Title :
Next hop storage and retrieval for coded and scalar IP prefix trees
Author :
Alaei, Hamid ; Behdadfar, Mohammad ; Saidi, Hossein
Author_Institution :
Dept. of Comput. Eng. & Inf. Technol., Amirkabir Univ. of Technol., Tehran, Iran
Abstract :
Currently, the large size of IP routing tables, the increasing rate of communication links and the unavoidable need for moving from IPv4 to IPv6, have caused researchers to introduce fast and memory efficient route lookup methods which are less dependent on IP address length. In this paper, we will review our two novel data structures called “Coded Prefix Trees” and “Scalar Prefix Trees” with lookup and update node access complexities of O(log n) where n is the number of prefixes. After reviewing these structures, the focus of the paper will be on the schemes required for storing and retrieving the “next hop” related to the Longest Matching Prefix (LMP) of an input query address.
Keywords :
IP networks; table lookup; telecommunication network routing; tree searching; IP address length; IP routing tables; IPv4 networks; IPv6 networks; coded IP prefix trees; communication links; input query address; longest matching prefix; next hop storage; route lookup methods; scalar IP prefix trees; Algorithm design and analysis; Binary search trees; IP networks; Memory management; Routing; Vegetation; CPT; LMP; LPM; SPT; next hop; prefix; scalar;
Conference_Titel :
Computer Networks and Distributed Systems (CNDS), 2011 International Symposium on
Conference_Location :
Tehran
Print_ISBN :
978-1-4244-9153-7
DOI :
10.1109/CNDS.2011.5764592