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

Towards a Context-Dependent Approach for Evaluating Data Quality Cost

Data-related expertise is a central and determining factor in the success of many organizations. Big Tech companies have developed an operational environment that extracts benefit from collected data to increase the effi...

Pre-Trained Convolutional Neural Network for Classification of Tanning Leather Image

Leather craft products, such as belt, gloves, shoes, bag, and wallet are mainly originated from cow, crocodile, lizard, goat, sheep, buffalo, and stingray skin. Before the skins are used as leather craft materials, they...

Average Link Stability with Energy-Aware Routing Protocol for MANETs

This paper suggests the A-LSEA (Average Link Stability and Energy Aware) routing protocol for Mobile Ad-hoc Networks (MANETs). The main idea behind this algorithm is on the one hand, a node must have enough Residual Ener...

Design, Release, Update, Repeat: The Basic Process of a Security Protocol’s Evolution

Companies, businesses, colleges, etc. throughout the world use computer networks and telecommunications to run their operations. The convenience, information-gathering, and organizational abilities provided by computer n...

Crypto-Steganographic LSB-based System for AES-Encrypted Data

The purpose of this work is to increase the level of concealment of information from unauthorized access by pre-encrypting and hiding it in multimedia files such as images. A crypto-steganographic information protection...

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