DocumentCode
2674002
Title
An algorithmic approach to identifying link failures
Author
Lad, Mohit ; Nanavati, Akash ; Massey, Dan ; Zhang, Lixia
Author_Institution
Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA
fYear
2004
fDate
3-5 March 2004
Firstpage
25
Lastpage
34
Abstract
Due to the Internet´s sheer size, complexity, and various routing policies, it is difficult if not impossible to locate the causes of large volumes of BGP update messages that occur from time to time. To provide dependable global data delivery we need diagnostic tools that can pinpoint the exact connectivity changes. We describe an algorithm, called MVSChange that can pin down the origin of routing changes due to any single link failure or link restoration. Using a simplified model of BGP, called simple path vector protocol (SPVP), and a graph model of the Internet, MVSChange takes as input the SPVP update messages collected from multiple vantage points and accurately locates the link that initiated the routing changes. We provide theoretical proof for the correctness of the design.
Keywords
Internet; fault diagnosis; fault tolerant computing; graph theory; routing protocols; system monitoring; telecommunication links; BGP; Internet; MVSChange algorithm; border gateway protocol; fault diagnosis; fault tolerance algorithm; graph theory; link failures; routing policy; simple path vector protocol; telecommunication link failure; Computer science; Data analysis; Fault diagnosis; Fault tolerance; Graph theory; Internet; Intersymbol interference; Monitoring; Routing protocols; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Dependable Computing, 2004. Proceedings. 10th IEEE Pacific Rim International Symposium on
Print_ISBN
0-7695-2076-6
Type
conf
DOI
10.1109/PRDC.2004.1276549
Filename
1276549
Link To Document