| Incentive-Compatible Interdomain Routing |
MAY 2006 |
31 pages |
| Authors:
Joan Feigenbaum; Vijay Ramachandran; Michael Schapira; YALE UNIV NEW HAVEN CT DEPT OF COMPUTER SCIENCE
|
 | The routing of traffic between Internet domains, or Autonomous Systems (ASes), a task known as interdomain routing, is currently handled by the Border Gateway Protocol (BGP). Using BGP, autonomous systems can apply semantically rich routing policies to choose interdomain routes in a distributed fashion. This expressiveness in routing-policy choice supports domains autonomy in network operations and in business decisions, but it comes at a price: The interaction of locally defined ... |
|
| Robustness of Path-Vector Protocols Without Independent Route Ranking |
APR 2005 |
33 pages |
| Authors:
Aaron D. Jaggard; Vijay Ramachandran; YALE UNIV NEW HAVEN CT DEPT OF COMPUTER SCIENCE
|
| Recent work has presented theoretical frameworks that rigorously model the behavior of path-vector protocols, which are primarily used for inter-domain routing on the Internet. We expand the scope of these to include protocols with route-selection procedures that cannot be captured by a per-node linear order on paths; in particular, our generalized model captures the use of commonly deployed route attributes such as MED, which is used to fine-tune routing between ... |
|
| Robustness of Class-Based Path-Vector Systems |
DEC 2004 |
19 pages |
| Authors:
Aaron D. Jaggard; Vijay Ramachandran; YALE UNIV NEW HAVEN CT DEPT OF COMPUTER SCIENCE
|
| Griffin, Jaggard, and Ramachandran [5] introduced a framework for studying design principles for path-vector protocols, such as the Border Gateway Protocol (BGP) used for inter-domain routing in the Internet. They outlined how their framework could describe Hierarchical- BGP-like systems in which routing at a node is determined by the relationship with the next-hop node on a path (e.g., an ISP-peering relationship) and some additional scoping rules (e.g., the use of ... |
|
| Relating Two Formal Models of Path-Vector Routing |
JUL 2004 |
14 pages |
| Authors:
Aaron D. Jaggard; Vijay Ramachandran; YALE UNIV NEW HAVEN CT DEPT OF COMPUTER SCIENCE
|
| This paper unifies two independently developed formalisms for path-vector routing protocols such as the Border Gateway Protocol (BGP), the standard interdomain routing protocol for the Internet. The works of Griffin, Jaggard, and Ramachandran [4] and Sobrinho [8] proved conditions for guaranteed protocol convergence, but as they operate at different levels of abstraction in modeling the protocols, the relationship between them is not obvious. Here we provide a rigorous translation between ... |
|
| Design Principles of Policy Languages for Path-Vector Protocols |
APR 2004 |
28 pages |
| Authors:
Timothy G. Griffin; Aaron D. Jaggard; Vijay Ramachandran; YALE UNIV NEW HAVEN CT DEPT OF COMPUTER SCIENCE
|
| BGP is unique among IP-routing protocols in that routing is determined using semantically rich routing policies. However this expressiveness has come with hidden risks. The interaction of locally defined routing policies can lead to unexpected global routing anomalies, which can be very difficult to identify and correct in the decentralized and competitive Internet environment. These risks increase as the complexity of local policies increase. which is precisely the current trend. ... |
|
Reports by Author
