Infinite balanced allocation via finite capacities

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)∈N . Given a fixed arrival rate λ=λ(n)∈(0,1) , in every round λn new balls (requests) are generated. Together with possible...

Full description

Saved in:
Bibliographic Details
Main Authors: Petra Berenbrink, Tom Friedetzky, Christopher Hahn, Lukas Hintze, Dominik Kaaser, Peter Kling, Lars Nagel
Format: Default Conference proceeding
Published: 2021
Subjects:
load balancing
balls-into-bins
job allocation
capacity
infinite process
thresholds
Online Access:https://hdl.handle.net/2134/15062856.v1
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://hdl.handle.net/2134/15062856.v1

Similar Items