MULTI-CLASS RESOURCE SHARING WITH BATCH ARRIVALS
-
Published:2018-09-21
Issue:3
Volume:33
Page:348-366
-
ISSN:0269-9648
-
Container-title:Probability in the Engineering and Informational Sciences
-
language:en
-
Short-container-title:Prob. Eng. Inf. Sci.
Author:
Ezhilchelvan Paul,Mitrani Isi
Abstract
A cloud provider hosts virtual machines (VMs) of different types, with different resource requirements. There are bounds on the total amounts of each kind of resource that are available. Requests arrive in batches of different sizes. Under the ‘complete blocking’ policy, a request is accepted only if all the VMs in its batch can be accommodated. The ‘partial blocking’ policy would accept a request if there is room for at least one of the VMs in the batch. Blocked requests are lost, with an associated loss of revenue. The trade-offs between costs and benefits are evaluated by means of appropriate models, for which novel solutions based on fixed-point iterations are proposed. The applicability of those solutions is extended, by means of simplifications, to very large-scale systems. Numerical examples and comparisons with simulations are presented.
Publisher
Cambridge University Press (CUP)
Subject
Industrial and Manufacturing Engineering,Management Science and Operations Research,Statistics, Probability and Uncertainty,Statistics and Probability
Reference24 articles.
1. https://aws.amazon.com/ec2/instance-types/, Amazon Web Services, 2016.
2. The Queueing Network Analyzer
3. Sadre R. , Haverkort B.R. & Ost A. (1999). An efficient and accurate decomposition method for open finite- and infinite-buffer queueing networks. Proceedings of the 3rd International Workshop on Numerical Solution of Markov Chains (Eds. W. Stewart and B. Plateau ), pp. 1–20.
4. Multiservice Loss Models for Broadband Telecommunication Networks
5. Blocking in a Shared Resource Environment
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献