Article

Resilient overlay networks

Authors:

David Andersen,

Hari Balakrishnan,

Frans Kaashoek, and

Robert MorrisAuthors Info & Claims

SOSP '01: Proceedings of the eighteenth ACM symposium on Operating systems principles

October 2001

Pages 131 - 145

https://doi.org/10.1145/502034.502048

Published: 21 October 2001 Publication History

Get Access

Abstract

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 information to decide whether to route packets directly over the Internet or by way of other RON nodes, optimizing application-specific routing metrics.Results from two sets of measurements of a working RON deployed at sites scattered across the Internet demonstrate the benefits of our architecture. For instance, over a 64-hour sampling period in March 2001 across a twelve-node RON, there were 32 significant outages, each lasting over thirty minutes, over the 132 measured paths. RON's routing mechanism was able to detect, recover, and route around all of them, in less than twenty seconds on average, showing that its methods for fault detection and recovery work well at discovering alternate paths in the Internet. Furthermore, RON was able to improve the loss rate, latency, or throughput perceived by data transfers; for example, about 5% of the transfers doubled their TCP throughput and 5% of our transfers saw their loss probability reduced by 0.05. We found that forwarding packets via at most one intermediate RON node is sufficient to overcome faults and improve performance in most cases. These improvements, particularly in the area of fault detection and recovery, demonstrate the benefits of moving some of the control over routing into the hands of end-systems.

References

[1]

ANDERSEN, D. G. Resilient Overlay Networks. Master's thesis, Massachusetts Institute of Technology, May 2001.]]

Google Scholar

[2]

BALAKRISHNAN, H., SESHAN, S., STEMM, M., AND KATZ, R. Analyzing Stability in Wide-Area Network Performance. In Proc. ACM SIGMETRICS (Seattle, WA, June 1997), pp. 2-12.]]

Digital Library

Google Scholar

[3]

CHANDRA, B., DAHLIN, M., GAG, L., AND NAYATE, A. End-to-end WAN Service Availability. In Proc. 3rd USITS (San Francisco, CA, 2001), pp. 97-108.]]

Digital Library

Google Scholar

[4]

CLARK, D. Policy Routing in Internet Protocols. Interact Engineering Task Force, May 1989. RFC 1102.]]

Digital Library

Google Scholar

[5]

COLLINS, A. The Detour Framework for Packet Rerouting. Master's thesis, University of Washington, Oct. 1998.]]

Google Scholar

[6]

ERIKSSON, H. Mbone: The Multicast Backbone. Communications of the ACM 37, 8 (1994), 54-60.]]

Digital Library

Google Scholar

[7]

FLOYD, S., HANDLEY, M., PADHYE, J., AND WIDMER, J. Equation-Based Congestion Control for Unicast Applications. In Prec. ACM SIGCOMM (Stockholm, Sweden, Sept. 2000), pp. 43-54.]]

Digital Library

Google Scholar

[8]

GOYAL, M., GUERIN, R., AND RAJAN, R. Predicting TCP Throughput From Non-invasive Data. (Unpublished, http : //www. seas. upenn, edu : 8080/~guerin/publ icat ions/TCP_model. pdf).]]

Google Scholar

[9]

GUARDINI, I., FASANO, P., AND G1RARDI, G. IPv6 Operational Experience within the 6bone. In Prec. lnternet Society (INET) Conf. (Yokohama, Japan, July 2000). http://www.5.see.org/ inet2OOO/cdproceedings/le/le_l .htm.]]

Google Scholar

[10]

HAGENS, R., HALL, N., AND ROSE, M. Use of the Internet as a Subnetwork for Experimentation with the OSI Network Layer. Interact Engineering Task Force, Feb 1989. RFC 1070.]]

Digital Library

Google Scholar

[11]

KHANNA, A., AND ZINKY, J. The Revised ARPANET Routing Metric. In Prec. ACMSIGCOMM (Austin, TX, Sept. 1989), pp. 45-56.]]

