{"id":"https://openalex.org/W2161081860","doi":"https://doi.org/10.1587/transcom.e94.b.3128","title":"An Efficient IP Address Lookup Scheme Using Balanced Binary Search with Minimal Entry and Optimal Prefix Vector","display_name":"An Efficient IP Address Lookup Scheme Using Balanced Binary Search with Minimal Entry and Optimal Prefix Vector","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2161081860","doi":"https://doi.org/10.1587/transcom.e94.b.3128","mag":"2161081860"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1587/transcom.e94.b.3128","pdf_url":null,"source":{"id":"https://openalex.org/S2493627025","display_name":"IEICE Transactions on Communications","issn_l":"0916-8516","issn":["0916-8516","1745-1345"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5047162438","display_name":"Hyuntae Park","orcid":null},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hyuntae PARK","raw_affiliation_strings":["Dept. of Electrical and Electronic Eng., Yonsei University"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Electronic Eng., Yonsei University","institution_ids":["https://openalex.org/I193775966"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087766273","display_name":"Hyejeong Hong","orcid":null},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hyejeong HONG","raw_affiliation_strings":["Dept. of Electrical and Electronic Eng., Yonsei University"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Electronic Eng., Yonsei University","institution_ids":["https://openalex.org/I193775966"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068528309","display_name":"Sungho Kang","orcid":"https://orcid.org/0000-0002-7093-2095"},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Sungho KANG","raw_affiliation_strings":["Dept. of Electrical and Electronic Eng., Yonsei University"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Electronic Eng., Yonsei University","institution_ids":["https://openalex.org/I193775966"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":1,"citation_normalized_percentile":{"value":0.504194,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":65,"max":72},"biblio":{"volume":"E94-B","issue":"11","first_page":"3128","last_page":"3131"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9998,"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.9998,"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.923,"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.9175,"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.84178793},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.7291186},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.6518818},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.58502245},{"id":"https://openalex.org/keywords/lookup-table","display_name":"Lookup table","score":0.52081287},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.50760543},{"id":"https://openalex.org/keywords/linear-search","display_name":"Linear search","score":0.42726976}],"concepts":[{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.84178793},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8351027},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.7291186},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.6518818},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.58502245},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.52154326},{"id":"https://openalex.org/C134835016","wikidata":"https://www.wikidata.org/wiki/Q690265","display_name":"Lookup table","level":2,"score":0.52081287},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.50760543},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.49536455},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.48036918},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4788613},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.47379276},{"id":"https://openalex.org/C204259536","wikidata":"https://www.wikidata.org/wiki/Q787903","display_name":"Linear search","level":2,"score":0.42726976},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.41043872},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41017497},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35303515},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.34788275},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.29950562},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.22262323},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.20946795},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.17712358},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14422119},{"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/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.0},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1587/transcom.e94.b.3128","pdf_url":null,"source":{"id":"https://openalex.org/S2493627025","display_name":"IEICE Transactions on Communications","issn_l":"0916-8516","issn":["0916-8516","1745-1345"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":7,"referenced_works":["https://openalex.org/W1521635056","https://openalex.org/W1967495931","https://openalex.org/W2104728907","https://openalex.org/W2120439392","https://openalex.org/W2152309511","https://openalex.org/W2152985513","https://openalex.org/W570611244"],"related_works":["https://openalex.org/W4243071922","https://openalex.org/W4234634192","https://openalex.org/W270522628","https://openalex.org/W2364382882","https://openalex.org/W2161081860","https://openalex.org/W2112680985","https://openalex.org/W2082897356","https://openalex.org/W2072924299","https://openalex.org/W2062200642","https://openalex.org/W115779656"],"abstract_inverted_index":{"Although":[0],"IP":[1,54],"address":[2,55,122],"lookup":[3,56,123,138],"schemes":[4],"using":[5,58],"ternary":[6],"content":[7],"addressable":[8],"memory":[9,24,143],"(TCAM)":[10],"can":[11,114],"perform":[12],"high":[13],"speed":[14],"packet":[15],"forwarding,":[16],"TCAM":[17],"is":[18],"much":[19],"more":[20],"expensive":[21],"than":[22],"ordinary":[23],"in":[25,124],"implementation":[26],"cost.":[27],"As":[28,105],"a":[29,37,41,106,120],"low-cost":[30],"solution,":[31],"binary":[32,38,42,60,111],"search":[33,43,61,112],"algorithms":[34],"such":[35],"as":[36],"trie":[39],"or":[40],"tree":[44,113],"have":[45],"been":[46],"widely":[47],"studied.":[48],"This":[49],"paper":[50],"proposes":[51],"an":[52],"efficient":[53],"scheme":[57,72,135],"balanced":[59,110],"with":[62,73,84,141],"minimal":[63],"entries":[64,83,93,98],"and":[65,99,117],"optimal":[66],"prefix":[67,74,86,103],"vectors.":[68,87,104],"In":[69,88],"the":[70,101,108,133],"previous":[71],"vectors,":[75],"there":[76],"were":[77],"numerous":[78],"pairs":[79],"of":[80],"nearly":[81],"identical":[82],"duplicated":[85],"our":[89],"scheme,":[90],"these":[91],"overlapping":[92],"are":[94],"combined,":[95],"thereby":[96],"minimizing":[97],"eliminating":[100],"unnecessary":[102],"result,":[107],"small":[109],"be":[115],"constructed":[116],"used":[118],"for":[119],"software-based":[121],"small-sized":[125],"routers.":[126],"The":[127],"performance":[128],"evaluation":[129],"results":[130],"show":[131],"that":[132],"proposed":[134],"offers":[136],"faster":[137],"speeds":[139],"along":[140],"reduced":[142],"requirements.":[144]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2161081860","counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2024-12-13T19:31:25.270686","created_date":"2016-06-24"}