Skip to main content

Control plane compression

Author(s): Beckett, Ryan; Gupta, Aarti; Mahajan, Ratul; Walker, David

To refer to this page use:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBeckett, Ryan-
dc.contributor.authorGupta, Aarti-
dc.contributor.authorMahajan, Ratul-
dc.contributor.authorWalker, David-
dc.identifier.citationBeckett, Ryan, Aarti Gupta, Ratul Mahajan, and David Walker. "Control plane compression." In Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication (2019): pp. 476-489. doi:10.1145/3230543.3230583en_US
dc.description.abstractWe develop an algorithm capable of compressing large networks into smaller ones with similar control plane behavior: For every stable routing solution in the large, original network, there exists a corresponding solution in the compressed network, and vice versa. Our compression algorithm preserves a wide variety of network properties including reachability, loop freedom, and path length. Consequently, operators may speed up network analysis, based on simulation, emulation, or verification, by analyzing only the compressed network. Our approach is based on a new theory of control plane equivalence. We implement these ideas in a tool called Bonsai and apply it to real and synthetic networks. Bonsai can shrink real networks by over a factor of 5 and speed up analysis by several orders of magnitude.en_US
dc.format.extent476 - 489en_US
dc.relation.ispartofProceedings of the 2018 Conference of the ACM Special Interest Group on Data Communicationen_US
dc.rightsAuthor's manuscripten_US
dc.titleControl plane compressionen_US
dc.typeConference Articleen_US

Files in This Item:
File Description SizeFormat 
ControlPlaneCompression.pdf1.13 MBAdobe PDFView/Download

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.