{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:01:23Z","timestamp":1725534083620},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020933"},{"type":"electronic","value":"9783642020940"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02094-0_15","type":"book-chapter","created":{"date-parts":[[2009,6,27]],"date-time":"2009-06-27T10:45:07Z","timestamp":1246099507000},"page":"319-329","source":"Crossref","is-referenced-by-count":1,"title":["New Data Structures for IP Lookup and Conflict Detection"],"prefix":"10.1007","author":[{"given":"Christine","family":"Maindorfer","sequence":"first","affiliation":[]},{"given":"Tobias","family":"Lauer","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Ottmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"E.M. McCreight","year":"1985","unstructured":"McCreight, E.M.: Priority search trees. SIAM J. Comput.\u00a014(2), 257\u2013276 (1985)","journal-title":"SIAM J. Comput."},{"issue":"10","key":"15_CR2","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1109\/TC.2004.81","volume":"53","author":"H. Lu","year":"2004","unstructured":"Lu, H., Sahni, S.: O(logn) dynamic router-tables for prefixes and ranges. IEEE Transanctions on Computers\u00a053(10), 1217\u20131230 (2004)","journal-title":"IEEE Transanctions on Computers"},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/TC.2007.250621","volume":"56","author":"K.S. Kim","year":"2007","unstructured":"Kim, K.S., Sahni, S.: Efficient construction of pipelined multibit-trie router-tables. IEEE Transactions on Computers\u00a056(1), 32\u201343 (2007)","journal-title":"IEEE Transactions on Computers"},{"key":"15_CR4","first-page":"358","volume-title":"ICNP 2005: Proceedings of the 13th IEEE International Conference on Network Protocols (ICNP 2005)","author":"H. Song","year":"2005","unstructured":"Song, H., Turner, J., Lockwood, J.: Shape shifting tries for faster IP route lookup. In: ICNP 2005: Proceedings of the 13th IEEE International Conference on Network Protocols (ICNP 2005), Washington, DC, USA, pp. 358\u2013367. IEEE Computer Society, Los Alamitos (2005)"},{"doi-asserted-by":"crossref","unstructured":"Ioannidis, I., Grama, A., Atallah, M.: Adaptive data structures for IP lookups. J. Exp. Algorithmics\u00a010, Article No. 1.1 (2005)","key":"15_CR5","DOI":"10.1145\/1064546.1064548"},{"doi-asserted-by":"crossref","unstructured":"Lu, W., Sahni, S.: Recursively partitioned static IP router-tables. In: 12th IEEE Symposium on Computers and Communications, pp. 437\u2013442 (2007)","key":"15_CR6","DOI":"10.1109\/ISCC.2007.4381472"},{"key":"15_CR7","first-page":"1","volume-title":"SIGMETRICS 1998\/PERFORMANCE 1998: Proceedings of the 1998 ACM SIGMETRICS Joint International Conference on Measurement and Modeling of Computer Systems","author":"V. Srinivasan","year":"1998","unstructured":"Srinivasan, V., Varghese, G.: Faster IP lookups using controlled prefix expansion. In: SIGMETRICS 1998\/PERFORMANCE 1998: Proceedings of the 1998 ACM SIGMETRICS Joint International Conference on Measurement and Modeling of Computer Systems, pp. 1\u201310. ACM Press, New York (1998)"},{"doi-asserted-by":"crossref","unstructured":"Lu, W., Sahni, S.: Succinct representation of static packet classifiers. In: 12th IEEE Symposium on Computers and Communications, pp. 1119\u20131124 (2007)","key":"15_CR8","DOI":"10.1109\/ISCC.2007.4381474"},{"issue":"1,2","key":"15_CR9","first-page":"181","volume":"56","author":"I. Lee","year":"2003","unstructured":"Lee, I., Park, K., Choi, Y., Chung, S.K.: A simple and scalable algorithm for the IP address lookup problem. Fundamenta Informaticae\u00a056(1,2), 181\u2013190 (2003)","journal-title":"Fundamenta Informaticae"},{"issue":"12","key":"15_CR10","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1109\/TC.2004.116","volume":"53","author":"H. Lu","year":"2004","unstructured":"Lu, H., Sahni, S.: Enhanced interval trees for dynamic IP router-tables. IEEE Transactions on Computers\u00a053(12), 1615\u20131628 (2004)","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"15_CR11","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.comnet.2003.09.004","volume":"44","author":"P. Warkhede","year":"2004","unstructured":"Warkhede, P., Suri, S., Varghese, G.: Multiway range trees: scalable IP lookup with fast updates. Computer Networks\u00a044(3), 289\u2013303 (2004)","journal-title":"Computer Networks"},{"key":"15_CR12","first-page":"1203","volume-title":"INFOCOM 2000: Proceedings of the Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies","author":"A. Hari","year":"2000","unstructured":"Hari, A., Suri, S., Parulkar, G.: Detecting and resolving packet filter conflicts. In: INFOCOM 2000: Proceedings of the Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 1203\u20131212. IEEE Press, Los Alamitos (2000)"},{"issue":"6","key":"15_CR13","doi-asserted-by":"publisher","first-page":"1353","DOI":"10.1109\/TNET.2005.860108","volume":"13","author":"H. Lu","year":"2005","unstructured":"Lu, H., Sahni, S.: Conflict detection and resolution in two-dimensional prefix router tables. IEEE\/ACM Transactions on Networking\u00a013(6), 1353\u20131363 (2005)","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"1","key":"15_CR14","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1142\/S0129054107004607","volume":"18","author":"T. Lauer","year":"2007","unstructured":"Lauer, T., Ottmann, T., Datta, A.: Update-efficient data structures for dynamic IP router tables. International Journal of Foundations of Computer Science\u00a018(1), 139\u2013161 (2007)","journal-title":"International Journal of Foundations of Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Hinze, R.: A simple implementation technique for priority search queues. In: International Conference on Functional Programming, pp. 110\u2013121 (2001)","key":"15_CR15","DOI":"10.1145\/507635.507650"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/3-540-48318-7_23","volume-title":"Algorithm Engineering","author":"S. Hanke","year":"1999","unstructured":"Hanke, S.: The performance of concurrent red-black tree algorithms. In: Vitter, J.S., Zaroliagis, C.D. (eds.) WAE 1999. LNCS, vol.\u00a01668, pp. 286\u2013300. Springer, Heidelberg (1999)"},{"doi-asserted-by":"crossref","unstructured":"Maindorfer, C., B\u00e4r, B., Ottmann, T.: Relaxed min-augmented range trees for the representation of dynamic IP router tables. In: 13th IEEE Symposium on Computers and Communications, pp. 920\u2013927 (2008)","key":"15_CR17","DOI":"10.1109\/ISCC.2008.4625595"},{"unstructured":"Ottmann, T., Soisalon-Soininen, E.: Relaxed balancing made simple. Technical Report\u00a071, Institut f\u00fcr Informatik, Albert-Ludwigs-Universit\u00e4t Freiburg (1995)","key":"15_CR18"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-62592-5_72","volume-title":"Algorithms and Complexity","author":"S. Hanke","year":"1997","unstructured":"Hanke, S., Ottmann, T., Soisalon-Soininen, E.: Relaxed balanced red-black trees. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS, vol.\u00a01203, pp. 193\u2013204. Springer, Heidelberg (1997)"},{"doi-asserted-by":"crossref","unstructured":"Maindorfer, C., Mohamed, K.A., Ottmann, T., Datta, A.: A new output-sensitive algorithm to detect and resolve conflicts in Internet router tables. In: INFOCOM 2007. 26th IEEE Conference on Computer Communications, pp. 2431\u20132435 (2007)","key":"15_CR20","DOI":"10.1109\/INFCOM.2007.295"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/12130.12142","volume-title":"STOC 1986: Proceedings of the eighteenth annual ACM symposium on Theory of computing","author":"J.R. Driscoll","year":"1986","unstructured":"Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. In: STOC 1986: Proceedings of the eighteenth annual ACM symposium on Theory of computing, pp. 109\u2013121. ACM Press, New York (1986)"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-540-69311-6_13","volume-title":"Frontiers in Algorithmics","author":"K.A. Mohamed","year":"2008","unstructured":"Mohamed, K.A., Langner, T., Ottmann, T.: Versioning tree structures by path-merging. In: Preparata, F.P., Wu, X., Yin, J. (eds.) FAW 2008. LNCS, vol.\u00a05059, pp. 101\u2013112. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithmics of Large and Complex Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02094-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:46:35Z","timestamp":1558395995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02094-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020933","9783642020940"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02094-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}