Conductance and congestion in power law graphs

It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the performance of basic communication tasks that a network is presumed to support? How does performance scale with the size of the network? We study routing in families of sparse random graphs whose degrees follow heavy tailed distributions. Instantiations of such random graphs have been proposed as models for the topology of the Internet at the level of Autonomous Systems as well as at the level of routers. Let n be the number of nodes. Suppose that for each pair of nodes with degrees du and dv we have O(du dv) units of demand. Thus the total demand is O(n2). We argue analytically and experimentally that in the considered random graph model such demand patterns can be routed so that the flow through each link is at most O(n log2 n). This is to be compared with a bound O(n2) that holds for arbitrary graphs. Similar results were previously known for sparse random regular graphs, a.k.a. "expander graphs." The significance is that Internet-like topologies, which grow in a dynamic, decentralized fashion and appear highly inhomogeneous, can support routing with performance characteristics comparable to those of their regular counterparts, at least under the assumption of uniform demand and capacities. Our proof uses approximation algorithms for multicommodity flow and establishes strong bounds of a generalization of "expansion," namely "conductance." Besides routing, our bounds on conductance have further implications, most notably on the gap between first and second eigenvalues of the stochastic normalization of the adjacency matrix of the graph.

[1]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[2]  Amin Saberi,et al.  On certain connectivity properties of the Internet topology , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[3]  kc claffy,et al.  Internet topology: connectivity of IP graphs , 2001, SPIE ITCom.

[4]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[5]  Eli Upfal,et al.  Stochastic models for the Web graph , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[6]  Alan M. Frieze,et al.  A General Model of Undirected Web Graphs , 2001, ESA.

[7]  Sugih Jamin,et al.  Inet: Internet Topology Generator , 2000 .

[9]  M. Murty.  Ramanujan Graphs , 1965 .

[10]  Christos Gkantsidis,et al.  The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs , 2003, ALENEX.

[11]  Dave Katz,et al.  Application of the Border Gateway Protocol in the Internet , 1990, RFC.

[12]  Kai-Yeung Siu,et al.  Distributed construction of random expander networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[13]  Walter Willinger,et al.  The origin of power laws in Internet topologies revisited , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[14]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[15]  Lixin Gao.  On inferring autonomous system relationships in the internet , 2001, TNET.

[16]  Fan Chung Graham,et al.  A Random Graph Model for Power Law Graphs , 2001, Exp. Math..

[17]  Ramesh Govindan,et al.  Using the small-world model to improve Freenet performance , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[18]  F. Chung,et al.  Connected Components in Random Graphs with Given Expected Degree Sequences , 2002 .

[19]  Frank Thomson Leighton,et al.  Circuit Switching: A Multicommodity Flow Based Approach , 1995 .

[20]  Fernando Paganini,et al.  Robustness and the Internet : Theoretical Foundations , 2002 .

[21]  Bob M. Metcalfe.  Internet collapses and other InfoWorld punditry , 2000 .

[22]  Fan Chung Graham,et al.  The Average Distance in a Random Graph with Given Expected Degrees , 2004, Internet Math..

[23]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[24]  Lada A. Adamic.  Zipf, Power-laws, and Pareto-a ranking tutorial , 2000 .

[25]  Christos H. Papadimitriou,et al.  Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet , 2002, ICALP.

[26]  Alistair Sinclair,et al.  Algorithms for Random Generation and Counting: A Markov Chain Approach , 1993, Progress in Theoretical Computer Science.

[27]  Walter Willinger,et al.  Toward an optimization-driven framework for designing and generating realistic Internet topologies , 2003, CCRV.

[28]  Nicholas Pippenger,et al.  On Rearrangeable and Non-Blocking Switching Networks , 1978, J. Comput. Syst. Sci..

[29]  Denis Trystram,et al.  Parallel algorithms and architectures , 1995 .

[30]  Alan M. Frieze,et al.  A general model of web graphs , 2003, Random Struct. Algorithms.

[31]  Walter Willinger,et al.  Network topology generators: degree-based vs. structural , 2002, SIGCOMM 2002.

[32]  Bruce A. Reed,et al.  The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.

[33]  Walter Willinger,et al.  Network topology generators: degree-based vs. structural , 2002, SIGCOMM '02.

[34]  Christos Gkantsidis,et al.  Spectral analysis of Internet topologies , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[35]  Alan M. Frieze.  Disjoint Paths in Expander Graphs via Random Walks: A Short Survey , 1998, RANDOM.

[36]  Béla Bollobás,et al.  The degree sequence of a scale‐free random graph process , 2001, Random Struct. Algorithms.

[37]  A. Bonato,et al.  Graphs and Hypergraphs , 2022 .

[38]  Helen J. Wang,et al.  Server-based Inference of Internet Performance , 2002 .

[39]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[40]  Nicholas Pippenger.  Information theory and the complexity of switching networks , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[41]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[42]  Fan Chung Graham,et al.  Random evolution in massive graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[43]  Walter Willinger,et al.  Robustness and the Internet: Design and evolution , 2002 .

[44]  Ibrahim Matta,et al.  On the origin of power laws in Internet topologies , 2000, CCRV.

[45]  Ronitt Rubinfeld,et al.  Short paths in expander graphs , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[46]  Randy H. Katz,et al.  Characterizing the Internet hierarchy from multiple vantage points , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[47]  Fan Chung Graham,et al.  A random graph model for massive graphs , 2000, STOC '00.

[48]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[49]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .