 IBM, Intel, and Motorola. Refer to the corresponding chapters that cover each company's approach. Data sheets and application notes are available directly from all these companies. Besides numerous tutorials on networking technology, www.lightreading.com offers an impressive array of documented testing of various types of network equipment. The associated discussion of both the methodology used each time and the results of each individual benchmark test can provide insight into what levels of performance are expected to typically qualify by the industry as acceptable. The following are other important references on lookup and classification: P. Gupta, S. Lin, and N. McKeown, "Routing Lookups in Hardware at Memory Access Speeds," Infocom 3 (1998): 1241-1248. P. Gupta, B. Prabhakar, and S. Boyd, "Near-Optimal Routing Lookups with Bounded Worst Case Performance," Infocom 3 (March 2000): 1184-1192. Downloaded from Digital Engineering Library @ McGraw-Hill (www.digitalengineeringlibrary.com) Copyright © 2004 The McGraw-Hill Companies. All rights reserved. Any use is subject to the Terms of Use as given at the website. CLASSIFICATION PROCESSORS CLASSIFICATION PROCESSORS 261 B. Lampson, V. Srinivasan, and G. Varghese, "IP Lookups Using Multiway and Multicolumn Search," Infocom 3 (1998): 1248-1256. S. Nilsson and G. Karlsson, "Fast Address Lookup for Internet Routers," IFIP International Conference on Broadband Communications, Stuttgart, Germany, April 1-3, 1998. V. Srinivasan, S. Suri, and G. Varghese, "Packet Classification Using Tuple Space Search," Proceedings of ACM Sigcomm 1999 (September 1999): 135-146. The Tandem Repeat Occurrence Locator (TROLL) algorithm is based on an Aho-Corasick variation. See http://capb.dbi.udel.edu/main/slides/adalberto-4p/sld001.htm. Another interesting site on the same subject is http://finder.sourceforge.net/main.html. T. Woo, "A Modular Approach to Packet Classification: Algorithms and Results," Infocom (2000). An interesting article discussing the way of connecting a search and clas