Best-path vs. multi-path overlay routing

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.

[1]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[2]  Nicholas F. Maxemchuk,et al.  DISPERSITY ROUTING IN STORE-AND-FORWARD NETWORKS. , 1975 .

[3]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[4]  A. Khanna,et al.  The revised ARPANET routing metric , 1989, SIGCOMM '89.

[5]  Jean-Chrysostome Bolot,et al.  End-to-end packet delay and loss behavior in the internet , 1993, SIGCOMM '93.

[6]  M. Rabin,et al.  An Adaptive Information Dispersal Algorithm for Time-critical Reliable Communication , 1994 .

[7]  Srinivasan Seshan,et al.  Improving reliable transport and handoff performance in cellular wireless networks , 1995, Wirel. Networks.

[8]  Anthony J. McAuley.  Error control for messaging applications in a wireless environment , 1995, Proceedings of INFOCOM'95.

[9]  V. Paxson.  End-to-end routing behavior in the internet , 2006, CCRV.

[10]  Anindo Banerjea.  Simulation Study of the Capacity Effects of Dispersity Routing for Fault Tolerant Realtime Channels , 1996, SIGCOMM.

[11]  Vern Paxson,et al.  End-to-end Internet packet dynamics , 1997, SIGCOMM '97.

[12]  Vern Paxson,et al.  End-to-end routing behavior in the Internet , 1996, TNET.

[13]  Farnam Jahanian,et al.  Internet routing instability , 1997, SIGCOMM '97.

[14]  Luigi Rizzo,et al.  Environments , 2019, Privacy, Regulations, and Cybersecurity.

[15]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

[16]  Stefan Savage,et al.  The end-to-end effects of Internet path selection , 1999, SIGCOMM '99.

[17]  Michael Mitzenmacher,et al.  Accessing multiple mirror sites in parallel: using Tornado codes to speed up downloads , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[18]  Abhijit Bose,et al.  Delayed internet routing convergence , 2000, SIGCOMM.

[19]  Peter Druschel,et al.  New approaches to routing for large-scale data networks , 2000 .

[20]  Kirk L. Johnson,et al.  Overcast: reliable multicasting with on overlay network , 2000, OSDI.

[21]  Abhijit Bose,et al.  Delayed Internet routing convergence , 2000, SIGCOMM.

[22]  Alex C. Snoeren,et al.  Mesh-based content routing using XML , 2001, SOSP.

[23]  Amin Vahdat,et al.  Opus: an overlay peer utility service , 2002, 2002 IEEE Open Architectures and Network Programming Proceedings. OPENARCH 2002 (Cat. No.02EX571).

[24]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[25]  Nick Feamster,et al.  Topology inference from BGP routing dynamics , 2002, IMW '02.

[26]  Nick Feamster,et al.  Measuring the effects of internet path faults on reactive routing , 2003, SIGMETRICS '03.