{"id":"https://openalex.org/W3172739028","doi":"https://doi.org/10.1145/3406325.3451098","title":"Hop-constrained oblivious routing","display_name":"Hop-constrained oblivious routing","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3172739028","doi":"https://doi.org/10.1145/3406325.3451098","mag":"3172739028"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451098","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451098","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","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/A5088284921","display_name":"Mohsen Ghaffari","orcid":"https://orcid.org/0000-0002-1939-9053"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Mohsen Ghaffari","raw_affiliation_strings":["ETH Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080591933","display_name":"Bernhard Haeupler","orcid":"https://orcid.org/0000-0003-3381-0459"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bernhard Haeupler","raw_affiliation_strings":["Carnegie Mellon University, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016898359","display_name":"Goran \u017du\u017ei\u0107","orcid":"https://orcid.org/0000-0002-9322-6329"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Goran Zuzic","raw_affiliation_strings":["ETH Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5088284921"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":1.9236,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.87702254,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1208","last_page":"1220"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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/T10237","display_name":"Cryptography and Data Security","score":0.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6676167845726013},{"id":"https://openalex.org/keywords/dilation","display_name":"Dilation (metric space)","score":0.5711871385574341},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5671791434288025},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4327477812767029},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.4129113554954529},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.39467453956604004},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3924691677093506},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3291589915752411},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.27278515696525574},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2500589191913605},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.20062926411628723}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6676167845726013},{"id":"https://openalex.org/C2780757906","wikidata":"https://www.wikidata.org/wiki/Q5276676","display_name":"Dilation (metric space)","level":2,"score":0.5711871385574341},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5671791434288025},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4327477812767029},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.4129113554954529},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.39467453956604004},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3924691677093506},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3291589915752411},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.27278515696525574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2500589191913605},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20062926411628723},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3406325.3451098","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451098","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G256738621","display_name":null,"funder_award_id":"CCF-1527110, CCF-1618280, CCF-1814603, CCF-1910588, NSF CAREER award CCF-1750808","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G801511831","display_name":null,"funder_award_id":"853109, 949272","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1518210324","https://openalex.org/W1899379166","https://openalex.org/W1963964297","https://openalex.org/W1988294273","https://openalex.org/W2020066367","https://openalex.org/W2040040773","https://openalex.org/W2041571997","https://openalex.org/W2056557086","https://openalex.org/W2058355999","https://openalex.org/W2058972589","https://openalex.org/W2082353536","https://openalex.org/W2083323175","https://openalex.org/W2084427019","https://openalex.org/W2089867501","https://openalex.org/W2103635929","https://openalex.org/W2114493937","https://openalex.org/W2118962177","https://openalex.org/W2122870665","https://openalex.org/W2145818650","https://openalex.org/W2150865801","https://openalex.org/W2169528477","https://openalex.org/W2400200109","https://openalex.org/W4213272272","https://openalex.org/W6712586854"],"related_works":["https://openalex.org/W757657516","https://openalex.org/W2539097916","https://openalex.org/W4377970799","https://openalex.org/W2944616377","https://openalex.org/W3127002380","https://openalex.org/W2251995179","https://openalex.org/W2556128816","https://openalex.org/W2351878639","https://openalex.org/W2181601090","https://openalex.org/W2768774055"],"abstract_inverted_index":{"We":[0],"prove":[1],"the":[2],"existence":[3],"of":[4,14],"an":[5],"oblivious":[6,24],"routing":[7],"scheme":[8],"that":[9],"is":[10],"poly(logn)-competitive":[11],"in":[12,23],"terms":[13],"(congestion":[15],"+":[16],"dilation),":[17],"thus":[18],"resolving":[19],"a":[20],"well-known":[21],"question":[22],"routing.":[25]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
