Loss-Optimized Routing in Overlay Networks

Path diversity exists in many overlay networks. How can we take advantage of this diversity to reduce packet loss? If bandwidth is infinite, the answer is simple—we could send a copy of the packet down every link, and hope it gets through. If we have perfect knowledge of the network state, we could always choose to send our packet down the “best” path. Since neither of these approaches is feasible, we study the trade-offs for more practical variants: Multi-path delivery with redundant encodings, and probe-based reactive overlay routing. Our measurements on a 17-node Internet testbed show that reactive routing can provide 20% reductions in the number of outages and the observed loss rates, and that 2-redundant multi-path routing can eliminates 30% of the outages while reducing standing loss rates by a factor of two.

[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 1989.

[5]  Jean-Chrysotome Bolot.  End-to-end packet delay and loss behavior in the internet , 1993, SIGCOMM 1993.

[6]  Azer Bestavros.  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]  Anindo Banerjea.  Simulation Study of the Capacity Effects of Dispersity Routing for Fault Tolerant Realtime Channels , 1996, SIGCOMM.

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

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

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

[13]  Luigi Rizzo,et al.  RMDP: an FEC-based reliable multicast protocol for wireless environments , 1998, MOCO.

[14]  Donald F. Towsley,et al.  Modeling TCP throughput: a simple model and its empirical validation , 1998, SIGCOMM '98.

[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]  Peter Druschel,et al.  New approaches to routing for large-scale data networks , 2000 .

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

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

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

[22]  Ramesh Govindan,et al.  An empirical study of router response to large BGP routing table load , 2002, IMW '02.

[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.