Improved routing strategies for Internet traffic delivery
Top Cited Papers
- 15 November 2004
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 70 (5) , 056105
- https://doi.org/10.1103/physreve.70.056105
Abstract
We analyze different strategies aimed at optimizing routing policies in the Internet. We first show that for a simple deterministic algorithm the local properties of the network deeply influence the time needed for packet delivery between two arbitrarily chosen nodes. We next rely on a real Internet map at the autonomous system level and introduce a score function that allows us to examine different routing protocols and their efficiency in traffic handling and packet delivery. Our results suggest that actual mechanisms are not the most efficient and that they can be integrated in a more general, though not too complex, scheme.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Local versus global knowledge in the Barabási-Albert scale-free network modelPhysical Review E, 2004
- Evolution and Structure of the InternetPublished by Cambridge University Press (CUP) ,2004
- Evolution of NetworksPublished by Oxford University Press (OUP) ,2003
- Resilience to damage of graphs with degree correlationsPhysical Review E, 2003
- Spread of epidemic disease on networksPhysical Review E, 2002
- Self-organized critical traffic in parallel computer networksPhysica A: Statistical Mechanics and its Applications, 2002
- Exploring complex networksNature, 2001
- Network Robustness and Fragility: Percolation on Random GraphsPhysical Review Letters, 2000
- Resilience of the Internet to Random BreakdownsPhysical Review Letters, 2000
- Emergence of Scaling in Random NetworksScience, 1999