Towards a Logic for Wide-Area Internet Routing

Nick Feamster, Hari Balakrishnan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Scopus citations

Abstract

Interdomain routing is a massive distributed computing task that propagates topological information for global reachability. Today's interdomain routing protocol, BGP4, is exceedingly complex because the wide variety of goals that it must meet - including fast convergence, failure resilience, scalability, policy expression, and global reachability - are accomplished by mechanisms that have complicated interactions and unintended side effects. The complexity of wide-area routing configuration and protocol dynamics requires mechanisms for expressing wide-area routing that adhere to a set of logical rules. We propose a set of rules, called the routing logic, which can be used to determine whether a routing protocol satisfies various properties. We demonstrate how this logic can aid in analyzing the behavior of BGP4 under various configurations. We also speculate on how the logic can be used to analyze existing configuration in real-world networks, synthesize network-wide router configuration from a high-level policy language, and assist protocol designers in reasoning about new routing protocols.

Original languageEnglish (US)
Title of host publicationProceedings of the ACM SIGCOMM Workshops
PublisherAssociation for Computing Machinery
Pages289-300
Number of pages12
ISBN (Print)1581137486, 9781581137484
DOIs
StatePublished - 2003
EventProceedings of the ACM SIGCOMM Workshops - Karlsruhe, Germany
Duration: Aug 25 2003Aug 25 2003

Publication series

NameProceedings of the ACM SIGCOMM Workshops

Other

OtherProceedings of the ACM SIGCOMM Workshops
CountryGermany
CityKarlsruhe
Period8/25/038/25/03

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Keywords

  • Design
  • Performance
  • Reliability

Fingerprint Dive into the research topics of 'Towards a Logic for Wide-Area Internet Routing'. Together they form a unique fingerprint.

  • Cite this

    Feamster, N., & Balakrishnan, H. (2003). Towards a Logic for Wide-Area Internet Routing. In Proceedings of the ACM SIGCOMM Workshops (pp. 289-300). (Proceedings of the ACM SIGCOMM Workshops). Association for Computing Machinery. https://doi.org/10.1145/972426.944767