Abstract
Path vector protocols in routing networks convey entire path information to each destination. When links fail, affected paths are replaced by new paths, and by observing the entire path information, one might hope to infer the failed links that caused these changes. However, inferring the exact topological changes behind observed routing changes may not be possible due to limited information, and the same changes may be explained by more than one set of candidate failures. In this paper, using a simple path vector routing model, we present the problem of finding the candidate set with minimum number of failures to explain observed route changes. We call this problem the minimum e-set problem and present algorithms for solving it optimally for certain cases. We also show that the minimum e-set problem is NP-complete in the general case.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Griffin T, Wilfong GT (2000) A safe path vector protocol. In: INFOCOM (2):490–499
Dahlhause E, Johnson DS, Papadimitriou CH, Seymore PD, Yannakakis, M (1992) The complexity of multiway cuts. In: 24th Annual ACM Symposium on Theory of Computing.
Garg N, Vazirani V, Yannakakis M (2004) Multiway cuts in node weighted graphs. In: Journal of Algorithms 49–61
Reddy A, Govindan R, Estrin D (2000) Fault isolation in multicast trees. In: SIGCOMM 29–40
Bejerano Y, Rastogi R (2003) Robust Monitoring of Link Delays and Faults in IP Networks. In: INFOCOMM
Wang C, Schwartz M (1993) Identification of Faulty Links in Dynamic-Routed Networks. IEEE Journal on Selected Areas in Communication 11
Lad M, Nanavati A, Massey D, Zhang L (2004) An Algorithmic Approach to Identifying Link Failures. In: 10th Pacific Rim International Symposium on Dependable Computing (PRDC).
Wu J, Mao ZM, Rexford J (2005) Finding a needle in a haystack: Pinpointing significant BGP routing changes in an IP network. In: Proceedings of 2nd symposium on Networked Systems Design and Implementation (NSDI).
FeldMann A, Maennel O, Mao ZM, Berger A, Maggs B (2004) Locating Internet routing instabilities. In: Proceedings of Sigcomm
Chang D, Govindan R, Hiedemann J (2003) The temporal and topological characterestics of BGP path changes. In: ICNP.
Kleinberg J, Sandler M, Slivkins A (2004) Network Failure Detection and Graph Connectivity. Proc. 15th ACM-SIAM Symposium on Discrete Algorithms
Garofalakis M, Kumar A (2003) Correlating xml data streams using tree-edit distance embeddings. In: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, ACM Press 143–154
Author information
Authors and Affiliations
Corresponding author
Additional information
This material is based upon work supported by the Defense Advanced Research Projects Agency (DARPA) under Contract No N66001-04-1-8926 and by National Science Fundation(NSF) under Contract No ANI-0221453. Any opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the DARPA or NSF. Part of the work was done when Akash Nanavati was at DA-IICT, India
Rights and permissions
About this article
Cite this article
Lad, M., Massey, D., Meyerson, A. et al. Minimum failure explanations for path vector routing changes. J Comb Optim 12, 5–16 (2006). https://doi.org/10.1007/s10878-006-8901-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-006-8901-3