Routing on longest-matching prefixes
IEEE/ACM Transactions on Networking (TON)
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
Faster IP lookups using controlled prefix expansion
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Fast address lookups using controlled prefix expansion
ACM Transactions on Computer Systems (TOCS)
Routing in distributed networks: overview and open problems
ACM SIGACT News
Communication Networks: Fundamental Concepts and Key Architectures
Communication Networks: Fundamental Concepts and Key Architectures
Design of RapidBase-An Active Measurement Database System
IDEAS '00 Proceedings of the 2000 International Symposium on Database Engineering & Applications
Efficient Construction of Variable-Stride Multibit Tries for IP Lookup
SAINT '02 Proceedings of the 2002 Symposium on Applications and the Internet
On fast address-lookup algorithms
IEEE Journal on Selected Areas in Communications
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
| Hi-index | 0.00 |
In computer networks nowadays, high-speed routers are compulsory to deliver the incoming packet to its destination. There are two parameters that exist in all lookup techniques that directly affect performance results: data structure size and number of lookup table accesses. With these remarks in mind, the specific goals of this paper are: (i) Design a data structure for storing an IP lookup table that enhances the lookup process, (ii) Produce an IP lookup algorithm that has a bounded worst-case number of accesses lower than contemporary techniques, and (iii) Improve updating and deletion operations that do not create a bottleneck to efficient forwarding.This paper investigates a suitable data structure of the routing table in order to minimize the total routing time. The investigated structure of the routing table is based on RapidBase technique. It contains all the information necessary to forward an IP data packet toward its destination. The properties of the created routing table facilitate searching for the best matching prefix quicker than when using the current routing table where packets do not have to be queued before lookup. Additionally, the proposed algorithm's effectiveness is deliberated via simulation. A comparative study with recently published algorithms shows that our proposed scheme has a great impact on shortening the route lookup and update operations. For more enhancements, combinations of the proposed algorithm with the most popular algorithms are also studied.