Abstract
The distributed load-balancing multipath routing algorithm
is designed for distributed switches and routers to allow for improved network
throughput (the rate of packet transmissions) and reduce packet latency (the
end-to-end delay to transmit packets). This effect is achieved by utilizing the
multipath capability of modern multi-rooted data center network topologies and
depth-first worst-fit search to obtain optimal load-balancing.The centralized load-balancing multipath routing algorithm
is designed for software defined networks with a fat tree topology to enable
full bandwidth usage and efficient packet scheduling by utilizing the global
knowledge of the network controller. Measuring the remaining link bandwidth and
selecting the minimum bottleneck load allows the algorithm to achieve the
load-balancing objective. Both algorithms have been tested in simulation
experiments.Benefit
Improved network throughputReduced packet latencyProvides higher bandwidthAvoids wasting switch bandwidthMinimization of bottleneck loadMarket Application
The algorithms can be applied for routing in modern data center networks
