On the scaling of congestion in the internet graph

As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added each day. Although the speeds of links in the core and at the edges improve roughly according to Moore's law, this improvement alone might not be enough. Indeed, the structure of the Internet graph and routing in the network might necessitate much faster improvements in the speeds of key links in the network. In this paper, using a combination of analysis and extensive simulations, we show that the worst congestion in the Internet AS-level graph in fact scales poorly with the network size (<i>n</i><sup>1+ω(1)</sup>, where <i>n</i> is the number of nodes), when shortest-path routing is used to route traffic between ASes. We also show, somewhat surprisingly, that policy-based routing <i>does not</i> exacerbate the maximum congestion when compared to shortest-path routing. Our results show that it is crucial to identify ways to alleviate this congestion to avoid some links from being perpetually congested. To this end, we show that the congestion scaling properties of Internet-like graphs can be improved dramatically by introducing moderate amounts of redundancy in the graph in terms of parallel edges between pairs of adjacent nodes.

[1]  Amin Saberi,et al.  On certain connectivity properties of the internet topology , 2006, J. Comput. Syst. Sci..

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

[3]  Yuval Rabani,et al.  An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..

[4]  Lixin Gao,et al.  On inferring autonomous system relationships in the Internet , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[5]  Anukool Lakhina,et al.  An approach to universal topology gen-eration , 2001 .

[6]  Alan M. Frieze,et al.  High Degree Vertices and Eigenvalues in the Preferential Attachment Graph , 2005, Internet Math..

[7]  Albert,et al.  Topology of evolving networks: local events and universality , 2000, Physical review letters.

[8]  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.

[9]  Haruko Okamura,et al.  Multicommodity flows in planar graphs , 1981, J. Comb. Theory, Ser. B.

[10]  Heejo Lee,et al.  On the effectiveness of route-based packet filtering for distributed DoS attack prevention in power-law internets , 2001, SIGCOMM '01.

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

[12]  Linyuan Lu,et al.  Random evolution in massive graphs , 2001 .

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

[14]  Walter Willinger,et al.  A first-principles approach to understanding the internet's router-level topology , 2004, SIGCOMM 2004.

[15]  Mischa Schwartz,et al.  ACM SIGCOMM computer communication review , 2001, CCRV.

[16]  Srinivasan Seshan,et al.  Scaling properties of the Internet graph , 2003, PODC '03.

[17]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

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

[19]  Sugih Jamin,et al.  Inet-3.0: Internet Topology Generator , 2002 .

[20]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[21]  Stefano Leonardi,et al.  On-line Network Routing , 1996, Online Algorithms.

[22]  Christos Gkantsidis,et al.  Conductance and congestion in power law graphs , 2003, SIGMETRICS '03.