{"id":"https://openalex.org/W1992550125","doi":"https://doi.org/10.1145/1993806.1993879","title":"Randomized compact routing in decomposable metrics","display_name":"Randomized compact routing in decomposable metrics","publication_year":2011,"publication_date":"2011-06-06","ids":{"openalex":"https://openalex.org/W1992550125","doi":"https://doi.org/10.1145/1993806.1993879","mag":"1992550125"},"language":"en","primary_location":{"id":"doi:10.1145/1993806.1993879","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993806.1993879","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed 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/A5058407079","display_name":"Goran Konjevod","orcid":"https://orcid.org/0000-0003-1377-7559"},"institutions":[{"id":"https://openalex.org/I1282311441","display_name":"Lawrence Livermore National Laboratory","ror":"https://ror.org/041nk4h53","country_code":"US","type":"facility","lineage":["https://openalex.org/I1282311441","https://openalex.org/I1330989302","https://openalex.org/I198811213","https://openalex.org/I4210138311"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Goran Konjevod","raw_affiliation_strings":["Lawrence Livermore National Laboratory, Livermore, CA, USA"],"affiliations":[{"raw_affiliation_string":"Lawrence Livermore National Laboratory, Livermore, CA, USA","institution_ids":["https://openalex.org/I1282311441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031875286","display_name":"Andr\u00e9a W. Richa","orcid":"https://orcid.org/0000-0003-3592-3756"},"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":"Andr\u00e9a W. Richa","raw_affiliation_strings":["Arizona State University, Tempe, AZ, USA","Arizona State University , Tempe , AZ , USA"],"affiliations":[{"raw_affiliation_string":"Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"Arizona State University , Tempe , AZ , USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071186704","display_name":"Donglin Xia","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Donglin Xia","raw_affiliation_strings":["Microsoft, Redmond, WA, USA","Microsoft Redmond, WA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Microsoft, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Redmond, WA, USA#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100520157","display_name":"Ling Zhou","orcid":"https://orcid.org/0000-0002-9508-4950"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ling Zhou","raw_affiliation_strings":["Microsoft, Redmond, WA, USA","Microsoft Redmond, WA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Microsoft, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Redmond, WA, USA#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5058407079"],"corresponding_institution_ids":["https://openalex.org/I1282311441"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.08233358,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"351","last_page":"352"},"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.9994999766349792,"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.9994999766349792,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/T10304","display_name":"Geometric and Algebraic Topology","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6447654962539673},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5955761671066284},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5300493240356445},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4934000074863434},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.4739511013031006},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.47306597232818604},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4666467010974884},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4276387691497803},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41710638999938965},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4034002125263214},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.19354495406150818}],"concepts":[{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6447654962539673},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5955761671066284},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5300493240356445},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4934000074863434},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.4739511013031006},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.47306597232818604},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4666467010974884},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4276387691497803},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41710638999938965},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4034002125263214},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.19354495406150818},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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},{"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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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":2,"locations":[{"id":"doi:10.1145/1993806.1993879","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993806.1993879","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.221.4208","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.4208","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.public.asu.edu/%7Earicha/mypapers/podc-ba11.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1527483699","https://openalex.org/W1560551754","https://openalex.org/W1587867115","https://openalex.org/W1602024640","https://openalex.org/W1981870397","https://openalex.org/W1997027778","https://openalex.org/W2004322147","https://openalex.org/W2042899161","https://openalex.org/W2102465486","https://openalex.org/W2127248062","https://openalex.org/W2142253242","https://openalex.org/W2156060048"],"related_works":["https://openalex.org/W3013085049","https://openalex.org/W1560496689","https://openalex.org/W1992739770","https://openalex.org/W4386900933","https://openalex.org/W4229058035","https://openalex.org/W3125672081","https://openalex.org/W2006389905","https://openalex.org/W4297797135","https://openalex.org/W2904666330","https://openalex.org/W64182352"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,66],"compact":[3,45,70],"routing":[4,46,71],"problem":[5],"in":[6],"networks":[7,77],"whose":[8],"shortest":[9],"path":[10],"metrics":[11,15,25,51],"are":[12,16],"decomposable.":[13],"Decomposable":[14],"more":[17],"general":[18,79],"than":[19],"doubling":[20],"metrics,":[21,23],"growth-bounded":[22],"and":[24,41,59],"induced":[26],"by":[27],"graphs":[28],"excluding":[29],"Kr,r":[30],"as":[31,78,80],"a":[32],"minor.":[33],"In":[34],"this":[35],"work,":[36],"we":[37],"present":[38],"both":[39],"name-dependent":[40],"name-independent":[42],"constant":[43,74],"stretch":[44,75],"schemes":[47,72],"for":[48,76],"bounded":[49],"decomposable":[50,81],"with":[52,73],"polylogarithmic":[53,60],"storage":[54],"requirements":[55],"at":[56],"each":[57],"node":[58],"packet":[61],"headers.":[62],"Our":[63],"work":[64],"is":[65],"first":[67],"to":[68],"design":[69],"metrics.":[82]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}