The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Generalized Nash Equilibria for the Service Provisioning Problem in Cloud Systems
Open accessAbstract
In recent years, the evolution and the widespread adoption of virtualization, service-oriented architectures, autonomic, and utility computing have converged letting a new paradigm to emerge: cloud computing. Clouds allow the on-demand delivering of software, hardware, and data as services. Currently, the cloud offer is becoming wider day by day because all the major IT companies and service providers, like Microsoft, Google, Amazon, HP, IBM, and VMWare, have started providing solutions involving this new technological paradigm. As cloud-based services are more numerous and dynamic, the development of efficient service provisioning policies becomes increasingly challenging. In this paper, we take the perspective of Software as a Service (SaaS) providers that host their applications at an Infrastructure as a Service (IaaS) provider. Each SaaS needs to comply with quality-of-service requirements, specified in service-level agreement (SLA) contracts with the end users, which determine the revenues and penalties on the basis of the achieved performance level. SaaS providers want to maximize their revenues from SLAs, while minimizing the cost of use of resources supplied by the IaaS provider. Moreover, SaaS providers compete and bid for the use of infrastructural resources. On the other hand, the IaaS wants to maximize the revenues obtained providing virtualized resources. In this paper, we model the service provisioning problem as a generalized Nash game and we show the existence of equilibria for such game. Moreover, we propose two solution methods based on the best-reply dynamics, and we prove their convergence in a finite number of iterations to a generalized Nash equilibrium. In particular, we develop an efficient distributed algorithm for the runtime allocation of IaaS resources among competing SaaS providers. We demonstrate the effectiveness of our approach by simulation and performing tests on a real prototype environment deployed on Amazon EC2. Results show that, compared to other state-of-the-art solutions, our model can improve the efficiency of the cloud system evaluated in terms of Price of Anarchy by 50-70 percent.
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
MATRIX-ANALYTIC ANALYSIS OF A MAP/PH/1 QUEUE FITTED TO WEB SERVER DATA
RISKA, A., SQUILLANTE, M. S., YU, S.-Z., LIU, Z., & ZHANG, L. (2002) · Matrix-Analytic Methods · doi:10.1142/9789812777164_0018 · Cited by 38
Cited by
Distributed Nash equilibrium seeking for aggregative games with coupled constraints
Liang, S., Yi, P., & Hong, Y. (2017) · Automatica · doi:10.1016/j.automatica.2017.07.064 · Cited by 328
Biobjective Task Scheduling for Distributed Green Data Centers
Yuan, H., Bi, J., Zhou, M., Liu, Q., & Ammari, A. C. (2021) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2019.2958979 · Cited by 138
A Trust Game Model of Service Cooperation in Cloud Computing
Sun, P. (2021) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2020.102864 · Cited by 12
Metadata
- Authors
- Ardagna, D., Panicucci, B., & Passacantando, M.
- Venue
- IEEE Transactions on Services Computing
- Published
- 2013-10
- Volume
- 6
- Issue
- 4
- Pages
- 429-442
- ISSN
- 1939-1374 (ISSN-L)
- OpenAlex
- W2084603067
- Cited by
- 166
- References
- 1
- FWCI
- 36.69
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Generalized Nash Equilibria for the Service Provisioning Problem in Cloud Systems. https://app.cochat.ai/papers/10.1109/tsc.2012.14
- The paper
- Ardagna, D., Panicucci, B., & Passacantando, M. (2013). Generalized Nash Equilibria for the Service Provisioning Problem in Cloud Systems. IEEE Transactions on Services Computing. https://doi.org/10.1109/tsc.2012.14
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.