H. Arafat Ali, A.I. El-Desouky, and M.F. Ared
Routing algorithm, LPM, RapidBase, routing table, lookup time,packet forwarding
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.
Important Links:
Go Back
