Searching time operation reduced IPV6 matching through dynamic DNA routing table for less memory and fast IP processing

Abstract

The internet technology needs high-speed (Internet Protocol) IP addressing system and IP matching in router. The IP addressing speed depends on the size of address and destination. Until now, IPV4 address matching performs with various algorithms such as binary trie, LC trie, prefix tree, priority trie, DTBM, and multi-prefix tree. The above algorithms suit for IPV4 address matching and never suit for IPV6 address matching. The IPV6 consists of 128 bits with different header structures when compared to IPV4. The IPV6 address matching needs a robust algorithm with high processing speed IP matching and uses low memory and high accuracy in IP address matching with less operation time. In this paper, we propose DNA-based sequence matching lookup (DSML) algorithm for IPV6 address matching with reduced searching time. The DSML algorithm performs better than existing algorithms such as disjoint prefix tree and multi-index suffix trie because of direct computation of IPv6 matching through DNA folding sequence. The proposed DSML algorithm does the direct computation due to hit score method and never splits the prefix of IPV6. The splitting of prefix in the existing algorithm consumes more time and reduces the accuracy in IPv6 matching. From the experimentation, when compared to existing algorithms the proposed DSML algorithm provides 80% result in terms of speed and scalability.