arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1601.07002cs.NI
收藏

通过代表性标头集进行转发表验证

Forwarding Tables Verification through Representative Header Sets

Yacine Boufkhad, Ricardo De La Paz, Leonardo Linguaglossa, Fabien Mathieu, Diego Perino, Laurent Viennot

摘要:

转发表验证包括检查由网络的转发表产生的分布式数据结构。一个经典的问题是循环的检测。我们在软件定义网络(SDN)的上下文中研究这个问题,其中转发规则可以是任意位掩码(概括前缀匹配),并且表由集中式控制器更新。基本的验证问题,如循环检测是NP难的,大多数以前的工作解决了他们的算法或SAT求解器。我们遵循一种不同的方法,基于计算头部类的表示,即匹配相同规则的头部集合。这种表示包括在代表性的头部集合的集合中,每个类至少一个,并且可以在时间上集中计算,这在类的数量上是多项式的。经典的验证任务可以通过检查每个代表性的头集来解决。通常,报头类的数量可以随着报头长度呈指数增加,但是在规则由预定义字段构成的实际情况下,其在规则的数量上保持多项式,其中在每个字段中应用精确的前缀匹配或范围匹配(例如,IP/MAC地址、TCP/UDP端口)。我们提出了一般的技术,工作在多项式时间,只要标题类的数量是多项式的,并没有作出具体的假设与规则相关联的集的结构。我们的方法的效率依赖于这样一个事实,即表示规则的数据结构允许有效的计算交集,基数和包含。最后,我们提出了一种算法来保持这样的表示存在的更新(即,规则插入/更新/删除)。我们还提供了一个本地分布式算法检查黑洞的存在和证明标签计划本地检查循环的存在。

英文摘要:

Forwarding table verification consists in checking the distributed data-structure resulting from the forwarding tables of a network. A classical concern is the detection of loops. We study this problem in the context of software-defined networking (SDN) where forwarding rules can be arbitrary bitmasks (generalizing prefix matching) and where tables are updated by a centralized controller. Basic verification problems such as loop detection are NP-hard and most previous work solves them with heuristics or SAT solvers. We follow a different approach based on computing a representation of the header classes, i.e. the sets of headers that match the same rules. This representation consists in a collection of representative header sets, at least one for each class, and can be computed centrally in time which is polynomial in the number of classes. Classical verification tasks can then be trivially solved by checking each representative header set. In general, the number of header classes can increase exponentially with header length, but it remains polynomial in the number of rules in the practical case where rules are constituted with predefined fields where exact, prefix matching or range matching is applied in each field (e.g., IP/MAC addresses, TCP/UDP ports). We propose general techniques that work in polynomial time as long as the number of classes of headers is polynomial and that do not make specific assumptions about the structure of the sets associated to rules. The efficiency of our method rely on the fact that the data-structure representing rules allows efficient computation of intersection, cardinal and inclusion. Finally, we propose an algorithm to maintain such representation in presence of updates (i.e., rule insert/update/removal). We also provide a local distributed algorithm for checking the absence of black-holes and a proof labeling scheme for locally checking the absence of loops.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