U.S. PATENT DOCUMENTS
6,353,873 Bl * 3/2002 Melchior 711/108
6,392,842 Bl * 5/2002 Boutaghou et al 360/236.6
6,522,632 Bl 2/2003 Waters etal.
6,563,823 Bl* 5/2003 Przygienda et al 370/392
6,611,832 Bl* 8/2003 van Lunteren 707/3
2002/0009076 Al 1/2002 Engbersen et al.
OTHER PUBLICATIONS
Berg, M. (1995) "Two- and Three-dimensional Point Location in Rectangular Sub-divisions" Journal of Algorithms. vol. 18, No. 2, pp. 256-277.
Chandranmenon, G. and Varghese, G. (1996) "Lrading Packet Headers for Packet Processing" IEEE Transactions on Networking, vol. 4, No. 2, pp. 141-152 (enclosed copy pages numbered 1-13). Cheung and McCanne. (1999) "Optimal Routing Lable Design for IP Address Lookups under Memory Constraints," IEEEINFOCOM. pp. 1437-1444.
Degermark, M. et al. "Small Forwarding Tables for Fast Routing
Lookups" ACMSIGCOMMProceedings ofthe ACMSIGCOMM'97
Conference on Applications, technologies, architectures, and proto-
cols for computer communication, pp. 3-14.
Doeringer, W. et al. (1996) "Routing on Longest-matching Prefixes"
IEEE/ACM Transactions on Networking, vol. 4, No. 1, pp. 86-97.
Ergun, F. et al. (2001) "A Dynamic Lookup Scheme for Bursty
Access Patterns" IEEE INFOCOM. pp. 1-10.
Gupta, P. and N. McKeown. (2000) "Dynamic Algorithms with
Worst-case Performance for Packet Classification." IFIP Network-
ing, pp. 528-539.
Hari, A. et al. (2000) "Detecting and Resolving Packet Filter Conflicts" IEEE INFOCOM. pp. 1203-1212.
Lampson, B. et al. (1998) "IP Lookup using Multi-way and Multicolumn Search" IEEE INFOCOM Transactions on Networking, vol. 7, No. 3, pp. 324-334.
Macian, C. and R. Finfhammer. (2001) "An Evaluation to the Key Design Criteria to Achieve High Update Rates in Packet Classifiers" IEEE Network. Nov./Dec, pp. 24-29 (enclosed copy pages numbered 1-10).
McAuley, A. and P. Francis.(1993) "Fast Routing Table Lookups Using CAMs" IEEE INFOCOM. vol. 3 Mar./Apr., pp. 1382-1391. McCreight, E. (1985). "Priority Search Trees" SIAMJr. on Computing, vol. 14, No. 1, pp. 257-276.
Newman, P. et al. (Jan. 1997) "IP Switching and Gigabit Routers" IEEE Broadband Communications Magazine, vol. 35, pp. 64-69 (enclosed copy pages numbered 1-8).
S. Nilsson and G. Karlsson (1998) "Fast Address Look-up for Internet Routers" Proceedings ofIEEE Broadband Communications. (enclosed copy pages numbered 9-18).
Ruiz-Sanchez, M. etal. (2001) "Survey and Taxonomy of IP Address Lookup Algorithms" IEEE Network, Mar./Apr., vol. 15, No. 2, pp. 8-23.
S. Sahni and K. Kim. "Data Structures of IP Lookup with Bursty Access Patterns", www.cise.ufl.edu/~sahni. (enclosed copy pages numbered 1-5).
S. Sahni and K. Kim. (2001) "Efficient Construction of Fixed-Stride Multibit Tries for IP Lookup" Proceedings 5th IEEE Workshop on Future Trends of Distributed Computing Systems, pp. 178-184 (enclosed copy pages numbered 1-7).
S. Sahni and K. Kim. (2002) "Efficient Construction of VariableStride Multibit Tries for IP Lookup." Proceedings IEEE Symposium on Applications and the Internet (SAINT), pp. 220-229 (enclosed copy pages numbered 1-8).
S. Sahni and K. Kim. (2002) "0(log n) Dynamic Packet Routing." 7th IEEE Symposium on computers and communications. S. Sahni and K. Kim, H. Lu. (May 2002) "Data structures for onedimensional packet classification using most-specific-rule matching." International Symposium on Parallel Architectures, Algorithms, and Networks (ISPAN). pp. 3-14 (enclosed copy pages numbered 1-12).
K. Sklower. (1991) "A tree-based routing table for Berkeley Unix." Proceedings of 1991 Winter USENIX Conference, pp. 93-99 (enclosed copy pages numbered 1-4).
V. Srinivasan and G. Varghese. (1999) "Faster IP lookups using controlled prefix expansion." ACM Transactions on Computer Systems, vol. 17, issue 1, pp. 1-40 (enclosed copy pages No. 1-21). Suri, S., G. Varghese, and P. Warkhede (2001) "Multiway range trees: Scalable IP lookup with fast updates." Proceedings of Globecom '01. Waldvogel, Marcel et al. (1997) "Scalable High Speed IP Routing Lookups." Proceedings of the ACM SIGCOMM '91 Conference on Applications, technologies, architectures, and protocols for computer communication, pp. 25-36 (enclosed copy pages numbered 1-12).
* cited by examiner
