Enhancing Robustness of Per-Packet Load-Balancing for Fat-Tree
نویسندگان
چکیده
منابع مشابه
Packet Loss Minimization in Load-Balancing Switch
Due to the overall growing demand on the network resources and tight restrictions on the power consumption, the requirements to the long-term scalability, cost and performance capabilities appear together with the deployment of novel switching architectures. The load-balancing switch proposed in [1,2] satisfies to the above requirements due to a simple distributed control and good performance c...
متن کاملOpenFlow based Load Balancing for Fat-Tree Networks with Multipath Support
Data center networks are designed for satisfying the data transmission demand of densely interconnected hosts in the data center. The network topology and routing mechanism can affect the performance and latency significantly. Nowadays, the fat-tree network is one of the most widely used topologies for data center networks. Network engineers also adopt load balancing methods in the design of ro...
متن کاملScheduling Techniques for Packet Routing , Load Balancing and Disk
We consider three scheduling problems that arise in studies of packet routing, load balancing and disk scheduling. A fundamental problem in the design of packet-switched communication networks is to provide effective methods for resolving contention when many packets wish to cross a link. End-to-end packet delays should be low and queue sizes should be small. For an adversarial connectionless m...
متن کاملDynamic Load Balancing for WDM-based Packet Networks
We develop load balancing algorithms for WDM-based packet networks in which the average traffic between nodes is dynamically changing. In WDM-based packet networks, routers are connected to each other using wavelengths (lightpaths) to form a logical network topology. This logical topology may be reconfigured by rearranging the lightpaths connecting the routers. The goal of our load balancing al...
متن کاملRandomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations
This paper considers generic load-balancing algorithms which efficiently parallelize a large class of applications based on traversing implicitly defined trees with irregular shape. First, a previous model is generalized yielding tree-shaped computations which cover the cost for communication and problem splitting, a measure of granularity and an easy to quantify parameter which limits irregula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2021
ISSN: 2076-3417
DOI: 10.3390/app11062664