{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T15:06:03Z","timestamp":1729177563067,"version":"3.27.0"},"reference-count":26,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2023,4,1]]},"DOI":"10.1587\/transinf.2022edp7088","type":"journal-article","created":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T22:27:39Z","timestamp":1680301659000},"page":"509-522","source":"Crossref","is-referenced-by-count":1,"title":["PR-Trie: A Hybrid Trie with Ant Colony Optimization Based Prefix Partitioning for Memory-Efficient IPv4\/IPv6 Route Lookup"],"prefix":"10.1587","volume":"E106.D","author":[{"given":"Yi","family":"ZHANG","sequence":"first","affiliation":[{"name":"College of Communication Eng., Army Engineering University of PLA"}]},{"given":"Lufeng","family":"QIAO","sequence":"additional","affiliation":[{"name":"College of Communication Eng., Army Engineering University of PLA"}]},{"given":"Huali","family":"WANG","sequence":"additional","affiliation":[{"name":"College of Communication Eng., Army Engineering University of PLA"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] V. Fuller, T. Li, J. Yu, and K. Varadhan, \u201cClassless inter-domain routing (CIDR): An address assignment and aggregation strategy,\u201d Tech. Rep., RFC 1519, Sept. 1993. 10.17487\/rfc1519","DOI":"10.17487\/rfc1519"},{"key":"2","unstructured":"[2] \u201cBGP routing table analysis reports,\u201d https:\/\/bgp.potaroo.net\/, 2022."},{"key":"3","unstructured":"[3] \u201cThe BGP instability report,\u201d https:\/\/bgpupdates.potaroo.net\/, 2022."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] S. Deering and R. Hinden, \u201cInternet protocol, version 6 (IPv6) specification,\u201d Tech. Rep., RFC 2460, Dec. 1998. 10.17487\/rfc2460","DOI":"10.17487\/rfc2460"},{"key":"5","unstructured":"[5] J.L. Hennessy and D.A. Patterson, Computer Architecture: A Quantitative Approach, Elsevier, 2011."},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] M. Degermark, A. Brodnik, S. Carlsson, and S. Pink, \u201cSmall forwarding tables for fast routing lookups,\u201d ACM SIGCOMM Computer Communication Review, vol.27, no.4, pp.3-14, 1997. 10.1145\/263109.263133","DOI":"10.1145\/263109.263133"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] S. Nilsson and G. Karlsson, \u201cIP-address lookup using LC-tries,\u201d IEEE J. Sel. Areas Commun., vol.17, no.6, pp.1083-1092, 1999. 10.1109\/49.772439","DOI":"10.1109\/49.772439"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] W. Eatherton, G. Varghese, and Z. Dittia, \u201cTree bitmap: Hardware\/ software IP lookups with incremental updates,\u201d ACM SIGCOMM Computer Communication Review, vol.34, no.2, pp.97-122, 2004. 10.1145\/997150.997160","DOI":"10.1145\/997150.997160"},{"key":"9","unstructured":"[9] H. Song, J. Turner, and J. Lockwood, \u201cShape shifting tries for faster IP route lookup,\u201d Proc. 13th IEEE International Conference on Network Protocols (ICNP'05), pp.358-367, 2005. 10.1109\/icnp.2005.36"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] S. Kumar, M. Becchi, P. Crowley, and J. Turner, \u201cCAMP: Fast and efficient IP lookup architecture,\u201d Proc. 2006 ACM\/IEEE Symposium on Architecture for Networking and Communications Systems, pp.51-60, 2006. 10.1145\/1185347.1185355","DOI":"10.1145\/1185347.1185355"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] M. Bando, Y.-L. Lin, and H.J. Chao, \u201cFlashTrie: Beyond 100-Gb\/s IP route lookup using hash-based prefix-compressed trie,\u201d IEEE\/ACM Trans. Netw., vol.20, no.4, pp.1262-1275, 2012. 10.1109\/tnet.2012.2188643","DOI":"10.1109\/TNET.2012.2188643"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] D. Pao, Z. Lu, and Y.H. Poon, \u201cIP address lookup using bit-shuffled trie,\u201d Computer Communications, vol.47, pp.51-64, 2014. 10.1016\/j.comcom.2014.04.006","DOI":"10.1016\/j.comcom.2014.04.006"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] T. Stimpfling, N. B\u00e9langer, J.M.P. Langlois, and Y. Savaria, \u201cSHIP: A scalable high-performance IPv6 lookup algorithm that exploits prefix characteristics,\u201d IEEE\/ACM Trans. Netw., vol.27, no.4, pp.1529-1542, 2019. 10.1109\/tnet.2019.2926230","DOI":"10.1109\/TNET.2019.2926230"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] Y.-K. Chang and Y.-C. Lin, \u201cA fast and memory efficient dynamic IP lookup algorithm based on B-tree,\u201d 2009 International Conference on Advanced Information Networking and Applications, pp.278-284, 2009. 10.1109\/aina.2009.63","DOI":"10.1109\/AINA.2009.63"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] G. Wang, Y. Lin, R. Li, J. Li, X. Yao, and P. Liu, \u201cTowards dynamic and scalable high-speed IP address lookup based on B+ tree,\u201d IEICE Trans. Inf. & Syst., vol.E95-D, no.9, pp.2277-2287, Sept. 2012. 10.1587\/transinf.e95.d.2277","DOI":"10.1587\/transinf.E95.D.2277"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] P. Zhong, \u201cAn IPv6 address lookup algorithm based on recursive balanced multi-way range trees with efficient search and update,\u201d 2011 International Conference on Computer Science and Service System (CSSS), pp.2059-2063, 2011. 10.1109\/csss.2011.5974986","DOI":"10.1109\/CSSS.2011.5974986"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] D.R. Morrison, \u201cPATRICIA \u2014 Practical algorithm to retrieve information coded in alphanumeric,\u201d Journal of the ACM (JACM), vol.15, no.4, pp.514-534, 1968. 10.1145\/321479.321481","DOI":"10.1145\/321479.321481"},{"key":"18","unstructured":"[18] K. Sklower, \u201cA tree-based packet routing table for Berkeley Unix,\u201d USENIX Winter, pp.93-99, 1991."},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] H. Lim, C. Yim, and E.E. Swartzlander, \u201cPriority tries for IP address lookup,\u201d IEEE Trans. Comput., vol.59, no.6, pp.784-794, 2010. 10.1109\/tc.2010.38","DOI":"10.1109\/TC.2010.38"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] F.U.S. Jim\u00e9nez, M.\u00c1.R. S\u00e1nchez, and C.J. Villanueva, \u201cGenetic algorithm based prefix partitioning for memory-efficient IPv4\/6 lookup,\u201d IEEE Lat. Am. Trans., vol.17, no.11, pp.1823-1830, 2019. 10.1109\/tla.2019.8986420","DOI":"10.1109\/TLA.2019.8986420"},{"key":"21","unstructured":"[21] \u201cUniversity of Oregon route views archive project,\u201d http:\/\/routeviews.org\/, 2022."},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] R. Hinden, S. Deering, and E. Nordmark, \u201cIPv6 global unicast address format,\u201d Tech. Rep., RFC 3587, Aug. 2003. 10.17487\/rfc3587","DOI":"10.17487\/rfc3587"},{"key":"23","unstructured":"[23] M. Dorigo, \u201cOptimization, learning and natural algorithms,\u201d Ph.D. Thesis, Politecnico di Milano, 1992."},{"key":"24","unstructured":"[24] A. Colorni, M. Dorigo, and V. Maniezzo, \u201cDistributed optimization by ant colonies,\u201d Proc. First European Conference on Artificial Life, pp.134-142, Paris, France, 1991."},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] M. Wang, S. Deering, T. Hain, and L. Dunn, \u201cNon-random generator for IPv6 tables,\u201d Proc. 12th Annual IEEE Symposium on High Performance Interconnects, pp.35-40, 2004. 10.1109\/conect.2004.1375198","DOI":"10.1109\/CONECT.2004.1375198"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] Y. Zhang, L. Qiao, L. Hu, Q. Chen, S. Zou, and X. Liu, \u201cA hybrid scheme of filter implemented on FPGA for faster IP route lookup,\u201d 2022 IEEE 6th Advanced Information Technology, Electronic and Automation Control Conference (IAEAC), pp.1512-1518, 2022. 10.1109\/iaeac54830.2022.9929544","DOI":"10.1109\/IAEAC54830.2022.9929544"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E106.D\/4\/E106.D_2022EDP7088\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T14:03:20Z","timestamp":1729173800000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E106.D\/4\/E106.D_2022EDP7088\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,1]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2022edp7088","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2023,4,1]]},"article-number":"2022EDP7088"}}