点击次数：

发表时间：2014-01-01

发表刊物：哈尔滨工程大学学报

所属单位：电子信息与电气工程学部

期号：10

页面范围：1247-1252

ISSN号：1006-7043

摘要：To solve the problem of the longest prefix matching in IP routing lookups, a fast IP routing lookup meth?od based on Bloom filters was proposed. A first?byte indexing table was established to reduce the number of Bloom filters to be queried in parallel. The number of Bloom filters was optimized based on the non?uniform distribution of the prefix lengths of IP addresses, so that the number of Bloom filters required in IP lookups was reduced. The up?date of routing tables was supported by associating a counter with each bit in the bit vectors of the basic Bloom fil?ters. The theoretical analysis showed the proposed method is more efficient than the existing methods with less aver?aged number of times to probe into the route selection tables, and lowers its upper bound under the worst circum?stances. Experimental results validated the efficacy of the proposed method and proved the accuracy of the perform?ance analysis.

备注：新增回溯数据