A cloud service broker based on dynamic game theory for bilateral SLA negotiation in cloud environment

6Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

In recent years, with the development of cloud computing, more and more service providers appear, making the cloud computing market more open and competitive. However, it is difficult for service consumers to choose the most suitable service provider for their own, especially for the service providers to provide the best service in the negotiated price, while the service providers and the service consumers themselves can’t automatically negotiate, thus in this paper, we propose a cloud service broker framework based on dynamic game theory for bilateral SLA negotiation in cloud environment, aiming for successful negotiation among participators. This paper also proposes a Nash equilibrium point and a satisfaction degree difference algorithm, aiming to find the optimal value of SLA attributes (price and bandwidth) at the minimum satisfaction degree difference among the participators. Experimental results show that the service consumers and the service providers are able to achieve the same satisfaction degree on price and bandwidth.

Cite

CITATION STYLE

APA

Chen, H., Liu, X., Xu, H., & Wang, C. (2016). A cloud service broker based on dynamic game theory for bilateral SLA negotiation in cloud environment. International Journal of Grid and Distributed Computing, 9(9), 251–268. https://doi.org/10.14257/ijgdc.2016.9.9.22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free