.png){kind=icon}
.png){kind=icon}
Return
Time-preference-based on-spot bundled cloud-service provisioning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.dss.2021.113607.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The cloud computing spot instance is one offering that vendors are leveraging to provide differentiated service to an expanding pay-per-use computing market. Spot instances have cost advantages, albeit at a trade-off of interruptions that can occur when the user's bid price falls below the spot price. The interruptions are often exacerbated since customers often require resources in bundles. For these reasons, customers might have to wait for a long time before their jobs are completed. In this paper, we propose a behavioral-economic model in the form of time-preference-based bids, wherein users are willing to use and bid for services at other times if the vendor cannot provide the resources at the preferred time. Given such bids, we consider the problem of provisioning for such service requests. We develop a time-preference-based optimization model. Since the optimization model is NP-Hard, we develop rule-based genetic algorithms. We have obtained very encouraging results with respect to standard commercial solver as a benchmark. In turn, our results provide evidence for the viability of our approach for online service-provisioning problems.
Keywords:
Behavioral-economic model
Cloud computing
Spot Market
Time-preference
Binary integer programming
Genetic algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.8
Papers:
3.8K
Citations:
1.5W