{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:35:27Z","timestamp":1742384127450,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/infcom.2003.1208660","type":"proceedings-article","created":{"date-parts":[[2004,3,2]],"date-time":"2004-03-02T02:26:50Z","timestamp":1078194410000},"page":"75-84","source":"Crossref","is-referenced-by-count":6,"title":["Adaptive data structures for IP lookups"],"prefix":"10.1109","volume":"1","author":[{"given":"I.","family":"Ioannidis","sequence":"first","affiliation":[]},{"family":"Ananth Grama","sequence":"additional","affiliation":[]},{"given":"M.","family":"Atallah","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Knapsack Problems","year":"1990","author":"martello","key":"19"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.752164"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.1999.755661"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/277851.277863"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662939"},{"key":"13","article-title":"Small forwarding tables for fast routing lookups","author":"degermark","year":"0","journal-title":"Proceedings of SIGCOMM '97"},{"key":"14","article-title":"Fast address look-up for internet routers","author":"nilsson","year":"0","journal-title":"Proceedings of IEEE Communications Magazine"},{"key":"11","article-title":"IP address lookup made fast and simple","volume":"tr 99 1","author":"crescenzi","year":"0","journal-title":"Technical Report"},{"key":"12","article-title":"Scalable high-speed IP routing lookups","author":"waldvogel","year":"0","journal-title":"Proceedings of SIGCOMM '97"},{"journal-title":"Fast Multilevel Hierarchical Routing Table Using Content-Addressable Memory","year":"0","author":"mcauley","key":"3"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662938"},{"key":"1","article-title":"A tree-based routing table for berkeley unix","author":"sklower","year":"1991","journal-title":"Proceedings of the 1991 Winter USENIX Conference"},{"key":"10","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1145\/347059.347565","article-title":"Memory-efficient state lookups with fast updates","author":"sikka","year":"2000","journal-title":"Proceedings of SIGCOMM 2000"},{"key":"7","article-title":"IP\/ATM: A strategy for integrating IP with ATM","author":"parulkar","year":"0","journal-title":"Proc SIGCOMM 95"},{"key":"6","doi-asserted-by":"crossref","DOI":"10.1145\/347059.347428","article-title":"Internet routing instability","author":"labovitz","year":"0","journal-title":"Proceedings of SIGCOMM '97"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/90.490742"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/35.568212"},{"journal-title":"Routing with a Clue","year":"0","author":"bremler-barr","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2105"}],"event":{"name":"IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies","acronym":"INFCOM-03","location":"San Francisco, CA, USA"},"container-title":["IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8585\/27205\/01208660.pdf?arnumber=1208660","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,28]],"date-time":"2023-04-28T01:41:29Z","timestamp":1682646089000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1208660\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/infcom.2003.1208660","relation":{},"subject":[]}}