Digital Library

Google Scholar

[12]

LABOVITZ, C., AHUJA, A., BOSE, A., AND JAHANIAN, F. Delayed Interact Routing Convergence. In Prec. ACM SIGCOMM (Stockholm, Sweden, September 2000), pp. 175-I 87.]]

Digital Library

Google Scholar

[13]

LABOVITZ, C., MALAN, R., AND JAHANIAN, F. Interact Routing Instability. IEEE/ACM Transactions on Networking 6, 5 (1998), 515-526.]]

Digital Library

Google Scholar

[14]

MCCANNE, S., AND JACOBSON, W. The BSD Packet Filter: A New Architecture for User-Level Packet Capture. In Prec. Winter '93 USENIX Conference (San Diego, CA, Jan. 1993), pp. 259-269.]]

Digital Library

Google Scholar

[15]

The North American Network Operators' Group mailing list archive. http : //www. cctec, com/maillists/nanog/.]]

Google Scholar

[16]

PADHYE, J., FIROIU, V., TOWSLEY, D., AND KUROSE, J. Modeling TCP Throughput: A Simple Model and its Empirical Validation. In Prec. ACM SIGCOMM (Vancouver, Canada, September 1998), pp. 303-323.]]

Digital Library

Google Scholar

[17]

PARTRIDGE, C. Using the Flow Label Field in 1Pv6. Internet Engineering Task Force, 1995. RFC 1809.]]

Digital Library

Google Scholar

[18]

PAXSON, V. End-to-End Routing Behavior in the Internet. In Prec. ACM SIGCOMM '96 (Stanford, CA, Aug. 1996), pp. 25-38.]]

Digital Library

Google Scholar

[19]

PAXSON, V. End-to-End Interact Packet Dynamics. In Prec. ACM SIGCOMM (Cannes, France, Sept. 1997), pp. 139-152.]]

Digital Library

Google Scholar

[20]

POSTEL, J. B. Transmission Control Protocol. Interact Engineering Task Force, September 1981. RFC 793.]]

Digital Library

Google Scholar

[21]

REKHTER, Y., AND LI, T. A Border Gateway Protocol 4 (BGP-4). Interact Engineering Task Force, 1995. RFC 1771.]]

Digital Library

Google Scholar

[22]

SAVAGE, S., ANDERSON, T., ET AL. Detour: A Case for Informed Interact Routing and Transport. IEEEMicro 19, 1 (Jan. 1999), 50-59.]]

Digital Library

Google Scholar

[23]

SAVAGE, S., COLLINS, A., HOFFMAN, E., SNELL, J., AND ANDERSON, T. The End-to-End Effects of lnternet Path Selection. In Proc. ACM SIGCOMM (Boston, MA, 1999), pp. 289-299.]]

Digital Library

Google Scholar

[24]

SESHAN, S., STEMM, M., AND KATZ, R. H. SPAND: Shared Passive Network Performance Discovery. In Proc. 1st USITS (Monterey, CA, December 1997), pp. 135-146.]]

Digital Library

Google Scholar

[25]

SHAIKH, A., KALAMPOUKAS, L., VARMA, A., AND DUBE, R. Routing Stability in Congested Networks: Experimentation and Analysis. In Proc. ACM SIGCOMM (Stockholm, Sweden, 2000), pp. 163-174.]]

Digital Library

Google Scholar

[26]

TOUCH, J., AND HOTZ, S. The X-Bone. In Proc. 3rd Global Internet Mini-Conference (Sydney, Australia, Nov. 1998), pp. 75-83.]]

Google Scholar

Cited By

View all

