ACM Home Page
Please provide us with feedback. Feedback
Measuring the effects of internet path faults on reactive routing
Full text PdfPdf (395 KB)
Source Joint International Conference on Measurement and Modeling of Computer Systems archive
Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems table of contents
San Diego, CA, USA
SESSION: Overlay networks table of contents
Pages: 126 - 137  
Year of Publication: 2003
ISBN:1-58113-664-1
Also published in ...
Authors
Nick Feamster  MIT Laboratory for Computer Science, Cambridge, MA
David G. Andersen  MIT Laboratory for Computer Science, Cambridge, MA
Hari Balakrishnan  MIT Laboratory for Computer Science, Cambridge, MA
M. Frans Kaashoek  MIT Laboratory for Computer Science, Cambridge, MA
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 41,   Citation Count: 29
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/781027.781043
What is a DOI?

ABSTRACT

Empirical evidence suggests that reactive routing systems improve resilience to Internet path failures. They detect and route around faulty paths based on measurements of path performance. This paper seeks to understand why and under what circumstances these techniques are effective.To do so, this paper correlates end-to-end active probing experiments, loss-triggered traceroutes of Internet paths, and BGP routing messages. These correlations shed light on three questions about Internet path failures: (1) Where do failures appear? (2) How long do they last? (3) How do they correlate with BGP routing instability?Data collected over 13 months from an Internet testbed of 31 topologically diverse hosts suggests that most path failures last less than fifteen minutes. Failures that appear in the network core correlate better with BGP instability than failures that appear close to end hosts. On average, most failures precede BGP messages by about four minutes, but there is often increased BGP traffic both before and after failures. Our findings suggest that reactive routing is most effective between hosts that have multiple connections to the Internet. The data set also suggests that passive observations of BGP routing messages could be used to predict about 20% of impending failures, allowing re-routing systems to react more quickly to failures.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Amini, L., Shaikh, A., and Schulzrinne, H. Issues with inferring Internet topological attributes. In Proc. SPIE ITCOM (Boston, MA, August 2002), vol. 4685, pp. 80--90.
2
3
 
4
CAIDA's Skitter project, 2002. http://www.caida.org/tools/measurement/skitter/.
 
5
Chandra, B., Dahlin, M., Gao, L., and Nayate, A. End-to-end WAN Service Availability. In Proc. 3rd USITS (San Francisco, CA, 2001), pp. 97--108.
 
6
Chang, D.-F., Govindan, R., and Heidemann, J. An empirical study of router response to large BGP routing table load. Tech. Rep. ISI-TR-2001-552, USC/Information Sciences Institute, December 2001.
 
7
Donelan, S. Update: CSX train derailment. http://www.merit.edu/mail.archives/nanog/2001-07/msg00351.html.
 
8
Egan, J. Signal Detection Theory and ROC Analysis. Academic Press, New York, 1975.
 
9
Freedman, A. Active UDP and TCP performance during BGP update activity. In Proc. Internet Statistics Metrics and Analysis Workshop (Leiden, The Netherlands, October 2002). http://www.caida.org/outreach/isma/0210/ISMAagenda.xml.
 
10
 
11
 
12
13
14
 
15
Miller, G. Overlay routing networks (akarouting), Apr. 2002.
 
16
Nichol, D. Detecting behavior propagation in BGP trace data. In Proc. Internet Statistics Metrics and Analysis Workshop (Leiden, The Netherlands, October 2002). http://www.caida.org/outreach/isma/0210/talks/david.pdf.
 
17
Opnix. Orbit: Routing Intelligence System. http://www.opnix.com/newsroom/OrbitWhitePaper_July_2001.pdf, 2002.
 
18
 
19
MIT RON Project. http://nms.lcs.mit.edu/ron/.
 
20
RouteScience. http://www.routescience.com/.
 
21
Sockeye. http://www.sockeye.com/.
22
23
 
24
Gnu Zebra. http://www.zebra.org/.
25

CITED BY  29

Collaborative Colleagues:
Nick Feamster: colleagues
David G. Andersen: colleagues
Hari Balakrishnan: colleagues
M. Frans Kaashoek: colleagues