In 2014, we launched our open-access repository which offers full text access to conference proceedings from many of our events including the INC and HAISA series. These papers are free to access and distribute (subject to citing the source).
» Openaccess proceedings » Eighth International Network Conference (INC 2010)
 | Eighth International Network Conference (INC 2010) |
Title: Some Notes and Results on Bandwidth-based Routing and Implicit Load Balancing
Author(s): Vic Grout, Nigel Houlden
Reference: pp19-30
Keywords: Routing, DSPA, Bandwidth, Load balancing
Abstract: The Maximum Bandwidth Path Algorithm (MBPA) is introduced as an alternative to Dijkstra’s Shortest Path Algorithm (DSPA) for Internet routing. The two are compared and differences noted. Of particular interest is the extent to which each algorithm achieves Implicit Load Balancing (ILB) – the principle of effective link usage for traffic across the network as a whole for non-equal paths and without the use of explicit routing variance. Although MBPA may prove to be more efficient than DSPA generally (further work is required), it is shown, through extensive simulation, that it produces better levels of ILB for real, as opposed to artificial, network scenarios.
Download count: 3303
How to get this paper:
PDF copy of this paper is free to download. You may distribute this copy providing you cite this page as the source.