Improved routing strategies for Internet traffic delivery

Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

Volumn 70, Issue 5 2, 2004, Pages

  Echenique, Pablo ^a   Gómez Gardeñes, Jesús ^a   Moreno, Yamir ^a  

^a UNIVERSITY OF ZARAGOZA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTONOMOUS AGENTS; INTERNET; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PACKET NETWORKS; PROBABILITY; TELECOMMUNICATION NETWORKS;

AUTONOMOUS SYSTEM (AS); INTERNET TRAFFIC; PACKET DELIVERY; ROUTING;

TELECOMMUNICATION TRAFFIC;

EID: 41349111050     PISSN: 15393755     EISSN: None     Source Type: Journal    
DOI: 10.1103/PhysRevE.70.056105     Document Type: Article

References (16)

1. R. Pastor-Satorras and A. Vespignani, Evolution and Structure of the Internet (Cambridge University Press, Cambridge, UK, 2004).
2. R. Cohen, K. Erez, D. ben-Avraham, and S. Havlin, Phys. Rev. Lett. 85, 4626 (2000).
3. D. S. Callaway, M. E. J. Newman, S. H. Strogatz, and D. J. Watts, Phys. Rev. Lett. 85, 5468 (2000).
4. Y. Moreno, R. Pastor-Satorras, and A. Vespignani, Eur. Phys. J. B 26, 521 (2002).
5. A. Vázquez and Y. Moreno, Phys. Rev. E 67, 015101(R) (2003).
6. M. E. J. Newman, Phys. Rev. E 66, 016128 (2002).
7. S. H. Strogatz, Nature (London) 410, 268 (2001).
8. S. N. Dorogovtsev and J. F. F. Mendes, Evolution of Networks: From Biological Nets to the Internet and the WWW (Oxford University Press, Oxford, UK, 2003).
9. Handbook of Graphs and Networks, edited by S. Bornholdt and H. G. Schuster (Wiley-VCH, Berlin, 2003).
10. Several traffic-dependent routing protocols with rules different to those employed here have been studied by computer scientists without taking into account the actual topology of real-world nets.
11. J. Gómez-Gardeñes and Y. Moreno, Phys. Rev. E 69, 037103 (2004).
12. A.-L. Barabási and R. Albert, Science 286, 509 (1999).
13. S. Valverde and R. V. Sóle, Physica A 312, 636 (2002).
14. R. Guimera, A. Arenas, A. Díaz-Guilera, and F. Giralt, Phys. Rev. E 66, 026704 (2002).
15. max〉 because the errors involved in its computation are the smallest of the three regardless of the algorithm.
16. Available at http://topology.eecs.umich.edu/. Electric Engineering and Computer Science Department, University of Michigan, Topology Project.