{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:36:27Z","timestamp":1725496587989},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404569"},{"type":"electronic","value":"9783540450368"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45036-x_57","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T07:33:07Z","timestamp":1196667187000},"page":"566-575","source":"Crossref","is-referenced-by-count":0,"title":["The Bitmap Trie for Fast Prefix Lookup"],"prefix":"10.1007","author":[{"given":"Seunghyun","family":"Oh","sequence":"first","affiliation":[]},{"given":"Yangsun","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"57_CR1","unstructured":"Keith Sklower: A Tree-Based Routing Table for Berkeley Unix, Technical report. University of California, Berkeley"},{"key":"57_CR2","doi-asserted-by":"crossref","unstructured":"Tong-Bi Pei and Charles Zukowski: Putting Routing Tables in Silicon. IEEE network Magazine (1992)","DOI":"10.1109\/65.120723"},{"key":"57_CR3","unstructured":"A.J. McAuley and P. Francis: Fast routing table lookup using CAMs. Proc. IEEE Infocom\u2019 93, San Francisco (1993) 1382\u20131391"},{"key":"57_CR4","unstructured":"Anthony J. Bloomfeld NJ McAuley, Paul F. Lake Hopatcong NJ Tsuchiya, and Daniel V. Rockaway Township Morris Country NJ Wilson: Fast Multilevel hierarchical routing table using content-addressable memory. U.S. Patent serial number 034444"},{"key":"57_CR5","doi-asserted-by":"crossref","unstructured":"P. Gupta (eds): Routing Lookups in Hardware at Memory Speeds. Proc. IEEE Infocom\u2019 98, San Francisco (1998)","DOI":"10.1109\/INFCOM.1998.662938"},{"key":"57_CR6","doi-asserted-by":"crossref","unstructured":"A. Bremler-Barr, Y. Afek, and S. Har-Peled: Routing with Clue. Proc. ACM SIGCOMM 99, Cambridge (1999)","DOI":"10.1145\/316188.316223"},{"key":"57_CR7","doi-asserted-by":"crossref","unstructured":"Rosen, E., Viswanathan, A. and R. Callon: Multiprotocol Label Switching Architecture. RFC 3031 (2001)","DOI":"10.17487\/rfc3031"},{"issue":"4","key":"57_CR8","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"D. R. Morrison","year":"1968","unstructured":"Donald R. Morrison: PATRICIA-Practical Algorithm to Retrieve Information Coded In Alfanumeric. Journal of the ACM, 15(4) (1968), 514\u2013534","journal-title":"Journal of the ACM"},{"key":"57_CR9","doi-asserted-by":"crossref","unstructured":"Mikael Degermark, Andrej Brodnik, Svante Carlsson, and Stephen pink: Small Forwarding Tables for Fast Routing Lookups. Proc. ACM SIGCOMM\u2019 97 (1997)","DOI":"10.1145\/263105.263133"},{"key":"57_CR10","doi-asserted-by":"crossref","unstructured":"B. Lampson, V. Srinivasan and G. Varghese: IP Lookups using Multiway and Multicolumn Search. Proc. INFOCOM\u2019 98 (1998)","DOI":"10.1109\/INFCOM.1998.662939"},{"key":"57_CR11","unstructured":"S. Venkatachary and G. Varghese: Faster IP Lookups using Controlled Prefix Expansion. Proc. ACM Sigmetrics\u2019 98 (1998)"},{"key":"57_CR12","unstructured":"Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, Data Structure and Algorithms. Addison-Wesley (1983)"},{"key":"57_CR13","unstructured":"T. Kijkanjanarat and H.J. Chao: Fast IP Lookups using a Two-Trie Data Structure. Proc. Globecom\u2019 99 (1999)"},{"key":"57_CR14","unstructured":"Pinar A. Yilmaz, Andrey Belenkiy, Necdet Uzun, and Nitin Gogate: A Trie-based Algorithm for IP Lookup Problem. Proc. Globecom\u2019 00 (2000)"},{"key":"57_CR15","unstructured":"Michigan University and merit Network. Internet Performance Management and Analysis (IPMA) project. http:\/\/nic.merit.edu\/~ipma"},{"key":"57_CR16","doi-asserted-by":"crossref","unstructured":"Marcel Waldvogel, George Varghese, Jon Turner, and Bernhard Plattner: Scalable High Speed IP Routing Lookups. In Proceedings of ACM SIGCOMM\u201997 (1997)","DOI":"10.1145\/263105.263136"},{"key":"57_CR17","doi-asserted-by":"crossref","unstructured":"S. Nilsson and G. karlsson: Fast Address Look-Up for Internet Routers. In Proceedings of IEEE Broadband Communications\u201998 (1998)","DOI":"10.1007\/978-0-387-35378-4_2"}],"container-title":["Lecture Notes in Computer Science","Web and Communication Technologies and Internet-Related Social Issues \u2014 HSI 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45036-X_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T09:19:27Z","timestamp":1557047967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45036-X_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404569","9783540450368"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45036-x_57","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}