Skip to main content
SpringerLink
Log in

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

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Abualigah LMQ (2019) Feature selection and enhanced krill herd algorithm for text document clustering. Stud Comput Intell 816:1–186. https://doi.org/10.1007/978-3-030-10674-4

    Article  Google Scholar 

  • Abualigah L (2020a) Group search optimizer: a nature-inspired meta-heuristic optimization algorithm with its results, variants, and applications. Neural Comput Appl 80(1):1–24. https://doi.org/10.1007/s00521-020-05107-y

    Article  Google Scholar 

  • Abualigah L (2020b) Multi-verse optimizer algorithm: a comprehensive survey of its results, variants, and applications. Neural Comput Appl 32(16):12381–12401. https://doi.org/10.1007/s00521-020-04839-1

    Article  Google Scholar 

  • Abualigah L, Diabat A (2020) A novel hybrid antlion optimization algorithm for multi-objective task scheduling problems in cloud computing environments. Cluster Comput 5:1–19. https://doi.org/10.1007/s10586-020-03075-5

    Article  Google Scholar 

  • Abualigah LM, Khader AT (2017) Unsupervised text feature selection technique based on hybrid particle swarm optimization algorithm with genetic operators for the text clustering. J Supercomput 73(11):4773–4795. https://doi.org/10.1007/s11227-017-2046-2

    Article  Google Scholar 

  • Abualigah LM, Khader AT, Hanandeh ES (2018) Hybrid clustering analysis using improved krill herd algorithm. Appl Intell 48(11):4047–4071. https://doi.org/10.1007/s10489-018-1190-6

    Article  Google Scholar 

  • Abualigah L, Diabat A, Geem ZW (2020) A comprehensive survey of the harmony search algorithm in clustering applications. Appl Sci 10(11):1–26. https://doi.org/10.3390/app10113827

    Article  Google Scholar 

  • Bando M, Jonathan Chao H (2010) FlashTrie: hash-based prefix-compressed Trie for IP route lookup beyond 100 Gbps. In: Proceedings—IEEE INFOCOM

  • Berger M (2003) IP lookup with low memory requirement and fast update. IEEE Int Conf High Perform Switch Routing HPSR:287–291

    Google Scholar 

  • Byun H, Li Q, Lim H (2019) Vectored-bloom filter implemented on FPGA for IP address lookup. In: ICEIC 2019—international conference on electronics, information, and communication. Institute of Electronics and Information Engineers (IEIE), pp 1–4

  • Chang YK, Kuo FC, Kuo HJ, Cheng Chien S (2014) LayeredTrees: most specific prefix-based pipelined design for on-chip IP address lookups. IEEE Trans Comput 63(12):3039–3052

    Article  MathSciNet  Google Scholar 

  • Deng W, Junjie X, Zhao H (2012) An improved ant colony optimization algorithm based on hybrid strategies for scheduling problem. Adv Mater Res 490–495:66–70

    Article  Google Scholar 

  • Deng W et al (2017) Study on an improved adaptive PSO algorithm for solving multi-objective gate assignment. Appl Soft Comput J 59:288–302

    Article  Google Scholar 

  • Eatherton W, Systems C, Varghese G (2004) Tree bitmap: hardware/software IP lookups with incremental updates. ACM SIGCOMM Comput Commun Rev 34(2):97–122

    Article  Google Scholar 

  • Ghosh S, Baliyan M (2017) A hash based architecture of longest prefix matching for fast IP processing. In: IEEE region 10 annual international conference, proceedings/TENCON, pp 228–31

  • Hsieh S-Y, Yang Y-C (2012) A classified multisuffix trie for IP lookup and update. IEEE Trans Comput 61(5):726–731

    Article  MathSciNet  Google Scholar 

  • Hsieh SY, Huang YL, Yang YC (2011) Multiprefix Trie: a new data structure for designing dynamic router-tables. IEEE Trans Comput 60(5):693–706

    Article  MathSciNet  Google Scholar 

  • Hsu PC, Hsieh SY (2017) Multi-inherited search tree for dynamic IP router-tables. IEEE Trans Comput 66(1):114–126

    Article  MathSciNet  Google Scholar 

  • Hyoung MJ, Lim H (2016) New approach for efficient IP address lookup using a bloom filter in trie-based algorithms. IEEE Trans Comput 65(5):1558–1565

    Article  MathSciNet  Google Scholar 

  • Kim C, Ahn SG, Min J, Kwon KW (2019) Power efficient and reliable nonvolatile TCAM with Hi-PFO and semi-complementary driver. IEEE Trans Circuits Syst I Regul Pap 66(2):605–615

    Article  Google Scholar 

  • Kuo FC, Chang YK, Cheng Chien S (2014) A memory-efficient TCAM COPROCESSOR for IPv4/IPv6 routing table update. IEEE Trans Comput 63(9):2110–2121

    Article  MathSciNet  Google Scholar 

  • Lim H, Lee N (2012) Survey and proposal on binary search algorithms for longest prefix match. IEEE Commun Surv Tutor 14(3):681–697

    Google Scholar 

  • Lim H, Yim C, Swartzlander EE (2010) Priority tries for IP address lookup. IEEE Trans Comput 59(6):784–794

    Article  MathSciNet  Google Scholar 

  • Lin CH, Hsu CY, Hsieh SY (2014) A multi-index hybrid trie for lookup and updates. IEEE Trans Parallel Distrib Syst 25(10):2486–2498

    Article  Google Scholar 

  • Liu L et al (2019) Longest prefix matching with pruning. In: IEEE international conference on high performance switching and routing (HPSR). IEEE, pp 1–6

  • Luo L et al (2014) A hybrid hardware architecture for high-speed IP lookups and fast route updates. IEEE/ACM Trans Netw 22(3):957–969

    Article  Google Scholar 

  • Pong F, Tzeng NF (2012) Concise lookup tables for IPv4 and IPv6 longest prefix matching in scalable routers. IEEE/ACM Trans Netw 20(3):729–741

    Article  Google Scholar 

  • Rétvári G et al (2013) Compressing IP forwarding tables: towards entropy bounds and beyond. In: SIGCOMM 2013—proceedings of the ACM SIGCOMM 2013 conference on applications, technologies, architectures, and protocols for computer communication, vol 43(4), pp 149–62

  • Reviriego P, Ullah A, Pontarelli S (2019) PR-TCAM: efficient TCAM emulation on Xilinx FPGAs using partial reconfiguration. IEEE Trans Very Large Scale Integr VLSI Syst 27(8):1952–1956

    Article  Google Scholar 

  • Sangireddy R, Somani AK (2003) High-speed IP routing with binary decision diagrams based hardware address lookup engine. IEEE J Sel Areas Commun 21(4):513–521

    Article  Google Scholar 

  • Sun X, Zhao YQ (2005) An on-chip IP address lookup algorithm. IEEE Trans Comput 54(7):873–885

    Article  Google Scholar 

  • Xu K, Zhang D, Li Y (2019) Longest name prefix match on multi-core processor. In: Proceedings—21st IEEE international conference on high performance computing and communications, 17th IEEE international conference on smart city and 5th IEEE international conference on data science and systems, HPCC/SmartCity/DSS 2019, pp 1035–1042

  • Zhao H, Liu H, Junjie X, Deng W (2019) Performance prediction using high-order differential mathematical morphology gradient spectrum entropy and extreme learning machine. IEEE Trans Instrum Meas 69(7):4165–4172

    Article  Google Scholar 

  • Zhao H, Zheng J et al (2020) Semi-supervised broad learning system based on manifold regularization and broad network. IEEE Trans Circuits Syst I Regul Pap 67(3):983–994

    Article  MathSciNet  Google Scholar 

Download references

Funding

There was no funding for the research.

Author information

Authors and Affiliations

  1. Department of CSE, Aalim Muhammed Salegh College of Engineering, Chennai, 600055, India

    M. Hemalatha

  2. Department of ECE, R.M.D. Engineering College, Kavaraipettai, 601206, India

    S. Rukmanidevi

  3. Department of ECE, Aalim Muhammed Salegh College of Engineering, Chennai, 600055, India

    N. R. Shanker

Authors
  1. M. Hemalatha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Rukmanidevi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. N. R. Shanker
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Hemalatha.

Ethics declarations

Conflict of interest

The authors declare no conflict of interest.

Additional information

Communicated by V. Loia.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hemalatha, M., Rukmanidevi, S. & Shanker, N.R. Searching time operation reduced IPV6 matching through dynamic DNA routing table for less memory and fast IP processing. Soft Comput 25, 3455–3468 (2021). https://doi.org/10.1007/s00500-020-05379-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-020-05379-5

Keywords

Search

Navigation