{"id":"https://openalex.org/W2123967665","doi":"https://doi.org/10.1137/s0097539703437831","title":"Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input","display_name":"Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2123967665","doi":"https://doi.org/10.1137/s0097539703437831","mag":"2123967665"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539703437831","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539703437831","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5000949710","display_name":"Aris Anagnostopoulos","orcid":"https://orcid.org/0000-0001-9183-7911"},"institutions":[{"id":"https://openalex.org/I175594653","display_name":"John Brown University","ror":"https://ror.org/02ct41q97","country_code":"US","type":"education","lineage":["https://openalex.org/I175594653"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Aris Anagnostopoulos","raw_affiliation_strings":["Brown University"],"affiliations":[{"raw_affiliation_string":"Brown University","institution_ids":["https://openalex.org/I175594653"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111963396","display_name":"Adam Kirsch","orcid":null},"institutions":[{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Adam Kirsch","raw_affiliation_strings":["Harvard University"],"affiliations":[{"raw_affiliation_string":"Harvard University","institution_ids":["https://openalex.org/I2801851002"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028869858","display_name":"Eli Upfal","orcid":"https://orcid.org/0000-0002-9321-9460"},"institutions":[{"id":"https://openalex.org/I175594653","display_name":"John Brown University","ror":"https://ror.org/02ct41q97","country_code":"US","type":"education","lineage":["https://openalex.org/I175594653"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eli Upfal","raw_affiliation_strings":["Brown University"],"affiliations":[{"raw_affiliation_string":"Brown University","institution_ids":["https://openalex.org/I175594653"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5000949710"],"corresponding_institution_ids":["https://openalex.org/I175594653"],"apc_list":null,"apc_paid":null,"fwci":1.9625,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.87497345,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"34","issue":"3","first_page":"616","last_page":"639"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9987000226974487,"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.9973000288009644,"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/bounded-function","display_name":"Bounded function","score":0.6279164552688599},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5683619976043701},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.5663825273513794},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5634443163871765},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5554780960083008},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4636126160621643},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.44571638107299805},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.42090386152267456},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.415498822927475},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.40720149874687195},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38367220759391785},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3431400656700134},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.31751060485839844},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30664485692977905},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2121526300907135},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18382516503334045},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1362822949886322}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6279164552688599},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5683619976043701},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.5663825273513794},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5634443163871765},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5554780960083008},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4636126160621643},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.44571638107299805},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.42090386152267456},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.415498822927475},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.40720149874687195},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38367220759391785},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3431400656700134},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31751060485839844},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30664485692977905},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2121526300907135},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18382516503334045},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1362822949886322},{"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},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0097539703437831","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539703437831","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.60.176","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.176","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.harvard.edu/~kirsch/pubs/lbstable/sicomp.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.61.3464","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.3464","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/people/eli/papers/SIAM%20Vol34%202005.pdf","raw_type":"text"},{"id":"pmh:oai:iris.uniroma1.it:11573/341812","is_oa":false,"landing_page_url":"http://epubs.siam.org/action/showAbstract?page=616&volume=34&issue=3&journalCode=smjcat","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1498869219","https://openalex.org/W1631258642","https://openalex.org/W1909387666","https://openalex.org/W1965399019","https://openalex.org/W1976407842","https://openalex.org/W1995713768","https://openalex.org/W2014071176","https://openalex.org/W2029220296","https://openalex.org/W2033864237","https://openalex.org/W2040107347","https://openalex.org/W2047680997","https://openalex.org/W2060084491","https://openalex.org/W2088240190","https://openalex.org/W2100070743","https://openalex.org/W2112990205","https://openalex.org/W2116911348","https://openalex.org/W2124138802","https://openalex.org/W2125103654","https://openalex.org/W2139770509","https://openalex.org/W2168550848","https://openalex.org/W2317997851","https://openalex.org/W2751862591"],"related_works":["https://openalex.org/W4388150944","https://openalex.org/W4242235492","https://openalex.org/W4237162029","https://openalex.org/W2367268135","https://openalex.org/W2385701518","https://openalex.org/W4237464767","https://openalex.org/W2086397253","https://openalex.org/W1658340114","https://openalex.org/W2068562251","https://openalex.org/W4252295672"],"abstract_inverted_index":{"We":[0,22,276,349],"study":[1],"the":[2,39,50,57,66,70,100,103,118,123,156,160,184,189,198,204,215,238,250,253,257,260,264,271,284,288,291,299,305,311,317,330,335,354,367,370,373,380],"long-term":[3],"(steady":[4],"state)":[5],"performance":[6,154,266],"of":[7,19,26,122,155,164,218,224,248,268,274,294,298,320,338],"a":[8,16,24,42,96,108,114,179,321,339],"simple,":[9],"randomized,":[10],"local":[11],"load":[12,54,86,112,286,357,368],"balancing":[13,87,358],"technique":[14],"under":[15],"broad":[17],"range":[18],"input":[20,130,133,182,192],"conditions.":[21],"assume":[23,127],"system":[25,157,239,261,289,371],"n":[27],"processors":[28,40],"connected":[29,244],"by":[30,41,136,229],"an":[31,137,209,314],"arbitrary":[32,138],"network":[33,58,205,245,300,312,381],"topology.":[34,301],"Jobs":[35],"are":[36],"placed":[37],"in":[38,56,69,84,89,99,117,221,287,296,304,329,364,369,379],"deterministic":[43,139],"or":[44,140],"randomized":[45],"adversary.":[46,187],"The":[47,132],"adversary":[48,142,162,199,251,308,333],"knows":[49],"current":[51],"and":[52,59,80,152,279,290,328,372],"past":[53],"distribution":[55],"can":[60,74,81,92,376],"use":[61],"this":[62],"information":[63],"to":[64,95,145],"place":[65],"new":[67,219,254],"tasks":[68,94],"processors.":[71,258],"A":[72],"node":[73,109],"execute":[75],"one":[76,85],"job":[77],"per":[78],"step,":[79],"also":[82],"participate":[83],"operation":[88],"which":[90],"it":[91],"move":[93],"direct":[97],"neighbor":[98,116],"network.":[101],"In":[102,302],"protocol":[104,124],"we":[105,158,177,194,361],"analyze":[106],"here,":[107],"equalizes":[110],"its":[111],"with":[113,346,353],"random":[115],"graph.":[119],"Our":[120],"analysis":[121],"does":[125,200],"not":[126,201],"any":[128,222,243],"particular":[129],"distribution.":[131],"is":[134,208,227,240,262,270,313,323,341],"generated":[135],"probabilistic":[141],"subject":[143],"only":[144],"some":[146,233],"weak":[147],"statistical":[148],"properties.":[149],"For":[150,174],"stability":[151],"expected":[153,216,278,318],"adopt":[159],"stochastic":[161,190,307],"model":[163,334],"[Borodin":[165],"et":[166],"al.,":[167],"J.":[168],"ACM,":[169],"48":[170],"(2001),":[171],"pp.":[172],"13--38].":[173],"high-probability":[175],"bounds":[176,282],"introduce":[178],"more":[180],"restricted":[181],"model,":[183,193,309],"strongly":[185,331],"bounded":[186,228,332],"Assuming":[188],"adversarial":[191],"show":[195,362],"that":[196,214,363],"if":[197,310],"trivially":[202],"overload":[203],"(i.e.,":[206],"there":[207],"integer":[210],"$w\\geq":[211],"1$":[212],"such":[213],"number":[217],"jobs":[220,255,295],"interval":[223],"length":[225],"w":[226],"$\\lambda":[230,234],"nw$":[231],"for":[232,242],"<":[235],"1$),":[236],"then":[237],"stable":[241],"topology,":[246],"regardless":[247],"how":[249],"allocates":[252],"between":[256],"When":[259],"stable,":[263],"next":[265],"parameter":[267],"interest":[269],"waiting":[272,292,336,374],"time":[273,293,337,375],"jobs.":[275],"develop":[277],"high":[280,347],"probability":[281],"on":[283],"total":[285],"terms":[297],"particular,":[303],"above":[306],"expander":[315],"graph,":[316],"wait":[319],"task":[322,340],"O(w":[324,342],"+":[325,343],"log":[326,344],"n),":[327],"n)":[345],"probability.":[348],"contrast":[350],"these":[351],"results":[352],"work":[355],"stealing":[356],"protocol,":[359],"where":[360],"sparse":[365],"networks,":[366],"be":[377],"exponential":[378],"size.":[382]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
