Design Principles of Policy Languages for Path-Vector Protocols

Timothy G. Griffin, Aaron D. Jaggard, and Vijay Ramachandran

Abstract

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. BGP policy languages have evolved in a rather organic fashion with little effort to avoid policy-interaction problems. We believe that researchers should start to consider how to design policy languages for path-vector protocols in order to avoid routing anomalies while obtaining desirable protocol properties. We take a few steps in this direction by identifying the important dimensions of this design space and characterizing some of the inherent design trade-offs. We do this in a general way that is not constrained by the details of BGP.

Current Citation

T. G. Griffin, A. D. Jaggard, and Vijay Ramachandran. "Design Principles of Policy Languages for Path-Vector Protocols." In Proc. ACM SIGCOMM'03, pp. 61-72, August 2003. Extended version available as Yale Univ. Tech. Rep't YALEU/DCS/TR-1250, April 2004.
 

@inproceedings{gjr03,
	title = {Design Principles of Policy Languages for Path-Vector Protocols},
	author = {Timothy G.\ Griffin and Aaron D.\ Jaggard and Vijay Ramachandran},
	booktitle = {Proc.\ {ACM} {SIGCOMM}'03},
	month = {August},
	year = {2003},
	publisher = {{ACM} Press},
	pages = {61--72},
	note = {Ext.\ version available as Yale Univ.\ Tech.\ Report
		{YALEU/DCS/TR--1250}, April 2004.} }

Download
(in reverse chronological order)

Filetype	Version
(268KB)	Extended version (YALEU/DCS/TR-1250)
(152KB)	Slides from 2003 OGST (extended version of conference talk)
(284KB)	Conference version (© 2003 ACM)
(116KB)	Slides from conference talk