Game Based Cooperative Negotiation among Cloud Providers in a Dynamic Collaborative Cloud Services Platform

게임 이론 기반 동적 협력 클라우드 서비스 플랫폼에서의 클라우드 공급자간 협상 기법

  • Received : 2010.08.23
  • Accepted : 2010.09.10
  • Published : 2010.10.31

Abstract

In recent years, dynamic collaboration (DC) among cloud providers (CPs) is becoming an inevitable approach for the widely use of cloud computing and to realize the greatest value of it. In our previous paper, we proposed a combinatorial auction (CA) based cloud market model called CACM that enables a DC platform among different CPs. The CACM model allows any CP to dynamically collaborate with suitable partner CPs to form a group before joining an auction and thus addresses the issue of conflicts minimization that may occur when negotiating among providers. But how to determine optimal group bidding prices, how to obtain the stability condition of the group and how to distribute the winning prices/profits among the group members in the CACM model have not been studied thoroughly. In this paper, we propose to formulate the above problems of cooperative negotiation in the CACM model as a bankruptcy game which is a special type of N-person cooperative game. The stability of the group is analyzed by using the concept of the core and the amount of allocationsto each member of the group is obtained by using Shapley value. Numerical results are presented to demonstrate the behaviors of the proposed approaches.

최근 다양한 분야에서 클라우드 컴퓨팅의 사용이 증가하고클라우드 컴퓨팅의 이상적 가치 실현을 위한 클라우드 공급자간의 동적협력은 필수적인 요소가 되고 있다. 이전의 연구를 통해서 다른 클라우드 공급자 간의 동적 협력 플랫폼으로 경매결합 방식 기반의 클라우드 마켓 모델 "CACM"을 제안한 바 있다. CACM모델은 경매에 참여하기 전에 미리 최적화된 클라우드 공급자들간 그룹을 형성하여 동적 협력을 제공할 수 있도록 하고 있으며, 이에 따라 공급자 간 협상시 발생할 수 있는 문제들을 최소화 하고자 하였다. 그러나 어떻게 최적의 입찰 가격 결정 그룹을 결정할 것인지, 어떻게 안정적인 그룹의 조건을 구할 것인지, 또한 입찰 가능 가격 및 이익을 그룹 구성원 간에 분배할 것인지에 대한 연구는 CACM 모델에서 구체적으로 연구되지 못했다. 본 논문에서는, CACM 모델을 N-person 협력 게임 이론에 대입하여 CACM모델에 추가적으로 위에서 제시한 문제들을 공식화하여 제안하고자 한다. 그룹의 안정성은 그룹의 각 구성원에게 코어와 할당량에 대한 개념을 대입해 게임이론에서의 샤플리 값을 사용하여 분석한다. 여러 계산 결과값을 통해 제안하는 기법의 특성평가를 도출한다.

Keywords

References

  1. M. M. Hassan, B. Songand E.N. Huh. "A Novel Market Oriented Dynamic Collaborative Cloud Service Infrastructure". The 5th IEEE SERVICES.II, Bangalore, India, September 21-25, Vol.1, pp. 9-16, 2009,
  2. S. Nepal, and J. Zic. "A Conflict NeighboringNegotiation Algorithm for Resource Services in Dynamic Collaboration". The IEEE Int. Conf. on Services Computing, Vol. 2, pp. 283-290, 2008
  3. M. M. Hassan, B. Song and E. N. Huh. "A Multi-Objective Optimization Model for Partner Selection in a Market-Oriented Dynamic Collaborative Cloud Service Platform". The 21stIntl. Conf. on Tools with Artificial Intelligence, New Jersey, USA, November 2-5, Vol. 1, pp. 637-644, 2009
  4. L. He and T. R. Ioerger, "Forming Resource-Sharing Coalitions: A Distributed Resource Allocation Mechanism for Self-Interested Agents in Computational Grids", ACM Symposium on Applied Computing, 2005
  5. J. Yamamoto and K. Sycara. "A stable and efficient buyer coalition formation scheme for e-marketplaces". International Conference on Autonomous Agents, pp: 576 . 583, 2001
  6. M. Nagarajan and G. Sosic. "Game-Theoretic Analysis of Cooperation among Supply Chain Agents: Review and Extensions". European Journal of Operational Research, May 2006
  7. A. S. Belenky,. "Cooperative Games of Choosing Partners and Forming Coalitions in the Marketplace". Journal of Mathematical and Computer Modeling, Vol. 36, pp. 1279-1291, 2002 https://doi.org/10.1016/S0895-7177(02)00276-5
  8. J-H Chen, K-M Chao, N. Godwin et al. "A Multiple-Stage Cooperative Negotiation". IEEE Intl. Conf. on e-Technology, e-Commerce and e-Service, pp. 131-138, 2004
  9. T.G. Crainic, M. Gendreau et al. "Cost Allocations in Combinatorial Auctions for Bilateral Procurement Markets". CIRRELT report, December, 2009, https://www.cirrelt.ca/
  10. K. Suzuki and M. Yokoo. "Secure generalized Vickery auction using homomorphic encryption". In Financial Cryptography, 7th International Conference, FC 2003, volume 2742 of Lecture Notes in Computer Science. Springer, 2003
  11. M. Yokoo and K. Suzuki. "Secure Multi-agent Dynamic Programming based on Homomorphic Encryption and its Application to Combinatorial Auctions". The first ACM joint International Conference on Autonomous Agents and Multi agent Systems, Bologna, Italy, July 2002
  12. T. S. Ferguson. "Game Theory Text", Mathematics Department, UCLA.
  13. M. Pulido, J. S. Soriano, and N. Llorca. "Game theory techniques for university management: An extended bankruptcy model". Operation Research, vol. 109, pp. 129-142, 2002
  14. L. S. Shapley. "A value for N-Person game". Annals of Mathematics Studies, Princeton University Press, vol. 2, pp. 307-317, 1953