Compact routing on internet-like graphs

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2004, Pages 209-219

  Krioukov, Dmitri ^c   Fall, Kevin ^a   Yang, Xiaowei ^b  

^a INTEL RESEARCH   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c NONE

Author keywords

Combinatorics; Graph Theory; Internet Topology; Routing; Simulations; Statistics

Indexed keywords

COMBINATORICS; INTERNET TOPOLOGY; ROUTING; SCALE-FREE NETWORKS;

COMPUTER SIMULATION; INTERNET; OPTIMIZATION; ROUTERS; STATISTICAL METHODS; TOPOLOGY;

GRAPH THEORY;

EID: 8344278794     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. H. Chang, S. Jamin, and W. Willinger, "Internet connectivity at the AS level: An optimization driven modeling approach," in Proc. of MoMeTools, 2003.
2. G. Huston, Commentary on Inter-Domain Routing in the Internet, IETF, RFC 3221, 2001.
3. th SPAA. ACM, 2001.
4. L. Kleinrock and F. Kamoun, "Hierarchical routing for large networks: Performance evaluation and optimization," Computer Networks, vol. 1, 1977.
5. I. Castineyra, N. Chiappa, and M. Steenstrup, The Nimrod Routing Architecture, IETF, RFC 1992, 1996.
6. F. Kastenholz, ISLAY: A New Routing and Addressing Architecture, IETF, Internet Draft, 2002.
7. th PODC. ACM, 1996.
8. H. Buhrman, J.-H. Hoepman, and P. Vitány, "Space-efficient routing tables for almost all networks and the incompressibility method," SIAM J. on Comp., vol. 28, no. 4, 1999.
9. C. Gavoille and M. Genegler, "Space-efficiency for routing schemes of stretch factor three," J. of Parallel and Distributed Comp., vol. 61, no. 5, 2001.
10. L. Cowen, "Compact routing with minimum stretch," J. of Algorithms, vol. 38, no. 1, 2001.
11. rd STOC. ACM, 2001.
12. P. Erdos and A. Réni, "On random graphs," Publicationes Mathematicae, vol. 6, 1959.
13. B. Bollobás, Random Graphs, Academic Press, New York, 1985.
14. A. Vázquez, R. Pastor-Satorras, and A. Vespignani, "Internet topology at the router and Autonomous System level," cond-mat/0206084.
15. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On power-law relationships of the Internet topology," in Proc. of the ACM SIGCOMM, 1999.
16. S. Milgram, "The small world problem," Psychology Today, vol. 61, 1967.
17. A.-L. Barabási and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, 1999.
18. W. Willinger, R. Govindan, S. Jamin, V. Paxson, and S. Shenker, "Scaling phenomena in the Internet: Critically examining criticality," PNAS, vol. 99, 2002.
19. Q. Chen, H. Chang, R. Govindan, S. Jamin, S. J. Shenker, and W. Willinger, "The origin of power laws in Internet topologies revisited," in Proc. of the IEEE INFOCOM, 2002.
20. S. Ross. Introduction to Probabilty Models (7th ed), Academic Press, San Diego, 2000.
21. D. Krioukov, K. Fall, and X. Yang, "Compact routing on Internet-like graphs," Tech. Report IRB-TR-03-010, Intel Research, 2003.
22. S. N. Dorogovtsev and J. F. F. Mendes, Evolution of Networks: From Biological Nets to the Internet and WWW, Oxford University Press, Oxford, 2003.
23. S. N. Dorogovtsev, J. F. F. Mendes, and A. N. Samukhin, "Metric structure of random networks," Nucl. Phys. B, vol. 653, no. 3, 2003.
24. S. N. Dorogovtsev, A. V. Goltsev, and J. F. F. Mendes, "Pseudofractal scale-free web," Phys. Rev. E, vol. 65, 066122, 2002.
25. nd STOC. ACM, 2000.
26. "BGP Table Data, http://bgp.potaroo.net/".
27. A. Broido, E. Nemeth, and k claffy, "Internet expansion, refinement, and churn," European Trans. on Telecommunications, vol. 13, no. 1, 2002.
28. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, "Network topology generators: Degree-based vs. structural," in Proc. of the ACM SIGCOMM, 2002.
29. F. Chung and L. Lu, "The average distance in a random graph with given expected degrees," Internet Mathematics, vol. 1, no. 1, 2003.
30. th SPAA. ACM, 2003.