Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
On the Scaling of Congestion in the Internet Graph Aditya Akella Shuchi Chawla Arvind Kannan Srinivasan Seshan
 

Summary: On the Scaling of Congestion in the Internet Graph
Aditya Akella Shuchi Chawla Arvind Kannan Srinivasan Seshan
Computer Science Department
Carnegie Mellon University
Pittsburgh, PA
{aditya,shuchi,srini+}@cs.cmu.edu, arvind@cmu.edu
ABSTRACT
As the Internet grows in size, it becomes crucial to under-
stand 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 struc-
ture 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 Inter-
net AS-level graph in fact scales poorly with the network size
(n1+(1)

  

Source: Akella, Aditya - Department of Computer Sciences, University of Wisconsin at Madison

 

Collections: Computer Technologies and Information Sciences