The distributed load-balancing multipath routing algorithmis designed for distributed switches and routers to allow for improved networkthroughput (the rate of packet transmissions) and reduce packet latency (theend-to-end delay to transmit packets). This effect is achieved by utilizing themultipath capability of modern multi-rooted data center network topologies anddepth-first worst-fit search to obtain optimal load-balancing. The centralized load-balancing multipath routing algorithmis designed for software defined networks with a fat tree topology to enablefull bandwidth usage and efficient packet scheduling by utilizing the globalknowledge of the network controller. Measuring the remaining link bandwidth andselecting the minimum bottleneck load allows the algorithm to achieve theload-balancing objective. Both algorithms have been tested in simulationexperiments. Shantanu Balkundi sbalkund@fiu.edu 305-348-8061
Smart, interactive desk
Get ready to take your space management game to the next level with the University of Glasgow’s innovative project! By combining the