Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 2005 ACM SIGCOMM workshop on Mining network data
Proceedings of the 3rd international workshop on Visualization for computer security
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
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. In this paper 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 the correctness of the design.