Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Scaling Properties of the Internet Graph Aditya Akella Shuchi Chawla Arvind Kannan Srinivasan Seshan
 

Summary: Scaling Properties of the Internet Graph
Aditya Akella Shuchi Chawla Arvind Kannan Srinivasan Seshan
Computer Science Department
Carnegie Mellon University
Pittsburgh, PA 15213
{aditya,shuchi}@cs.cmu.edu {arvind,srini}@cmu.edu
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 accord-
ing to Moore's law, this improvement alone might not be enough.
Indeed, the structure of the Internet graph and routing in the net-
work might necessitate much faster improvements in the speeds of
key links in the network.
In this paper, using a combination of analysis and extensive sim-
ulations, we show that the worst congestion in the Internet in fact
scales poorly with the network size (n1+(1)
, where n is the num-
ber of nodes), when shortest-path routing is used. We also show,

  

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

 

Collections: Computer Technologies and Information Sciences