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
IP lookups using multiway and multicolumn search
IEEE/ACM Transactions on Networking (TON)
An O(log n) Dynamic Router-Table Design
IEEE Transactions on Computers
Multiway range trees: scalable IP lookup with fast updates
Computer Networks: The International Journal of Computer and Telecommunications Networking
Enhanced Interval Trees for Dynamic IP Router-Tables
IEEE Transactions on Computers
IPv4 address allocation and the BGP routing table evolution
ACM SIGCOMM Computer Communication Review
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
Scheduling of Updates in an IP Forwarding Engine with Partitioned Prefix Tables
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
Hi-index | 0.00 |
Various schemes for high-performance IP address lookups have been proposed recently Pre-computations are usually used by the special designed IP address lookup algorithms to improve the lookup speed and reduce the memory requirement However, the disadvantage of the pre-computation based schemes is when a single prefix is added or deleted, the entire data structure may need to be rebuilt Rebuilding the entire data structure seriously affects the lookup performance of a backbone router, and thus is not suitable for dynamic routing tables In this paper, we develop a new dynamic routing table algorithm The proposed data structure consists of a collection of balanced binary search trees The search, insertion, and deletion operations can be finished in O(logN) time, where N is the number of prefixes in a routing table Comparing with the best existing dynamic routing table algorithm, PBOB (Prefix Binary tree On Binary tree), our experiment results using the real routing tables show that the proposed scheme performs better than PBOB in terms of the lookup speed, insertion time, deletion time, and memory requirement.