On the convergence time of a path-vector protocol

MaRDI QIDQ5501315zbMATH OpenFDO

Authors Howard Karloff

Publication date 3 August 2015

Mathematics Subject Classification ID

Network protocols (68M12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Online algorithms; streaming algorithms (68W27)

Recommendations

• On the stable paths problem
• Bringing order to BGP, decreasing time and message complexity
• The convergency of some routing protocols
• The Complexity of Restricted Variants of the Stable Paths Problem
• Bringing order to BGP: decreasing time and message complexity

Cited in

(6)

• Bringing order to BGP: decreasing time and message complexity
• An analysis of convergence delay in path vector routing protocols
• On the stable paths problem
• The convergency of some routing protocols
• Bringing order to BGP, decreasing time and message complexity
• Minimum failure explanations for path vector routing changes

This page was built for publication: On the convergence time of a path-vector protocol

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