Tree-Combined Trie: A Compressed Data Structure for Fast IP Address Lookup
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2015, Vol 6, Issue 12
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
RISK ASSESSMENT OF NETWORK SECURITY BASED ON NON-OPTIMUM CHARACTERISTICS ANALYSIS
This paper discusses in detail the theory of non-optimum analysis on network systems. It points out that the main problem of exploring indefinite networks’ optimum lies in the lack of non-optimum analysis on the network...
El Niño / La Niña Identification based on Takens Reconstruction Theory
An identification method for earth observation data according to a chaotic behavior based on Takens reconstruction theory is proposed. The proposed method is examined by using the observed time series data of SST (Sea Su...
Self-regulating Message Throughput in Enterprise Messaging Servers – A Feedback Control Solution
Enterprise Messaging is a very popular message exchange concept in asynchronous distributed computing environments. The Enterprise Messaging Servers are heavily used in building business critical Enterprise applic...
BHA-160: Constructional Design of Hash Function based on NP-hard Problem
Secure hash function is used to protect the integrity of the message transferred on the unsecured network. Changes on the bits of the sender’s message are recognized by the message digest produced by the hash function. H...
Tuning of Customer Relationship Management (CRM) via Customer Experience Management (CEM) using Sentiment Analysis on Aspects Level
This study proposes a framework that combines a supervised machine learning and a semantic orientation approach to tune Customer Relationship Management (CRM) via Customer Experience Management (CEM). The framework extra...