{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T22:40:31Z","timestamp":1740264031090,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540259206"},{"type":"electronic","value":"9783540320784"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11427186_50","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T21:38:24Z","timestamp":1279057104000},"page":"580-592","source":"Crossref","is-referenced-by-count":1,"title":["Distilling Router Data Analysis for Faster and Simpler Dynamic IP\u00a0Lookup Algorithms"],"prefix":"10.1007","author":[{"given":"Filippo","family":"Geraci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50_CR1","doi-asserted-by":"crossref","unstructured":"Aho, A.V., Sloane, N.J.A.: Some doubly exponential sequences. Fibonacci Quarterly, 429\u2013437 (1973)","DOI":"10.1080\/00150517.1973.12430815"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Aida, M., Abe, T.: Pseudo-address generation algorithm of packet destinations for internet performance simulation. In: IEEE INFOCOM, pp. 1425\u20131433 (2001)","DOI":"10.1109\/INFCOM.2001.916638"},{"key":"50_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/996546.996550","volume":"8","author":"A.L. Buchsbaum","year":"2003","unstructured":"Buchsbaum, A.L., Fowler, G.S., Kirishnamurthy, B., Vo, K.-P., Wang, J.: Fast prefix matching of bounded strings. J. Exp. Algorithmics\u00a08, 1\u20133 (2003)","journal-title":"J. Exp. Algorithmics"},{"key":"50_CR4","doi-asserted-by":"crossref","unstructured":"Crescenzi, P., Dardini, L., Grossi, R.: IP address lookup made fast and simple. In: Proce. 7th Annual European Symposium on Algorithms, pp. 65\u201376 (1999)","DOI":"10.1007\/3-540-48481-7_7"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"Deering, S., Hinden, R.: Internet protocol, version 6 (IPv6). RFC 1883 (1995)","DOI":"10.17487\/rfc1883"},{"key":"50_CR6","doi-asserted-by":"crossref","unstructured":"Dharmapurikar, S., Krishnamurthy, P., Taylor, D.E.: Longest prefix matching using bloom filters. In: IEEE INFOCOM, pp. 201\u2013212 (2003)","DOI":"10.1145\/863955.863979"},{"issue":"2","key":"50_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/997150.997160","volume":"34","author":"W. Eatherton","year":"2004","unstructured":"Eatherton, W., Varghese, G., Dittia, Z.: Tree bitmap: hardware\/software IP lookups with incremental updates. SIGCOMM Comput. Commun. Rev.\u00a034(2), 97\u2013122 (2004)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"Geraci, F., Grossi, R.: Distilling router data analysis for faster and simpler dynamic IP lookup algorithms. Tech. Report TR-05-01, Universit\u00e0 di Pisa (January 2005)","DOI":"10.1007\/11427186_50"},{"key":"50_CR9","unstructured":"Goodell, G., Aiello, W., Griffin, T., Ioannidis, J., McDaniel, P., Rubin, A.: Working around BGP: An incremental approach to improving security and accuracy of interdomain routing. In: Network and Distributed System Security Symposium (2003)"},{"key":"50_CR10","unstructured":"Labovitz, C., Jahanian, F., Johnson, S., Malan, R., Harris, S.R., Wan, J., Agrawal, M., Zhu, D., Ahuja, A., Poland, J.: Internet Performance Measurement and Analysis (IPMA) statistics (1999), http:\/\/www.merit.edu\/ipma"},{"issue":"3","key":"50_CR11","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1109\/90.779199","volume":"7","author":"B. Lampson","year":"1999","unstructured":"Lampson, B., Srinivasan, V., Varghese, G.: IP lookups using multiway and multicolumn search. IEEE\/ACM Transactions on Networking\u00a07(3), 324\u2013334 (1999)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"50_CR12","doi-asserted-by":"crossref","unstructured":"Pellegrini, M., Fusco, G.: Efficient IP table lookup via adaptive stratified trees with selective reconstructions. In: 12th European Symp. on Algorithms, pp. 24\u201335 (2004)","DOI":"10.1007\/978-3-540-30140-0_68"},{"key":"50_CR13","doi-asserted-by":"crossref","unstructured":"Postel, J.: Internet protocol. RFC 791 (1981)","DOI":"10.17487\/rfc0791"},{"key":"50_CR14","unstructured":"Network Coordination Centre of the R\u00e9seaux IP Europ\u00e9ens (RIPE NCC). Routing information service project, Amsterdam router (2003), http:\/\/www.ripe.net\/ris\/index.html"},{"key":"50_CR15","unstructured":"Rizzo, L.: Personal communication (2003)"},{"key":"50_CR16","doi-asserted-by":"crossref","unstructured":"Ruiz-Sanchez, M.A., Biersack, E.W., Dabbous, W.: Survey and taxonomy of IP address lookup algorithms. IEEE Network, 8\u201323 (2001)","DOI":"10.1109\/65.912716"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11427186_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T22:00:36Z","timestamp":1740261636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11427186_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259206","9783540320784"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11427186_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}