{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:23:19Z","timestamp":1737436999607,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540738138"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73814-5_19","type":"book-chapter","created":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T05:31:44Z","timestamp":1188624704000},"page":"204-215","source":"Crossref","is-referenced-by-count":0,"title":["Using Bit Selection to Do Routing Table Lookup"],"prefix":"10.1007","author":[{"given":"Zhenqiang","family":"Li","sequence":"first","affiliation":[]},{"given":"Dongqu","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Yan","family":"Ma","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Deering, S., Hinden, R.: Internet protocol version 6 specification. RFC2460 (December 1998)","DOI":"10.17487\/rfc2460"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Fink, R., Hinden, R.: 6bone (IPv6 testing address allocation) phaseout. RFC3701 (March 2004)","DOI":"10.17487\/rfc3701"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/65.912716","volume":"15","author":"M. Ruiz-Sbnches","year":"2001","unstructured":"Ruiz-Sbnches, M., Biersack, E., Dabbous, W.: Survey and taxonomy of IP address lookup algorithms. IEEE Network\u00a015(2), 8\u201323 (2001)","journal-title":"IEEE Network"},{"key":"19_CR4","unstructured":"Sklower, K.: A tree-based packet routing table for Berkeley Unix. In: 1991 Winter USENIX Conf., pp. 93\u201399 (1991)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Gupta, P., Lin, S., McKeown, N.: Routing lookups in hardware at memory access speed. In: IEEE INFOCOM, pp. 1240\u20131247 (1998)","DOI":"10.1109\/INFCOM.1998.662938"},{"issue":"6","key":"19_CR6","first-page":"1083","volume":"17","author":"S. Nilsson","year":"1999","unstructured":"Nilsson, S., Karlsson, G.: IP-address lookup using LC-tries. IEEE JSAS\u00a017(6), 1083\u20131092 (1999)","journal-title":"IEEE JSAS"},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/997150.997160","volume":"34","author":"W. Eatherton","year":"2004","unstructured":"Eatherton, W., Dittia, Z., Varghese, G.: Tree bitmap: hardware\/ software IP lookups with incremental updates. ACM SIGCOMM Computer Communication Review\u00a034(2), 97\u2013122 (2004)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Li, Z., Ma, Y.: Trie-based observations on the routing tables. In: Japan-China Joint Workshop on Frontier of Computer Science and Technology, pp. 157\u2013163 (November 2006)","DOI":"10.1109\/FCST.2006.33"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Srinivasan, V., Varghese, G.: Fast address lookups using controlled prefix expansion. ACM Sigmetrics, 1\u201311 (June 1998)","DOI":"10.1145\/277858.277863"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Wuu, L., Chen, K., Liu, T.: A longest prefix first search tree for IP lookup. IEEE ICC, 989\u2013993 (May 2005)","DOI":"10.1109\/ICC.2005.1494497"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Woo, T.Y.C.: A modular approach to packet classification: algorithms and results. In: IEEE INFOCOM, pp. 1213\u20131222 (March 2000)","DOI":"10.1109\/INFCOM.2000.832499"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Lampson, B., Srinivasan, V., Varghese, G.: IP lookups using multiway and multicolumn search. In: IEEE INFOCOM, pp. 1248\u20131256 (March 1998)","DOI":"10.1109\/INFCOM.1998.662939"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Zheng, K., Liu, B.: V6Gene: a scalable IPv6 prefix generator for route lookup algorithm benchmark. In: IEEE AINA, pp. 147\u2013152 (April 2006)","DOI":"10.1109\/AINA.2006.344"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73814-5_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T20:02:48Z","timestamp":1737403368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73814-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540738138"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73814-5_19","relation":{},"subject":[]}}