专利名称：System and method for efficiently searching
a forwarding database that is split into abounded number of sub-databases having abounded size
发明人：Srinivasan Venkatachary,Pankaj Gupta申请号：US10402887申请日：20030328公开号：US07426518B2公开日：20080916
专利附图：
摘要：A method, apparatus, and storage medium product are provided for forming a
forwarding 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 thathigher speed lookup operations can be achieved since only the sub-database of interestis being searched.
申请人：Srinivasan Venkatachary,Pankaj Gupta
地址：Sunnyvale CA US,Mountain View CA US
国籍：US,US
代理机构：Shemwell Mahamedi LLP
更多信息请下载全文后查看
因篇幅问题不能全部显示，请点此查看更多更全内容