IP address lookup for internet routers using balanced binary search with prefix vector

• Published in: IEEE transactions on communications Vol. 57; no. 3; pp. 618 - 621
• Main Authors: LIM, Hyesook, KIM, Hyeong-Gee, YIM, Changhoon
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01-03-2009; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Access methods and protocols, osi model; Applied sciences; Associative memory; binary search tree; Binary search trees; binary trie; Communication switching; Communications Society; Electronic mail; Exact sciences and technology; Impedance matching; Interconnected networks; Internet; IP address lookup; Networks and services in france and abroad; Packet switching; router; Routing; Scalability; Systems, networks and services of telecommunications; Telecommunications; Telecommunications and information theory; Teleprocessing networks. Isdn; Transmission and modulation (techniques and equipments); Performance evaluation; Scalability; Internet protocol; binary trie; Routing; Router; Table lookup; Addressing; Search algorithm; Binary tree; Algorithm performance; IP address lookup; binary search tree; Search tree; Internet
• ISSN: 0090-6778; 1558-0857
• DOI: 10.1109/TCOMM.2009.03.070146

We propose an efficient binary search algorithm for IP address lookup in the Internet routers. While most of the previous binary search algorithms do not provide a balanced search, the proposed algorithm provides a perfectly balanced search, and hence it provides excellent search performance and scalability toward large routing tables.