A Hierarchical Model for BGP Routing Policies

Proceedings of the Second ACM SIGCOMM Workshop on Programmable Routers for Extensible Services of TOmorrow · 2009

Abstract

BGP routing policies are mainly used by network operators to enforce business relationships between Autonomous Systems (AS), and to prefer some routes over others. In this paper, we propose a hierarchical policy model to express each policy at the most appropriate level of abstraction. The model is structured around chains of filters that apply at a specific level of abstraction. To validate our approach, we implemented the model in a Java prototype and used it to reproduce several network-wide routing policies. In all studied networks, the model produced a high-level view of routing policies while preserving their semantics. Our model offers numerous advantages to network operators including, but not limited to, a better network documentation, an improved understanding of routing policies, redundancy suppression, and an easier way of managing their network.

People

Laurent Vanbever

Bruno Quoitin

Olivier Bonaventure

Cite (BibTeX)

@inproceedings {LBO09, 
	title = {A Hierarchical Model for BGP Routing Policies},
	booktitle = {Proceedings of the Second ACM SIGCOMM Workshop on Programmable Routers for Extensible Services of TOmorrow},
	pages = {61-66},
	address = {Barcelona, Spain},
	author = {Laurent Vanbever and Bruno Quoitin and Olivier Bonaventure},
	year = {2009},
	month = {August},
}