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
Scalable high speed IP routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
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)
IP lookups using multiway and multicolumn search
IEEE/ACM Transactions on Networking (TON)
Efficient construction of multibit tries for IP lookup
IEEE/ACM Transactions on Networking (TON)
An O(log n) Dynamic Router-Table Design
IEEE Transactions on Computers
O(\log n) Dynamic Router-Tables for Prefixes and Ranges
IEEE Transactions on Computers
Enhanced Interval Trees for Dynamic IP Router-Tables
IEEE Transactions on Computers
An On-Chip IP Address Lookup Algorithm
IEEE Transactions on Computers
IP-address lookup using LC-tries
IEEE Journal on Selected Areas in Communications
Survey and taxonomy of IP address lookup algorithms
IEEE Network: The Magazine of Global Internetworking
Packet processing with blocking for bursty traffic on multi-thread network processor
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
SafeQ: secure and efficient query processing in sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
An efficient IP address lookup algorithm based on a small balanced tree using entry reduction
Computer Networks: The International Journal of Computer and Telecommunications Networking
Privacy- and integrity-preserving range queries in sensor networks
IEEE/ACM Transactions on Networking (TON)
A high-throughput and high-capacity IPv6 routing lookup system
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hint-based cache design for reducing miss penalty in HBS packet classification algorithm
Journal of Parallel and Distributed Computing
Cross-domain privacy-preserving cooperative firewall optimization
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Backbone routers with tens-of-gigabits-per-second links are indispensable communication devices to deploy on the Internet. The IP lookup operation is the most critical task that must be improved in routers. In this paper, we first present a systematic method to compare prefixes of different lengths. The list of prefixes can then be sorted and stored in a sequential array, which is contrary to the linked lists used in most of trie-based structures. Next, fast binary and multiway prefix searches assisted by auxiliary prefixes are proposed. We also developed a 32-bit representation to encode the prefixes of different lengths. For the large routing tables currently available on the Internet, the proposed multiway prefix search can achieve the worst-case number of memory accesses of three and four if the sizes of the CPU cache lines are 64bytes and 32bytes, respectively. The IPv4 simulation results show that the proposed prefix searches outperform the existing IP lookup schemes in terms of lookup times and memory consumption. The simulations using IPv6 routing tables also show the performance advantages of the proposed binary prefix searches. We also analyze the performance of the existing lookup schemes by concurrently considering the lookup speed, the update speed, and the memory consumption. Although the update speed of the proposed prefix search is worse than the dynamic routing table schemes with log(N) complexity for a table of N prefixes, our analysis shows that the overall performance of the proposed binary prefix search outperforms all the existing schemes.