Ramanathan ASankaran RAbdu Jyothi S(2024)Xaminer: An Internet Cross-Layer Resilience Analysis ToolProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/36390428:1(1-37)Online publication date: 21-Feb-2024
https://dl.acm.org/doi/10.1145/3639042
Wang CXie KTian JWen JLi XXie GLi K(2024)HPETC: History Priority Enhanced Tensor Completion for Network Distance MeasurementIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2023.327430535:6(1012-1028)Online publication date: Jun-2024
https://doi.org/10.1109/TPDS.2023.3274305
Lenzen CMedina MSaberi MSchmid S(2024)Robust Routing Made Easy: Reinforcing Networks Against Non-Benign FaultsIEEE/ACM Transactions on Networking10.1109/TNET.2023.328318432:1(283-297)Online publication date: Feb-2024
https://doi.org/10.1109/TNET.2023.3283184
Show More Cited By

Index Terms

Resilient overlay networks
1. Networks
  1. Network protocols
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Routing and network design problems

Recommendations

Resilient overlay networks

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 ...
Read More
Efficient and resilient overlay topologies over ad hoc networks
IWSOS'07: Proceedings of the Second international conference on Self-Organizing Systems

We discuss what kind of overlay topology should be proactively built before an overlay routing protocol enters a route search process on top of it.

The basic overlay structures we study are the K-Nearest Neighbours overlay topologies, connecting every ...
Read More
Ranking factors in peer-to-peer overlay networks

A large number of peer processes are distributed in a peer-to-peer (P2P) overlay network. It is difficult, maybe impossible for a peer to perceive the membership and location of every resource object due to the scalability and openness of a P2P network. ...
Read More

Reviews

Reviewer: Alexandru Petrescu

In a world where peer-to-peer networks flourish, and where Internet path congestion and oscillations are daily events, the need for new efficient routing mechanisms is more and more pressing. Andersen, Balakrishnan, Kaashoek, and Morris present resilient overlay networks (RONs) as groups of nodes, distributed over large areas, whose users agree to engage in cooperative networking, and whose paths are formed over actual Internet routing paths. The main characteristics of a RON are that the number of participating nodes is small (up to 50), and that communication between sites follows paths that circumvent temporary failures of the actual Internet paths. This is achieved by continuous probing of the direct links between sites, and by employing a new link-state routing protocol (different than open shortest path first (OSPF) and border gateway protocol (BGP)). Simply put, when the underlying segments of a direct path between two RON nodes fail (BGP failures are often cited), the overlay network redirects the entire path toward an intermediary RON node, apparently lengthening the entire path, but still offering connectivity. RON nodes have addresses different than Internet protocol version 4 (IPv4) or Internet protocol version 6 (IPv6). Actual experiments, performed by the authors, included a 16-node deployment in the USA and Europe. As expected, another distinguishing trait of RON networking is the ability of applications at the uppermost layer to make routing decisions (traditionally, routing and application layers are separated, with the inconvenience of application interruption when routing fails). The authors pay detailed attention to motivating the overlaying routing approach. Not only do they describe an actual implementation, including simulation, test deployment, and performance measurements, but they also address, in a separate discussion section, tough questions on potential violation of the deployed Internet policy routing (presumably due to tunneling), limited RON size and scalability, and network address translation (NAT) traversal. Finally, one aspect whose treatment seems to be overlooked is one that lies at the very heart of a routing protocol: loop avoidance. While a description of path lookup and building by using link-state exchanges is given, proofs (at least conceptual) of loop avoidance are not mentioned at all. The paper provides a comprehensive bibliographical list. Many of the references are correctly used as explanations of the current BGP routing instabilities, as well as of how these influence transmission control protocol (TCP) applications; thus, they offer perfect motivations for the need to overlay network routing. Online Computing Reviews Service

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Information & Contributors

Information

Published In

SOSP '01: Proceedings of the eighteenth ACM symposium on Operating systems principles

October 2001

254 pages

ISBN:1581133898

DOI:10.1145/502034

General Chair:
Keith Marzullo
University of California, San Diego
,
Program Chair:
M. Satyanarayanan
Carnegie Mellon University and Intel Research, Pittsburgh

