Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Field |
|---|---|---|
2016 | arXiv: Networking and Internet Architecture | Polynomial,Generalization,Computer science,Algorithm,Computer network,Theoretical computer science,Distributed algorithm,Heuristics,Header,Routing table,Time complexity,Computation |
DocType | Volume | Citations |
Journal | abs/1601.07002 | 0 |
PageRank | References | Authors |
0.34 | 6 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yacine Boufkhad | 1 | 304 | 28.11 |
| Ricardo De La Paz | 2 | 0 | 0.34 |
| Leonardo Linguaglossa | 3 | 28 | 1.58 |
| Fabien Mathieu | 4 | 301 | 27.52 |
| Diego Perino | 5 | 740 | 50.54 |
| Laurent Viennot | 6 | 492 | 35.31 |