Conductance and congestion in power law graphs

Performance Evaluation Review

Volumn 31, Issue 1, 2003, Pages 148-159

  Gkantsidis, Christos ^a   Mihail, Milena ^a   Saberi, Amin ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Conductance; Congestion; Expansion; Internet topology; Power law graphs; Routing

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); EXPANSION; INTERNET; RANDOM PROCESSES; STATISTICAL METHODS; TELECOMMUNICATION NETWORKS; TOPOLOGY;

CONDUCTANCE; CONGESTION; INTERNET TOPOLOGY; POWER-LAW GRAPHS; ROUTING;

GRAPH THEORY;

EID: 33646179859     PISSN: 01635999     EISSN: 01635999     Source Type: Conference Proceeding    
DOI: 10.1145/885651.781046     Document Type: Conference Paper

References (59)

1. L. Adamic. Zipf, power-laws, and pareto, a ranking tutorial. http://www.hpl.hp.com/shl/papers/ranking/, 2002.
2. S. Agarwal, L. Subramanian, J. Rexford, and R. Katz. Characterizing the internet hierarchy from multiple vantage points web page. http://www.cs. berkeley.edu/~sagarwal/research/BGP-hierarchy/, 2002.
3. W. Aiello, F. R. K. Chung, and L. Lu. A random graph model for power law graphs. In Proc. 41st Symposium on Foundations of Computer Science (FOCS), pages 171-180. IEEE, 2000.
4. W. Aiello, F. R. K. Chung, and L. Lu. Random evolution in massive graphs. In Proc. 42nd Symposium on Foundations of Computer Science (FOCS), pages 510-519. IEEE, 2001.
5. D. Alderson, J. Doyle, and W. Willinger. Toward an optimization-driven framework for designing and generating realistic internet topologies. In HotNets, 2002.
6. A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286:509-512, 1999.
7. C. Berge. Graphs and Hypergraphs. North Holland Publishing Company, 1973.
8. Bob metcalfe eats his words. Internet Computing Online, 1(3), 1997. http://www.computer.org/internet/v1n3/eats9702.htm.
9. B. Bollobás. Random Graphs, 2nd Ed. Cambridge University Press, 2001.
10. B. Bollobás and O. Riordan. The diameter of scale-free graphs. Combinatorial, To appear.
11. B. Bollobás, O. Riordan, J. Spencer, and G. Tusnády. The degree sequence of a scale-free random graph process. Random Structures and Algorithms, 18(3):279-290, 2001.
12. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomikns, and J. Wiener. Graph structure in the web. 9th International World Wide Web Conference (WWW9)/Computer Networks, 33(1-6):309-320, 2000.
13. A. Broido and K. Claffy. Internet topology: Connectivity of ip graphs. http://www.caida.org/outreach/papers/2001/OSD/, 2001.
14. C. Chang, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. The origins of power-laws in internet topologies revisited. In Proc. Infocom. IEEE, 2002.
15. F. Chung and L. Lu. The average distance in a random graph with given expected degree. Available at http://math.ucsd.edu/~fan/inet.html.
16. F. Chung and L. Lu. Connected components in random graphs with given degree sequences. http://www.math.ucsd.edu/~fan, 2002.
17. F. R. Chung. Spectral Graph Theory. American Mathematical Society Book Series, 1997.
18. C. Cooper and A. Frieze. A general model for web graphs. In ESA, pages 500-511, 2001.
19. J. Doyle, J. Carlson, S. Low, F. Paganini, G. Vinnicombe, W. Willinger, J. Hickey, P. Parrilo, and L. Vandenberghe. Robustness and the internet: Theoretical foundations. http://netlab.caltech.edu/internet/, 2002.
20. A. Fabrikant, E. Koutsoupias, and C. Papadimitriou. Heuristically optimized tradeoffs: A new paradigm for powerlaws in the internet. ICALP 2002, 2002.
21. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In Proc. SigComm. ACM, 1999.
22. N. L. for Applied Retwork Research. Route views archive. http://moat.nlanr.net/Routing/rawdata, 2002.
23. A. Frieze. Disjoint Paths in Expander Graphs via Random Walks: A Short Survey, volume 1518 of Lecture Notes in Computer Science. Springer Verlag, 1998.
24. L. Gao. On inferring autonomous system relationships in the internet. IEEE Glogal Internet, 2000.
25. C. Gkantsidis, M. Mihail, and E. Zegura. The markov chain simulation method for generating connected power law random graphs. In Proc. 5th Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM, January 2003.
26. C. Gkantsidis, M. Mihail, and E. Zegura. Spectral analysis of internet topologies. In Proc. Infocom. IEEE, 2003. To appear.
27. C. Jin, Q. Chen, and S. Jamin. Inet: Internet topology generator. Technical Report CSE-TR-433-00, U. Michigan, Ann Arbor, 2000.
28. J. Kleinberg. Navigation in small world. Nature, 406, 2000.
29. J. Kleinberg and R. Rubinfeld. Short paths in expander graphs. In Proc. 37th Symposium on Foundations of Computer Science (FOCS), pages 86-95. IEEE, 1996.
30. R. Kumar, P. Raghavan, S. Rajagopalan, S. D., A. Tomkins, and E. Upfal. Stochastic models for the web graphs. In Proc. 41st Symposium on Foundations of Computer Science (FOCS), pages 57-65. IEEE, 2000.
31. C. Law and K.-Y. Siu. Distributed construction of random expander networks. In Proc. Infocom. IEEE, 2003. To appear.
32. F. Leighton. Parallel Algorithms and Architectures. Morgan Kaufmann, 1992.
33. F. Leighton and S. Rao. Circuit switching: Multicommodity flow based approach. In Workshop on Randomized Parallel Computing, 1996.
34. F. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46:787-832, 1999.
35. N. Linial, E. London, and Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15:215-245, 1995.
36. A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8:261-278, 1988.
37. A. Medina, I. Matta, and J. Byers. On the origin of power-laws in internet topologies. ACM Computer Communications Review, April 2000.
38. B. Metcalfe. Internet Collapses and Other InfoWorld Punditry. Hungry Minds, Inc., May 2000.
39. M. Mihail and C. Papadimitriou. Random 2002, 2002.
40. M. Mihail, C. Papadimitrious, and A. Saberi. On certain connectivity properties of internet graphs. submitted, 2003.
41. M. Molloy and B. Reed. A critical point for random graphs with a given degree sequence. Random Structures and Algorithms, 6:161-180, 1995.
42. M. Molloy and B. Reed. The size of the largest component of a random graph on a fixed degree sequence. Combinatorics, Probability and Computing, 7:295-306, 1998.
43. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
44. M. Newman. Assortativity mixing in networks. Phys. Rev. Lett., 89, 2002.
45. V. Padmanabhan, L. Qiu, and H. Wang. Server-based inference of internet performance. In Proc. Infocom. IEEE, 2003. To appear.
46. C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
47. N. Pippinger. Information theory and the complexity of switching networks. In Proc. 16th Symposium on Foundations of Computer Science (FOCS), pages 113-118, 1975.
48. N. Pippinger. Superconcentrators. SIAM Journal on Computing, 6(2):298-304, 1977.
49. N. Pippinger. On rearrangeable and non-blocking switching networks. Journal of Computer and System Sciences, 17(2):145-162, 1978.
50. J. S. Quarterman. Imminent death of the internet? Matrix News, 6(6), June 1996. Also, available at http://www2.aus.us.mids.org/mn/606/death.html.
51. Y. Rehkter and P. Gross. Application of the border gateway protocol in the internet. RFC 1655, IETF, July 1994.
52. A. Sinclair. Algorithms for Random Generation and Counting: A Markov Chain Approach. Springer-Verlag, 1997.
53. L. Subramanian, S. Agarwal, J. Rexford, and R. Katz. Characterizing the internet hierarchy from multiple vantage points. In Proc. Infocom. IEEE, 2002.
54. H. Tagmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Network topology generators: Degree-based vs structural. In Proc. SigComm. ACM, 2002.
55. H. Tagmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Network topology generators: Degree-based vs structural. Technical Report 02-760, USC, 2002.
56. D. Towsley. Modeling the internet: Seeing the forest through the trees. Keynote Address, Sigmetrics, 2002.
57. V. Vazirani. Approximation Algorithms. Springer-Verlag, 2001.
58. W. Willinger and J. Doyle. Robustness and the internet: Design and evolution. http://netlab.caltech.edu/internet/, 2002.
59. H. Zhang, A. Goel, and R. Govindan. Using the small-world model to improve freenet performance. In Proc. Infocom. IEEE, 2002.