Browse by author
Lookup NU author(s): Dr Paul EzhilchelvanORCiD, Emeritus Professor Isi Mitrani
This is the authors' accepted manuscript of an article that has been published in its final definitive form by Cambridge University Press, 2019.
For re-use rights please refer to the publisher's terms and conditions.
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.
Author(s): Ezhilchelvan P, Mitrani I
Publication type: Article
Publication status: Published
Journal: Probability in the Engineering and Informational Sciences
Year: 2019
Volume: 33
Issue: 3
Pages: 348-366
Print publication date: 01/07/2019
Online publication date: 21/09/2018
Acceptance date: 14/09/2018
Date deposited: 18/10/2018
ISSN (print): 0269-9648
ISSN (electronic): 1469-8951
Publisher: Cambridge University Press
URL: https://doi.org/10.1017/S0269964818000323
DOI: 10.1017/S0269964818000323
Altmetrics provided by Altmetric
