URL: https://doi.org/10.1145/872035.872087
Bibtex Entry:
@inproceedings{2003-Akella-podc, author = “Akella, Aditya and Chawla, Shuchi and Kannan, Arvind and Seshan, Srinivasan”, title = “Scaling Properties of the Internet Graph”, year = “2003”, isbn = “1581137087”, publisher = “Association for Computing Machinery”, address = “New York, NY, USA”, url = “https://doi.org/10.1145/872035.872087”, doi = “10.1145/872035.872087”, abstract = “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 roughly improve 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 in fact scales poorly with the network size (n1+Ω(1), where n is the number of nodes), when shortest-path routing is used. We also show, somewhat surprisingly, that policy-based routing does not 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 the Internet graph can be improved dramatically by introducing moderate amounts of redundancy in the graph in terms of parallel edges between pairs of adjacent nodes.”, booktitle = “Symposium on Principles of Distributed Computing (PODC)”, pages = “337–346”, numpages = “10”, month = “July”, keywords = “shortest path routing, policy routing, congestion, power-law distribution”, location = “Boston, Massachusetts”, series = “PODC ‘03”, category = “[Measurement, Multipath, Congestion Control]” }