ACM SIGOPS Operating Systems Review Volume 35, Issue 5
Dec. 2001
243 pages
ISSN:0163-5980
DOI:10.1145/502059
Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 October 2001

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SOSP01

Sponsor:

SIGOPS

SOSP01: 18th Symposium on Operating System Principles

October 21 - 24, 2001

Alberta, Banff, Canada

Acceptance Rates

SOSP '01 Paper Acceptance Rate 17 of 85 submissions, 20%;

Overall Acceptance Rate 131 of 716 submissions, 18%

Upcoming Conference

SOSP '24

Sponsor:
sigops

ACM SIGOPS 30th Symposium on Operating Systems Principles

November 5 - 8, 2024

Austin , TX , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1,345
Total Citations
View Citations
4,768
Total Downloads

Downloads (Last 12 months)119
Downloads (Last 6 weeks)18

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ramanathan ASankaran RAbdu Jyothi S(2024)Xaminer: An Internet Cross-Layer Resilience Analysis ToolProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/36390428:1(1-37)Online publication date: 21-Feb-2024
https://dl.acm.org/doi/10.1145/3639042
Wang CXie KTian JWen JLi XXie GLi K(2024)HPETC: History Priority Enhanced Tensor Completion for Network Distance MeasurementIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2023.327430535:6(1012-1028)Online publication date: Jun-2024
https://doi.org/10.1109/TPDS.2023.3274305
Lenzen CMedina MSaberi MSchmid S(2024)Robust Routing Made Easy: Reinforcing Networks Against Non-Benign FaultsIEEE/ACM Transactions on Networking10.1109/TNET.2023.328318432:1(283-297)Online publication date: Feb-2024
https://doi.org/10.1109/TNET.2023.3283184
Xu YNi HZhu X(2023)A Novel Multipath Transmission Scheme for Information-Centric NetworkingFuture Internet10.3390/fi1502008015:2(80)Online publication date: 17-Feb-2023
https://doi.org/10.3390/fi15020080
Zhang SZhang YWang RGong XXiong Y(2023)DIT: A Dynamic Bandwidth Isolated Transmission System for Large-Scale Inter-DC Wireless Communication NetworkWireless Communications and Mobile Computing10.1155/2023/72094142023(1-17)Online publication date: 20-Feb-2023
https://doi.org/10.1155/2023/7209414
Kannagi AKumar SVishwakarma P(2023)Prevention of Security Against Attacks in Order to Balance the Syatem Using Optimisation2023 International Conference on Power Energy, Environment & Intelligent Control (PEEIC)10.1109/PEEIC59336.2023.10451286(1077-1082)Online publication date: 19-Dec-2023
https://doi.org/10.1109/PEEIC59336.2023.10451286
Chen XChen ZChang XJi TWu ZLi C(2023)Fast Reroute Algorithms for Satellite Network With Segment RoutingIEEE Access10.1109/ACCESS.2023.333598811(133509-133520)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3335988
Birge-Lee HApostolaki MRexford J(2022)It takes two to tangoProceedings of the 21st ACM Workshop on Hot Topics in Networks10.1145/3563766.3564107(174-180)Online publication date: 14-Nov-2022
https://dl.acm.org/doi/10.1145/3563766.3564107
Salamatian LAnderson SMatthews JBarford PWillinger WCrovella M(2022)Curvature-based Analysis of Network Connectivity in Private Backbone InfrastructuresProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/35080256:1(1-32)Online publication date: 28-Feb-2022
https://dl.acm.org/doi/10.1145/3508025
Liu CTourrilhes JChuah CSharma P(2022)Voyager: Revisiting Available Bandwidth Estimation With a New Class of Methods—Decreasing- Chirp-Train MethodsIEEE/ACM Transactions on Networking10.1109/TNET.2022.315217530:4(1717-1732)Online publication date: Aug-2022
https://doi.org/10.1109/TNET.2022.3152175
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations