Large-scale heterogeneous service systems with general packing constraints
From MaRDI portal
Publication:5233159
DOI10.1017/apr.2016.79zbMath1426.90060arXiv1508.07512OpenAlexW2963819536MaRDI QIDQ5233159
Publication date: 16 September 2019
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.07512
lossqueueing networkblockingcloud computingfluid limitstochastic bin packinggreedy random (GRAND) algorithmheterogeneous service systempacking constraint
Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25)
Related Items (5)
Pull-based load distribution among heterogeneous parallel servers: the case of multiple routers ⋮ A Theory of Auto-Scaling for Resource Reservation in Cloud Services ⋮ A Service System with Packing Constraints: Greedy Randomized Algorithm Achieving Sublinear in Scale Optimality Gap ⋮ Large-scale join-idle-queue system with general service times ⋮ A Restless Bandit Model for Resource Allocation, Competition, and Reservation
Cites Work
- Decay of tails at equilibrium for FIFO join the shortest queue networks
- Asymptotic independence of queues under randomized load balancing
- Queueing system with selection of the shortest of two queues: An asymptotic approach
- Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints
- Pull-based load distribution in large-scale heterogeneous service systems
- On the Sum-of-Squares algorithm for bin packing
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
- Interior-Point-Based Online Stochastic Bin Packing
- An Infinite Server System with General Packing Constraints
This page was built for publication: Large-scale heterogeneous service systems with general packing constraints
