Rapid convergence of a local load balancing algorithm for asynchronous rings

We consider the problem of load balancing in a ring network. We present an analysis of the following local algorithm. In each step, each node of the ring examines the number of tokens at its clockwise neighbor and sends a token to the neighbour if the neighbour has fewer tokens. We show that in a sy...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 220; no. 1; pp. 247 - 265
Main Authors: Gehrke, Johannes E., Plaxton, C.Greg, Rajaraman, Rajmohan
Format: Journal Article
Language:English
Published: Elsevier B.V 06.06.1999
Subjects:
Asynchronous networks
Distributed algorithms
Load balancing
Ring topology
Ring topology
Load balancing
Distributed algorithms
Asynchronous networks
ISSN:0304-3975, 1879-2294
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We consider the problem of load balancing in a ring network. We present an analysis of the following local algorithm. In each step, each node of the ring examines the number of tokens at its clockwise neighbor and sends a token to the neighbour if the neighbour has fewer tokens. We show that in a synchronous model, for any initial token distribution b on an n-node ring, the algorithm converges to a completely balanced distribution within 4 OPT( b) + n steps, where OPT( b) is the time taken by the optimal centralized algorithm to balance b completely. Our main result is an analysis of the algorithm in an asynchronous model in which local computations and messages may be arbitrarily delayed, subject to the constraint that each message is eventually delivered and each computation is eventually performed. By generalizing our analysis for the synchronous model, we show that for any initial token distribution b, the algorithm converges to a completely balanced distribution within 8 OPT( b) + 2 n rounds, where a round is a minimal sequence of steps in which every component of the network is scheduled at least once. We also show that for every initial token distribution, the message complexity of the algorithm is asymptotically optimal among all algorithms that move tokens in the clockwise direction.
AbstractList We consider the problem of load balancing in a ring network. We present an analysis of the following local algorithm. In each step, each node of the ring examines the number of tokens at its clockwise neighbor and sends a token to the neighbour if the neighbour has fewer tokens. We show that in a synchronous model, for any initial token distribution b on an n-node ring, the algorithm converges to a completely balanced distribution within 4 OPT( b) + n steps, where OPT( b) is the time taken by the optimal centralized algorithm to balance b completely. Our main result is an analysis of the algorithm in an asynchronous model in which local computations and messages may be arbitrarily delayed, subject to the constraint that each message is eventually delivered and each computation is eventually performed. By generalizing our analysis for the synchronous model, we show that for any initial token distribution b, the algorithm converges to a completely balanced distribution within 8 OPT( b) + 2 n rounds, where a round is a minimal sequence of steps in which every component of the network is scheduled at least once. We also show that for every initial token distribution, the message complexity of the algorithm is asymptotically optimal among all algorithms that move tokens in the clockwise direction.
Author Rajaraman, Rajmohan
Plaxton, C.Greg
Gehrke, Johannes E.
Author_xml – sequence: 1
  givenname: Johannes E.
  surname: Gehrke
  fullname: Gehrke, Johannes E.
  organization: University of Wisconsin-Madison, Department of Computer Science, Madison, WI 53706, USA
– sequence: 2
  givenname: C.Greg
  surname: Plaxton
  fullname: Plaxton, C.Greg
  email: plaxton@cs.utexas.edu
  organization: The University of Texas at Austin, Department of Computer Science, Austin, TX 78712, USA
– sequence: 3
  givenname: Rajmohan
  surname: Rajaraman
  fullname: Rajaraman, Rajmohan
  organization: Rutgers University, DIMACS Center, Piscataway, NJ 08854, USA
