Genesis: synthesizing forwarding tables in multi-tenant networks
Genesis: synthesizing forwarding tables in multi-tenant networks
复制标题
DOI：
10.1145/3009837.3009845
复制
发表时间：
2017-01
期刊：
影响因子：
--
通讯作者：
Kausik Subramanian;Loris D'antoni;Aditya Akella
中科院分区：
文献类型：
--
作者：
Kausik Subramanian;Loris D'antoni;Aditya Akella
多租户云数据中心的运营商需要支持多种复杂的端到端策略，如可达性、中间盒遍历、隔离、流量工程、网络资源管理等。我们介绍了Genesis，一个数据中心网络管理系统，它允许以声明性方式指定策略，而无需显式地对网络数据平面进行编程。Genesis通过综合交换机转发表来解决执行策略的问题。它将约束求解的正式基础与快速的现成SMT求解器结合使用。为了提高综合性能，Genesis结合了一种新的搜索策略，该策略使用正则表达式来指定利用数据中心网络结构的属性，以及一个分而治之的综合过程，该过程利用策略关系的结构。我们制作了Genesis的原型，并在实际拓扑上进行了各种工作负载的实验，以证明其性能。
Operators in multi-tenant cloud datacenters require support for diverse and complex end-to-end policies, such as, reachability, middlebox traversals, isolation, traffic engineering, and network resource management. We present Genesis, a datacenter network management system which allows policies to be specified in a declarative manner without explicitly programming the network data plane. Genesis tackles the problem of enforcing policies by synthesizing switch forwarding tables. It uses the formal foundations of constraint solving in combination with fast off-the-shelf SMT solvers. To improve synthesis performance, Genesis incorporates a novel search strategy that uses regular expressions to specify properties that leverage the structure of datacenter networks, and a divide-and-conquer synthesis procedure which exploits the structure of policy relationships. We have prototyped Genesis, and conducted experiments with a variety of workloads on real-world topologies to demonstrate its performance.