专利名称：SYSTEM AND METHOD FOR EFFICIENTLY
SEARCHING A FORWARDING DATABASETHAT IS SPLIT INTO A BOUNDED NUMBEROF SUB-DATABASES HAVING A BOUNDEDSIZE
发明人：VENKATACHARY, Srinivasan,GUPTA, Pankaj申请号：EP04758519.5申请日：20040326公开号：EP1611533A1公开日：20060104
摘要：A method, apparatus, and storage medium product are provided for forming aforwarding database, and for using the formed database to more efficiently and quicklyroute packets of data across a computer network. The forwarding database is arrangedinto multiple sub-databases. Each sub-database is pointed to by a pointer within a pointertable. When performing a longest-match search of incoming addresses, a longest prefixmatching algorithm can be used to find the longest match among specialized “spearprefixes” stored in the pointer table. After the longest spear prefixes are found, thepointer table will direct the next search within a sub-database pointed to by that spearprefix. Another longest-match search can be performed for database prefixes (or simply“prefixes”) within the sub-database selected by the pointer. Only the sub-database ofinterest will, therefore, be searched and all other sub-databases are not accessed. Usinga precursor pointer and a sub-database of optimally bounded size and number ensurespower consumption be confined only to the sub-database being accessed, and that
higher speed lookup operations can be achieved since only the sub-database of interestis being searched.
申请人：CYPRESS SEMICONDUCTOR CORP.
地址：3901 North First Street San Jose, CA 95134 US
国籍：US
代理机构：Lohr, Georg
更多信息请下载全文后查看
因篇幅问题不能全部显示，请点此查看更多更全内容