Efficient Network Reachability Analysis Using a Succinct Control Plane Representation

Authors: 

Seyed K. Fayaz and Tushar Sharma, Carnegie Mellon University; Ari Fogel, Intentionet; Ratul Mahajan, Microsoft Research; Todd Millstein, University of California, Los Angeles; Vyas Sekar, Carnegie Mellon University; George Varghese, University of California, Los Angeles

Abstract: 

To guarantee network availability and security, operators must ensure that their reachability policies (e.g., A can or cannot talk to B) are correctly implemented. This is a difficult task due to the complexity of network configuration and the constant churn in a network’s environment, e.g., new route announcements arrive and links fail. Current network reachability analysis techniques are limited as they can only reason about the current “incarnation” of the network, cannot analyze all configuration features, or are too slow to enable exploration of many environments. We build ERA, a tool for efficient reasoning about network reachability. Instead of reasoning about individual incarnations of the network, ERA directly reasons about the network “control plane” that generates these incarnations. We address key expressiveness and scalability challenges by building (i) a succinct model for the network control plane (i.e., various routing protocols and their interactions), and (ii) a repertoire of techniques for scalable (taking a few seconds for a network with > 1000 routers) exploration of this model. We have used ERA to successfully find both known and new violations of a range of common intended polices.

Open Access Media

USENIX is committed to Open Access to the research presented at our events. Papers and proceedings are freely available to everyone once the event begins. Any video, audio, and/or slides that are posted after the event are also free and open to everyone. Support USENIX and our commitment to Open Access.

Presentation Audio

BibTeX
@inproceedings {199378,
author = {Seyed K. Fayaz and Tushar Sharma and Ari Fogel and Ratul Mahajan and Todd Millstein and Vyas Sekar and George Varghese},
title = {Efficient Network Reachability Analysis Using a Succinct Control Plane Representation},
booktitle = {12th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 16)},
year = {2016},
isbn = {978-1-931971-33-1},
address = {Savannah, GA},
pages = {217--232},
url = {https://www.usenix.org/conference/osdi16/technical-sessions/presentation/fayaz},
publisher = {{USENIX} Association},
}