BookMark eNqFkE1LAzEQhoMo2FZ_gpCjHlbztZsNHkSKX1AQ_DiH2STbRrZJSdZC_73bVjx46RxmYGaeF953jI5DDA6hC0quKaHVzTvhRBRcyfJS1VeEMMGL6giNaC1VwZgSx2j093KKxjl_kaFKWY3Q7A1W3mITw9qluQvG4dhiwF000A0dLG6gg2B8mGPo5jH5frHEbUwY8iaYRYohfmechns-QyctdNmd_84J-nx8-Jg-F7PXp5fp_awwnMi-UI0robQNM0rI0jqQFqq6aoVqSikVF5bBsCMWGi6IqokUnDFJRV1DRWjDJ6jc65oUc06u1avkl5A2mhK9jUTvItFbv1rVeheJrgbu9h9nfA-9j6FP4LuD9N2edoO1tXdJZ-O3iVmfnOm1jf6Awg-E031C
CitedBy_id crossref_primary_10_1016_j_jocs_2018_04_002
crossref_primary_10_1016_j_comcom_2019_11_006
crossref_primary_10_1137_100799216
Cites_doi 10.1002/cpe.4330030502
10.1016/0304-3975(81)90109-2
10.1145/3149.3156
10.1145/4221.4227
10.1016/0020-0190(94)90124-4
10.1006/jpdc.1996.1257
10.1145/2402.322387
10.1137/0218015
10.1007/BF01955042
10.1016/0304-3975(87)90069-7
10.1016/0743-7315(89)90021-X
10.1145/7531.7919
10.1007/BF01191625
10.1109/TSE.1986.6312961
10.1145/48014.48247
ContentType Journal Article
Copyright 1999
Copyright_xml – notice: 1999
DBID 6I.
AAFTH
AAYXX
CITATION
DOI 10.1016/S0304-3975(98)00243-6
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1879-2294
EndPage 265
ExternalDocumentID 10_1016_S0304_3975_98_00243_6
S0304397598002436
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
123
1B1
1RT
1~.
1~5
29Q
4.4
457
4G.
5VS
6I.
7-5
71M
8P~
9JN
AABNK
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABAOU
ABBOA
ABEFU
ABFNM
ABJNI
ABMAC
ABTAH
ABVKL
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADMUD
AEBSH
AEKER
AENEX
AEXQZ
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBLVA
GBOLZ
HVGLF
HZ~
IHE
IXB
J1W
KOM
LG9
M26
M41
MHUIS
MO0
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SCC
SDF
SDG
SES
SEW
SPC
SPCBC
SSV
SSW
SSZ
T5K
TAE
TN5
WH7
WUQ
XJT
YNT
ZMT
ZY4
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
ID FETCH-LOGICAL-c307t-9be5a5db2c9475dea7da686f49b577934d2aa7d0dab3409807432271488a601b3
ISICitedReferencesCount 7
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000080729000010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0304-3975
IngestDate Sat Nov 29 06:16:33 EST 2025
Tue Nov 18 22:13:33 EST 2025
Fri Feb 23 02:21:01 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Ring topology
Load balancing
Distributed algorithms
Asynchronous networks
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
https://www.elsevier.com/tdm/userlicense/1.0
https://www.elsevier.com/open-access/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c307t-9be5a5db2c9475dea7da686f49b577934d2aa7d0dab3409807432271488a601b3
OpenAccessLink https://dx.doi.org/10.1016/S0304-3975(98)00243-6
PageCount 19
ParticipantIDs crossref_primary_10_1016_S0304_3975_98_00243_6
crossref_citationtrail_10_1016_S0304_3975_98_00243_6
elsevier_sciencedirect_doi_10_1016_S0304_3975_98_00243_6
PublicationCentury 1900
PublicationDate 1999-06-06
PublicationDateYYYYMMDD 1999-06-06
PublicationDate_xml – month: 06
  year: 1999
  text: 1999-06-06
  day: 06
