The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Optimization of Resource Provisioning Cost in Cloud Computing
Abstract
In cloud computing, cloud providers can offer cloud consumers two provisioning plans for computing resources, namely reservation and on-demand plans. In general, cost of utilizing computing resources provisioned by reservation plan is cheaper than that provisioned by on-demand plan, since cloud consumer has to pay to provider in advance. With the reservation plan, the consumer can reduce the total resource provisioning cost. However, the best advance reservation of resources is difficult to be achieved due to uncertainty of consumer's future demand and providers' resource prices. To address this problem, an optimal cloud resource provisioning (OCRP) algorithm is proposed by formulating a stochastic programming model. The OCRP algorithm can provision computing resources for being used in multiple provisioning stages as well as a long-term plan, e.g., four stages in a quarter plan and twelve stages in a yearly plan. The demand and price uncertainty is considered in OCRP. In this paper, different approaches to obtain the solution of the OCRP algorithm are considered including deterministic equivalent formulation, sample-average approximation, and Benders decomposition. Numerical studies are extensively performed in which the results clearly show that with the OCRP algorithm, cloud consumer can successfully minimize total cost of resource provisioning in cloud computing environments.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
McKay, M. D., Beckman, R. J., & Conover, W. J. (2000) · Technometrics · doi:10.2307/1271432 · Cited by 7,415
McKay, M. D., Beckman, R. J., & Conover, W. J. (1979) · Technometrics · doi:10.2307/1268522 · Cited by 3,757
Cloud Computing and Grid Computing 360-Degree Compared
Foster, I., Zhao, Y., Raicu, I., & Lu, S. (2008) · 2008 Grid Computing Environments Workshop · doi:10.1109/gce.2008.4738445 · Cited by 2,912
Scenario Reduction Algorithms in Stochastic Programming
Heitsch, H., & Römisch, W. (2003) · Computational Optimization and Applications · doi:10.1023/a:1021805924152 · Cited by 982
Dynamic Placement of Virtual Machines for Managing SLA Violations
Bobroff, N., Kochut, A., & Beaty, K. (2007) · 2007 10th IFIP/IEEE International Symposium on Integrated Network Management · doi:10.1109/inm.2007.374776 · Cited by 808
Monte Carlo bounding techniques for determining solution quality in stochastic programs
Mak, W.-K., Morton, D. P., & Wood, R. K. (1999) · Operations Research Letters · doi:10.1016/s0167-6377(98)00054-6 · Cited by 704
Entropy: a consolidation manager for clusters
Hermenier, F., Lorca, X., Menaud, J.-M., Muller, G., & Lawall, J. (2009) · Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments · doi:10.1145/1508293.1508300 · Cited by 479
The empirical behavior of sampling methods for stochastic programming
Linderoth, J., Shapiro, A., & Wright, S. (2006) · Annals of Operations Research · doi:10.1007/s10479-006-6169-8 · Cited by 425
Optimal virtual machine placement across multiple cloud providers
Chaisiri, S., Lee, B.-S., & Niyato, D. (2009) · 2009 IEEE Asia-Pacific Services Computing Conference (APSCC) · doi:10.1109/apscc.2009.5394134 · Cited by 331
Self-citationShares and utilities based power consolidation in virtualized server environments
Cardosa, M., Korupolu, M. R., & Singh, A. (2009) · 2009 IFIP/IEEE International Symposium on Integrated Network Management · doi:10.1109/inm.2009.5188832 · Cited by 262
SLA-Aware Virtual Resource Management for Cloud Infrastructures
Van, H. N., Tran, F. D., & Menaud, J.-M. (2009) · 2009 Ninth IEEE International Conference on Computer and Information Technology · doi:10.1109/cit.2009.109 · Cited by 209
Grit, L., Irwin, D., Yumerefendi, A., & Chase, J. (2006) · First International Workshop on Virtualization Technology in Distributed Computing (VTDC 2006) · doi:10.1109/vtdc.2006.17 · Cited by 169
Autonomic Provisioning of Backend Databases in Dynamic Content Web Servers
Chen, J., Soundararajan, G., & Amza, C. (2006) · IEEE International Conference on Autonomic Computing (ICAC) · doi:10.1109/icac.2006.1662403 · Cited by 107
Large-Scale Stochastic Linear Programs: Importance Sampling and Benders Decomposition
Dantzig, G. B., & Infanger, G. (1991) · doi:10.21236/ada234962 · Cited by 88
Coordinated Service Allocation through Flexible Reservation
Miyashita, K., Masuda, K., & Higashitani, F. (2008) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2008.9 · Cited by 14
Cited by
A Survey on Mobile Edge Computing: The Communication Perspective
Mao, Y., You, C., Zhang, J., Huang, K., & Letaief, K. B. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2745201 · Cited by 5,607
Security in cloud computing: Opportunities and challenges
Ali, M., Khan, S. U., & Vasilakos, A. V. (2015) · Information Sciences · doi:10.1016/j.ins.2015.01.025 · Cited by 829
Resource Management in Clouds: Survey and Research Challenges
Jennings, B., & Stadler, R. (2015) · Journal of Network and Systems Management · doi:10.1007/s10922-014-9307-7 · Cited by 548
Cloud Computing Resource Scheduling and a Survey of Its Evolutionary Approaches
Zhan, Z.-H., Liu, X.-F., Gong, Y.-J., Zhang, J., Chung, H. S.-H., & Li, Y. (2015) · ACM Computing Surveys · doi:10.1145/2788397 · Cited by 482
Load balancing in cloud computing: A big picture
Mishra, S. K., Sahoo, B., & Parida, P. P. (2020) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2018.01.003 · Cited by 384
Metadata
- Authors
- Chaisiri, S., Lee, B.-S., & Niyato, D.
- Venue
- IEEE Transactions on Services Computing
- Published
- 2012-04
- Volume
- 5
- Issue
- 2
- Pages
- 164-177
- ISSN
- 1939-1374 (ISSN-L)
- OpenAlex
- W2133664094
- Cited by
- 643
- References
- 15
- FWCI
- 138.72
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.