Bringing order to BGP, decreasing time and message complexity

DOI10.1145/1281100.1281177MaRDI QIDQ5401467zbMATH OpenOpenAlexFDO

Authors Anat Bremler-Barr, Nir Chen, Jussi Kangasharju, Yuval Shavitt, Osnat (Ossi) Mokryn

Publication date 13 March 2014

Published in Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1281100.1281177

zbMATH Keywords

convergenceroutingBGPpath exploration

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Internet topics (68M11) Distributed systems (68M14) Network protocols (68M12)

Recommendations

• Bringing order to BGP: decreasing time and message complexity
• BGP-RCN: improving BGP convergence through root cause notification
• On the convergence time of a path-vector protocol
• Distributed Computing - IWDC 2003
• On the stable paths problem

Cited in

(6)

• BGP session lifetime modeling in congested networks
• An analysis of convergence delay in path vector routing protocols
• BGP-RCN: improving BGP convergence through root cause notification
• Bringing order to BGP: decreasing time and message complexity
• Distributed Computing - IWDC 2003
• On the convergence time of a path-vector protocol

This page was built for publication: Bringing order to BGP, decreasing time and message complexity

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