DMCA
Best-Path vs. Multi-Path Overlay Routing (2003)
Cached
Download Links
- [project-iris.net]
- [iris.csail.mit.edu]
- [nms.lcs.mit.edu]
- [www.cs.ucsd.edu]
- [www.cse.ucsd.edu]
- [cseweb.ucsd.edu]
- [cseweb.ucsd.edu]
- [cseweb.ucsd.edu]
- [www.cs.cmu.edu]
- DBLP
Other Repositories/Bibliography
by
David G. Andersen
,
Alex C. Snoeren
,
Hari Balakrishnan
| Venue: | IN PROC. ACM SIGCOMM INTERNET MEASUREMENT CONFERENCE |
| Citations: | 80 - 6 self |
BibTeX
@INPROCEEDINGS{Andersen03best-pathvs.,
author = {David G. Andersen and Alex C. Snoeren and Hari Balakrishnan},
title = {Best-Path vs. Multi-Path Overlay Routing},
booktitle = {IN PROC. ACM SIGCOMM INTERNET MEASUREMENT CONFERENCE},
year = {2003},
pages = {91--100},
publisher = {ACM Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Time-varying congestion on Internet paths and failures due to software, hardware, and configuration errors often disrupt packet delivery on the Internet. Many aproaches to avoiding these problems use multiple paths between two network locations. These approaches rely on a path-independence assumption in order to work well; i.e., they work best when the problems on different paths between two locations are uncorrelated in time. This paper
