{"id":"https://openalex.org/W2150351561","doi":"https://doi.org/10.1109/glocom.2003.1258969","title":"A memory-efficient scheme for address lookup using compact prefix tries","display_name":"A memory-efficient scheme for address lookup using compact prefix tries","publication_year":2004,"publication_date":"2004-03-22","ids":{"openalex":"https://openalex.org/W2150351561","doi":"https://doi.org/10.1109/glocom.2003.1258969","mag":"2150351561"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2003.1258969","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2003.1258969","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","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/A5087728179","display_name":"A. Sarda","orcid":null},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"A. Sarda","raw_affiliation_strings":["Department of Computer Science and Engineering, Arizona State University, Tempe, AZ, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110923699","display_name":"A. Sen","orcid":null},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Sen","raw_affiliation_strings":["Department of Computer Science and Engineering, Arizona State University, Tempe, AZ, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087728179"],"corresponding_institution_ids":["https://openalex.org/I55732556"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17408326,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":null,"first_page":"3943","last_page":"3947"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":1.0,"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":1.0,"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.9811999797821045,"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/T10400","display_name":"Network Security and Intrusion Detection","score":0.9729999899864197,"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/computer-science","display_name":"Computer science","score":0.8050515055656433},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.6745845079421997},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6271072626113892},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5794099569320679},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.497421532869339},{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.4938519597053528},{"id":"https://openalex.org/keywords/router","display_name":"Router","score":0.4911751449108124},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.47326424717903137},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.46831613779067993},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.46221843361854553},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.45171549916267395},{"id":"https://openalex.org/keywords/lookup-table","display_name":"Lookup table","score":0.45079025626182556},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.41263532638549805},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.4122953712940216},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36588120460510254},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.35617589950561523},{"id":"https://openalex.org/keywords/overlay","display_name":"Overlay","score":0.27296173572540283},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.23501768708229065},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.11306631565093994},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.10084280371665955},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0943249762058258}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8050515055656433},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.6745845079421997},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6271072626113892},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5794099569320679},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.497421532869339},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.4938519597053528},{"id":"https://openalex.org/C2775896111","wikidata":"https://www.wikidata.org/wiki/Q642560","display_name":"Router","level":2,"score":0.4911751449108124},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.47326424717903137},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.46831613779067993},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.46221843361854553},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.45171549916267395},{"id":"https://openalex.org/C134835016","wikidata":"https://www.wikidata.org/wiki/Q690265","display_name":"Lookup table","level":2,"score":0.45079025626182556},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.41263532638549805},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.4122953712940216},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36588120460510254},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.35617589950561523},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.27296173572540283},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.23501768708229065},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.11306631565093994},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.10084280371665955},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0943249762058258},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2003.1258969","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2003.1258969","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W179820653","https://openalex.org/W1600636947","https://openalex.org/W2081145547","https://openalex.org/W2108190694","https://openalex.org/W2108712752","https://openalex.org/W2111695485","https://openalex.org/W2141006890","https://openalex.org/W2155512447","https://openalex.org/W2337480916","https://openalex.org/W6635760005"],"related_works":["https://openalex.org/W54192826","https://openalex.org/W2074308207","https://openalex.org/W2395357979","https://openalex.org/W2795037468","https://openalex.org/W1754202134","https://openalex.org/W3092113474","https://openalex.org/W2800763970","https://openalex.org/W1982065671","https://openalex.org/W2523370762","https://openalex.org/W2640654012"],"abstract_inverted_index":{"We":[0,18],"present":[1],"a":[2,31,36,42,150],"new":[3],"memory-efficient":[4],"scheme":[5,47,154],"for":[6,71,100,108,158],"address":[7],"lookup":[8,81,129],"that":[9,39],"exploits":[10],"the":[11,68,96,133],"caching":[12],"support":[13],"provided":[14],"by":[15],"general-purpose":[16],"processors.":[17],"propose":[19],"compact":[20,72,109],"prefix":[21,73,110],"tries,":[22,111],"in":[23,41,50,80,88,121],"which":[24],"prefixes":[25],"occurring":[26],"at":[27],"multiple":[28],"levels":[29],"of":[30,123],"subtrie":[32],"are":[33],"compressed":[34,147],"into":[35,148],"single":[37,43],"node":[38],"fits":[40],"cache":[44],"line.":[45],"The":[46],"performs":[48],"well":[49,54,127],"compressing":[51],"dense":[52],"as":[53,55,126,128,132],"sparse":[56,140],"tries.":[57],"For":[58],"an":[59],"IP":[60],"core":[61],"router":[62],"(Mae-West)":[63],"database":[64],"with":[65,92,114,142],"93354":[66],"prefixes,":[67],"simulation":[69],"results":[70,120],"tries":[74,141],"show":[75,118],"up":[76,84],"to":[77,85],"70%":[78],"improvement":[79],"performance":[82],"and":[83,139],"33%":[86],"reduction":[87],"memory":[89,124,134],"when":[90,112],"compared":[91,113],"LC-tries.":[93],"In":[94],"fact,":[95],"entire":[97],"forwarding":[98],"table":[99],"Mae-West":[101],"required":[102],"only":[103,149],"829":[104],"KB":[105],"space.":[106],"Measurements":[107],"most":[115],"existing":[116],"schemes,":[117],"better":[119],"terms":[122],"usage":[125,135],"speeds.":[130],"Moreover,":[131],"is":[136,155],"significantly":[137],"less":[138],"long":[143],"paths":[144],"can":[145],"be":[146],"few":[151],"nodes,":[152],"this":[153],"particularly":[156],"attractive":[157],"IPv6.":[159]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}