{"id":"https://openalex.org/W4296886836","doi":"https://doi.org/10.1145/3527974.3545718","title":"Attaining stable and loop-free inter-domain routing without path vectors","display_name":"Attaining stable and loop-free inter-domain routing without path vectors","publication_year":2022,"publication_date":"2022-08-22","ids":{"openalex":"https://openalex.org/W4296886836","doi":"https://doi.org/10.1145/3527974.3545718"},"language":"en","primary_location":{"id":"doi:10.1145/3527974.3545718","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3527974.3545718","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3527974.3545718","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3527974.3545718","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108379099","display_name":"J. J. Garcia\u2010Luna\u2010Aceves","orcid":null},"institutions":[{"id":"https://openalex.org/I2803209242","display_name":"University of California System","ror":"https://ror.org/00pjdza24","country_code":"US","type":"education","lineage":["https://openalex.org/I2803209242"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J. J. Garcia-Luna-Aceves","raw_affiliation_strings":["University of California"],"affiliations":[{"raw_affiliation_string":"University of California","institution_ids":["https://openalex.org/I2803209242"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5108379099"],"corresponding_institution_ids":["https://openalex.org/I2803209242"],"apc_list":null,"apc_paid":null,"fwci":0.4282,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.63882316,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"58","last_page":"65"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9994000196456909,"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/T11158","display_name":"Wireless Networks and Protocols","score":0.9990000128746033,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9986000061035156,"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/path-vector-protocol","display_name":"Path vector protocol","score":0.7654157876968384},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7006910443305969},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6737704873085022},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.580089807510376},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5468733310699463},{"id":"https://openalex.org/keywords/identifier","display_name":"Identifier","score":0.5425435304641724},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5218352675437927},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.44484102725982666},{"id":"https://openalex.org/keywords/border-gateway-protocol","display_name":"Border Gateway Protocol","score":0.4184924364089966},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3781975507736206},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3586307168006897},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.35859233140945435},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.2750205993652344},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17552274465560913},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.04829868674278259}],"concepts":[{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.7654157876968384},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7006910443305969},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6737704873085022},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.580089807510376},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5468733310699463},{"id":"https://openalex.org/C154504017","wikidata":"https://www.wikidata.org/wiki/Q853614","display_name":"Identifier","level":2,"score":0.5425435304641724},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5218352675437927},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.44484102725982666},{"id":"https://openalex.org/C178086212","wikidata":"https://www.wikidata.org/wiki/Q11155","display_name":"Border Gateway Protocol","level":5,"score":0.4184924364089966},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3781975507736206},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3586307168006897},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.35859233140945435},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.2750205993652344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17552274465560913},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.04829868674278259}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3527974.3545718","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3527974.3545718","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3527974.3545718","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing","raw_type":"proceedings-article"},{"id":"pmh:oai:escholarship.org:ark:/13030/qt5br5n4zz","is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/5br5n4zz","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3527974.3545718","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3527974.3545718","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3527974.3545718","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.7200000286102295,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4296886836.pdf","grobid_xml":"https://content.openalex.org/works/W4296886836.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W250822895","https://openalex.org/W1812317301","https://openalex.org/W1980507101","https://openalex.org/W2004993199","https://openalex.org/W2026392294","https://openalex.org/W2069762560","https://openalex.org/W2098989705","https://openalex.org/W2102615557","https://openalex.org/W2113230746","https://openalex.org/W2121635209","https://openalex.org/W2130882486","https://openalex.org/W2144537141","https://openalex.org/W2146164879","https://openalex.org/W2168056773","https://openalex.org/W2249711818","https://openalex.org/W2269218031","https://openalex.org/W2506906025","https://openalex.org/W2733548457","https://openalex.org/W2987497684","https://openalex.org/W4290996709","https://openalex.org/W6630648595","https://openalex.org/W6638424650","https://openalex.org/W6640380507","https://openalex.org/W6682678350","https://openalex.org/W6684941598","https://openalex.org/W6696763472"],"related_works":["https://openalex.org/W2369878062","https://openalex.org/W2541547212","https://openalex.org/W2182380586","https://openalex.org/W2885726394","https://openalex.org/W2562537016","https://openalex.org/W2083307645","https://openalex.org/W2030140188","https://openalex.org/W288328875","https://openalex.org/W1534342069","https://openalex.org/W1558646768"],"abstract_inverted_index":{"A":[0,12],"sufficient":[1],"condition":[2,33],"for":[3,49,75],"loop-free":[4,65],"routing":[5,68],"is":[6,34],"introduced":[7],"based":[8,58],"on":[9,59],"path":[10,13,28,60,76],"labels.":[11],"label":[14],"consists":[15],"of":[16,19,26],"the":[17,20,37,73],"identifier":[18],"first":[21],"node":[22],"and":[23,56,66],"hop-count":[24],"length":[25],"a":[27,30],"to":[29,36,62],"destination.":[31],"This":[32],"applied":[35],"policy":[38],"mechanisms":[39],"used":[40],"in":[41,45],"BGP,":[42],"which":[43],"results":[44],"BGP-ELF":[46,52],"(BGP":[47],"Enhanced":[48],"Loop":[50],"Freedom).":[51],"uses":[53],"updates,":[54],"queries,":[55],"replies":[57],"labels":[61],"attain":[63],"multi-path":[64],"stable":[67],"across":[69],"autonomous":[70],"systems":[71],"without":[72],"need":[74],"vectors.":[77]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}