TY - JOUR
T1 - Reservation schemes for IaaS cloud broker
T2 - A time-multiplexing way for different rental time
AU - Gu, Chonglin
AU - Chen, Shi
AU - Zhang, Jiangtao
AU - Huang, Hejiao
AU - Jia, Xiaohua
PY - 2017/8/25
Y1 - 2017/8/25
N2 - Infrastructure-as-a-Service cloud providers always charge users in 2 ways: on-demand billing and reservation billing with different discounts. On-demand billing is more flexible for short-term use but with higher cost, while reservation billing is much cheaper for long renting period but may cause inefficiency because of underutilized capacity. As middle agent, cloud broker always tries to reserve a large number of virtual machine (VM) instances from cloud providers to meet the requirement of all users, while making high profit through reducing its cost by leveraging long-term reservations and time-multiplexing of instances. Different from existing work, we believe that the rental time of each user's request should be served consecutively in one VM instance, rather than partitioned into different VM instances by cloud broker to enhance time-multiplexing ratio. In this paper, we first try to smooth users' unordered and time-overlapping requests using demand graph, based on which we propose two reservation algorithms for cloud broker, one for off-line and the other for online. We also consider cloud broker with multiple service providers, finding that much more cost can be saved by leveraging the various reservation discounts of those providers. Extensive simulations have been done on the traces from real cloud platforms. Experiment results show that the broker cost can be substantially saved using our off-line and online algorithms.
AB - Infrastructure-as-a-Service cloud providers always charge users in 2 ways: on-demand billing and reservation billing with different discounts. On-demand billing is more flexible for short-term use but with higher cost, while reservation billing is much cheaper for long renting period but may cause inefficiency because of underutilized capacity. As middle agent, cloud broker always tries to reserve a large number of virtual machine (VM) instances from cloud providers to meet the requirement of all users, while making high profit through reducing its cost by leveraging long-term reservations and time-multiplexing of instances. Different from existing work, we believe that the rental time of each user's request should be served consecutively in one VM instance, rather than partitioned into different VM instances by cloud broker to enhance time-multiplexing ratio. In this paper, we first try to smooth users' unordered and time-overlapping requests using demand graph, based on which we propose two reservation algorithms for cloud broker, one for off-line and the other for online. We also consider cloud broker with multiple service providers, finding that much more cost can be saved by leveraging the various reservation discounts of those providers. Extensive simulations have been done on the traces from real cloud platforms. Experiment results show that the broker cost can be substantially saved using our off-line and online algorithms.
KW - cloud broker
KW - cost minimization
KW - instance reservation
KW - virtual machine
UR - http://www.scopus.com/inward/record.url?scp=85002566976&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85002566976&origin=recordpage
U2 - 10.1002/cpe.3972
DO - 10.1002/cpe.3972
M3 - RGC 21 - Publication in refereed journal
SN - 1532-0626
VL - 29
JO - Concurrency Computation
JF - Concurrency Computation
IS - 16
M1 - e3972
ER -