Elliot Anshelevich, David Kempe  Home/Search
Context Related
| cornell.edu/home/kleinb...stoc02bal.ps From: cornell.edu/home/kleinber/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In the dynamic load balancing problem, we seek to keep the job load roughly evenly distributed among the processors of a given network. The arrival and departure of jobs is modeled by an adversary restricted in its power. Muthukrishnan and Rajaraman (1998) gave a clean characterization of a restriction on the adversary that can be considered the natural analogue of a cut condition. They proved that a simple local balancing algorithm proposed by Aiello et. al. (1993) is stable against such an... (Update)
Context of citations to this paper: More
...The aim is to route and schedule packets so that the system remains stable. A similar problem was considered by Anshelevich et al. in [6]. However, there is an important distinction between our model and the models of [7, 6] in addition to the fact that their rates can only...
Cited by: More
Scheduling over a Time-Varying User-Dependent Channel with.. - Andrews, Zhang (2002) (Correct)
Routing and Scheduling in Multihop Wireless Networks with.. - Andrews, Zhang (Correct)
The Effect of Faults on Network Expansion - Bagchi, Bhargava, Chaudhary.. (2004) (Correct)
Active bibliography (related documents): More All
0.5: Algorithms And Complete Formulations For The Network Design Problem - Sastry (1997) (Correct)
0.2: Load Balancing in Arbitrary Network Topologies with.. - Anagnostopoulos.. (2005) (Correct)
0.2: Stability and Efficiency of a Random Local Load.. - Anagnostopoulos.. (2003) (Correct)
Similar documents based on text: More All
0.4: An Adversarial Model for Distributed Dynamic Load Balancing - Muthukrishnan, Rajaraman (1998) (Correct)
0.4: Connectivity and Inference Problems for Temporal Networks - Kempe, Kleinberg, Kumar (2000) (Correct)
0.3: Connectivity and Inference Problems for Temporal Networks.. - Kempe, al. (1999) (Correct)
Related documents from co-citation: More All
4: Adaptive packet routing for bursty adversarial traffic - Aiello, Kushilevitz et al. - 1998
4: Adversarial queueing theory - Borodin, Kleinberg et al.
3: Power and Server Allocation in a Multi-Beam Satellite with Time Varying Channels (context) - Neely, Modiano et al. - 2002
BibTeX entry: (Update)
E. Anshelevich, D. Kempe, and J. Kleinberg. Stability of load balancing algorithms in dynamic adversarial systems. In Proc. of the 34th ACM Symp. on Theory of Computing (STOC), 2002. http://citeseer.ist.psu.edu/anshelevich02stability.html More
@misc{ anshelevich02stability,
author = "E. Anshelevich and D. Kempe and J. Kleinberg",
title = "Stability of load balancing algorithms in dynamic adversarial systems",
text = "E. Anshelevich, D. Kempe, and J. Kleinberg. Stability of load balancing
algorithms in dynamic adversarial systems. In Proc. of the 34th ACM Symp.
on Theory of Computing (STOC), 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/anshelevich02stability.html" }
Citations (may not include all citations):266 Adaptive Load Sharing in Homogeneous Distributed Systems (context) - Eager, Lazowska et al. - 1986
170 The geometry of graphs and some of its algorithmic applicati.. - Linial, London et al. - 1995
90 Universal Stability Results for Greedy Contention--Resolutio.. - Andrews, Awerbuch et al. - 1996
90 Adversarial Queueing Theory - Borodin, Kleinberg et al. - 1996
84 Scheduling and Load Balancing in Parallel and Distributed Sy.. (context) - Shirazi, Hurson et al. - 1995
71 Maximal flow through a network (context) - Ford, Fulkerson - 1956
54 The token distribution problem (context) - Peleg, Upfal - 1989
45 Improved approximation algorithms for the multi-commodity fl.. - Awerbuch, Leighton - 1994
41 Multi-commodity network flows (context) - Hu - 1963
41 A simple local-control approximation algorithm for multicomm.. - Awerbuch, Leighton - 1993
35 Tight analyses of two local load balancing algorithms - Ghosh, Leighton et al. - 1995
35 the Analysis of Randomized Load Balancing Schemes - Mitzenmacher - 1997
34 Approximate load balancing on dynamic and asynchronous netwo.. - Aiello, Awerbuch et al. - 1993
34 Task assignment in a distributed system: Improving performan.. - Crovella, Harchol-Balter et al. - 1998
33 Adaptive packet routing for bursty adversarial tra#c - Aiello, Kushilevitz et al. - 1998
31 Stability of adaptive and non-adaptive packet routing polici.. - Gamarnik - 1999
30 Multicommodity max-flow min-cut theorems and their use in de.. (context) - Leighton, Rao - 1999
30 Strongly adaptive token distribution - auf, Oesterdiekho et al. - 1996
15 Simple routing strategies for adversarial systems - Awerbuch, Berenbrink et al. - 2001
7 An adversarial model for distributed dynamic load balancing - Muthukrishnan, Rajaraman - 1998
2 A short proof of the two-commodity flow theorem (context) - Seymour - 1979
Documents on the same site (http://www.cs.cornell.edu/home/kleinber/): More
On Invariants of Sets of Points or Line Segments Under.. - Huttenlocher, Kleinberg (Correct)
Allocating Bandwidth for Bursty Connections - Kleinberg, Rabani, Tardos (1997) (Correct)
The Localization Problem for Mobile Robots - Kleinberg (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC