A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
A hash-based scalable IP lookup using Bloom and fingerprint filters
2009
2009 17th IEEE International Conference on Network Protocols
Several challenges in the IP lookup architecture must be addressed for a high-speed forwarding in a large scale routing table: power, memory, and lookup complexity. Hashbased architectures have lookup schemes that are recognized for being both power and memory efficient due to their O(1) lookup, in contrast to other contemporary architectures. In this paper, we propose a novel hash architecture to address these issues by using pipelined Bloom and fingerprint filters for a binary searching in
doi:10.1109/icnp.2009.5339676
dblp:conf/icnp/YuMB09
fatcat:izkhk4sr3reetnnq36ab3hln4m