{"id":"https://openalex.org/W2012940837","doi":"https://doi.org/10.1145/1011767.1011795","title":"Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs","display_name":"Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs","publication_year":2004,"publication_date":"2004-07-25","ids":{"openalex":"https://openalex.org/W2012940837","doi":"https://doi.org/10.1145/1011767.1011795","mag":"2012940837"},"language":"en","primary_location":{"id":"doi:10.1145/1011767.1011795","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1011767.1011795","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third annual ACM 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/A5037226596","display_name":"Jie Gao","orcid":"https://orcid.org/0000-0001-5083-6082"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jie Gao","raw_affiliation_strings":["Stanford University, Stanford, CA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100425578","display_name":"Li Zhang","orcid":"https://orcid.org/0000-0002-4535-3200"},"institutions":[{"id":"https://openalex.org/I1324840837","display_name":"Hewlett-Packard (United States)","ror":"https://ror.org/059rn9488","country_code":"US","type":"company","lineage":["https://openalex.org/I1324840837"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Li Zhang","raw_affiliation_strings":["HP Labs, Palo Alto, CA","HP Labs., Palo Alto, CA#TAB#"],"affiliations":[{"raw_affiliation_string":"HP Labs, Palo Alto, CA","institution_ids":["https://openalex.org/I1324840837"]},{"raw_affiliation_string":"HP Labs., Palo Alto, CA#TAB#","institution_ids":["https://openalex.org/I1324840837"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037226596"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":2.2436,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.89764975,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"189","last_page":"196"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9995999932289124,"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.9995999932289124,"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.9987999796867371,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9986000061035156,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5414190292358398},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5268016457557678},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.524816632270813},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4710507392883301},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.4230755567550659},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4195634126663208},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.39638325572013855},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38840824365615845},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36728090047836304},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3644881248474121},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36302390694618225},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34930121898651123},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.33815377950668335},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.18830826878547668}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5414190292358398},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5268016457557678},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.524816632270813},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4710507392883301},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.4230755567550659},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4195634126663208},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.39638325572013855},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38840824365615845},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36728090047836304},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3644881248474121},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36302390694618225},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34930121898651123},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.33815377950668335},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.18830826878547668},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1011767.1011795","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1011767.1011795","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.131.5305","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.5305","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://graphics.stanford.edu/projects/lgl/papers/gz-tsflb-04/gz-tsflb-04.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.150.7280","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.7280","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.sunysb.edu/~jgao/paper/lbrouting2_journal.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.188.1148","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.1148","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/en-us/um/People/lzha/papers/tradeoff-j.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.885.8739","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.885.8739","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.researchgate.net/profile/Jie_Gao3/publication/221343564_Tradeoffs_between_stretch_factor_and_load_balancing_ratio_in_routing_on_growth_restricted_graphs/links/00b49524e2cf283422000000.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":40,"referenced_works":["https://openalex.org/W148398262","https://openalex.org/W1552092932","https://openalex.org/W1552828154","https://openalex.org/W1591562949","https://openalex.org/W1666015432","https://openalex.org/W1853496817","https://openalex.org/W1988247442","https://openalex.org/W2000876023","https://openalex.org/W2003160050","https://openalex.org/W2011571064","https://openalex.org/W2027920448","https://openalex.org/W2031904783","https://openalex.org/W2040040773","https://openalex.org/W2042796613","https://openalex.org/W2048902080","https://openalex.org/W2063572899","https://openalex.org/W2065248207","https://openalex.org/W2073271991","https://openalex.org/W2084427019","https://openalex.org/W2101087742","https://openalex.org/W2102465486","https://openalex.org/W2105643862","https://openalex.org/W2127248062","https://openalex.org/W2128467914","https://openalex.org/W2139739478","https://openalex.org/W2142253242","https://openalex.org/W2146522433","https://openalex.org/W2148488875","https://openalex.org/W2152121871","https://openalex.org/W2153319198","https://openalex.org/W2156271404","https://openalex.org/W2161843738","https://openalex.org/W2169036209","https://openalex.org/W2169528473","https://openalex.org/W2176446742","https://openalex.org/W2181088386","https://openalex.org/W2752885492","https://openalex.org/W3011766368","https://openalex.org/W3145128584","https://openalex.org/W4238665603"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W3127002380","https://openalex.org/W2068473861","https://openalex.org/W757657516","https://openalex.org/W2351878639","https://openalex.org/W2539097916","https://openalex.org/W2148093630","https://openalex.org/W2136173851","https://openalex.org/W4253436398","https://openalex.org/W2124642421"],"abstract_inverted_index":{"A":[0],"graph":[1,124],"has":[2,219],"growth":[3,33,49,112,237],"rate":[4,238],"k":[5,108],"if":[6,85,136,146],"the":[7,40,58,63,66,70,78,86,110,121,147,151,163,174,178,186,190,193,200,208,215],"number":[8],"of":[9,24,65,150,166,224],"nodes":[10,132,152,179],"in":[11,48,129,199,256],"any":[12],"subgraph":[13],"with":[14,94,236],"diameter":[15],"r":[16],"is":[17,80,89,103,109,139,153,169,180,197,210],"bounded":[18,104,154,211],"by":[19,105,118,155,212],"O(rk).":[20],"The":[21,52,226],"communication":[22,135],"graphs":[23,233,235],"wireless":[25,127],"networks":[26,29,128],"and":[27,69,173,234,251],"peer-to-peer":[28],"often":[30],"have":[31,133],"small":[32],"rate.":[34,113],"In":[35,188],"this":[36],"paper":[37],"we":[38,55],"study":[39],"tradeoff":[41],"between":[42],"two":[43,53,131],"quality":[44],"measures":[45,54,62,75],"for":[46,125,245,252],"routing":[47,67,87,159,167,218,250,255],"restricted":[50],"graphs.":[51,258],"consider":[56],"are":[57],"stretch":[59,95,164],"factor,":[60],"which":[61,74,130],"lengths":[64],"paths,":[68],"load":[71,100,176,194,221,246,253],"balancing":[72,101,195,222],"ratio,":[73],"how":[76],"evenly":[77],"traffic":[79],"distributed.":[81],"We":[82,114,143,240],"show":[83,144],"that":[84,145,162],"algorithm":[88],"required":[90],"to":[91,229],"use":[92],"paths":[93,168],"factor":[96,165],"c,":[97,172],"then":[98],"its":[99],"ratio":[102,196,223],"O((n/c)1-1/k),":[106],"where":[107],"graph's":[111],"illustrate":[115],"our":[116],"results":[117],"focusing":[119],"on":[120,177,192],"unit":[122,231],"disk":[123],"modeling":[126],"direct":[134],"their":[137],"distance":[138],"under":[140],"certain":[141],"threshold.":[142],"maximum":[148,175],"density":[149,209],"\u03c1,":[156],"there":[157],"exists":[158],"scheme":[160],"such":[161],"at":[170,181],"most":[171,182],"O(min(\u221a\u03c1n/c,":[183],"n/c))":[184],"times":[185],"optimum.":[187],"addition,":[189],"bound":[191],"tight":[198],"worst":[201],"case.":[202],"As":[203],"a":[204,213,220],"special":[205],"case,":[206],"when":[207],"constant,":[214],"shortest":[216],"path":[217,249],"O(\u221an).":[225],"result":[227],"extends":[228],"k-dimensional":[230],"ball":[232],"k.":[239],"also":[241],"discuss":[242],"algorithmic":[243],"issues":[244],"balanced":[247,254],"short":[248],"spanner":[257]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}