The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Imperfect Information Dynamic Stackelberg Game Based Resource Allocation Using Hidden Markov for Cloud Computing
Abstract
Existing static grid resource scheduling algorithms, which are limited to minimizing the makespan, cannot meet the needs of resource scheduling required by cloud computing. Current cloud infrastructure solutions provide operational support at the level of resource infrastructure only. When hardware resources form the virtual resource pool, virtual machines are deployed for use transparently. Considering the competing characteristics of multi-tenant environments in cloud computing, this paper proposes a cloud resource allocation model based on an imperfect information Stackelberg game (CSAM-IISG) using a hidden Markov model (HMM) in a cloud computing environment. CSAM-IISG was shown to increase the profit of both the resource supplier and the applicant. Firstly, we used the HMM to predict the service provider's current bid using the historical resources based on demand. Through predicting the bid dynamically, an imperfect information Stackelberg game (IISG) was established. The IISG motivates service providers to choose the optimal bidding strategy according to the overall utility, achieving maximum profits. Based on the unit prices of different types of resources, a resource allocation model is proposed to guarantee optimal gains for the infrastructure supplier. The proposed resource allocation model can support synchronous allocation for both multi-service providers and various resources. The simulation results demonstrated that the predicted price was close to the actual transaction price, which was lower than the actual value in the game model. The proposed model was shown to increase the profits of service providers and infrastructure suppliers simultaneously.
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
Beloglazov, A., Abawajy, J., & Buyya, R. (2012) · Future Generation Computer Systems · doi:10.1016/j.future.2011.04.017 · Cited by 2,761
Rethinking virtual network embedding: substrate support for path splitting and migration
Yu, M., Yi, Y., Rexford, J., & Chiang, M. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1355734.1355737 · Cited by 1,244
Energy-Optimal Mobile Cloud Computing under Stochastic Wireless Channel
Zhang, W., Wen, Y., Guan, K., Kilper, D., Luo, H., & Wu, D. O. (2013) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2013.072513.121842 · Cited by 863
ViNEYard: Virtual Network Embedding Algorithms With Coordinated Node and Link Mapping
Chowdhury, M., Rahman, M. R., & Boutaba, R. (2012) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2011.2159308 · Cited by 818
Optimization of Resource Provisioning Cost in Cloud Computing
Chaisiri, S., Lee, B.-S., & Niyato, D. (2012) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2011.7 · Cited by 643
Dynamic resource management using virtual machine migrations
Mishra, M., Das, A., Kulkarni, P., & Sahoo, A. (2012) · IEEE Communications Magazine · doi:10.1109/mcom.2012.6295709 · Cited by 270
SVNE: Survivable Virtual Network Embedding Algorithms for Network Virtualization
Rahman, M. R., & Boutaba, R. (2013) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2013.013013.110202 · Cited by 230
Dynamic Resource Pricing on Federated Clouds
Mihailescu, M., & Teo, Y. M. (2010) · 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing · doi:10.1109/ccgrid.2010.123 · Cited by 182
Survivable Virtual Network Embedding
Rahman, M. R., Aib, I., & Boutaba, R. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-12963-6_4 · Cited by 165
Dynamic Auction Mechanism for Cloud Resource Allocation
Lin, W., Lin, G.-Y., & Wei, H. (2010) · IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid) · doi:10.1109/ccgrid.2010.92 · Cited by 155
Cited by
Sajid, A., Abbas, H., & Saleem, K. (2016) · IEEE Access · doi:10.1109/access.2016.2549047 · Cited by 401
Machine Learning Based Workload Prediction in Cloud Computing
Gao, J., Wang, H., & Shen, H. (2020) · 2020 29th International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn49398.2020.9209730 · Cited by 311
Driver behavior profiling: An investigation with different smartphone sensors and machine learning
Ferreira, J., Carvalho, E., Ferreira, B. V., de Souza, C., Suhara, Y., Pentland, A., & Pessin, G. (2017) · PLOS ONE · doi:10.1371/journal.pone.0174959 · Cited by 258
Recovery for overloaded mobile edge computing
Satria, D., Park, D., & Jo, M. (2017) · Future Generation Computer Systems · doi:10.1016/j.future.2016.06.024 · Cited by 112
An Energy-Efficient Networking Approach in Cloud Services for IIoT Networks
Jiang, D., Wang, Y., Lv, Z., Wang, W., & Wang, H. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.2980919 · Cited by 106
A survey on computation resource allocation in IoT enabled vehicular edge computing
Naren, Gaurav, A. K., Sahu, N., Dash, A. P., Chalapathi, G. S. S., & Chamola, V. (2022) · Complex & Intelligent Systems · doi:10.1007/s40747-021-00483-x · Cited by 25
Investigating the Adoption of Hybrid Encrypted Cloud Data Deduplication With Game Theory
Liang, X., Yan, Z., Deng, R. H., & Zheng, Q. (2021) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2020.3028685 · Cited by 18
Metadata
- Authors
- Wei, W., Fan, X., Song, H., Fan, X., & Yang, J.
- Venue
- IEEE Transactions on Services Computing
- Published
- 2018-01-01
- Volume
- 11
- Issue
- 1
- Pages
- 78-89
- ISSN
- 1939-1374 (ISSN-L)
- OpenAlex
- W2334760274
- Cited by
- 348
- References
- 17
- FWCI
- 113.70
- 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.