Name
Abstract | ||
|---|---|---|
We analyze the following infinite load balancing process, modeled as a classical balls-into-bins game: There are $n$ bins (servers) with a limited capacity (buffer) of size $c=c(n)\in \mathbb{N}$. Given a fixed arrival rate $\lambda=\lambda(n)\in(0,1)$, in every round $\lambda n$ new balls (requests) are generated. Together with possible leftovers from p... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/ICDCS51616.2021.00096 | 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS) |
Keywords | DocType | ISSN |
Analytical models,Conferences,Load management,Servers,Resource management,Distributed computing,Load modeling | Conference | 1063-6927 |
ISBN | Citations | PageRank |
978-1-6654-4513-9 | 0 | 0.34 |
References | Authors | |
0 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Petra Berenbrink | 1 | 472 | 46.41 |
| tom friedetzky | 2 | 249 | 24.47 |
| Christopher Hahn | 3 | 0 | 0.34 |
| Lukas Hintze | 4 | 0 | 0.34 |
| Dominik Kaaser | 5 | 26 | 8.14 |
| Peter Kling | 6 | 34 | 6.05 |
| Lars Nagel | 7 | 76 | 13.58 |