{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T10:26:11Z","timestamp":1773311171778,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031248474","type":"print"},{"value":"9783031248481","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-24848-1_7","type":"book-chapter","created":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T15:08:33Z","timestamp":1673190513000},"page":"98-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Perspective of\u00a0IP Lookup Approach Using Graphical Processing Unit (GPU)"],"prefix":"10.1007","author":[{"given":"Veeramani","family":"Sonai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Indira","family":"Bharathi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sk.","family":"Noor Mahammad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,8]]},"reference":[{"key":"7_CR1","unstructured":"https:\/\/www.caida.org\/research\/traffic-analysis\/"},{"key":"7_CR2","unstructured":"(2016). http:\/\/www.nvidia.com\/object\/cuda_get.html"},{"key":"7_CR3","unstructured":"CUDA, Compute Unified Device Architecture. http:\/\/nvidia.com\/. Accessed 2016"},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1145\/1851275.1851207","volume":"40","author":"S Han","year":"2010","unstructured":"Han, S., Jang, K., Park, K.S., Moon, S.: Packetshader: a GPU-accelerated software router. ACM SIGCOMM Comput. Commun. Rev. 40(4), 195\u2013206 (2010)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Indira, B., Valarmathi, K., Devaraj, D.: A trie based IP lookup for high performance router\/switch. IEEE International Conference on Intelligent Techniques in Control, Optimization and Signal Processing, pp. 1\u20136 (2019)","DOI":"10.1109\/INCOS45849.2019.8951425"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Kasnavi, S., Gaudet, V.C., Berube, P., Amaral, J.N.: A hardware-based longest prefix matching scheme for TCAMs. IEEE International Symposium on Circuits and Systems, ISCAS, pp. 3339\u20133342 (2005)","DOI":"10.1109\/ISCAS.2005.1465343"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Mu, S., Zhang, X., Zhang, N., Lu, J., Deng, Y.S., Zhang, S.: IP routing processing with graphic processors. In: Proceedings of the Conference on Design, Automation and Test in Europe, pp. 93\u201398 (2010)","DOI":"10.1109\/DATE.2010.5457229"},{"issue":"6","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1109\/49.772439","volume":"17","author":"S Nilsson","year":"1999","unstructured":"Nilsson, S., Karlsson, G.: IP Address lookup using LC-tries. IEEE J. Sel. Areas Commun. 17(6), 1083\u20131092 (1999)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Padmashani, R., Sathyadevan, S., Dath, D.: BSnort IPS better snort intrusion detection\/prevention system. In: 2012 12th International Conference on Intelligent Systems Design and Applications (ISDA), pp. 46\u201351 (2012)","DOI":"10.1109\/ISDA.2012.6416511"},{"issue":"18","key":"7_CR10","doi-asserted-by":"publisher","first-page":"3787","DOI":"10.1016\/j.comcom.2007.09.006","volume":"30","author":"M Pan","year":"2007","unstructured":"Pan, M., Haibin, L.: Build shape-shifting tries for fast IP lookup in o(n) time. Comput. Commun. 30(18), 3787\u20133795 (2007)","journal-title":"Comput. Commun."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Rekhter, Y., Li, T.: An architecture for IP address allocation with CIDR. RFC 1518 (1993)","DOI":"10.17487\/rfc1518"},{"key":"7_CR12","unstructured":"RIS. Routing information service (2015)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Rojas-Cessa, R., Ramesh, L., Dong, Z., Cai, L., Ansari, N.: Parallel search trie-based scheme for fast IP lookup. In: IEEE Global Telecommunications Conference, GLOBECOM 2007, pp. 210\u2013214 (2007)","DOI":"10.1109\/GLOCOM.2007.47"},{"issue":"2","key":"7_CR14","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/65.912716","volume":"15","author":"MA Ruiz-Sanchez","year":"2001","unstructured":"Ruiz-Sanchez, M.A., Biersack, E.W., Dabbous, W.: Survey and taxonomy of IP address lookup algorithms. IEEE Netw. 15(2), 8\u201323 (2001)","journal-title":"IEEE Netw."},{"issue":"4","key":"7_CR15","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1109\/TNET.2003.815288","volume":"11","author":"Sartaj Sahni and Kun Suk Kim","year":"2003","unstructured":"Sartaj Sahni and Kun Suk Kim: Efficient construction of multibit tries for IP lookup. IEEE\/ACM Trans. Netw. (TON) 11(4), 650\u2013662 (2003)","journal-title":"IEEE\/ACM Trans. Netw. (TON)"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Sajeev, G.P., Nair, L.M.: LASER: a novel hybrid peer to peer network traffic classification technique. In: 2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI), pp. 1364\u20131370 (2016)","DOI":"10.1109\/ICACCI.2016.7732238"},{"key":"7_CR17","unstructured":"Shekhar, A., Goyal, J.: Parallel binary search trees for rapid IP lookup using graphic processors. In: 2nd International Conference on Information Management in the Knowledge Economy (IMKE), pp. 176\u2013179 (2013)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Veeramani, S., Mahammad, N.: Minimization of flow table for TCAM based openflow switches by virtual compression approach. In: IEEE International Conference on Advanced Networks and Telecommunication Systems (ANTS), pp. 1\u20134 (2013)","DOI":"10.1109\/ANTS.2013.6802865"},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/277858.277863","volume":"26","author":"V Srinivasan","year":"1998","unstructured":"Srinivasan, V., Varghese, G.: Faster IP lookups using controlled prefix expansion. ACM SIGMETRICS Perform. Eval. Rev. 26(1), 1\u201310 (1998)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Veeramani, S., Mahammad, N.: Hybrid trie based partitioning of TCAM based openflow switches. In: IEEE IEEE International Conference on Advanced Networks and Telecommunication Systems (ANTS), pp. 1\u20135 (2013)","DOI":"10.1109\/ANTS.2013.6802844"},{"issue":"2","key":"7_CR21","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s11107-014-0466-y","volume":"28","author":"S Veeramani","year":"2014","unstructured":"Veeramani, S., Mahammad, N.: Efficient IP lookup using hybrid trie-based partitioning of TCAM-based Openflow switches. Photonic Netw. Commun. 28(2), 135\u2013145 (2014)","journal-title":"Photonic Netw. Commun."},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Veeramani, S., Rahul Sharma, S., Noor Mahammad, SK.: Constructing scalable hierarchical switched openflow network using adaptive replacement of flow table management. In: 2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS), pp. 1\u20133 (2013)","DOI":"10.1109\/ANTS.2013.6802862"},{"issue":"7","key":"7_CR23","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/LCOMM.2005.1461694","volume":"9","author":"C Yim","year":"2005","unstructured":"Yim, C., Lee, B., Lim, H.: Efficient binary search for IP address lookup. IEEE Commun. Lett. 9(7), 652\u2013654 (2005)","journal-title":"IEEE Commun. Lett."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Intelligent Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-24848-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T20:34:17Z","timestamp":1728678857000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-24848-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031248474","9783031248481"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-24848-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDCIT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Distributed Computing and Intelligent Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneswar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 January 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 January 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icdcit2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icdcit.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}