{"id":"https://openalex.org/W1560106201","doi":"https://doi.org/10.1109/infcom.2003.1208660","title":"Adaptive data structures for IP lookups","display_name":"Adaptive data structures for IP lookups","publication_year":2004,"publication_date":"2004-03-02","ids":{"openalex":"https://openalex.org/W1560106201","doi":"https://doi.org/10.1109/infcom.2003.1208660","mag":"1560106201"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2003.1208660","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2003.1208660","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080008170","display_name":"Ioannis Ioannidis","orcid":"https://orcid.org/0000-0002-0529-4824"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"I. Ioannidis","raw_affiliation_strings":["Department of Computer Sciences, Purdue University, West Lafayette, IN, USA","Department of Computer Science, Purdue University, West Lafayette IN, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019202832","display_name":"Ananth Grama","orcid":"https://orcid.org/0000-0002-9378-9244"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ananth Grama","raw_affiliation_strings":["Department of Computer Sciences, Purdue University, West Lafayette, IN, USA","Department of Computer Science, Purdue University, West Lafayette IN, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113562454","display_name":"Mikhail J. Atallah","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Atallah","raw_affiliation_strings":["Department of Computer Sciences, Purdue University, West Lafayette, IN, USA","Department of Computer Science, Purdue University, West Lafayette IN, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette IN, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5080008170"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":1.5846,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.81580873,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"1","issue":null,"first_page":"75","last_page":"84"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.983299970626831,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9721999764442444,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.8596033453941345},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7751994132995605},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6385496258735657},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.6038472056388855},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.5938048362731934},{"id":"https://openalex.org/keywords/router","display_name":"Router","score":0.5424230694770813},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5119236707687378},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46994903683662415},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.4275818169116974},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39511004090309143},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36029624938964844},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14047735929489136}],"concepts":[{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.8596033453941345},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7751994132995605},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6385496258735657},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.6038472056388855},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5938048362731934},{"id":"https://openalex.org/C2775896111","wikidata":"https://www.wikidata.org/wiki/Q642560","display_name":"Router","level":2,"score":0.5424230694770813},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5119236707687378},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46994903683662415},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.4275818169116974},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39511004090309143},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36029624938964844},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14047735929489136},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infcom.2003.1208660","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2003.1208660","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.12.5737","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.5737","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ieee-infocom.org/2003/papers/02_04.PDF","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309036","display_name":"Purdue University","ror":"https://ror.org/02dqehb95"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W179820653","https://openalex.org/W1600636947","https://openalex.org/W1802176962","https://openalex.org/W1990388142","https://openalex.org/W2049919593","https://openalex.org/W2068558784","https://openalex.org/W2081145547","https://openalex.org/W2104785447","https://openalex.org/W2111695485","https://openalex.org/W2115183763","https://openalex.org/W2121021091","https://openalex.org/W2121654675","https://openalex.org/W2129460177","https://openalex.org/W2140037362","https://openalex.org/W2141006890","https://openalex.org/W2147749336","https://openalex.org/W2147900802","https://openalex.org/W2165126126","https://openalex.org/W4210459685","https://openalex.org/W4238334627","https://openalex.org/W6607263602","https://openalex.org/W6635760005","https://openalex.org/W6676533105","https://openalex.org/W6681889181"],"related_works":["https://openalex.org/W1539167344","https://openalex.org/W2254826453","https://openalex.org/W3197499346","https://openalex.org/W59193048","https://openalex.org/W2021988580","https://openalex.org/W2344633058","https://openalex.org/W2000568570","https://openalex.org/W2167571888","https://openalex.org/W2951419104","https://openalex.org/W2145437447"],"abstract_inverted_index":{"The":[0,192],"problem":[1,32,100],"of":[2,33,43,86,90,150,165,176,183,185,194,203,228,249],"efficient":[3,148],"data":[4,108],"structures":[5],"for":[6,50,98,105,118,199,245],"IP":[7],"lookups":[8],"has":[9],"been":[10],"well":[11],"studied":[12],"in":[13],"literature.":[14],"Techniques":[15],"such":[16],"as":[17],"LC":[18,35],"tries":[19,36],"and":[20,37,66,101,172,188,207,226],"extensible":[21,38,243],"hashing":[22,244],"are":[23,111],"commonly":[24],"used.":[25],"In":[26,212],"this":[27,99,151,213],"paper,":[28],"we":[29],"address":[30],"the":[31,67,71,78,87,106,123,126,130,144,181,186,204,224,229,246],"generalizing":[34],"hashing,":[39],"based":[40],"on":[41,116,140,231],"traces":[42],"past":[44],"lookups,":[45],"to":[46,82,143],"provide":[47],"performance":[48,225],"guarantees":[49],"memory":[51,69,114,138],"sub-optimal":[52],"structures.":[53],"As":[54],"a":[55,59,95,162,173,195,200],"specific":[56],"example,":[57],"if":[58,104],"memory-optimal":[60],"(LC)":[61],"trie":[62,79,187,196],"takes":[63],"6":[64],"MB":[65,89],"total":[68],"at":[70],"router":[72],"is":[73,180,197,208],"8":[74],"MB,":[75],"how":[76],"should":[77],"be":[80],"modified":[81],"make":[83],"best":[84],"use":[85],"2":[88],"excess":[91],"memory?":[92],"We":[93,157,221,235],"present":[94],"greedy":[96,131],"algorithm":[97,132,152,230,240],"prove":[102],"that,":[103],"optimal":[107],"structure":[109],"there":[110],"b":[112],"fewer":[113,137],"accesses":[115,139],"average":[117,141],"each":[119],"lookup":[120],"compared":[121],"with":[122,161],"original":[124,145],"trie,":[125],"solution":[127],"produced":[128],"by":[129],"will":[133],"have":[134],"9/spl":[135],"times/b/22":[136],"(compared":[142],"trie).":[146],"An":[147],"implementation":[149,160],"presents":[153],"significant":[154],"additional":[155],"challenges.":[156],"describe":[158],"an":[159],"time":[163],"complexity":[164,175],"O(/spl":[166],"xi/(d)n":[167],"/spl":[168,215],"times/":[169],"log":[170],"n)":[171],"space":[174],"O(n),":[177],"where":[178],"n":[179],"number":[182],"nodes":[184],"d":[189],"its":[190],"depth.":[191],"depth":[193],"fixed":[198],"given":[201],"version":[202],"Internet":[205],"protocol":[206],"typically":[209],"O(log":[210],"n).":[211,220],"case,":[214],"xi/(d)":[216],"=":[217],"O(log/sup":[218],"2/":[219],"demonstrate":[222],"experimentally":[223],"scalability":[227],"actual":[232],"routing":[233],"data.":[234],"also":[236],"show":[237],"that":[238],"our":[239],"significantly":[241],"outperforms":[242],"same":[247],"amount":[248],"memory.":[250]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}