Minimum failure explanations for path vector routing changes

DOI10.1007/S10878-006-8901-3MaRDI QIDQ857773zbMATH OpenOpenAlexFDO

Authors Mohit Lad, Dan Massey, Adam Meyerson, Akash Nanavati, Lixia Zhang

Publication date 5 January 2007

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-006-8901-3

zbMATH Keywords

minimum e-set problemrouting networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• On the convergence time of a path-vector protocol
• Subjective-cost policy routing
• The Complexity of Restricted Variants of the Stable Paths Problem
• On the stable paths problem
• An analysis of convergence delay in path vector routing protocols

Cites work

• Multiway cuts in node weighted graphs
• Network Failure Detection and Graph Connectivity

This page was built for publication: Minimum failure explanations for path vector routing changes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857773)