PublicationDecade 1990
PublicationTitle Theoretical computer science
PublicationYear 1999
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Plaxton (BIB24) June 1989
Bertsekas, Tsitsiklis (BIB8) 1989
Cybenko (BIB10) 1989; 2
Peleg, Upfal (BIB22) 1987; 53
Awerbuch, Cowen, Smith (BIB7) 1994
Frederickson, Lynch (BIB14) 1987; 34
Williams (BIB27) 1991; 3
Aiello, Awerbuch, Maggs, Rao (BIB1) May 1993
Ghosh, Leighton, Maggs, Muthukrishnan, Plaxton, Rajaraman, Richa, Tarjan, Zuckerman (BIB15) May, 1995
Leighton (BIB19) 1991
Hutchinson (BIB17) 1988
Tantawi, Towsley (BIB26) 1985; 32
Attiya, Mavronicolas (BIB4) 1994; 27
Tanenbaum (BIB25) 1989
Peleg, Upfal (BIB23) 1989; 18
Arora, Gouda (BIB3) 1995; vol. 972
Fizzano, Karger, Stein, Wein (BIB13) June 1994
Lamport, Lynch (BIB18) 1990; vol. B
Cohen (BIB9) 1994; 52
Arjomandi, Fischer, Lynch (BIB2) 1983; 30
Attiya, Snir, Warmuth (BIB5) 1988; 35
Heirich, Taylor (BIB16) March 1993
Awerbuch (BIB6) 1985; 32
Deng, Liu, Long, Xiao (BIB11) 1997; 40
Lynch, Fischer (BIB20) 1981; 13
Eager, Lazowska, Zahorjan (BIB12) 1986; 12
der Heide, Oesterdiekhoff, Wanka (BIB21) 1996; 15
Eager (10.1016/S0304-3975(98)00243-6_BIB12) 1986; 12
Attiya (10.1016/S0304-3975(98)00243-6_BIB4) 1994; 27
Cohen (10.1016/S0304-3975(98)00243-6_BIB9) 1994; 52
Awerbuch (10.1016/S0304-3975(98)00243-6_BIB7) 1994
Lamport (10.1016/S0304-3975(98)00243-6_BIB18) 1990; vol. B
Heirich (10.1016/S0304-3975(98)00243-6_BIB16) 1993
Peleg (10.1016/S0304-3975(98)00243-6_BIB23) 1989; 18
Peleg (10.1016/S0304-3975(98)00243-6_BIB22) 1987; 53
Arjomandi (10.1016/S0304-3975(98)00243-6_BIB2) 1983; 30
Attiya (10.1016/S0304-3975(98)00243-6_BIB5) 1988; 35
Cybenko (10.1016/S0304-3975(98)00243-6_BIB10) 1989; 2
Tantawi (10.1016/S0304-3975(98)00243-6_BIB26) 1985; 32
Leighton (10.1016/S0304-3975(98)00243-6_BIB19) 1991
Tanenbaum (10.1016/S0304-3975(98)00243-6_BIB25) 1989
Deng (10.1016/S0304-3975(98)00243-6_BIB11) 1997; 40
Frederickson (10.1016/S0304-3975(98)00243-6_BIB14) 1987; 34
der Heide (10.1016/S0304-3975(98)00243-6_BIB21) 1996; 15
Lynch (10.1016/S0304-3975(98)00243-6_BIB20) 1981; 13
Ghosh (10.1016/S0304-3975(98)00243-6_BIB15) 1995
Williams (10.1016/S0304-3975(98)00243-6_BIB27) 1991; 3
Plaxton (10.1016/S0304-3975(98)00243-6_BIB24) 1989
Aiello (10.1016/S0304-3975(98)00243-6_BIB1) 1993
Hutchinson (10.1016/S0304-3975(98)00243-6_BIB17) 1988
Awerbuch (10.1016/S0304-3975(98)00243-6_BIB6) 1985; 32
Bertsekas (10.1016/S0304-3975(98)00243-6_BIB8) 1989
Arora (10.1016/S0304-3975(98)00243-6_BIB3) 1995; vol. 972
Fizzano (10.1016/S0304-3975(98)00243-6_BIB13) 1994
References_xml – volume: 34
  start-page: 98
  year: 1987
  end-page: 115
  ident: BIB14
  article-title: Electing a leader in a synchronous ring
  publication-title: J. ACM
– volume: 15
  start-page: 413
  year: 1996
  end-page: 427
  ident: BIB21
  article-title: Strongly adaptive token distribution
  publication-title: Algorithmica
– volume: 32
  start-page: 445
  year: 1985
  end-page: 465
  ident: BIB26
  article-title: Optimal static load balancing in distributed computer systems
  publication-title: J. ACM
– volume: 27
  start-page: 547
  year: 1994
  end-page: 571
  ident: BIB4
  article-title: Efficiency of semi-synchronous versus asynchronous networks
  publication-title: Math. Systems Theory
– start-page: 548
  year: May, 1995
  end-page: 558
  ident: BIB15
  article-title: Tight analyses of two local load balancing algorithms
  publication-title: Proc. 27th Annu. ACM Symp. on Theory of Computing
