Small forwarding tables for fast routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Fast address lookups using controlled prefix expansion
ACM Transactions on Computer Systems (TOCS)
Scalable high-speed prefix matching
ACM Transactions on Computer Systems (TOCS)
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
Technologies and building blocks for fast packet forwarding
IEEE Communications Magazine
On fast address-lookup algorithms
IEEE Journal on Selected Areas in Communications
High-speed IP routing with binary decision diagrams based hardware address lookup engine
IEEE Journal on Selected Areas in Communications
Survey and taxonomy of IP address lookup algorithms
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
The IP address lookup in the communication link technologies is becoming a major bottleneck by exploring the exact matching and the parallel hashing in each prefix length. In this paper, we present an algorithm for IP address lookup and collision resolution to reduce memory space and solve collision for high speed routing based on multiple table indexing structure. Our scheme makes possible direct access in a designated IP prefix without replicating the forwarding table entries, and provides efficient collision resolution for fast route lookup with only small memory. Simulation results indicate that our algorithm provides a faster lookup than the conventional lookup schemes.