David G. Andersen
Alex C. Snoeren
ABSTRACT
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.
- Andersen, D. G., Balakrishnan, H., Kaashoek, M. F., and Morris, R. Resilient Overlay Networks. In Proc. 18th ACM SOSP (Banff, Canada, Oct. 2001), pp. 131--145. Google Scholar
Digital Library
- Andersen, D. G., Feamster, N., Bauer, S., and Balakrishnan, H. Topology Inference from BGP Routing Dynamics. In Proc. Internet Measurement Workshop (Marseille, France, 2002). Google ScholarDigital Library
- Awduche, D. O., Chiu, A., Elwalid, A., Widjaja, I., and Xiao, X. Overview and Principles of Interent Traffic Engineering. Internet Engineering Task Force, May 2002. RFC 3272. Google ScholarDigital Library
- Balakrishnan, H., Seshan, S., and Katz, R. Improving Reliable Transport and Handoff Performance in Cellular Wireless Networks. ACM Wireless Networks 1, 4 (Dec. 1995). Google ScholarDigital Library
- Banerjea, A. Simulation study of the capacity effects of dispersity routing for fault tolerant realtime channels. In Proc. ACM SIGCOMM (Aug. 1996), pp. 194--205. Google ScholarDigital Library
- Bestavros, A. An adaptive information dispersal algorithm for time-critical reliable communication. In Network Management and Control, Volume II, I. Frish, M. Malek, and S. Panwar, Eds. Plenum Publishing Co., New York, New York, 1994, pp. 423--438.Google ScholarCross Ref
- Bolot, J. End-to-End Packet Delay and Loss Behavior in the Internet. In Proc. ACM SIGCOMM (San Francisco, CA, Sept. 1993). Google ScholarDigital Library
- Braynard, R., Kostic, D., Rodriguez, A., Chase, J., and Vahdat, A. Opus: an overlay peer utility service. In Proc. 5th International Conference on Open Architectures and Network Programming (OPENARCH) (June 2002).Google ScholarCross Ref
- Byers, J. W., Luby, M., and Mitzenmacher, M. Accessing multiple mirror sites in parallel: Using tornado codes to speed up downloads. In Proc. IEEE Infocom (Mar. 1999), pp. 275--283.Google ScholarCross Ref
- Byers, J. W., Luby, M., Mitzenmacher, M., and Rege, A. A digital fountain approach to reliable distribution of bulk data. In Proc. ACM SIGCOMM (Aug. 1998), pp. 56--67. Google ScholarDigital Library
- Chen, J. New Approaches to Routing for Large-Scale Data Networks. PhD thesis, Rice University, 1999. Google ScholarDigital Library
- Cisco Security Advisory: Code Red Worm - Customer Impact. http://www.cisco.com/warp/public/707/cisco-code-red-worm-pub.shtml, 2001.Google Scholar
- Donelan, S. Update: CSX train derailment. http://www.merit.edu/mail.archives/nanog/2001-07/msg00351.html.Google Scholar
- Feamster, N., Andersen, D., Balakrishnan, H., and Kaashoek, M. F. Measuring the effects of Internet path faults on reactive routing. In Proc. Sigmetrics (San Diego, CA, June 2003). Google ScholarDigital Library
- Gallager, R. G. Low-Density Parity-Check Codes. PhD thesis, Massachusetts Institute of Technology, 1963.Google Scholar
- Jannotti, J., Gifford, D. K., Johnson, K. L., Kaashoek, M. F., and O'Toole Jr., J. W. Overcast: Reliable multicasting with an overlay network. In Proc. 4th USENIX OSDI (San Diego, California, October 2000), pp. 197--212. Google ScholarDigital Library
- Khanna, A., and Zinky, J. The Revised ARPANET Routing Metric. In Proc. ACM SIGCOMM (Austin, TX, Sept. 1989), pp. 45--56. Google ScholarDigital Library
- Labovitz, C., Ahuja, A., Bose, A., and Jahanian, F. Delayed Internet Routing Convergence. In Proc. ACM SIGCOMM (Stockholm, Sweden, September 2000), pp. 175--187. Google ScholarDigital Library
- Labovitz, C., Malan, R., and Jahanian, F. Internet Routing Instability. IEEE/ACM Transactions on Networking 6, 5 (1998), 515--526. Google ScholarDigital Library
- Lewin, D. Systems issues in global Internet content delivery, 2000. Keynote Address at 4th USENIX OSDI Conference.Google Scholar
- Maxemchuk, N. F. Dispersity Routing in Store and Forward Networks. PhD thesis, University of Pennsylvania, May 1975.Google Scholar
- McAuley, A. J. Error Control for Messaging Applications in a Wireless Environment. In Proc. INFOCOM Conf. (Apr. 1995). Google ScholarDigital Library
- Miller, G. Overlay routing networks (Akarouting). http://www-math.mit.edu/~steng/18.996/lecture9.ps, Apr. 2002.Google Scholar
- Opnix. Orbit: Routing Intelligence System. http://www.opnix.com/newsroom/OrbitWhitePaper_July_2001.pdf, 2001.Google Scholar
- Paxson, V. End-to-End Routing Behavior in the Internet. In Proc. ACM SIGCOMM '96 (Stanford, CA, Aug. 1996), pp. 25--38. Google ScholarDigital Library
- Paxson, V. End-to-End Internet Packet Dynamics. In Proc. ACM SIGCOMM (Cannes, France, Sept. 1997), pp. 139--152. Google ScholarDigital Library
- Rabin, M. O. Efficient dispersal of information for security, load balancing and fault tolerance. J. ACM 36, 2 (Apr. 1989), 335--348. Google ScholarDigital Library
- Rizzo, L., and Vicisano, L. RMDP: An FEC-based reliable multicast protocol for wireless environments. Mobile Computing and Communications Review 2, 2 (1998). Google ScholarDigital Library
- RouteScience. Whitepaper available from http://www.routescience.com/technology/tec_whitepaper.html.Google Scholar
- Savage, S., Collins, A., Hoffman, E., Snell, J., and Anderson, T. The End-to-End Effects of Internet Path Selection. In Proc. ACM SIGCOMM (Boston, MA, 1999), pp. 289--299. Google ScholarDigital Library
- Snoeren, A. C., Conley, K., and Gifford, D. K. Mesh-based content routing using XML. In Proc. 18th ACM SOSP (Banff, Canada, Oct. 2001), pp. 160--173. Google ScholarDigital Library
- Sockeye. http://www.sockeye.com/.Google Scholar
- Stonesoft. Multi-link technology white paper. http://www.stonesoft.com/files/products/StoneGate/SG_Multi-Link_Technology_Whitepaper.pdf, Oct. 2001.Google Scholar
Index Terms
- Best-path vs. multi-path overlay routing
Recommendations
Multi-path TCP: a joint congestion control and routing scheme to exploit path diversity in the internet
We consider the problem of congestion-aware multi-path routing in the Internet. Currently, Internet routing protocols select only a single path between a source and a destination. However, due to many policy routing decisions, single-path routing may ...
A Dynamic Multi-Path Routing Algorithm for ATM Networks
In this paper we describe briefly a dynamic multi-path routing scheme that has been considered for connection oriented homogeneous high-speed wide area Asynchronous Transfer Mode (ATM) networks. The fundamental objective of the scheme is to bridge the ...
Path splicing
SIGCOMM '08: Proceedings of the ACM SIGCOMM 2008 conference on Data communicationWe present path splicing, a new routing primitive that allows network paths to be constructed by combining multiple routing trees ("slices") to each destination over a single network topology. Path splicing allows traffic to switch trees at any hop en ...
Comments