U.S. application No. 08/933,477, Douceur et al, filed Sep. 18, 1997. |
Aho et al., "Chapter 3--Trees", Data Structures and Algorithms, (.COPYRGT. 1983, Addison-Wesley Publishing Company, Inc.), pp. 75-106. |
Bailey et al., "Pathfinder: A Pattern-Based Packet Classifier", Proceedings of the First Symposium on Operating Systems Design and Implementation (OSDI) USENIX Association, Nov. 14-17, 1994, pp. 115-123. |
Bell et al., "Longest-match String Searching for Ziv-Lempel Compression", Software-Practice and Experience, vol. 23, No. 7, Jul. 1993, pp. 757-771. |
Devroye, "A Note on the Probabilistic Analysis of Patricia Trees", Random Structures and Algorithms, vol. 3, no. 2, 1992, pp. 203-214. |
Doeringer et al., "Routing on Longest-Matching Prefixes", IEEE/ACM Transactions on Networking, vol. 4, No. 1, Feb. 1996, pp. 86-97. |
Knuth, The Art of Computer Programming, vol. 3--Sorting and Searching, (.COPYRGT. 1973, Addison-Wesley Publishing Company, Inc.), pp. 490-499. |
McCanne et al., "The BSD Packet Filter: A New Architecture for User-level Packet Capture", Proceedings of the 1993 Winter USENIX Conference, San Diego, California, Jan. 25-29, 1993, pp. 259-269. |
Merrett et al., "Dynamic Patricia", Proceedings of the International Conference on Foundations of Data Organization, 1985, pp. 19-29. |
Mogul et al., "The Packet Filter: An Efficient Mechanism for User-level Network Code", Operating Systems Review, vol. 21, No. 5, 1987, pp. 39-51. |
Morrison, "PATRICIA--Practical Algorithm to Retrieve Information Coded in Alphanumeric", Journal of the Association for Computing Machinery, vol. 15, No. 4, Oct. 1968, pp. 514-534. |
Wu et al., "Fast Text Searching Allowing Errors", Communications of the ACM, vol. 35, No. 10, Oct. 1992, pp. 83-91. |
Wu et al., "AGREP--A Fast Approximate Pattern-Matching Tool", Proceedings of the Winter 1992 USENIX Conference, San Francisco, California, Jan. 20-24, 1992, pp. 153-162. |
Yuhara et al., "Efficient Packet Demultiplexing for Multiple Endpoints and Large Messages", USENIX--1994 Winter, San Francisco, California, Jan. 17-21, 1994, pp. 153-165. |
Zobel et al., "Finding Approximate Matches in Large Lexicons", Software--Practice and Experience, vol. 25, No. 3, Mar. 1995, pp. 331-345. |