Sciweavers

12 search results - page 2 / 3
» sigcomm 1999
Sort
View
SIGCOMM
1999
ACM
13 years 9 months ago
On Estimating End-to-End Network Path Properties
The more information about current network conditions available to a transport protocol, the more efficiently it can use the network to transfer its data. In networks such as the...
Mark Allman, Vern Paxson
SIGCOMM
1999
ACM
13 years 9 months ago
The End-to-End Effects of Internet Path Selection
The path taken by a packet traveling across the Internet depends on a large number of factors, including routing protocols and pernetwork routing policies. The impact of these fac...
Stefan Savage, Andy Collins, Eric Hoffman, John Sn...
SIGCOMM
1999
ACM
13 years 9 months ago
A Simple Approximation to Minimum-Delay Routing
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
Srinivas Vutukury, J. J. Garcia-Luna-Aceves
SIGCOMM
1999
ACM
13 years 9 months ago
Routing with a Clue
We suggest a new simple forwarding technique to speed-up IP destination address lookup. The technique is a natural extension of IP, requires 5 bits in the IP header (IPv4, 7 in IP...
Anat Bremler-Barr, Yehuda Afek, Sariel Har-Peled
SIGCOMM
1999
ACM
13 years 9 months ago
Load-Sensitive Routing of Long-Lived IP Flows
Internet service providers face a daunting challenge in provisioning network resources, due to the rapid growth of the Internet and wide fluctuations in the underlying traffic pa...
Anees Shaikh, Jennifer Rexford, Kang G. Shin