To refer to this page use:
|Abstract:||There is a strong trend in networking to move towards Software-Defined Networks (SDN). SDNs enable easier network configuration through a separation between a centralized controller and a distributed data plane comprising a network of switches. The controller implements network policies through installing rules on switches. Recently the "Big Switch" abstraction  was proposed as a specification mechanism for high-level network behavior, i.e., the network policies. The network operating system or compiler can use his specification for placing rules on individual switches. However, this is constrained by the limited capacity of the Ternary Content Addressable Memories (TCAMs) used for rules in each switch. We propose an Integer Linear Programming (ILP) based solution for placing rules on switches for a given firewall policy while optimizing for the total number of rules and meeting the switch capacity constraints. Experimental results demonstrate that our approach is scalable to practical sized networks.|
|Citation:||Zhang, Shuyuan, Franjo Ivancic, Cristian Lumezanu, Yifei Yuan, Aarti Gupta, and Sharad Malik. "An Adaptable Rule Placement for Software-Defined Networks." In 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2014): pp. 88-99. doi:10.1109/DSN.2014.24|
|Pages:||88 - 99|
|Type of Material:||Conference Article|
|Journal/Proceeding Title:||44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.