On certain connectivity properties of the internet topology

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 28-35

  Mihail, Milena ^a   Papadimitriou, Christos ^b   Saberi, Amin ^a  

^a Georgia Institute of Technology   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; MATHEMATICAL MODELS; MATRIX ALGEBRA; RANDOM PROCESSES; TELECOMMUNICATION TRAFFIC; THEOREM PROVING; BRAIN; BRAIN MODELS; COMPUTER SCIENCE; INTERNET; INTERNET PROTOCOLS; TOPOLOGY; WEIGHING;

INTERNET TOPOLOGY; RANDOM GRAPHS; VICKREY-CLARKE-GROES MECHANISM;

INTERNET; EIGENVALUES AND EIGENFUNCTIONS;

CONNECTIVITY MODEL; CONNECTIVITY PROPERTIES; EDUCATIONAL INSTITUTIONS; INTERNET TOPOLOGIES; IP NETWORKS; ROUTING; ROUTING CONGESTION; VICKREY-CLARKE-GROVES MECHANISM;

EID: 0344550533     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (46)

1. Adamic, L., Lukose, R., Puniyani, A. and Huberman, B., "Search in Power Law Networks", Physical review E, Volume 64.
2. Aiello, W., Chung, F.R.K. and Lu, L., "A Random Graph Model for Power Law Graphs", FOCS 2000, pp. 171-180.
3. Aiello, W., Chung, F.R.K. and Lu, L., "Random Evolution in Massive Graphs", FOCS 2001, pp. 510-519.
4. Albert R. and Barabási, A.-L., "Error and Attack Tolerance of Complex Networks", Nature 406, 2000.
5. Archer, A. and Tárdos, E. "Frugal Path Mechanisms", SODA 2002, pp 991-999.
6. Barabási, A.-L. and Albert, R., "Emergence of scaling in random graphs", Science 286 (1999), pp. 509-512.
7. Bar-Yossef, Z., Berg, A., Chien, S., Fakcharoenphol, J. and Weitz, D., "Approximating Aggregate Queries about Web Pages via Random Walks", VLDB 2000.
8. Bollobás, B. and de la Vega, F. W., "The Diameter of Random Regular Graphs", Combinatorica 2(2):125-134 (1982).
9. Bollobás, B., "Random Graphs", Cambridge University Press, 2nd edition (September 15, 2001).
10. Bollobás B. and Riordan, O., "The diameter of scale-free graphs", to appear in Combinatorica.
11. Bollobás, B., Riordan, O., Spencer, J. and Tusnády, G., "The degree sequence of a scale-free random graph process", Random Structures and Algorithms, Volume 18, Issue 3, 2001, pp 279-290.
12. Broder, A., Frieze, A. and Upfal, E., SIAM Journal of Computing, (23) No 5, pp 976-989.
13. Broder, A. and Karlin, A., "Bounds on the Cover Time", J. Theoretical Probability 2(1) (1989), pp 101-120.
14. Chen, Q., Chang, H., Govindan, R., Jamin, S., Shenker, S. and Willinger, W., "The Origins of Power-Laws in Internet Topologies Revisited", Infocomm 2002.
15. Chung, F.R.K., "Spectral Graph Theory", AMS-RCSM, No 92, 1997.
16. Chung, F.R.K. and Lu, L., "The Diameter of Random Sparse Graphs", Advances in Applied Math., 26 (2001), 257-279.
17. Chung, F.R.K. and Lu, L., "The average distance in a random graph with given expected degrees", Proceedings of the National Academy of Sciences, 99, No 25, December 2002.
18. Chung, F.R.K., Lu, L. and Vu, V., "The spectra of random graphs with given expected degrees", Proceedings of the National Academy of Sciences (to appear).
19. Cooper, C. and Frieze, A., "A general model for web graphs", Proceedings of ESA, 2001, pp 500-511.
20. Cooper, C. and Frieze, A., "Crawling on Web Graphs", STOC 2002, pp 419-427.
21. Cooper, C. and Frieze, A., "The cover time of sparse random graphs", SODA 2003, pp 148-157.
22. Elkind, E. and Sahai, A. and Steiglitz, K. "Frugality in Path Auctions", Manuscript, 2003.
23. Fabrikant, A., Koutsoupias, E. and Papadimitriou, C.H. "Heuristically Optimized Tradeoffs", ICALP 2002.
24. Faloutsos, M., Faloutsos, P. and Faloutsos, C., "On Power-law Relationships of the Internet Topology", In Proceedings Sigcomm 1999, pp 251-262.
25. Feigenbaum, J., Papadimitriou, C.H., Sami, R. and Shenker, S., "A BGP-based Mechanism for Lowest-Cost Routing", Proceedings of the 21st Symposium on Principles of Distributed Computing, New York, 2002, pp. 173-182.
26. Gkantsidis, C., Mihail, M. and Zegura, E., "Spectral Analysis of Internet Topologies", INFOCOM 2003 (to appear).
27. Gkantsidis, C., Mikhail, M. and Saberi, A., "Throughput and Congestion in Power Law Graphs", Sigmetrics 2003 (to appear).
28. Griffin, T., "An Introduction to Interdomain Routing and BGP", SIGCOMM 2001 Tutorial.
29. Holme, P., "Edge Overload Breakdown in Evolving Networks", Physical Review E 66, 2002.
30. Holme, P. and Kim, B.J., "Attack Vulnerability of Complex Networks", Physical Review E 65, 2002.
31. Kleinberg, J. and Rubinfeld, R., "Short Paths in Expander Graphs", FOCS 96, pp 86-95.
32. Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A. and Upfal, E., "Stochastic models for the Web graph", FOCS 2000, pp 57-65.
33. Leighton, F. T., and Rao, S., "Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms", Journal of the ACM, 46:787-832, 1999.
34. Public Route Server and Looking Glass Site List, Traceroute.org, http://www.traceroute.org.
35. Mas-Collel, A., Whinston, M. and Green, J., "Microeconomics Theory", Oxford University Press, 1995.
36. Mihail, M. and Papadimitriou, C.H., "On the Eigenvalue Power Law", RANDOM 2002.
37. Motwani, R. and Raghavan, P., Randomized Algorithms, Cambridge University Press, 1995.
38. National Laboratory for Applied Networking Research, Routing Data, http://moat.lanr.net/Routing/rawdata.
39. Nisan, N. and A. Ronen, "Algorithmic Mechanism Design" STOC 1999, pp 129-140.
40. Papadimitriou, C.H., "Computational Complexity", Addison-Wesley, 1994.
41. Papadimitriou, C.H., "Algorithms, Games, and the Internet", Keynote Address, STOC 2001, pp 749-753.
42. Papadimitriou, C.H., "Game Theory and Math Economics: A TCS Introduction", Tutorial, FOCS 2001.
43. Sinclair, A., "Algorithms for Random Generation and Counting: A Markov Chain Approach", Springer-Verlag, 1997.
44. Towsley, D., "Modeling the Internet: Seeing the Forest through the Trees", Keynote Address, Sigmetrics 2002.
45. Vazirani, V., Approximation Algorithms, Springer-Verlag, 2001.
46. Willinger, W., Govindan, R., Paxson, V. and Shenker, S., "Scaling Phenomena in the Internet: Critically examining Criticality", Proceedings of the National Academy of Sciences, Vol 99, 2002.