Resilient overlay networks

@article{Andersen2001ResilientON,
  title={Resilient overlay networks},
  author={David G. Andersen and Hari Ram Balakrishnan and M. Frans Kaashoek and Robert Tappan Morris},
  journal={Proceedings of the eighteenth ACM symposium on Operating systems principles},
  year={2001}
}
A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance within several seconds, improving over today's wide-area routing protocols that take at least several minutes to recover. A RON is an application-layer overlay on top of the existing Internet routing substrate. The RON nodes monitor the functioning and quality of the Internet paths among themselves, and use this… 
Resilient overlay networks
TLDR
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.
Topology aware overlay networks
TLDR
This paper proposes a novel framework for topology-aware overlay networks, aiming to maximize path independence without degrading performance, and develops measurement-based heuristics for placement of overlay nodes inside an ISP and selection of a set of ISPs that conclude that single-hop overlay routing performs as well as multi-hop routing with respect to both availability and performance.
GONE: an infrastructure overlay for resilient, DoS-limiting networking
TLDR
This work proposes an alternative overlay network architecture by introducing a set of generic functions in network edges and end hosts that offers a number of advantages for upper layer end-to-end applications, including intrinsic provisioning of resilience and DoS prevention in a dynamic and nomadic environment.
An algebraic approach to practical and scalable overlay network monitoring
TLDR
Simulation and Internet experiments demonstrate that highly accurate path loss rate estimation is obtained while adapting to topology changes within seconds and handling topology errors.
A comparison of overlay routing and multihoming route control
TLDR
The results demonstrate that, by leveraging the capability of multihoming route control, it is not necessary to circumvent BGP routing to extract good wide-area performance and availability from the existing routing system.
Impact of path diversity on multi-homed and overlay networks
  • Junghee Han, F. Jahanian
  • Computer Science
    International Conference on Dependable Systems and Networks, 2004
  • 2004
TLDR
This paper quantitatively analyzes the impact of path diversity on multihomed and overlay networks and highlights several inherent limitations of these architectures in exploiting the full potential redundancy of the Internet.
Enhancing end-to-end availability and performance via topology-aware overlay networks
TLDR
A novel overlay architecture to improve availability and performance of end-to-end communication over the Internet and validate the proposed framework using real Internet outages to show that the architecture is able to provide a significant amount of resilience to real-world failures.
An Intersection-Based Multipath Routing Scheme
TLDR
This paper presents an alternative algorithm that uses a lazy approach to collect link state information, and computes paths by finding the intersection of sets of candidate intermediate hops, which produces paths that provide better performance, has significantly lower overhead, and distributes load more evenly through the network than link-state alternatives.
Resilience Evaluation of Multi-Path Routing against Network Attacks and Failures
TLDR
This evaluation of global networks shows that, if network attacks or failures occur in other autonomous systems (ASes) that FMP routing cannot avoid, it is feasible to deal with such problems by switching to alternative paths by using MMP routing.
Geographic Properties of Internet Routing
TLDR
This work examines several geographic properties of Internet routing, including the circuitousness of Internet routes, how multiple ISPs along an end-to-end path share the burden of routing packets, and the geographic fault tolerance of ISP networks.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 37 REFERENCES
Overcast: reliable multicasting with on overlay network
TLDR
Simulations indicate that Overcast quickly builds bandwidth-efficient distribution trees that, compared to IP Multicast, provide 70%-100% of the total bandwidth possible, at a cost of somewhat less than twice the network load.
The end-to-end effects of Internet path selection
TLDR
A measurement-based study comparing the performance seen using the "default" path taken in the Internet with the potential performance available using some alternate path, finding that in 30-80% of the cases, there is an alternate path with significantly superior quality.
Internet routing instability
TLDR
The analysis in this paper is based on data collected from border gateway protocol (BGP) routing messages generated by border routers at five of the Internet core's public exchange points during a nine month period, and reveals several unexpected trends and ill-behaved systematic properties in Internet routing.
Delayed internet routing convergence
TLDR
This paper presents a two-year study of Internet routing convergence through the experimental instrumentation of key portions of the Internet infrastructure, including both passive data collection and fault-injection machines at major Internet exchange points, and describes several unexpected properties of convergence.
Routing stability in congested networks: experimentation and analysis
TLDR
The findings demonstrate the importance of selective treatment of routing protocol messages from other traffic, by using scheduling and utilizing buffer management policies in the routers, to achieve stable and robust network operation.
SPAND: Shared Passive Network Performance Discovery
TLDR
A system called SPAND (Shared Passive Network Performance Discovery) is proposed that determines network characteristics by making shared, passive measurements from a collection of hosts and it is shown that sharing measurements can significantly increase the accuracy and timeliness of predictions.
End-to-end WAN service availability
TLDR
It is found that caching alone is seldom effective at insulating services from failures but that the combination of mobile extension code and prefetching can improve average unavailability by as much as an order of magnitude for classes of service whose semantics support disconnected operation.
The revised ARPANET routing metric
TLDR
The ARPANET routing metric was revised in July 1987, resulting in substantial performance improvements, especially in terms of user delay and effective network capacity, and a move away from the strict delay metric.
Measuring Bottleneck Link Speed in Packet-Switched Networks
TLDR
The design and implementation of the probe tools are discussed, specifically illustrating the techniques used to achieve accuracy and robustness, and validation studies for both tools are presented which demonstrate their reliability in the face of actual Internet conditions.
FIRE: flexible intra-AS routing environment
TLDR
An overview of FIRE is presented, focusing particularly on FIRE's novel aspects with respect to traditional routing protocols, and the Java-based implementation is described.
...
1
2
3
4
...