Method of and apparatus for matching strings of different lengths

作者: Paul Seungkyu Min , Nasser Yazdani

DOI:

关键词:

摘要: A method and apparatus is provided for comparing sorting data strings of different lengths, in a given character set, modifying the such that queries can be run using search trees. Three trees are provided, including: binary prefix tree two m_way structures, static dynamic tree. The may prefixes addresses TCP/IP protocols searching performed host address computer network. further provides transmitting packet information associated with network address. Additionally, switching packets layer 3 4 protocol sending to designated ports device provided. also provide differentiated service or protection, as firewall, based on classification information.

参考文章(22)
Stefan Nilsson, Gunnar Karlsson, Fast address look-up for internet routers BC '98 Proceedings of the IFIP TC6/WG6.2 Fourth International Conference on Broadband Communications: The future of telecommunications. ,vol. 121, pp. 11- 22 ,(1998) , 10.1007/978-0-387-35378-4_2
Jacob Ziv, Martin Cohn, Abraham Lempel, Willard L. Eastman, Apparatus and method for compressing data signals and restoring the compressed data signals ,(1981)
Willibald Doeringer, Mehdi Nassehi, Mohan Sharma, Douglas Dykeman, Gunter Karjoth, Variable length data sequence backtracking a trie structure ,(1994)
George Varghese, Hugh M. Wilkinson, Nigel T. Poole, Compressed prefix matching database searching ,(1990)
Bruce W. Ravenel, James F. McKevitt, William B. Pohlman, Stephen P. Morse, Extended address, single and multiple bit microprocessor ,(1981)
V. Srinivasan, G. Varghese, Fast address lookups using controlled prefix expansion ACM Transactions on Computer Systems. ,vol. 17, pp. 1- 40 ,(1999) , 10.1145/296502.296503
Tolga Bozkaya, Nasser Yazdani, Meral Özsoyoğlu, Matching and indexing sequences of different lengths conference on information and knowledge management. pp. 128- 135 ,(1997) , 10.1145/266714.266880