Bringing order to BGP: decreasing time and message complexity

DOI10.1016/J.COMNET.2009.04.001zbMath1180.68043OpenAlexW2004850125MaRDI QIDQ1031040

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

Publication date: 28 October 2009

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2009.04.001

zbMATH Keywords

convergencerouting protocolsBGPpath exploration

Mathematics Subject Classification ID

Network protocols (68M12) Internet topics (68M11)

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