Dynamic rectangular intersection with priorities

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 639-648

  Kaplan, Haim ^a   Molad, Eyal ^a   Tarjan, Robert E ^b,c  

^a TEL AVIV UNIVERSITY   (Israel)

^b Princeton University   (United States)

^c HEWLETT PACKARD COMPANY   (United States)

Author keywords

Orthogonal range searching; Packet classification; Rectangular intersection; Rectangular point location

Indexed keywords

NETWORK PROTOCOLS; QUERY LANGUAGES; ROUTERS; TREES (MATHEMATICS);

PACKET CLASSIFICATION;

DATA STRUCTURES;

EID: 0038446818     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780542.780635     Document Type: Conference Paper

References (15)

1. S. W. Bent, D. D. Sleator, and R. E. Tarjan. Biased search trees. SIAM J. Comput., 14(3):545-568, 1985.
2. M. Buddhikot, S Suri, and M Waldvogel. Space decomposition techniques for fast Layer-4 switching. In Protocols for High Speed Networks IV, pages 25-41, 1999.
3. H. Edelsbrunner. A new approach to rectangle intersection, part I. Int. J. Computer Mathematics, 13:209-219, 1983.
4. A. Feldmann and S. Muthukrishnan. Tradeoffs for packet classification. In INFOCOM, pages 1193-1202, 2000.
5. P. Gupta and N. McKeown. Dynamic algorithms with worst-case performance for packet classification. In IFIP Networking, pages 528-539, 2000.
6. P. Gupta and N. McKeown. Algorithms for packet classification. IEEE Network, 15(2):24-32, 2001.
7. K. Mehlhorn. Data structures and algorithms, Volume 1; Sorting and Searching. Springer-Verlag, Berlin, 1984.
8. K. Mehlhorn. Data structures and algorithms, Volume 3: Multi-dimensional Searching and Computational Geometry. Springer-Verlag, Berlin, 1984.
9. J. Nievergelt and E. M. Reingold. Binary search trees of bounded balance. SIAM J. Comput., 2(1):33-43, 1973.
10. S. Sahni and K. Kim. O(log n) dynamic packet routing. IEEE Symposium on Computers and Communications, pages 443-448, 2002.
11. S. Sahni, K. Kim, and H. Lu. Data structures for one-dimensional packet classification using most specific rule matching. ISPAN, pages 3-14, 2002.
12. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32:652-686, 1985.
13. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. JCSS, 26(3):362-391, 1983.
14. R. E. Tarjan. A class of algorithms which require non-linear time to maintain disjoint sets. JCSS, 18(2):110-127, 1979.
15. D. E. Willard and G. S. Lueker. Adding range restriction capability to dynamic data structures. Journal of the ACM, 32(3):597-617, 1985.