{"id":"https://openalex.org/W2762355805","doi":"https://doi.org/10.1109/infocom.2017.8057000","title":"Load balancing with bounded convergence in dynamic networks","display_name":"Load balancing with bounded convergence in dynamic networks","publication_year":2017,"publication_date":"2017-05-01","ids":{"openalex":"https://openalex.org/W2762355805","doi":"https://doi.org/10.1109/infocom.2017.8057000","mag":"2762355805"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2017.8057000","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2017.8057000","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2017 - IEEE Conference on Computer Communications","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/A5049161363","display_name":"Michael Dinitz","orcid":"https://orcid.org/0000-0002-2632-966X"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Dinitz","raw_affiliation_strings":["Johns Hopkins University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Johns Hopkins University","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011772692","display_name":"Jeremy T. Fineman","orcid":"https://orcid.org/0009-0000-7483-4532"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeremy Fineman","raw_affiliation_strings":["Georgetown University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgetown University","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042520814","display_name":"Seth Gilbert","orcid":"https://orcid.org/0000-0003-3298-7412"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Seth Gilbert","raw_affiliation_strings":["National University of Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National University of Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078649776","display_name":"Calvin Newport","orcid":"https://orcid.org/0009-0006-0353-8254"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Calvin Newport","raw_affiliation_strings":["Georgetown University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgetown University","institution_ids":["https://openalex.org/I184565670"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8788,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.78385172,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"67","issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9991000294685364,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9991000294685364,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9980999827384949,"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/T12288","display_name":"Optimization and Search Problems","score":0.9975000023841858,"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/load-balancing","display_name":"Load balancing (electrical power)","score":0.7478196024894714},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6953624486923218},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5606200695037842},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5395130515098572},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5367717742919922},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.484954833984375},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.4819197952747345},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.459416925907135},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.45003268122673035},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4257640242576599},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.4228516221046448},{"id":"https://openalex.org/keywords/load-management","display_name":"Load management","score":0.4224504232406616},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41634029150009155},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3792005777359009},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2408072054386139},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17448213696479797},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14103630185127258},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.0843556821346283},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.0833720862865448}],"concepts":[{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.7478196024894714},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6953624486923218},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5606200695037842},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5395130515098572},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5367717742919922},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.484954833984375},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.4819197952747345},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.459416925907135},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.45003268122673035},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4257640242576599},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.4228516221046448},{"id":"https://openalex.org/C2779370713","wikidata":"https://www.wikidata.org/wiki/Q357554","display_name":"Load management","level":2,"score":0.4224504232406616},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41634029150009155},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3792005777359009},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2408072054386139},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17448213696479797},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14103630185127258},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0843556821346283},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0833720862865448},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2017.8057000","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2017.8057000","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2017 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1514107797","https://openalex.org/W1560148589","https://openalex.org/W1586184796","https://openalex.org/W1618442965","https://openalex.org/W1864806140","https://openalex.org/W1970700632","https://openalex.org/W1974286267","https://openalex.org/W1998692453","https://openalex.org/W2005659209","https://openalex.org/W2015410655","https://openalex.org/W2050002204","https://openalex.org/W2067153340","https://openalex.org/W2074796812","https://openalex.org/W2083612893","https://openalex.org/W2085128250","https://openalex.org/W2089366837","https://openalex.org/W2090781315","https://openalex.org/W2094410194","https://openalex.org/W2096284451","https://openalex.org/W2110786464","https://openalex.org/W2120741723","https://openalex.org/W2125668987","https://openalex.org/W2129774545","https://openalex.org/W2151685478","https://openalex.org/W2152755966","https://openalex.org/W2156464356","https://openalex.org/W2165744313","https://openalex.org/W2166417226","https://openalex.org/W2541488199","https://openalex.org/W4250134109","https://openalex.org/W6674818385"],"related_works":["https://openalex.org/W1583194654","https://openalex.org/W2185389245","https://openalex.org/W1964245459","https://openalex.org/W2147320702","https://openalex.org/W2248871425","https://openalex.org/W4377970692","https://openalex.org/W2162063029","https://openalex.org/W2944222538","https://openalex.org/W2022863591","https://openalex.org/W2563943286"],"abstract_inverted_index":{"Load":[0],"balancing":[1,87,111,179],"is":[2,59,88],"an":[3,62,78],"important":[4],"activity":[5],"in":[6,18,56,61,72,77,138,181],"distributed":[7,65],"systems.":[8],"At":[9],"a":[10,23,100,107,118,130,139,155],"high-level":[11],"of":[12,27,123,133],"abstraction,":[13],"this":[14,44,47,147,173],"problem":[15],"assumes":[16],"processes":[17,69],"the":[19,121],"system":[20],"begin":[21],"with":[22,75,84,135,187],"potentially":[24],"uneven":[25],"assignment":[26],"\u201cwork\u201d":[28],"which":[29,57,162,182],"they":[30],"must":[31],"then":[32,145,170],"attempt":[33],"to":[34,42,89,99,128,174],"spread":[35],"evenly.":[36],"There":[37],"are":[38],"many":[39],"different":[40],"approaches":[41],"solving":[43],"problem.":[45],"In":[46],"paper,":[48],"we":[49],"focus":[50],"on":[51,120,172],"local":[52,85,93,109],"load":[53,86,110,178],"balancing-an":[54],"approach":[55],"work":[58,71,159,186],"balanced":[60],"iterative":[63],"and":[64,105,116,157,169],"manner":[66],"by":[67,153],"having":[68],"exchange":[70],"each":[73],"round":[74,193],"neighbors":[76],"underlying":[79],"communication":[80],"network.":[81],"The":[82],"goal":[83],"prove":[90,117,146,175],"that":[91,176],"these":[92],"exchanges":[94,185],"will":[95],"lead":[96],"over":[97],"time":[98],"global":[101],"balance.":[102],"We":[103,144],"describe":[104],"analyze":[106],"new":[108],"strategy":[112],"called":[113],"max":[114,163,199],"neighbor,":[115],"bound":[119],"number":[122],"rounds":[124],"required":[125],"for":[126,161],"it":[127],"obtain":[129],"parameterized":[131],"level":[132],"balance,":[134],"high":[136],"probability,":[137],"general":[140],"dynamic":[141],"network":[142,156],"topology.":[143],"analysis":[148],"tight":[149],"(within":[150],"logarithmic":[151],"factors)":[152],"describing":[154],"initial":[158],"distribution":[160],"neighbor":[164],"matches":[165],"its":[166],"upper":[167],"bound,":[168],"build":[171],"no":[177],"algorithm":[180],"every":[183],"node":[184],"at":[188],"most":[189],"one":[190],"partner":[191],"per":[192],"can":[194],"converge":[195],"asymptotically":[196],"faster":[197],"than":[198],"neighbor.":[200]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}