{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T10:58:24Z","timestamp":1761562704313,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,10,31]],"date-time":"2020-10-31T00:00:00Z","timestamp":1604102400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,31]],"date-time":"2020-10-31T00:00:00Z","timestamp":1604102400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s00500-020-05379-5","type":"journal-article","created":{"date-parts":[[2020,10,31]],"date-time":"2020-10-31T17:02:53Z","timestamp":1604163773000},"page":"3455-3468","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Searching time operation reduced IPV6 matching through dynamic DNA routing table for less memory and fast IP processing"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2071-0224","authenticated-orcid":false,"given":"M.","family":"Hemalatha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Rukmanidevi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. R.","family":"Shanker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,31]]},"reference":[{"key":"5379_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-10674-4","volume":"816","author":"LMQ Abualigah","year":"2019","unstructured":"Abualigah LMQ (2019) Feature selection and enhanced krill herd algorithm for text document clustering. Stud Comput Intell 816:1\u2013186. https:\/\/doi.org\/10.1007\/978-3-030-10674-4","journal-title":"Stud Comput Intell"},{"issue":"1","key":"5379_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00521-020-05107-y","volume":"80","author":"L Abualigah","year":"2020","unstructured":"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\u201324. https:\/\/doi.org\/10.1007\/s00521-020-05107-y","journal-title":"Neural Comput Appl"},{"issue":"16","key":"5379_CR3","doi-asserted-by":"publisher","first-page":"12381","DOI":"10.1007\/s00521-020-04839-1","volume":"32","author":"L Abualigah","year":"2020","unstructured":"Abualigah L (2020b) Multi-verse optimizer algorithm: a comprehensive survey of its results, variants, and applications. Neural Comput Appl 32(16):12381\u201312401. https:\/\/doi.org\/10.1007\/s00521-020-04839-1","journal-title":"Neural Comput Appl"},{"key":"5379_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10586-020-03075-5","volume":"5","author":"L Abualigah","year":"2020","unstructured":"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\u201319. https:\/\/doi.org\/10.1007\/s10586-020-03075-5","journal-title":"Cluster Comput"},{"issue":"11","key":"5379_CR5","doi-asserted-by":"publisher","first-page":"4773","DOI":"10.1007\/s11227-017-2046-2","volume":"73","author":"LM Abualigah","year":"2017","unstructured":"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\u20134795. https:\/\/doi.org\/10.1007\/s11227-017-2046-2","journal-title":"J Supercomput"},{"issue":"11","key":"5379_CR6","doi-asserted-by":"publisher","first-page":"4047","DOI":"10.1007\/s10489-018-1190-6","volume":"48","author":"LM Abualigah","year":"2018","unstructured":"Abualigah LM, Khader AT, Hanandeh ES (2018) Hybrid clustering analysis using improved krill herd algorithm. Appl Intell 48(11):4047\u20134071. https:\/\/doi.org\/10.1007\/s10489-018-1190-6","journal-title":"Appl Intell"},{"issue":"11","key":"5379_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/app10113827","volume":"10","author":"L Abualigah","year":"2020","unstructured":"Abualigah L, Diabat A, Geem ZW (2020) A comprehensive survey of the harmony search algorithm in clustering applications. Appl Sci 10(11):1\u201326. https:\/\/doi.org\/10.3390\/app10113827","journal-title":"Appl Sci"},{"key":"5379_CR8","doi-asserted-by":"crossref","unstructured":"Bando M, Jonathan Chao H (2010) FlashTrie: hash-based prefix-compressed Trie for IP route lookup beyond 100\u00a0Gbps. In: Proceedings\u2014IEEE INFOCOM","DOI":"10.1109\/INFCOM.2010.5462142"},{"key":"5379_CR9","first-page":"287","volume":"HPSR","author":"M Berger","year":"2003","unstructured":"Berger M (2003) IP lookup with low memory requirement and fast update. IEEE Int Conf High Perform Switch Routing HPSR:287\u2013291","journal-title":"IEEE Int Conf High Perform Switch Routing"},{"key":"5379_CR10","doi-asserted-by":"crossref","unstructured":"Byun H, Li Q, Lim H (2019) Vectored-bloom filter implemented on FPGA for IP address lookup. In: ICEIC 2019\u2014international conference on electronics, information, and communication. Institute of Electronics and Information Engineers (IEIE), pp 1\u20134","DOI":"10.23919\/ELINFOCOM.2019.8706399"},{"issue":"12","key":"5379_CR11","doi-asserted-by":"publisher","first-page":"3039","DOI":"10.1109\/TC.2013.109","volume":"63","author":"YK Chang","year":"2014","unstructured":"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\u20133052","journal-title":"IEEE Trans Comput"},{"key":"5379_CR12","doi-asserted-by":"publisher","first-page":"66","DOI":"10.4028\/www.scientific.net\/AMR.441.66","volume":"490\u2013495","author":"W Deng","year":"2012","unstructured":"Deng W, Junjie X, Zhao H (2012) An improved ant colony optimization algorithm based on hybrid strategies for scheduling problem. Adv Mater Res 490\u2013495:66\u201370","journal-title":"Adv Mater Res"},{"key":"5379_CR13","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.asoc.2017.06.004","volume":"59","author":"W Deng","year":"2017","unstructured":"Deng W et al (2017) Study on an improved adaptive PSO algorithm for solving multi-objective gate assignment. Appl Soft Comput J 59:288\u2013302","journal-title":"Appl Soft Comput J"},{"issue":"2","key":"5379_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/997150.997160","volume":"34","author":"W Eatherton","year":"2004","unstructured":"Eatherton W, Systems C, Varghese G (2004) Tree bitmap: hardware\/software IP lookups with incremental updates. ACM SIGCOMM Comput Commun Rev 34(2):97\u2013122","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"5379_CR15","unstructured":"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\u201331"},{"issue":"5","key":"5379_CR16","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1109\/TC.2011.86","volume":"61","author":"S-Y Hsieh","year":"2012","unstructured":"Hsieh S-Y, Yang Y-C (2012) A classified multisuffix trie for IP lookup and update. IEEE Trans Comput 61(5):726\u2013731","journal-title":"IEEE Trans Comput"},{"issue":"5","key":"5379_CR17","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1109\/TC.2010.133","volume":"60","author":"SY Hsieh","year":"2011","unstructured":"Hsieh SY, Huang YL, Yang YC (2011) Multiprefix Trie: a new data structure for designing dynamic router-tables. IEEE Trans Comput 60(5):693\u2013706","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"5379_CR18","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1109\/TC.2016.2574347","volume":"66","author":"PC Hsu","year":"2017","unstructured":"Hsu PC, Hsieh SY (2017) Multi-inherited search tree for dynamic IP router-tables. IEEE Trans Comput 66(1):114\u2013126","journal-title":"IEEE Trans Comput"},{"issue":"5","key":"5379_CR19","doi-asserted-by":"publisher","first-page":"1558","DOI":"10.1109\/TC.2015.2444850","volume":"65","author":"MJ Hyoung","year":"2016","unstructured":"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\u20131565","journal-title":"IEEE Trans Comput"},{"issue":"2","key":"5379_CR20","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1109\/TCSI.2018.2867005","volume":"66","author":"C Kim","year":"2019","unstructured":"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\u2013615","journal-title":"IEEE Trans Circuits Syst I Regul Pap"},{"issue":"9","key":"5379_CR21","doi-asserted-by":"publisher","first-page":"2110","DOI":"10.1109\/TC.2013.22","volume":"63","author":"FC Kuo","year":"2014","unstructured":"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\u20132121","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"5379_CR22","first-page":"681","volume":"14","author":"H Lim","year":"2012","unstructured":"Lim H, Lee N (2012) Survey and proposal on binary search algorithms for longest prefix match. IEEE Commun Surv Tutor 14(3):681\u2013697","journal-title":"IEEE Commun Surv Tutor"},{"issue":"6","key":"5379_CR23","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1109\/TC.2010.38","volume":"59","author":"H Lim","year":"2010","unstructured":"Lim H, Yim C, Swartzlander EE (2010) Priority tries for IP address lookup. IEEE Trans Comput 59(6):784\u2013794","journal-title":"IEEE Trans Comput"},{"issue":"10","key":"5379_CR24","doi-asserted-by":"publisher","first-page":"2486","DOI":"10.1109\/TPDS.2013.214","volume":"25","author":"CH Lin","year":"2014","unstructured":"Lin CH, Hsu CY, Hsieh SY (2014) A multi-index hybrid trie for lookup and updates. IEEE Trans Parallel Distrib Syst 25(10):2486\u20132498","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"5379_CR25","doi-asserted-by":"crossref","unstructured":"Liu L et al (2019) Longest prefix matching with pruning. In: IEEE international conference on high performance switching and routing (HPSR). IEEE, pp 1\u20136","DOI":"10.1109\/HPSR.2019.8808125"},{"issue":"3","key":"5379_CR26","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1109\/TNET.2013.2266665","volume":"22","author":"L Luo","year":"2014","unstructured":"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\u2013969","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"3","key":"5379_CR27","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1109\/TNET.2011.2167158","volume":"20","author":"F Pong","year":"2012","unstructured":"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\u2013741","journal-title":"IEEE\/ACM Trans Netw"},{"key":"5379_CR28","doi-asserted-by":"crossref","unstructured":"R\u00e9tv\u00e1ri G et al (2013) Compressing IP forwarding tables: towards entropy bounds and beyond. In: SIGCOMM 2013\u2014proceedings of the ACM SIGCOMM 2013 conference on applications, technologies, architectures, and protocols for computer communication, vol 43(4), pp 149\u201362","DOI":"10.1145\/2486001.2486009"},{"issue":"8","key":"5379_CR29","doi-asserted-by":"publisher","first-page":"1952","DOI":"10.1109\/TVLSI.2019.2903980","volume":"27","author":"P Reviriego","year":"2019","unstructured":"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\u20131956","journal-title":"IEEE Trans Very Large Scale Integr VLSI Syst"},{"issue":"4","key":"5379_CR30","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1109\/JSAC.2003.810516","volume":"21","author":"R Sangireddy","year":"2003","unstructured":"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\u2013521","journal-title":"IEEE J Sel Areas Commun"},{"issue":"7","key":"5379_CR31","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1109\/TC.2005.107","volume":"54","author":"X Sun","year":"2005","unstructured":"Sun X, Zhao YQ (2005) An on-chip IP address lookup algorithm. IEEE Trans Comput 54(7):873\u2013885","journal-title":"IEEE Trans Comput"},{"key":"5379_CR32","doi-asserted-by":"crossref","unstructured":"Xu K, Zhang D, Li Y (2019) Longest name prefix match on multi-core processor. In: Proceedings\u201421st 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\u20131042","DOI":"10.1109\/HPCC\/SmartCity\/DSS.2019.00148"},{"issue":"7","key":"5379_CR33","doi-asserted-by":"publisher","first-page":"4165","DOI":"10.1109\/TIM.2019.2948414","volume":"69","author":"H Zhao","year":"2019","unstructured":"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\u20134172","journal-title":"IEEE Trans Instrum Meas"},{"issue":"3","key":"5379_CR34","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1109\/TCSI.2019.2959886","volume":"67","author":"H Zhao","year":"2020","unstructured":"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\u2013994","journal-title":"IEEE Trans Circuits Syst I Regul Pap"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05379-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-020-05379-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05379-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,26]],"date-time":"2021-02-26T15:15:17Z","timestamp":1614352517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-020-05379-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,31]]},"references-count":34,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["5379"],"URL":"https:\/\/doi.org\/10.1007\/s00500-020-05379-5","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2020,10,31]]},"assertion":[{"value":"31 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}