## Internet Packet Filter Management and Rectangle Geometry (2001)

Citations: | 69 - 1 self |

### BibTeX

@INPROCEEDINGS{Eppstein01internetpacket,

author = {David Eppstein and S. Muthukrishnan},

title = {Internet Packet Filter Management and Rectangle Geometry},

booktitle = {},

year = {2001},

pages = {827--835}

}

### Years of Citing Articles

### OpenURL

### Abstract

We consider rule sets for internet packet routing and filtering, where each rule consists of a range of source addresses, a range of destination addresses, a priority, and an action. A given packet should be handled by the action from the maximum priority rule that matches its source and destination. We describe new data structures for quickly finding the rule matching an incoming packet, in near-linear space, and a new algorithm for determining whether a rule set contains any conflicts, in time O(n 3/2 ). 1 Introduction The working of the current Internet and its posited evolution depend on efficient packet filtering mechanisms: databases of rules, maintained at various parts of the network, which use patterns to filter out sets of IP packets and specify actions to be performed on those sets. Typical filter patterns are based on packet header information such as the source or destination IP addresses. The actions to be performed depend on where the packet filtering is performed i...

### Citations

2447 | The Design and Analysis of Computer Algorithms - Aho, Hopcroft, et al. - 1974 |

1124 |
Multidimensional binary search trees used for associative searching
- Bentley
- 1975
(Show Context)
Citation Context ...ter conflict detection problem uses a technique related to an algorithm by Overmars and Yap [11] for Klee’s measure problem (determining the volume of a union of rectangular blocks): we use a kD-tree =-=[5]-=- to divide the plane into rectangular cells, not containing any rectangle vertex, so that the rectangles intersecting any cell form stripes (i.e., rectangles that are unbounded in one dimension). The ... |

148 |
A linear-time algorithm for a special case of disjoint set union
- Gabow, Tarjan
- 1985
(Show Context)
Citation Context ...es of the contracted graph. Since the contractions will be performed along the edges of a fixed tree (namely, the given path), we can use the linear-time union-find data structure of Gabow and Tarjan =-=[9]-=- or its recent simplification by Alstrup et al. [3]. Our algorithm, then, simply performs the following steps for each edge (u, v), in sorted order by edge weight: for each uncontracted edge (x, y) re... |

127 | Router plugins: a software architecture for next-generation routers
- DECASPER, DITTIA, et al.
(Show Context)
Citation Context ...ise quite naturally, and the task of the administrator is to resolve them appropriately. The work in [1] was motivated by this scenario. However, conflict detection helps in auditing filter databases =-=[6]-=- in general for ambiguities in routing, unfulfilled service guarantees etc., that is, in general where packet filter mechanism is employed. It is straightforward to solve this problem in O(n2 log n) t... |

107 | Trade-offs for Packet Classification
- Feldmann, Muthukrishnan
(Show Context)
Citation Context ...ult. The packet classification problem has been extensively studied with over a dozen papers in the premier networking conferences (INFOCOM and SIGCOMM) in the past few years (e.g., see references in =-=[7]-=-). Classification time is of paramount importance (for example, for backbone routers, filtering IP packets has to be done at the speed at which it forwards the packets, a blistering speed!). However, ... |

87 |
Applications of path compression on balanced trees
- Tarjan
(Show Context)
Citation Context ...n-MST edge can be found in linear time [10], the fastest known algorithm for finding the best replacement for each MST edge (without the integer restriction) remains Tarjan’s slightly superlinear one =-=[12]-=-. LEMMA 3.1. The three problems described above can be solved in linear time. Proof. We consider the minimum spanning tree verification formulation of the problem, and consider the non-tree edges in s... |

62 | Optimal bounds for the predecessor problem
- Beame, Fich
- 1999
(Show Context)
Citation Context ...l containing q has as its left endpoint the predecessor of q. Thus, we can use a static version of the data structure described in Theorem 2.1 (with k = log x) to solve this problem. ✷ Beame and Fich =-=[4]-=- provide matching Θ(log log n/ log log log n) upper and lower bounds for integer predecessor queries in polynomial space, and survey several previous results on the problem. Because of the reduction a... |

47 | New upper bounds in Klee’s measure problem
- Overmars, Yap
- 1991
(Show Context)
Citation Context ...ional problem using a data structure combining ideas from B-trees and segment trees. Our approach to the filter conflict detection problem uses a technique related to an algorithm by Overmars and Yap =-=[11]-=- for Klee’s measure problem (determining the volume of a union of rectangular blocks): we use a kD-tree [5] to divide the plane into rectangular cells, not containing any rectangle vertex, so that the... |

37 | A simpler minimum spanning tree verification algorithm
- King
- 1997
(Show Context)
Citation Context ...ueue problem, however their problem involves delete-minimum operations rather than deletions of particular values. Although the best replacement edge for each non-MST edge can be found in linear time =-=[10]-=-, the fastest known algorithm for finding the best replacement for each MST edge (without the integer restriction) remains Tarjan’s slightly superlinear one [12]. LEMMA 3.1. The three problems describ... |

22 |
Detecting and resolving packet filter conflicts
- Adiseshu, Suri, et al.
- 2000
(Show Context)
Citation Context ...ore, our result is easily implementable; hence, it additionally holds promise as a practical packet classification solution. The filter conflict detection problem has received attention only recently =-=[1]-=-. That work was primarily motivated by detecting security holes in firewalls. Filter databases in firewalls get modified by systems administrators manually or automatically (for example, when a host f... |

14 | Multi-method dispatching: A geometric approach with applications to string matching problems
- Ferragina, Muthukrishnan, et al.
- 1999
(Show Context)
Citation Context ...ith the exception of [7], known algorithms for d = 2 fail to meet this bound. Our algorithmic result here meets this bound, but uses only O(n1+o(1) ) space improving upon the Θ(n1+ǫ ) space needed by =-=[7, 8]-=- which is the previously best known result. Furthermore, our result is easily implementable; hence, it additionally holds promise as a practical packet classification solution. The filter conflict det... |

9 | Optimal on-line decremental connectivity in trees
- Alstrup, Secher, et al.
- 1997
(Show Context)
Citation Context ...will be performed along the edges of a fixed tree (namely, the given path), we can use the linear-time union-find data structure of Gabow and Tarjan [9] or its recent simplification by Alstrup et al. =-=[3]-=-. Our algorithm, then, simply performs the following steps for each edge (u, v), in sorted order by edge weight: for each uncontracted edge (x, y) remaining in the path between u and v, set that edge’... |