An Adaptable Rule Placement for Software-Defined Networks

DSN(2014)

引用 46|浏览50
暂无评分
摘要
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 [1] 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.
更多
查看译文
关键词
firewalls,network policies,distributed firewall,rule placement,network operating systems,sdn,firewall policy,compiler,practical sized networks,network configuration,computer network management,ilp,integer programming,distributed dataplane,sdn, big switch abstraction, rule placement, distributed firewall,linear programming,integer linear programming,centralized controller,switch capacity constraints,adaptable rule placement,software-defined networks,tcam,big switch abstraction,high-level network behavior,ternary content addressable memories,software defined networks,silicon,optimization,control systems,routing
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要