Proceedings ArticleDOI
Best-path vs. multi-path overlay routing
David G. Andersen,Alex C. Snoeren,Hari Balakrishnan +2 more
- pp 91-100
TLDR
This paper examines the extent to which a path-independence assumption holds on the Internet by analyzing 14 days of data collected from 30 nodes in the RON testbed, and finds that the chances of losing two packets between the same hosts is nearly as high when those packets are sent through an intermediate node.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 examines the extent to which this assumption holds on the Internet by analyzing 14 days of data collected from 30 nodes in the RON testbed. We examine two problems that manifest themselves---congestion-triggered loss and path failures---and find that the chances of losing two packets between the same hosts is nearly as high when those packets are sent through an intermediate node (60%) as when they are sent back-to-back on the same path (70%). In so doing, we also compare two different ways of taking advantage of path redundancy proposed in the literature: mesh routing based on packet replication, and reactive routing based on adaptive path selection.read more
Citations
More filters
Journal ArticleDOI
Dynamic load balancing without packet reordering
TL;DR: Contrary to popular belief, it is shown that one can systematically split a single flow across multiple paths without causing packet reordering, and proposes FLARE, a new traffic splitting algorithm that operates on bursts of packets, carefully chosen to avoid reordering.
Proceedings Article
Improving the reliability of internet paths with one-hop source routing
TL;DR: This research demonstrates that one-hop source routing is easy to implement, adds negligible overhead, and achieves close to the maximum benefit available to indirect routing schemes, without the need for path monitoring, history, or a-priori knowledge of any kind.
Proceedings ArticleDOI
Locating internet bottlenecks: algorithms, measurements, and implications
TL;DR: This paper presents Pathneck, a tool that allows end users to efficiently and accurately locate the bottleneck link on an Internet path based on a novel probing technique called Recursive Packet Train (RPT) and does not require access to the destination.
Journal ArticleDOI
Path splicing
TL;DR: This work evaluates path splicing for intradomain routing using slices generated from perturbed link weights and finds that splicing achieves reliability that approaches the best possible using a small number of slices, for only a small increase in latency and no adverse effects on traffic in the network.
Proceedings ArticleDOI
On the predictability of large transfer TCP throughput
TL;DR: This paper classifies TCP throughput prediction techniques into two categories: Formula-Based and History-Based, and develops representative prediction algorithms, which are evaluated empirically over the RON testbed.
References
More filters
Book
Low-Density Parity-Check Codes
TL;DR: A simple but nonoptimum decoding scheme operating directly from the channel a posteriori probabilities is described and the probability of error using this decoder on a binary symmetric channel is shown to decrease at least exponentially with a root of the block length.
Journal ArticleDOI
Efficient dispersal of information for security, load balancing, and fault tolerance
TL;DR: Information Dispersal Algorithm (IDA) has numerous applications to secure and reliable storage of information in computer networks and even on single disks, to fault-tolerant and efficient transmission ofInformation in networks, and to communications between processors in parallel computers.
Proceedings ArticleDOI
Resilient overlay networks
TL;DR: It is found that forwarding packets via at most one intermediate RON node is sufficient to overcome faults and improve performance in most cases, demonstrating the benefits of moving some of the control over routing into the hands of end-systems.
Journal ArticleDOI
Resilient overlay networks
TL;DR: It is found that forwarding packets via at most one intermediate RON node is sufficient to overcome faults and improve performance in most cases, demonstrating the benefits of moving some of the control over routing into the hands of end-systems.
Proceedings ArticleDOI
A digital fountain approach to reliable distribution of bulk data
TL;DR: A protocol is developed that closely approximates a digital fountain using a new class of erasure codes that for large block sizes are orders of magnitude faster than standard erasures codes.