Conflict detection and resolution in two-dimensional prefix router tables

IEEE/ACM Transactions on Networking

Volumn 13, Issue 6, 2005, Pages 1353-1363

  Lu, Haibin ^a   Sahni, Sartaj ^b  

^a University of Missouri   (United States)

^b UNIVERSITY OF FLORIDA   (United States)

Author keywords

Filter conflict; Packet classification; Two dimensional prefix filters

Indexed keywords

ALGORITHMS; INTERNET; PACKET NETWORKS; SET THEORY; SIGNAL FILTERING AND PREDICTION; TWO DIMENSIONAL; VECTORS;

FILTER CONFLICT; PACKET CLASSIFICATION; TWO-DIMENTIONAL PREFIX FILTERS;

ROUTERS;

EID: 29844447197     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2005.860108     Document Type: Article

References (18)

1. F. Baboescu and G. Varghese, "Scalable packet classification," presented at the ACM SIGCOMM, San Diego, CA, Aug. 2001.
2. F. Baboescu and G. Varghese, "Fast and scalable conflict detection for packet classifiers," in Proc. 10th IEEE Int. Conf. Network Protocols (ICNP'02), 2002, pp. 270-279.
3. F. Baboescu, S. Singh, and G. Varghese, "Packet classification for core routers: Is there an alternative to CAMs?," in Proc. IEEE INFOCOM, 2003, pp. 53-63.
4. J. L. Bentley and T. A. Ottmann, "Algorithms for reporting and counting geometric intersections," IEEE Trans. Computers, vol. C-28, no. 9, pp. 643-647, Sep. 1979.
5. M. Buddhikot, S. Suri, and M. Waldvogel, "Space decomposition techniques for fast layer-4 switching," in Proc. IFIP Workshop on Protocols for High Speed Networks, Salem, MA, 1999, pp. 25-41.
6. D. Eppstein and S. Muthukrishnan, "Internet packet filter management and rectangle geometry," in Proc. 12th ACM/SIAM Symp. Discrete Algorithms, 2001, pp. 827-835.
7. A. Feldman and S. Muthukrishnan, "Tradeoffs for packet classification," in Proc. IEEE INFOCOM, 2000, pp. 1193-1202.
8. P. Gupta and N. McKeown, "Packet classification using hierarchical intelligent cuts," presented at the ACM SIGCOMM, Cambridge, MA, 1999.
9. A. Hari, S. Suri, and G. Parulkar, "Detecting and resolving packet filter conflicts," in Proc. IEEE INFOCOM, 2000, pp. 1203-1212.
10. E. Horowitz, S. Sahni, and S. Rajasekeran, Computer Algorithms/C++, New York: W. H. Freeman, 1997.
11. T. Lakshman and D. Stidialis, "High speed policy-based packet forwarding using efficient multi-dimensional range matching," presented at the ACM SIGCOMM, Vancouver, BC, Canada, 1998.
12. L. Qiu, G. Varghese, and S. Suri, "Fast firewall implementation for software and hardware based routers," in Proc. 9th Int. Conf. Network Protocols (ICNP), 2001, pp. 344-345.
13. M. Ruiz-Sanchez, E. Biersack, and W. Dabbous, "Survey and taxonomy of EP address lookup algorithms," IEEE Network, vol. 15, no. 2, pp. 8-23, Mar./Apr. 2001.
14. S. Sahni, K. Kim, and H. Lu, "Data structures for 1-D packet classification using most-specific-rule matching," Int. J. Foundations Comput. Sci., vol. 14, no. 3, pp. 337-358, 2003.
15. V. Srinivasan, S. Suri, and G. Varghese, "Packet classification using tuple space search," presented at the ACM SIGCOMM, Cambridge, MA, 1999.
16. V. Srinivasan, "A packet classification and filter management system," in Proc. IEEE INFOCOM, 2001, pp. 1464-1473.
17. C. W. Mortensen, "Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time," in Proc. 14th Annu. ACM/SIAM Symp. Discrete Algorithms (SODA), 2003, pp. 618-627.
18. C. Kaufman, R. Perlman, and M. Speciner, Network Security: Private Communication in a Public World, 2nd ed. Englewood Cliffs, NJ: Prentice Hall, 2002, ch. 17.