{"id":"https://openalex.org/W2902893896","doi":"https://doi.org/10.1109/nca.2018.8548101","title":"Toward Incremental FIB Aggregation with Quick Selections (FAQS)","display_name":"Toward Incremental FIB Aggregation with Quick Selections (FAQS)","publication_year":2018,"publication_date":"2018-11-01","ids":{"openalex":"https://openalex.org/W2902893896","doi":"https://doi.org/10.1109/nca.2018.8548101","mag":"2902893896"},"language":"en","primary_location":{"id":"doi:10.1109/nca.2018.8548101","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nca.2018.8548101","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1812.05520","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103114555","display_name":"Yaoqing Liu","orcid":"https://orcid.org/0000-0002-8317-1029"},"institutions":[{"id":"https://openalex.org/I16944753","display_name":"Clarkson University","ror":"https://ror.org/03rwgpn18","country_code":"US","type":"education","lineage":["https://openalex.org/I16944753"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yaoqing Liu","raw_affiliation_strings":["Clarkson University"],"affiliations":[{"raw_affiliation_string":"Clarkson University","institution_ids":["https://openalex.org/I16944753"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030268978","display_name":"Garegin Grigoryan","orcid":"https://orcid.org/0000-0002-3728-3249"},"institutions":[{"id":"https://openalex.org/I155173764","display_name":"Rochester Institute of Technology","ror":"https://ror.org/00v4yb702","country_code":"US","type":"education","lineage":["https://openalex.org/I155173764"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Garegin Grigoryan","raw_affiliation_strings":["Rochester Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Rochester Institute of Technology","institution_ids":["https://openalex.org/I155173764"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103114555"],"corresponding_institution_ids":["https://openalex.org/I16944753"],"apc_list":null,"apc_paid":null,"fwci":0.2632,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54875073,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"43","issue":null,"first_page":"1","last_page":"8"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T10400","display_name":"Network Security and Intrusion Detection","score":0.9972000122070312,"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.8099343776702881},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.7019928693771362},{"id":"https://openalex.org/keywords/ipv6","display_name":"IPv6","score":0.5877277851104736},{"id":"https://openalex.org/keywords/ipv4","display_name":"IPv4","score":0.575782060623169},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.533224880695343},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.45335426926612854},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4447672963142395},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3761550784111023},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3710927963256836},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2716103792190552},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.11601507663726807},{"id":"https://openalex.org/keywords/the-internet","display_name":"The Internet","score":0.0894506573677063}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8099343776702881},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7019928693771362},{"id":"https://openalex.org/C84555802","wikidata":"https://www.wikidata.org/wiki/Q2551624","display_name":"IPv6","level":3,"score":0.5877277851104736},{"id":"https://openalex.org/C2779233093","wikidata":"https://www.wikidata.org/wiki/Q11103","display_name":"IPv4","level":4,"score":0.575782060623169},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.533224880695343},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.45335426926612854},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4447672963142395},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3761550784111023},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3710927963256836},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2716103792190552},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.11601507663726807},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.0894506573677063},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/nca.2018.8548101","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nca.2018.8548101","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1812.05520","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1812.05520","pdf_url":"https://arxiv.org/pdf/1812.05520","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1812.05520","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1812.05520","pdf_url":"https://arxiv.org/pdf/1812.05520","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2902893896.pdf","grobid_xml":"https://content.openalex.org/works/W2902893896.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W1494972982","https://openalex.org/W1978583869","https://openalex.org/W1986610279","https://openalex.org/W1994287221","https://openalex.org/W2022768928","https://openalex.org/W2031529828","https://openalex.org/W2035233990","https://openalex.org/W2055113824","https://openalex.org/W2055419611","https://openalex.org/W2058987027","https://openalex.org/W2083856268","https://openalex.org/W2090900595","https://openalex.org/W2096567253","https://openalex.org/W2108766572","https://openalex.org/W2109403421","https://openalex.org/W2112899463","https://openalex.org/W2132074944","https://openalex.org/W2155512447","https://openalex.org/W2157422153","https://openalex.org/W2159910630","https://openalex.org/W2161090120","https://openalex.org/W2165424133","https://openalex.org/W2288392279","https://openalex.org/W2483259715","https://openalex.org/W3003711888","https://openalex.org/W3093756599","https://openalex.org/W4206060609","https://openalex.org/W4250382357","https://openalex.org/W4252580868"],"related_works":["https://openalex.org/W2349428606","https://openalex.org/W2360869876","https://openalex.org/W3004929566","https://openalex.org/W1849784828","https://openalex.org/W2374277641","https://openalex.org/W2391251019","https://openalex.org/W2791057254","https://openalex.org/W2347589432","https://openalex.org/W2129227231","https://openalex.org/W2391250720"],"abstract_inverted_index":{"Several":[0],"approaches":[1],"to":[2,28,32,44,57,63,91,93],"mitigating":[3],"the":[4,25,95,104,111],"Forwarding":[5],"Information":[6],"Base":[7],"(FIB)":[8],"overflow":[9],"problem":[10],"were":[11],"developed":[12],"and":[13,40,67,85,126,138],"software":[14],"solutions":[15],"using":[16],"FIB":[17,48,116,133,146],"aggregation":[18,66,117,134,147],"are":[19],"of":[20,24,47,97,106],"particular":[21],"interest.":[22],"One":[23],"greatest":[26],"concerns":[27],"deploy":[29],"these":[30],"algorithms":[31],"real":[33],"networks":[34],"is":[35,110,124],"their":[36],"high":[37],"running":[38],"time":[39,113],"heavy":[41],"computational":[42],"overhead":[43],"handle":[45],"thousands":[46],"updates":[49],"every":[50],"second.":[51],"In":[52],"this":[53],"work,":[54],"we":[55],"manage":[56],"use":[58],"a":[59,144],"single":[60],"tree":[61],"traversal":[62],"implement":[64],"faster":[65],"update":[68],"handling":[69],"algorithm":[70,99,135],"with":[71,100],"much":[72],"lower":[73],"memory":[74],"footprint":[75],"than":[76],"other":[77],"existing":[78],"work.":[79],"We":[80],"utilize":[81],"6-year":[82],"realistic":[83],"IPv4":[84,137],"IPv6":[86,115,139],"routing":[87],"tables":[88],"from":[89],"2011":[90],"2016":[92],"evaluate":[94],"performance":[96],"our":[98,107],"various":[101],"metrics.":[102],"To":[103],"best":[105],"knowledge,":[108],"it":[109],"first":[112],"that":[114],"has":[118],"been":[119],"performed.":[120],"Our":[121],"new":[122],"solution":[123],"2.53":[125],"1.75":[127],"times":[128],"as":[129,131],"fast":[130],"the-state-of-the-art":[132],"for":[136],"FIBs,":[140],"respectively,":[141],"while":[142],"achieving":[143],"near-optimal":[145],"ratio.":[148]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}