– start-page: 214
  year: 1994
  end-page: 223
  ident: BIB7
  article-title: Efficient asynchronous distributed symmetry breaking
  publication-title: Proc. 26th Annu. ACM Symp. on Theory of Computing
– volume: vol. 972
  start-page: 183
  year: 1995
  end-page: 197
  ident: BIB3
  article-title: Load balancing: An exercise in constrained convergence
  publication-title: Proc. 9th Internat. Workshop on Distributed Algorithms
– year: 1989
  ident: BIB25
  article-title: Computer Networks
– start-page: 64
  year: June 1989
  end-page: 73
  ident: BIB24
  article-title: Load balancing, selection, and sorting on the hypercube
  publication-title: Proc. 1st Annu. ACM Symp. on Parallel Algorithms and Architectures
– volume: 30
  start-page: 449
  year: 1983
  end-page: 456
  ident: BIB2
  article-title: Efficiency of synchronous versus asynchronous distributed systems
  publication-title: J. ACM
– volume: 53
  start-page: 281
  year: 1987
  end-page: 293
  ident: BIB22
  article-title: The generalized packet routing problem
  publication-title: Theoret. Comput. Sci.
– year: 1991
  ident: BIB19
  article-title: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, and Hypercubes
– volume: 32
  start-page: 804
  year: 1985
  end-page: 823
  ident: BIB6
  article-title: Complexity of network synchronization
  publication-title: J. ACM
– start-page: 632
  year: May 1993
  end-page: 641
  ident: BIB1
  article-title: Approximate load balancing on dynamic and asynchronous networks
  publication-title: Proc. 25th Annu. ACM Symp. on Theory of Computing
– year: 1989
  ident: BIB8
  article-title: Parallel and Distributed Computation: Numerical Methods
– year: March 1993
  ident: BIB16
  article-title: A parabolic theory of load balance
  publication-title: Technical Report Caltech-CS-TR-93-22
– volume: 13
  start-page: 17
  year: 1981
  end-page: 43
  ident: BIB20
  article-title: On describing the behavior and implementation of distributed systems
  publication-title: Theoret. Comput. Sci.
– volume: 2
  start-page: 279
  year: 1989
  end-page: 301
  ident: BIB10
  article-title: Dynamic load balancing for distributed memory multiprocessors
  publication-title: J. Parallel Distrib. Comput.
– volume: 52
  start-page: 181
  year: 1994
  end-page: 182
  ident: BIB9
  article-title: On the convergence span of greedy load balancing
  publication-title: Inform. Process. Lett.
– volume: vol. B
  start-page: 1157
  year: 1990
  end-page: 1199
  ident: BIB18
  article-title: Distributed computing: Models and methods
  publication-title: Formal Models and Semantics
– start-page: 210
  year: June 1994
  end-page: 219
  ident: BIB13
  article-title: Job scheduling in rings
  publication-title: Proc. 6th Annu. ACM Symp. on Parallel Algorithms and Architectures
– volume: 35
  start-page: 845
  year: 1988
  end-page: 875
  ident: BIB5
  article-title: Computing on an anonymous ring
  publication-title: J. ACM
– volume: 40
  start-page: 162
  year: 1997
  end-page: 172
  ident: BIB11
  article-title: Competitive analysis of network load balancing
  publication-title: J. Parallel Distrib. Comput.
– volume: 3
  start-page: 457
  year: 1991
  end-page: 481
  ident: BIB27
  article-title: Performance of dynamic load balancing algorithms for unstructured mesh calculations
  publication-title: Concurrency: Practice and Experience
– volume: 12
  start-page: 662
  year: 1986
  end-page: 675
  ident: BIB12
  article-title: Adaptive load sharing in homogeneous distributed systems
  publication-title: IEEE Trans. Software Eng.
– year: 1988
  ident: BIB17
  article-title: Local Area Network Architectures
– volume: 18
  start-page: 229
  year: 1989
  end-page: 243
  ident: BIB23
  article-title: The token distribution problem
  publication-title: SIAM J. Comput.
– volume: 3
  start-page: 457
  year: 1991
  ident: 10.1016/S0304-3975(98)00243-6_BIB27
  article-title: Performance of dynamic load balancing algorithms for unstructured mesh calculations
  publication-title: Concurrency: Practice and Experience
  doi: 10.1002/cpe.4330030502
