Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints

DOI10.1007/s11134-014-9414-xzbMath1310.90031arXiv1306.4991OpenAlexW2081708767MaRDI QIDQ2018944

Yuan Zhong, Alexander L. Stolyar

Publication date: 26 March 2015

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.4991

zbMATH Keywords

queueing networksvirtual machinecloud computingfluid limitinfinite server systemgreedy random algorithmstochastic bin packing

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

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 heterogeneous service systems with general packing constraints

Cites Work

• Unnamed Item
• Loss networks
• Stochastic bandwidth packing process: stability conditions via Lyapunov function technique
• Shadow-Routing Based Control of Flexible Multiserver Pools in Overload
• On the Sum-of-Squares algorithm for bin packing
• A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
• Blocking probabilities in large circuit-switched networks
• Insensitivity in queueing systems
• Dynamics of large uncontrolled loss networks
• Interior-Point-Based Online Stochastic Bin Packing
• An Infinite Server System with General Packing Constraints
• A Note on Insensitivity in Stochastic Networks

This page was built for publication: Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints