Fast prefix matching of bounded strings

ACM Journal of Experimental Algorithmics

Volumn 8, Issue , 2003, Pages

  Buchsbaum, Adam L ^a   Fowler, Glenn S ^a   Krishnamurthy, Balachander ^a   Vo, Kiem Phong ^a   Wang, Jia ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

Algorithms; D.2.8 software engineering : metrics performance measures; E.1 data structures : arrays; E.2 data storage representations : linked representations; Experimentation; F.2.2 analysis of algorithms and problem complexity : nonnumerical algorithms and problems pattern matching; IP routing; Measurement; Performance; Prefix matching; Records; Table look up; Theory; Tries

Indexed keywords

EID: 24944553891     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/996546.996550     Document Type: Article

References (36)

1. AMIR, A., FARACH, M., IDURY, R. M., POUTRÉ, J. A. L., AND SCHÄFFER, A. A. 1995. Improved dynamic dictionary matching. Inf. Comp. 119, 2, 258-282.
2. ARNOLD, K. C. R. C. 1977. Screen Updating and Cursor Movement Optimization: A Library Package. 4.2BSD UNIX Programmer's Manual.
3. BLUM, A., LI, M., TROMP, J., AND YANNAKAKIS, M. 1994. Linear approximation of shortest superstrings. J. ACM 41, 4, 630-647.
4. BRESLAUER, D. 1995. Fast parallel string prefix-matching. Theor. Comput. Sci. 137, 2, 268-278.
5. BRESLAUER, D., COLUSSI, L., AND TONIOLO, L. 1998. On the comparison complexity of the string prefix-matching problem. J. Alg. 29, 1, 18-67.
6. CHEN, Y.-F., DOUGLIS, F., HUANG, H., AND VO, K.-P. 2000. TopBlend: An efficient implementation of HtmlDiff in Java. In Proc. 2000 World Conf. on the WWW and Internet. AACE, Norfolk, VA.
7. th Ann. Joint Conf. of the IEEE Computer and Communications Societies. Vol. 3. IEEE, Los Alamitos, CA, 1437-1444.
8. COVER, T. M. and THOMAS, J. A. 1991. Elements of Information Theory. John Wiley & Sons, New York.
9. th European Symp. on Algorithms. Lecture Notes in Computer Science, vol. 1643. Springer-Verlag, Berlin, 65-76.
10. DEGERMARK, M., BRODNIK, A., CARLSSON, S., AND PINK, S. 1997. Small forwarding tables for fast routing lookups. In Proc. ACM SIGCOMM '97. ACM, New York, 3-14.
11. DOERINGER, W., KARJOTH, G., AND NASSEHI, M. 1996. Routing on longest-matching prefixes. IEEE/ACM Trans. Network. 4, 1, 86-97. Erratum, 1997, 5, 1, 600.
12. th ACM-SIAM Symp. on Discrete Algorithms. SIAM, Philadelphia, 827-835.
13. th Ann. Joint Conf. of the IEEE Computer and Communications Societies. Vol. 3. IEEE, Los Alamitos, CA, 1444-1453.
14. th Ann. Joint Conf. of the IEEE Computer and Communications Societies. Vol. 3. IEEE, Los Alamitos, CA, 1193-1202.
15. th ACM Symp. on Theory of Computing. ACM, New York, 693-702.
16. FULLER, V., LI, T., YU, J., AND VARADHAN, K. 1993. Classless Inter-Domain Routing (CIDR): An Address Assignment and Aggregation Strategy. Internet Engineering Task Force (www.ietf.org). RFC 1519.
17. th Ann. Joint Conf. of the IEEE Computer and Communications Societies. Vol. 3. IEEE, Los Alamitos, CA, 1240-1247.
18. th Ann. Joint Conf. of the IEEE Computer and Communications Societies. Vol. 3. IEEE, Los Alamitos, CA, 1184-1192.
19. HIRSCHBERG, D. S. 1977. Algorithms for the longest common subsequence problem. J. ACM 24, 4, 664-675.
20. th Ann. Joint Conf. of the IEEE Computer and Communications Societies. Vol. 3. IEEE, Los Alamitos, CA, 1429-1436.
21. rd Symp. on Combinatorial Pattern Matching. Lecture Notes in Computer Science, vol. 644. Springer-Verlag, Berlin, 52-65.
22. KRISHNAMURTHY, B. AND WANG, J. 2000. On network-aware clustering of Web clients. In Proc. ACM SIGCOMM '00. ACM, New York, 97-110.
23. LAMPSON, B., SRINIVASAN, V., AND VARGHESE, G. 1999. IP lookups using multiway and multi-column search. IEEE/ACM Trans. Network. 7, 3, 324-334.
24. MCCREIGHT, E. M. 1976. A space-economical suffix tree construction algorithm. J. ACM 23, 2, 262-272.
25. MOESTEDT, A. AND SJÖDIN, P. 1998. IP address lookup in hardware for high-speed routing. In Proc. Hot Interconnects VI. IEEE, Los Alamitos, CA.
26. NILSSON, S. 2001. Personal communication.
27. NILSSON, S. AND KARLSSON, G. 1999. IP-address lookup using LC-tries. IEEE J. Sel. Areas Comm. 17, 6, 1083-1092.
28. PREPARATA, F. P. AND SHAMOS, M. I. 1988. Computational Geometry: An Introduction. Texts and Monographs in Computer Science. Springer-Verlag, Berlin.
29. SANKOFF, D. AND KRUSKAL, J. B. 1983. Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparisons. Addison Wesley, Reading, MA.
30. SKLOWER, K. 1991. A tree-based routing table for Berkeley UNIX. In Proc. USENIX Winter 1991 Technical Conf. USENIX, Berkeley, CA, 93-104.
31. SRINIVASAN, V. AND VARGHESE, G. 1999. Fast address lookup using controlled prefix expansion. ACM Trans. Comput. Syst. 17, 1, 1-40.
32. SRINIVASAN, V., VARGHESE, G., SURI, S., AND WALDVOGEL, M. 1998. Fast and scalable layer four switching. In Proc. ACM SIGCOMM '98. ACM, New York, 191-202.
33. th ACM-SIAM Symp. on Discrete Algorithms. SIAM, Philadelphia, 969-970.
34. Telstra Internet 2001. http://www.telstra.net/ops/bgptab.txt.
35. WALDVOGEL, M., VARGHESE, G., TURNER, J., AND PLATTNER, B. 2001. Scalable high speed prefix matching. ACM Trans. Comput. Syst. 19, 4, 440-482.
36. th Ann. Joint Conf. of the IEEE Computer and Communications Societies. Vol. 3. IEEE, Los Alamitos, CA, 1434-1443.