前向网络中的有效环路检测和集合域中的原子表示
Efficient Loop Detection in Forwarding Networks and Representing Atoms in a Field of Sets
摘要:
在转发网络中检测环路的问题是已知的NP完全时,一般规则,如表达式的使用。然而,诸如Netplumber(Kazemian等人,NSDI'13)或Veriflow(Khurshid等人,NSDI'13)在具有数千条转发规则的网络中有效地解决了这个问题。在本文中,我们补充了这样的实验验证的实际算法的第一个可证明有效的算法的一般规则的背景下。我们的主要工具是一个规范表示的原子(即最小的非空集)的集合所产生的集合的字段。当两个集合的交集可以被有效地计算和表示时,该工具特别适合。在转发网络的情况下,每个转发规则与它匹配的分组报头集相关联。然后,原子对应于网络中具有相同行为的头部类。我们提出了一个原子计算的算法,并提供了第一个多项式时间算法的循环检测的类的数量(这可以是指数一般)。这与以前的方法形成对比,这些方法可以是指数的,即使在简单的情况下也是线性的。其次,我们引入了网络维度的概念,通过转发规则的重叠度来捕获。该度量的值在实践中似乎非常低,并且恒定的重叠度确保了头类别的多项式数量。因此,在具有恒定重叠度的转发网络中,转发环路检测是多项式的。
英文摘要:
The problem of detecting loops in a forwarding network is known to be NP-complete when general rules such as wildcard expressions are used. Yet, network analyzer tools such as Netplumber (Kazemian et al., NSDI'13) or Veriflow (Khurshid et al., NSDI'13) efficiently solve this problem in networks with thousands of forwarding rules. In this paper, we complement such experimental validation of practical heuristics with the first provably efficient algorithm in the context of general rules. Our main tool is a canonical representation of the atoms (i.e. the minimal non-empty sets) of the field of sets generated by a collection of sets. This tool is particularly suited when the intersection of two sets can be efficiently computed and represented. In the case of forwarding networks, each forwarding rule is associated with the set of packet headers it matches. The atoms then correspond to classes of headers with same behavior in the network. We propose an algorithm for atom computation and provide the first polynomial time algorithm for loop detection in terms of number of classes (which can be exponential in general). This contrasts with previous methods that can be exponential, even in simple cases with linear number of classes. Second, we introduce a notion of network dimension captured by the overlapping degree of forwarding rules. The values of this measure appear to be very low in practice and constant overlapping degree ensures polynomial number of header classes. Forwarding loop detection is thus polynomial in forwarding networks with constant overlapping degree.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。