Abstract
For meeting the requirements of the high-speed Internet and satisfying the Internet users, building fast routers with high-speed IP address lookup engine is inevitable. Regarding the unpredictable variations occurred in the forwarding information during the time and space, the IP lookup algorithm should be able to customize itself with temporal and spatial conditions. This paper proposes a new dynamic data structure for fast IP address lookup. This novel data structure is a dynamic mixture of trees and tries which is called Tree-Combined Trie or simply TC-Trie. Binary sorted trees are more advantageous than tries for representing a sparse population while multibit tries have better performance than trees when a population is dense. TC-trie combines advantages of binary sorted trees and multibit tries to achieve maximum compression of the forwarding information. Dynamic reconfiguration of TC-trie, made it capable of customizing itself along the time and scaling to support more prefixes or longer IPv6 prefixes. TC-trie provides a smooth transition from current large IPv4 databases to the large IPv6 databases of the future Internet.
Highlights
Improvement of Internet-base multimedia applications in recent years drives new demands for high-speed Internet
This paper proposes a new cost-efficient data structure for fast IP address lookup that dynamically reconfigures itself
It could be said that the Tree-Combined Trie (TC-trie) is a variable stride multibit trie that its sparse parts are dynamically represented by binary sorted tree structures
Summary
Improvement of Internet-base multimedia applications in recent years drives new demands for high-speed Internet. The main role of router is to forward millions of packets per second on each of its destination by finding address of next-hop router or the egress port through which packet should be forwarded. Finding a high-speed, memory-efficient and scalable IP address lookup method has been a great challenge especially in the last decade (i.e. after introducing Classless InterDomain Routing, CIDR, in 1994). This paper proposes a new cost-efficient data structure for fast IP address lookup that dynamically reconfigures itself. This novel data structure combines binary sorted trees with variable-stride multibit tries and put advantages of them all together in itself
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
