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 language | English (US) |
|---|---|
| Pages | 289-300 |
| Number of pages | 12 |
| DOIs | |
| State | Published - 2003 |
| Event | ACM SIGCOMM Workshop on Future Directions in Network Architecture, FDNA '03 - Karlsruhe, Germany Duration: Aug 25 2003 → Aug 27 2003 |
Other
| Other | ACM SIGCOMM Workshop on Future Directions in Network Architecture, FDNA '03 |
|---|---|
| Country/Territory | Germany |
| City | Karlsruhe |
| Period | 8/25/03 → 8/27/03 |
All Science Journal Classification (ASJC) codes
- Hardware and Architecture
- Electrical and Electronic Engineering
Keywords
- C.2.2 [computer-communication networks]: routing protocols
- Design
- Performance
- Protocol verification
- Reliability