Skip to main navigation Skip to search Skip to main content

Bringing order to BGP: Decreasing time and message complexity

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Original languageEnglish
Title of host publicationPODC'07
Subtitle of host publicationProceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Pages368-369
Number of pages2
ISBN (Print)1595936165, 9781595936165
DOIs
StatePublished - 12 Aug 2007
Externally publishedYes
Event26th Annual ACM Symposium on Principles of Distributed Computing, PODC 2007 - Portland, OR, United States
Duration: 12 Aug 2007 → 15 Aug 2007

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference26th Annual ACM Symposium on Principles of Distributed Computing, PODC 2007
Country/TerritoryUnited States
CityPortland, OR
Period12/08/07 → 15/08/07

Keywords

  • BGP
  • Convergence
  • Path exploration
  • Routing

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications
  • Bringing order to BGP: Decreasing time and message complexity

    Bremler-Barr, A., Chen, N., Kangasharju, J., Mokryn, O. & Shavitt, Y., 13 Aug 2009, In: Computer Networks. 53, 12, p. 2241-2256 16 p.

    Research output: Contribution to journal › Article › peer-review

Cite this