Robust Path-Vector Routing Despite Inconsistent Route Preferences

Authors:
Aaron Jaggard;Vijay Ramachandran
Affiliations:
Department of Mathematics, Tulane University, New Orleans, LA USA. adj@math.tulane.edu;Department of Computer Science, Stevens Institute of Technology, Hoboken, NJ USA. vijayr@cs.stevens.edu
Venue:
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Year:
2006

Citing 0
Cited 6

Resolving inter-domain policy disputes

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective

Graph-Theoretic Concepts in Computer Science
On the convergence condition and convergence time of BGP

Computer Communications
Resolving inter-domain routing policy disputes at run-time with scalability consideration

Information Fusion
On the stability of interdomain routing

ACM Computing Surveys (CSUR)
An economic analysis of routing conflict and its resolution

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Some commonly used inter-domain-routing policies驴e.g., those using BGP's MED attribute for cold-potato routing驴are beyondthe scope of routing theory developed to date. This is because these policies cannot be expressed as a linear preference rankingof available routes at each node. Existing characterizations of well-behaved path-vector routing, however, critically dependon this linear ranking and do not naturally extend to more complex policies. In this paper, we present a framework that isable to model these more general policies. We use it to give the broadest-known sufficient condition for robust convergenceof path-vector protocols, even when complex policies are used. In doing so, we present a new, unified notion of order on policies;this reduces to earlier results in the case of restricted policies, but it allows us to analyze the practically useful butinconsistent policies that could not be directly modeled before. As an application, we rigorously analyze (and improve) variousrobust protocol-design proposals.