{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T14:53:51Z","timestamp":1729608831453,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/glocom.2003.1258969","type":"proceedings-article","created":{"date-parts":[[2004,3,22]],"date-time":"2004-03-22T09:34:28Z","timestamp":1079948068000},"page":"3943-3947","source":"Crossref","is-referenced-by-count":0,"title":["A memory-efficient scheme for address lookup using compact prefix tries"],"prefix":"10.1109","author":[{"given":"A.","family":"Sarda","sequence":"first","affiliation":[]},{"given":"A.","family":"Sen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35378-4_2"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/49.772439"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/65.912716"},{"key":"ref13","article-title":"A memory-efficient scheme for IP Address Lookup using Compact Prefix Tries","author":"sarda","year":"2003","journal-title":"Dept of Computer Science and Engineering Arizona State University"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/277851.277863"},{"article-title":"Hardware-Based Internet Protocol Prefix Lookups","year":"1999","author":"eatherton","key":"ref4"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1145\/263105.263133","article-title":"Small Forwarding Tables for Fast Routing Lookups","author":"degermark","year":"1997","journal-title":"Proceedings of ACM SIGCOMM"},{"journal-title":"IPMA Routing Table Snapshots","year":"0","key":"ref6"},{"journal-title":"Trie Memory Communications of the ACM","year":"1960","author":"fredkin","key":"ref5"},{"journal-title":"LMbench Tools for performance analysis","year":"0","key":"ref8"},{"journal-title":"IP Lookups using Multiway and Multi-column search IEEE\/ACM TON","year":"1999","author":"lampson","key":"ref7"},{"key":"ref2","first-page":"65","article-title":"IP Address Lookup Made Fast and Simple","author":"crescenzi","year":"1999","journal-title":"European Symposium on Algorithms"},{"journal-title":"Optimal Routing Table Design for IP Address Lookups Under Memory Constraints Infocom","year":"1999","author":"cheung","key":"ref1"},{"key":"ref9","first-page":"514","volume":"15","author":"morrison","year":"1968","journal-title":"PATRICIA - Practical Algorithm to Retrieve Information Coded in Alphanumeric J ACM"}],"event":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference","acronym":"GLOCOM-03","location":"San Francisco, CA, USA"},"container-title":["GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8900\/28138\/01258969.pdf?arnumber=1258969","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T00:26:54Z","timestamp":1497572814000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1258969\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/glocom.2003.1258969","relation":{},"subject":[]}}