Scalable Resilient Overlay Networks Using Destination-Guided Detouring
Sameer Qazi, Tim Moors · 2007
Routing policies used in the Internet tend to be restrictive, limiting communication between source-destination pairs to one path, when often better alternatives exist. To avoid route flapping, recovery mechanisms may be dampened, making adaptation slow. Unstructured overlays have been widely used to mitigate the issues of path and performance failures in the Internet by routing through alternate paths via overlay peers. The construction of such routing overlays often does not take into account the physical topology of the network, which necessitates that all overlay nodes aggressively probe paths to check performance, limiting scalability. In this paper, we analyze a topologically-aware architecture to estimate end-to-end path availability for service on the Internet. We propose destination-guided detouring via resilient overlay networks (DG-RON); a distributed coordinate-based overlay architecture, which uses landmark based heuristics for scalable end-to-end path discovery. Simulations show that DG- RON can predict alternate paths with a high success rate.