Bringing order to BGP: Decreasing time and message complexity

Anat Bremler-Barr*, Nir Chen, Jussi Kangasharju, Osnat Mokryn, Yuval Shavitt

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Original languageEnglish
Title of host publicationPODC'07
Subtitle of host publicationProceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing
Pages368-369
Number of pages2
DOIs
StatePublished - 2007
EventPODC'07: 26th Annual ACM Symposium on Principles of Distributed Computing - Portland, OR, United States
Duration: 12 Aug 200715 Aug 2007

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

ConferencePODC'07: 26th Annual ACM Symposium on Principles of Distributed Computing
Country/TerritoryUnited States
CityPortland, OR
Period12/08/0715/08/07

Keywords

  • BGP
  • Convergence
  • Path exploration
  • Routing

Cite this