Some Notes and Results on Bandwidth-based Routing and Implicit Load Balancing
Grout, Vic and Houlden, Nigel (2010) Some Notes and Results on Bandwidth-based Routing and Implicit Load Balancing. In: UNSPECIFIED.
|
PDF
fulltext.pdf Download (499kB) | Preview |
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.
| Item Type: | Conference or Workshop Item |
|---|---|
| Additional Information: | This paper was presented at the Eighth International Network Conference (INC 2010), July 6-8 2010, which was held in Heidelberg, Germany. It was published by the University of Plymouth, and the symposium proceedings are available at http://www.cscan.org/default.asp?page=viewabstract&paperid=619 |
| Keywords: | Internet routing, Implicit load-balancing, Dijkstra, Shortest path algorithm, DSPA, Minimum bandwidth routing |
| Divisions: | ?? GlyndwrUniversity ?? |
| Depositing User: | ULCC Admin |
| Date Deposited: | 05 Oct 2011 09:13 |
| Last Modified: | 11 Dec 2017 20:06 |
| URI: | https://wrexham.repository.guildhe.ac.uk/id/eprint/206 |
Actions (login required)
 |
Edit Item |