Exploiting Order Independence for Scalable and Expressive Packet Classification

Kogan, Kirill; Nikolenko, Sergey I.; Rottenstreich, Ori; Culhane, William; Eugster, Patrick

doi:10.1109/tnet.2015.2407831

Cited by 33 publications

(6 citation statements)

References 59 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…TCAM memory can efficiently represent prefix rules, but range rules only with difficulty. Recent works propose methods to handle efficiently range rules by identifying classifier properties [21,16]. Note that our hardness results (NP-completeness) extend to more expressive aggregation rules.…”

Section: Introductionmentioning

confidence: 77%

On the Complexity of Compressing Two Dimensional Routing Tables with Order

2016

View full text Add to dashboard Cite

Motivated by routing in telecommunication network using Software Defined Network (SDN) technologies, we consider the following problem of finding short routing lists using aggregation rules. We are given a set of communications X , which are distinct pairs (s, t) ⊆ S × T , (typically S is the set of sources and T the set of destinations), and a port function π : X → P where P is the set of ports. A routing list R is an ordered list of triples which are of the form (s, t, p), (* , t, p), (s, * , p) or (* , * , p) with s ∈ S, t ∈ T and p ∈ P. It routes the communication (s, t) to the port r(s, t) = p which appears on the first triple in the list R that is of the form (s, t, p), (* , t, p), (s, * , p) or (* , * , p). If r(s, t) = π(s, t), then we say that (s, t) is properly routed by R and if all communications of X are properly routed, we say that R emulates (X , π). The aim is to find a shortest routing list emulating (X , π). In this paper, we carry out a study of the complexity of the two dual decision problems associated to it. Given a set of communication X , a port function π and an integer k, the

show abstract

Section: Introductionmentioning

confidence: 77%

On the Complexity of Compressing Two Dimensional Routing Tables with Order

2016

View full text Add to dashboard Cite

show abstract

“…The increasing FIB size problem has received much attention recently, and many approaches have been explored to represent FIBs more efficiently [11], [12] or cache FIB entries on cheaper memory [2], leveraging Zipf's law [25]. FIB aggregation is a well-known technique to mitigate router memory consumption, and accordingly, it has been studied intensively and in different contexts.…”

Section: B Related Workmentioning

confidence: 99%

Online Aggregation of the Forwarding Information Base: Accounting for Locality and Churn

Bieńkowski

Sarrar

Schmid

et al. 2018

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

This paper studies the problem of compressing the Forwarding Information Base (FIB), but taking a wider perspective. Indeed, FIB compression goes beyond sheer compression, as the gain in memory use obtained from the compression has consequences on the updates that will have to be applied to the compressed FIB. We are interested in the situation where forwarding rules can change over time, e.g., due to BGP route updates. Accordingly, we frame FIB compression as an online problem, and design competitive online algorithms to solve it. In contrast to prior work which mostly focused on static optimizations, we study an online variant of the problem where routes can change over time, and where the number of updates to the FIB are taken into account explicitly. The reason to consider this version of the problem is that leveraging temporal locality while accounting for the number of FIB updates helps to keep routers CPU load low and reduces the number of FIB updates to be transferred, e.g., from the network-attached Software-Defined Network (SDN) controller to a remote switch. This paper introduces a formal model which is an interesting generalization of several classic online aggregation problems. Our main contribution is an O(w)-competitive algorithm, where w is the length of an IP address. We also derive a lower bound which shows that our result is asymptotically optimal within a natural class of algorithms, based on so-called sticks.

show abstract

“…Several groups considered representations based on rule disjointness [16,17,34] and addressed efficient time-space tradeoffs for multi-field classification, where fields are represented by ranges. In these works, they assign all rules into multiple disjoint groups, where every group obeys a structural property on a subset of bit indices of a rule.…”

Section: :19mentioning

confidence: 99%

“…In general networking applications, packet classification typically includes bit-wise matching of a key against a predefined rule set [13,[15][16][17]42]. The key is typically a subset of packet header fields, but might also include other meta-data derived from the packet header.…”

Section: Introductionmentioning

confidence: 99%

GenMatcher

Wang

McHale

Gratz

et al. 2018

ACM Trans. Archit. Code Optim.

View full text Add to dashboard Cite

Packet classification methods rely upon packet content/header matching against rules. Thus, throughput of matching operations is critical in many networking applications. Further, with the advent of Software Defined Networking (SDN), efficient implementation of software approaches to matching are critical for the overall system performance. This article presents 1 GenMatcher, a generic, software-only, arbitrary matching framework for fast, efficient searches. The key idea of our approach is to represent arbitrary rules with efficient prefix-based tries. To support arbitrary wildcards, we rearrange bits within the rules such that wildcards accumulate to one side of the bitstring. Since many non-contiguous wildcards often remain, we use multiple prefix-based tries. The main challenge in this context is to generate efficient trie groupings and expansions to support all arbitrary rules. Finding an optimal mix of grouping and expansion is an NP-complete problem. Our contribution includes a novel, clustering-based grouping algorithm to group rules based upon their bit-level similarities. Our algorithm generates near-optimal trie groupings with low configuration times and provides significantly higher match throughput compared to prior techniques. Experiments with synthetic traffic show that our method can achieve a 58.9X speedup compared to the baseline on a single core processor under a given memory constraint.

show abstract

Exploiting Order Independence for Scalable and Expressive Packet Classification

Cited by 33 publications

References 59 publications

On the Complexity of Compressing Two Dimensional Routing Tables with Order

On the Complexity of Compressing Two Dimensional Routing Tables with Order

Online Aggregation of the Forwarding Information Base: Accounting for Locality and Churn

GenMatcher

Contact Info

Product

Resources

About