– volume: 13
  start-page: 17
  year: 1981
  ident: 10.1016/S0304-3975(98)00243-6_BIB20
  article-title: On describing the behavior and implementation of distributed systems
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/0304-3975(81)90109-2
– start-page: 210
  year: 1994
  ident: 10.1016/S0304-3975(98)00243-6_BIB13
  article-title: Job scheduling in rings
– volume: 32
  start-page: 445
  year: 1985
  ident: 10.1016/S0304-3975(98)00243-6_BIB26
  article-title: Optimal static load balancing in distributed computer systems
  publication-title: J. ACM
  doi: 10.1145/3149.3156
– volume: vol. 972
  start-page: 183
  year: 1995
  ident: 10.1016/S0304-3975(98)00243-6_BIB3
  article-title: Load balancing: An exercise in constrained convergence
– start-page: 214
  year: 1994
  ident: 10.1016/S0304-3975(98)00243-6_BIB7
  article-title: Efficient asynchronous distributed symmetry breaking
– volume: 32
  start-page: 804
  year: 1985
  ident: 10.1016/S0304-3975(98)00243-6_BIB6
  article-title: Complexity of network synchronization
  publication-title: J. ACM
  doi: 10.1145/4221.4227
– volume: 52
  start-page: 181
  year: 1994
  ident: 10.1016/S0304-3975(98)00243-6_BIB9
  article-title: On the convergence span of greedy load balancing
  publication-title: Inform. Process. Lett.
  doi: 10.1016/0020-0190(94)90124-4
– volume: 40
  start-page: 162
  year: 1997
  ident: 10.1016/S0304-3975(98)00243-6_BIB11
  article-title: Competitive analysis of network load balancing
  publication-title: J. Parallel Distrib. Comput.
  doi: 10.1006/jpdc.1996.1257
– start-page: 64
  year: 1989
  ident: 10.1016/S0304-3975(98)00243-6_BIB24
  article-title: Load balancing, selection, and sorting on the hypercube
– start-page: 632
  year: 1993
  ident: 10.1016/S0304-3975(98)00243-6_BIB1
  article-title: Approximate load balancing on dynamic and asynchronous networks
– start-page: 548
  year: 1995
  ident: 10.1016/S0304-3975(98)00243-6_BIB15
  article-title: Tight analyses of two local load balancing algorithms
– year: 1988
  ident: 10.1016/S0304-3975(98)00243-6_BIB17
– volume: 30
  start-page: 449
  year: 1983
  ident: 10.1016/S0304-3975(98)00243-6_BIB2
  article-title: Efficiency of synchronous versus asynchronous distributed systems
  publication-title: J. ACM
  doi: 10.1145/2402.322387
– volume: 18
  start-page: 229
  year: 1989
  ident: 10.1016/S0304-3975(98)00243-6_BIB23
  article-title: The token distribution problem
  publication-title: SIAM J. Comput.
  doi: 10.1137/0218015
– year: 1993
  ident: 10.1016/S0304-3975(98)00243-6_BIB16
  article-title: A parabolic theory of load balance
– volume: 15
  start-page: 413
  year: 1996
  ident: 10.1016/S0304-3975(98)00243-6_BIB21
  article-title: Strongly adaptive token distribution
  publication-title: Algorithmica
  doi: 10.1007/BF01955042
– volume: 53
  start-page: 281
  year: 1987
  ident: 10.1016/S0304-3975(98)00243-6_BIB22
  article-title: The generalized packet routing problem
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/0304-3975(87)90069-7
– volume: 2
  start-page: 279
  year: 1989
  ident: 10.1016/S0304-3975(98)00243-6_BIB10
  article-title: Dynamic load balancing for distributed memory multiprocessors
  publication-title: J. Parallel Distrib. Comput.
  doi: 10.1016/0743-7315(89)90021-X
– volume: 34
  start-page: 98
  year: 1987
  ident: 10.1016/S0304-3975(98)00243-6_BIB14
  article-title: Electing a leader in a synchronous ring
  publication-title: J. ACM
  doi: 10.1145/7531.7919
– volume: vol. B
  start-page: 1157
  year: 1990
  ident: 10.1016/S0304-3975(98)00243-6_BIB18
  article-title: Distributed computing: Models and methods
