Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Threshold Load Balancing in Networks   We study probabilistic protocols for concurrent threshold-based load
balancing in networks. There are n resources or machines represented by nodes
in an undirected graph and m >> n users that try to find an acceptable resource
by moving along the edges of the graph. Users accept a resource if the load is
below a threshold. Such thresholds have an intuitive meaning, e.g., as
deadlines in a machine scheduling scenario, and they allow the design of
protocols under strong locality constraints. When migration is partly
controlled by resources and partly by users, our protocols obtain rapid
convergence to a balanced state, in which all users are satisfied. We show that
convergence is achieved in a number of rounds that is only logarithmic in m and
polynomial in structural properties of the graph. Even when migration is fully
controlled by users, we obtain similar results for convergence to approximately
balanced states. If we slightly adjust the migration probabilities in our
protocol, we can also obtain fast convergence to balanced states.

0
The categories of this paper are: hep-ph
33
The categories of this paper are: plasm-ph
6
The categories of this paper are: astro-ph
26
The categories of this paper are: bayes-an
13
The categories of this paper are: quant-ph
9
The categories of this paper are: nlin
12
The categories of this paper are: nucl-th
28
The categories of this paper are: alg-geom
32
The categories of this paper are: atom-ph
34
The categories of this paper are: chem-ph
36
The categories of this paper are: cmp-lg
27
The categories of this paper are: comp-gas
22
The categories of this paper are: chao-dyn
16
The categories of this paper are: stat
31
The categories of this paper are: ao-sci
25
The categories of this paper are: patt-sol