Brief announcement: a calculus of policy-based routing systems

Authors:
Anduo Wang;Carolyn Talcott;Alexander Gurney;Boon Thau Loo;Andre Scedrov
Affiliations:
University of Pennsylvania, Philladephia, PA, USA;SRI International, Menlo Park, CA, USA;University of Pennsylvania, Philadelphia, PA, USA;University of Pennsylvania, Phildadelphia, PA, USA;University of Pennsylvania, Phildadelphia, PA, USA
Venue:
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Year:
2012

Citing 2
Cited 2

An analysis of BGP convergence properties

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Network routing with path vector protocols: theory and applications

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications

Reduction-based analysis of BGP systems with BGPVerif

Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Reduction-based analysis of BGP systems with BGPVerif

ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12

Quantified Score

Hi-index	0.00

Visualization

Abstract

The BGP (Border Gateway Protocol) is the single inter-domain routing protocol that enables network operators within each autonomous system (AS) to influence routing decisions by independently setting local policies on route filtering and selection. This independence leads to fragile networking and makes analysis of policy configurations very complex. To aid the systematic and efficient study of the policy configuration space, this paper presents a reduction calculus on policy-based routing systems. In the calculus, we provide two types of reduction rules that transform policy configurations by merging duplicate and complementary router configurations to simplify analysis. We show that the reductions are sound, dual of each other and are locally complete. The reductions are also computationally attractive, requiring only local configuration information and modification. These properties establish our reduction calculus as a sound, efficient, and complete theory for scaling up existing analysis techniques.