Internet Packet Filter Management and Rectangle Geometry
| dc.creator | Eppstein, David | |
| dc.creator | Muthukrishnan, S. | |
| dc.date | 2000-10-11 | |
| dc.date.accessioned | 2026-07-07T03:16:37Z | |
| dc.date.available | 2026-07-07T03:16:37Z | |
| dc.description | 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}). | |
| dc.description | 9 pages, 2 figures. To appear at 12th ACM/SIAM Symp. Discrete Algorithms (SODA 2001) | |
| dc.identifier | https://arxiv.org/abs/cs/0010018 | |
| dc.identifier | http://arxiv.org/abs/cs/0010018 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30421 | |
| dc.subject | Computational Geometry | |
| dc.subject | Networking and Internet Architecture | |
| dc.subject | F.2.2 | |
| dc.title | Internet Packet Filter Management and Rectangle Geometry | |
| dc.type | text |