Tree-Combined Trie: A Compressed Data Structure for Fast IP Address Lookup

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.

Authors and Affiliations

Muhammad Tahir, Shakil Ahmed

Keywords

Related Articles

Exploiting the Interplay among Products for Efficient Recommendations

Recommender systems are built with the aim to reduce the cognitive load on the user. An efficient recommender system should ensure that a user spends minimal time in the process. Conversational Case-Based Recommender Sys...

RFID: The Big Player in the Libraries of the Future

This paper suggest the idea of developing an automatic Radio Frequency Identification (RFID)-based system for library search and to observe the current literature to define whether current technology and developed RFID-b...

Extended Standard Hough Transform for Analytical Line Recognition

This paper presents a new method which extends the Standard Hough Transform for the recognition of naive or standard line in a noisy picture. The proposed idea conserves the power of the Standard Hough Transform particul...

Load Balancing for Improved Quality of Service in the Cloud

Due to the advancement in technology and the growth of human society, it is necessary to work in an environment that reduces costs, resource-efficient, reduces man power and minimizes the use of space. This led to the em...

Adaptive Error Detection Method for P300-based Spelling Using Riemannian Geometry

Brain-Computer Interface (BCI) systems have be-come one of the valuable research area of ML (Machine Learning) and AI based techniques have brought significant change in traditional diagnostic systems of medical diagnosi...

Download PDF file
  • EP ID EP122874
  • DOI 10.14569/IJACSA.2015.061223
  • Views 106
  • Downloads 0

How To Cite

Muhammad Tahir, Shakil Ahmed (2015). Tree-Combined Trie: A Compressed Data Structure for Fast IP Address Lookup. International Journal of Advanced Computer Science & Applications, 6(12), 168-175. https://europub.co.uk/articles/-A-122874