A Novel Distributed Dynamic Location Management Scheme for Minimizing Signaling Costs in Mobile IP
IEEE Transactions on Mobile Computing
A Scalable and Small Forwarding Table for Fast IP Address Lookups
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Simultaneous Multithreading-Based Routers
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Hardware-based IP routing using partitioned lookup table
IEEE/ACM Transactions on Networking (TON)
Scalable, memory efficient, high-speed IP lookup algorithms
IEEE/ACM Transactions on Networking (TON)
An IP packet forwarding technique based on a new structure of lookup table
International Journal of Computers and Applications
A lookup algorithm based on multiple tables for high-speed routers
Journal of High Speed Networks
Adaptive selection of MIPv6 and hierarchical MIPv6 for minimizing signaling cost
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
How to determine MAP domain size using node mobility pattern in HMIPv6
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
Comparison of signaling and packet forwarding overhead for HMIP and MIFA
WWIC'05 Proceedings of the Third international conference on Wired/Wireless Internet Communications
| Hi-index | 0.07 |
The growth of the Internet and its acceptance has sparkled keen interest in the research community in respect to many apparent scaling problems for a large infrastructure based on IP technology. A self-contained problem of considerable practical and theoretical interest is the longest-prefix lookup operation, perceived as one of the decisive bottlenecks. Several novel approaches have been proposed to speed up this operation that promise to scale forwarding technology into gigabit speeds. This paper surveys these new lookup algorithms and classifies them based on applied techniques, accompanied by a set of practical requirements that are critical to the design of high-speed routing devices. We also propose several new algorithms to provide lookup capability at gigabit speeds. In particular, we show the theoretical limitations of routing table size and show that one of our new algorithms is almost optimal, while requiring only a small number of memory accesses to perform each address lookup