– year: 1991
  ident: 10.1016/S0304-3975(98)00243-6_BIB19
– year: 1989
  ident: 10.1016/S0304-3975(98)00243-6_BIB25
– volume: 27
  start-page: 547
  year: 1994
  ident: 10.1016/S0304-3975(98)00243-6_BIB4
  article-title: Efficiency of semi-synchronous versus asynchronous networks
  publication-title: Math. Systems Theory
  doi: 10.1007/BF01191625
– volume: 12
  start-page: 662
  year: 1986
  ident: 10.1016/S0304-3975(98)00243-6_BIB12
  article-title: Adaptive load sharing in homogeneous distributed systems
  publication-title: IEEE Trans. Software Eng.
  doi: 10.1109/TSE.1986.6312961
– year: 1989
  ident: 10.1016/S0304-3975(98)00243-6_BIB8
– volume: 35
  start-page: 845
  year: 1988
  ident: 10.1016/S0304-3975(98)00243-6_BIB5
  article-title: Computing on an anonymous ring
  publication-title: J. ACM
  doi: 10.1145/48014.48247
SSID ssj0000576
Score 1.5850594
Snippet We consider the problem of load balancing in a ring network. We present an analysis of the following local algorithm. In each step, each node of the ring...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 247
SubjectTerms Asynchronous networks
Distributed algorithms
Load balancing
Ring topology
Title Rapid convergence of a local load balancing algorithm for asynchronous rings
URI https://dx.doi.org/10.1016/S0304-3975(98)00243-6
Volume 220
WOSCitedRecordID wos000080729000010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1879-2294
  dateEnd: 20180131
  omitProxy: false
  ssIdentifier: ssj0000576
  issn: 0304-3975
  databaseCode: AIEXJ
  dateStart: 19950109
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELdKxwM8DBggNj7kB5BAU0rkfNh-nKYimMaEYKC-RRfboZ26tErLVN75wznHrlOxabAHXqzEki9R7pc7f9z9jpCXKk1EKbmO0gryKAXGI8hiFamS5QAqqbKWp-DbMT85EaOR_NTr_VrnwlxMeV2L1UrO_6uqsQ-VbVNnb6DuIBQ78BqVji2qHdt_UvxnmE-0iyZvHNNmmwLZOi1sAWecNpxRtdmJ0--zZrIcn7tgysXPWlmyXBsW24Qt9LMAqJDyqHwtiH3vQEMUjxn7aJ-j2RjQhC_2h4Ngfaew8sH6hwObG9OdMZ1BA34rFm_O7dhuO8JTGERxvmG1EnvUIl05lLWJZSy-hCVvMB3fpve9zNWNuGTW3Q7DlyAbJ99SvGKy5VOMrqDS_sPFhcDDLqYNRRVWVCFF0Yop8ltki-HyKe6TrYMPw9FR59Ez7s68_eO7TLC33Tu9luKNf5-r5zgb85bT-2TbLzjogQPKA9Iz9Q65ty7mQb1t3yF3PwYC38VDctyiiG6giM4qCrRFEbUoogFFNKCIIoroJopoi6JH5Ou74enh-8gX3ogUmvxlJEuTQaZLpmTKM22Aa8hFXqWyzDga9FQzwL5YQ5mksbR8SugXOK6sBeACv0wek349q80TQnlsKqMhSwBMaqmHYqFL4EzoCpgozS5J15-qUJ6V3hZHmRbXqmqXDMKwuaNl-dsAsdZD4X8NN2csEGPXD9276bOekjvdn_GM9JfND_Oc3FYXy8mieeHB9RvM75Wh
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Rapid+convergence+of+a+local+load+balancing+algorithm+for+asynchronous+rings&rft.jtitle=Theoretical+computer+science&rft.au=Gehrke%2C+Johannes+E.&rft.au=Plaxton%2C+C.Greg&rft.au=Rajaraman%2C+Rajmohan&rft.date=1999-06-06&rft.issn=0304-3975&rft.volume=220&rft.issue=1&rft.spage=247&rft.epage=265&rft_id=info:doi/10.1016%2FS0304-3975%2898%2900243-6&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_S0304_3975_98_00243_6
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon