DocumentCode
3310732
Title
Detecting the unintended in BGP policies
Author
Perouli, D. ; Griffin, T.G. ; Maennel, Olaf ; Fahmy, Sonia ; Phillips, Iain ; Pelsser, Cristel
Author_Institution
Purdue Univ., West Lafayette, IN, USA
fYear
2012
fDate
Oct. 30 2012-Nov. 2 2012
Firstpage
1
Lastpage
2
Abstract
Internet Service Providers (ISPs) use routing policies to implement the requirements of business contracts, manage traffic, address security concerns and increase scalability of their network. These routing policies are often a high-level expression of strategies or intentions of the ISP. They have meaning when viewed from a network-wide perspective (e.g., mark on ingress, filter on egress). However, configuring these policies for the Border Gateway Protocol (BGP) is undertaken at a low-level, on a per router basis. Unintended routing outcomes have been observed. In this work, we define a language that allows analysis of network-wide configurations at the high-level. This language aims at bridging the gap between router configurations and abstract mathematical models capable of capturing complex policies. The language can be used to verify desired properties of routing protocols and hence detect potential unintended states of BGP. The language is accompanied by a tool suite that parses router configuration languages (which by their nature are vendor-dependent) and translates them into vendor-independent representations of policies.
Keywords
Internet; computer network security; routing protocols; telecommunication traffic; BGP policies; ISP; Internet service providers; abstract mathematical models; border gateway protocol; business contracts; network scalability; router configurations; routing policies; routing protocols; security concerns; traffic management; Communities; Computer science; Educational institutions; Internet; Routing; Routing protocols; Vegetation;
fLanguage
English
Publisher
ieee
Conference_Titel
Network Protocols (ICNP), 2012 20th IEEE International Conference on
Conference_Location
Austin, TX
Print_ISBN
978-1-4673-2445-8
Electronic_ISBN
978-1-4673-2446-5
Type
conf
DOI
10.1109/ICNP.2012.6459955
Filename
6459955
Link To Document