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

Face Recognition Using Bacteria Foraging Optimization-Based Selected Features 

Feature selection (FS) is a global optimization problem in machine learning, which reduces the number of features, removes irrelevant, noisy and redundant data, and results in acceptable recognition accuracy. This paper...

STUDY OF INDIAN BANKS WEBSITES FOR CYBER CRIME SAFETY MECHANSIM

The human society has undergone tremendous changes from time to time with rapid pace at social level from the beginning and technological level ever since the rise of technologies. This technology word changes the human...

Classification of Hand Gestures Using Gabor Filter with Bayesian and Naïve Bayes Classifier

A hand Gesture is basically the movement, position or posture of hand used extensively in our daily lives as part of non-verbal communication. A lot of research is being carried out to classify hand gestures in videos as...

Eliminating Broadcast Storming in Vehicular Ad-Hoc Networks

VANETs (Vehicular Ad-hoc Networks) offer diversity of appealing applications. A lot of applications offered by VANETs depend upon the propagation of messages from one vehicle to another vehicle in the network. Several al...

Automatic Scheme for Fused Medical Image Segmentation with Nonsubsampled Contourlet Transform

Medical image segmentation has become an essential technique in clinical and research- oriented applications. Because manual segmentation methods are tedious, and semi-automatic segmentation lacks the flexibility, fully-...

Download PDF file
  • EP ID EP122874
  • DOI 10.14569/IJACSA.2015.061223
  • Views 90
  • 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