Searching time operation reduced IPV6 matching through dynamic DNA routing table for less memory and fast IP processing
- PDF / 1,330,306 Bytes
- 14 Pages / 595.276 x 790.866 pts Page_size
- 81 Downloads / 147 Views
(0123456789().,-volV)(0123456789(). ,- volV)
METHODOLOGIES AND APPLICATION
Searching time operation reduced IPV6 matching through dynamic DNA routing table for less memory and fast IP processing M. Hemalatha1
•
S. Rukmanidevi2 • N. R. Shanker3
Springer-Verlag GmbH Germany, part of Springer Nature 2020
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. Keywords Internet technology Lookup speed IPv6 matching DSML algorithm Speed and scalability
1 Introduction An internet system consists of nodes and routers connected through transmission cable such as optical and coaxial. Node processes the data through router. Routers execute four tasks such as packet switching, packet filtering, internetworking and path selection. In packet switching, the data is broken into packets to improve network efficiency. Packet switching enables multiple users to share a single data path, and packet has sent through network based on their destination IP address (Bando and Jonathan Chao
Communicated by V. Loia. & M. Hemalatha [email protected] 1
Department of CSE, Aalim Muhammed Salegh College of Engineering, Chennai 600055, India
2
Department of ECE, R.M.D. Engineering College, Kavaraipettai 601206, India
3
Department of ECE, Aalim Muhammed Salegh College of Engineering, Chennai 600055, India
2010). In addition, packet filtering monitors and restricts the packet entering and leaving the network based on the source and destination internet protocol (IP) address, port and protocol. Furthermore, internetworking acts as gateway to enable two or more networks in the internet. Internetworking provides a standard method of routing packet among the networks. The path selection in the router se
Data Loading...
