Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Measuring the Effects of Internet Path Faults on Reactive Routing
 

Summary: Measuring the Effects of Internet Path Faults on
Reactive Routing
Nick Feamster, David G. Andersen, Hari Balakrishnan, and M. Frans Kaashoek
MIT Laboratory for Computer Science
200 Technology Square, Cambridge, MA 02139
{feamster,dga,hari,kaashoek}@lcs.mit.edu
Abstract
Empirical evidence suggests that reactive routing systems im­
prove resilience to Internet path failures. They detect and route
around faulty paths based on measurements of path perfor­
mance. This paper seeks to understand why and under what cir­
cumstances these techniques are effective.
To do so, this paper correlates end­to­end active probing ex­
periments, loss­triggered traceroutes of Internet paths, and BGP
routing messages. These correlations shed light on three ques­
tions 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

  

Source: Andersen, Dave - School of Computer Science, Carnegie Mellon University
Feamster, Nick - College of Computing, Georgia Institute of Technology
Massachusetts Institute of Technology (MIT), Computer Science and Artificial Intelligence Laboratory, Networks and Mobile Systems Group
Massachusetts Institute of Technology (MIT), Computer Science and Artificial Intelligence Laboratory, Parallel and Distributed Operating Systems Group
Massachusetts Institute of Technology (MIT), Department of Electrical Engineering and Computer Science, Database Group

 

Collections: Computer Technologies and Information Sciences