To refer to this page use:
|Abstract:||Software 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.|
|Citation:||Kang, 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.2535373|
|Pages:||13 - 24|
|Type of Material:||Conference Article|
|Journal/Proceeding Title:||Proceedings of the ninth ACM conference on Emerging networking experiments and technologies|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.