{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:58:38Z","timestamp":1725566318237},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230250"},{"type":"electronic","value":"9783540301400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30140-0_68","type":"book-chapter","created":{"date-parts":[[2010,9,18]],"date-time":"2010-09-18T21:31:13Z","timestamp":1284845473000},"page":"772-783","source":"Crossref","is-referenced-by-count":2,"title":["Efficient IP Table Lookup via Adaptive Stratified Trees with Selective Reconstructions"],"prefix":"10.1007","author":[{"given":"Marco","family":"Pellegrini","sequence":"first","affiliation":[]},{"given":"Giordano","family":"Fusco","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"68_CR1","unstructured":"McKeown, N.: Hot interconnects tutorial slides. Stanford University, available at http:\/\/klamath.stanford.edu\/talks\/ (1999)"},{"key":"68_CR2","unstructured":"Suri, S., Varghese, G., Warkhede, P.: Multiwayrange trees: Scalable ip lookup with fast updates. Technical Report 99-28, Washington Universityin St. Luis,Dept. of Computer Science (1999)"},{"key":"68_CR3","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1109\/90.779199","volume":"7","author":"B.W. Lampson","year":"1999","unstructured":"Lampson, B.W., Srinivasan, V., Varghese, G.: IP lookups using multiwayand multicolumn search. IEEE\/ACM Transactions on Networking\u00a07, 324\u2013334 (1999)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"68_CR4","first-page":"1193","volume-title":"Proceedings of INFOCOM","author":"A. Feldmann","year":"2000","unstructured":"Feldmann, A., Muthukrishnan, S.: Tradeoffs for packet classification. In: Proceedings of INFOCOM, vol.\u00a03, pp. 1193\u20131202. IEEE, Los Alamitos (2000)"},{"key":"68_CR5","first-page":"649","volume-title":"Proceedings of the 35th Annual ACM Symposium on Theory of Computing","author":"M. Thorup","year":"2003","unstructured":"Thorup, M.: Space efficient dynamic stabbing with fast queries. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, San Diego, CA, USA, June 9-11, pp. 649\u2013658. ACM, New York (2003)"},{"key":"68_CR6","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1145\/780542.780635","volume-title":"Proceedings of the thirty-fifth ACM symposium on Theory of computing","author":"H. Kaplan","year":"2003","unstructured":"Kaplan, H., Molad, E., Tarjan, R.E.: Dynamic rectangular intersection with priorities. In: Proceedings of the thirty-fifth ACM symposium on Theory of computing, pp. 639\u2013648. ACM Press, New York (2003)"},{"key":"68_CR7","doi-asserted-by":"crossref","unstructured":"Buchsbaum, A.L., Fowler, G.S., Krishnamurthy, B., Vo, K.P., Wang, J.: Fast prefix matching of bounded strings. In: Proceedings of Alenex 2003 (2003)","DOI":"10.1145\/996546.996550"},{"key":"68_CR8","doi-asserted-by":"crossref","unstructured":"Cheung, G., McCanne, S.: Optimal routing table design for IP address lookups under memory constraints. In: INFOCOM, vol.\u00a0(3), pp. 1437\u20131444 (1999)","DOI":"10.1109\/INFCOM.1999.752164"},{"key":"68_CR9","doi-asserted-by":"crossref","unstructured":"Gupta, P., Prabhakar, B., Boyd, S.P.: Near optimal routing lookups with bounded worst case performance. In: INFOCOM, vol.\u00a0(3), pp. 1184\u20131192 (2000)","DOI":"10.1109\/INFCOM.2000.832490"},{"key":"68_CR10","doi-asserted-by":"crossref","unstructured":"Srinivasan, V., Varghese, G.: Fast address lookups using controlled prefix expansion. ACM Transactions on Computer Systems, 1\u201340 (1999)","DOI":"10.1145\/296502.296503"},{"key":"68_CR11","doi-asserted-by":"crossref","unstructured":"Ioannidis, I., Grama, A., Atallah, M.: Adaptive data structures for ip lookups. In: INFOCOM 2003 (2003)","DOI":"10.1109\/INFCOM.2003.1208660"},{"key":"68_CR12","unstructured":"Pellegrini, M., Fusco, G., Vecchiocattivi, G.: Adaptive stratified search trees for ip table lookup. Technical Report TR IIT 22\/2002, Istituto di Informatica e Telematica del CNR (IIT-CNR), Pisa, Italy (2002)"},{"key":"68_CR13","doi-asserted-by":"crossref","unstructured":"Degermark, M., Brodnik, A., Carlsson, S., Pink, S.: Small forwarding tables for fast routing lookups. In: SIGCOMM, pp. 3\u201314 (1997)","DOI":"10.1145\/263105.263133"},{"key":"68_CR14","doi-asserted-by":"crossref","unstructured":"Crescenzi, P., Dardini, L., Grossi, R.: IP address lookup made fast and simple. In: European Symposium on Algorithms, pp. 65\u201376 (1999)","DOI":"10.1007\/3-540-48481-7_7"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30140-0_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:44:43Z","timestamp":1605743083000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30140-0_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230250","9783540301400"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30140-0_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}