Skip to main content

Optimizing the "one big switch" abstraction in software-defined networks

Author(s): Kang, Nanxi; Liu, Zhenming; Rexford, Jennifer; Walker, David

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr17g0f
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKang, Nanxi-
dc.contributor.authorLiu, Zhenming-
dc.contributor.authorRexford, Jennifer-
dc.contributor.authorWalker, David-
dc.date.accessioned2021-10-08T19:49:40Z-
dc.date.available2021-10-08T19:49:40Z-
dc.date.issued2013-12en_US
dc.identifier.citationKang, Nanxi, Zhenming Liu, Jennifer Rexford, and David Walker. "Optimizing the 'one big switch' abstraction in software-defined networks." In Proceedings of the ninth ACM conference on Emerging networking experiments and technologies (2013): pp. 13-24. doi:10.1145/2535372.2535373en_US
dc.identifier.urihttps://www.cs.princeton.edu/~jrex/papers/obs-tech.pdf-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr17g0f-
dc.description.abstractSoftware Defined Networks (SDNs) support diverse network policies by offering direct, network-wide control over how switches handle traffic. Unfortunately, many controller platforms force applications to grapple simultaneously with end-to-end connectivity constraints, routing policy, switch memory limits, and the hop-by-hop interactions between forwarding rules. We believe solutions to this complex problem should be factored in to three distinct parts: (1) high-level SDN applications should define their end-point connectivity policy on top of a "one big switch" abstraction; (2) a mid-level SDN infrastructure layer should decide on the hop-by-hop routing policy; and (3) a compiler should synthesize an effective set of forwarding rules that obey the user-defined policies and adhere to the resource constraints of the underlying hardware. In this paper, we define and implement our proposed architecture, present efficient rule-placement algorithms that distribute forwarding policies across general SDN networks while managing rule-space constraints, and show how to support dynamic, incremental update of policies. We evaluate the effectiveness of our algorithms analytically by providing complexity bounds on their running time and rule space, as well as empirically, using both synthetic benchmarks, and real-world firewall and routing policies.en_US
dc.format.extent13 - 24en_US
dc.language.isoen_USen_US
dc.relation.ispartofProceedings of the ninth ACM conference on Emerging networking experiments and technologiesen_US
dc.rightsAuthor's manuscripten_US
dc.titleOptimizing the "one big switch" abstraction in software-defined networksen_US
dc.typeConference Articleen_US
dc.identifier.doi10.1145/2535372.2535373-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/conference-proceedingen_US

Files in This Item:
File Description SizeFormat 
OptimizingAbstractionSoftwareDefinedNetworks.pdf1.37 MBAdobe PDFView/Download


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