标题：A Distributed Game-theoretic Approach for IaaS Service Trading in an Auction-based Cloud Market
作者：Wei, Yi; Pan, Li; Yuan, Dong; Liu, Shijun; Wu, Lei; Meng, Xiangxu
作者机构：[Wei, Yi; Pan, Li; Liu, Shijun; Wu, Lei; Meng, Xiangxu] Shandong Univ, Sch Comp Sci & Technol, Jinan 250101, Peoples R China.; [Yuan, Dong] Univ Syd 更多
会议名称：15th IEEE Int Conf on Trust, Security and Privacy in Comp and Commun / 10th IEEE Int Conf on Big Data Science and Engineering / 14th IEEE Int Symposium on Parallel and Distributed Proc with Applicat (IEEE Trustcom/BigDataSE/ISPA)
会议日期：AUG 23-26, 2016
来源：2016 IEEE TRUSTCOM/BIGDATASE/ISPA
关键词：cloud computing; Infrastructure as a Service; auction; resource; allocation; game theory; Nash equilibrium
摘要：With the rapid development of IaaS market, how to efficiently trade between cloud providers and users is becoming a new challenge which attracts huge attentions from both industry and academia. Compared with traditional fixed-price model, market-oriented trading mechanism such as auction demonstrates greater promise for resource pricing and allocation in clouds due to its adaptability and flexibility. In this paper, we focus on the competitive and bidding scenario among independent users in an auction-based IaaS market. Participants have different composite service demands and they adjust their bidding prices during the trading with the aim of obtaining appropriate amount of resources to maximize their profits. We formulate this scenario as a dynamic noncooperative game with incomplete information and propose a feedback-based distributed bidding adjustment approach to find the approximated optimal bids (i.e. Nash Equilibrium) for each user so as to achieve a fair and multi-win resources allocation outcome in the whole market. Our experimental investigation showed that with the help of our agent-based automated trading model and distributed bidding algorithms, the Nash equilibrium state of the cloud resource allocation game can be reached efficiently within an acceptable time, and the optimal bidding prices of each user could be obtained at the same time.