High-speed lookup method and high-speed lookup apparatus

作者: Tetsumei Tsuruoka

DOI:

关键词:

摘要: Entries which become lookup objects and have variable length comparison conditions are divided into a plurality of groups, representative key is taken as data for each group, mask that sets range matching with match candidate, well object data, stored in masked memory so setting can be made the entries. Information corresponding to groups obtained from memory, entries limited within group. Further, entries, objects, classified tree state, nodes adopted at points where bit values either “0” or “1”, order first bit, entry performed after groups.

参考文章(9)
Anthony J. McAuley, Daniel V. Wilson, Paul F. Tsuchiya, Fast multilevel hierarchical routing table lookup using content addressable memory ,(1993)
Marcel Waldvogel, George Varghese, Jon Turner, Bernhard Plattner, Scalable high speed IP routing lookups acm special interest group on data communication. ,vol. 27, pp. 25- 36 ,(1997) , 10.1145/263105.263136
宏泰 水野, Hiroyasu Mizuno, Associative memory retrieval system ,(1996)