96 search results - page 1 / 20 » On the scaling of congestion in the internet graph |
CCR
2004
13 years 4 months ago
2004
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 e...
PODC
2003
ACM
13 years 10 months ago
2003
ACM
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 e...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...
SIGMETRICS
2003
ACM
13 years 10 months ago
2003
ACM
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...
SIGMETRICS
2000
ACM
13 years 4 months ago
2000
ACM
Our research focuses on end-to-end congestion avoidance algorithms that use round trip time (RTT) fluctuations as an indicator of the level of network congestion. The algorithms a...