期刊文献+

基于非合作博弈效用最优化的云资源提供策略

Cloud Resource Provision Strategy Based on Non-cooperative Game Utility Optimization
下载PDF
导出
摘要 为解决云计算资源提供过程中用户的异构性需求问题,提出一种基于非合作博弈效用最优化的云资源提供策略。利用比例共享机制,根据用户的出价提供资源,对用户的出价函数进行求解,并证明效用最优化模型存在非合作博弈纳什均衡解。实验结果表明,该策略能够反映用户需求与资源价格之间的浮动关系,规范用户的出价与资源分配,在公平性、均衡性和合理性上均有较好的效果。 To solve the problem of heterogeneity of user requirements in cloud resource provision, this paper proposes a cloud resource provision strategy based on non-cooperative game utility optimization. The strategy provides resources according to user's bidding by proportional sharing mechanism. The bidding function is solved, and the existence of Nash equilibrium solution of optimal bidding set is proved. Experimental results show that the strategy can reflect the floating relation between user requirement and resource price, regulate the user's bidding and resource allocation, and get better performance on fairness, equilibrium and rationality.
出处 《计算机工程》 CAS CSCD 2013年第7期59-62,72,共5页 Computer Engineering
基金 国家自然科学基金资助项目(60970064 60773211 61171075)
关键词 云计算 效用最优化 资源提供策略 非合作博弈 纳什均衡 cloud computing utility optimization resource provision strategy non-cooperative game Nash equilibrium
  • 相关文献

参考文献8

  • 1Armbrust M, Fox A, Griffith R, et al. A View of Cloud Computing[J]. Communications of the ACM, 2010, 53(4): 5O-58.
  • 2李志洁,程春田,黄飞雪.基于合作博弈的网格资源分配[J].大连理工大学学报,2007,47(6):909-913. 被引量:10
  • 3Subrata R, Zomaya A Y, Landfeldt B. A Cooperative Game Framework for QoS Guided Job Allocation Schemes in Grids[J]. IEEE Transactions on Parallel and Distributed Systems, 2008, 57(10): 1413-1422.
  • 4Subrata R, Zomaya A Y, Landfeldt B. Game Theoretic Approach for Load Balancing in Computational Grids[J]. IEEE Transactions on Parallel and Distributed Systems, 2008, 19(1): 66-76.
  • 5Drew F, Jean T. Game Theroy[M]. Cambridge, USA: TheMIT Press, 1991.
  • 6Li Chunlin, Li Layuan. Competitive Proportional Resource Allocation Policy for Computational Grid[J]. Future Genaration Computer Systems, 2004, 20(6): 1041-1054.
  • 7Calheiros R N , Ranjan R, Beloglazov A, et al. CloudSim: A Toolkit for Modeling and Simulation of Cloud Computing Environments and Evaluation of Resource Provisioning Algorithms[J]. Software-Practice & Experience, 2011, 41(1): 23-50.
  • 8Buyya R, Ranjan R, Calheiros R N. Modeling and Simulation of Scalable Cloud Computing Environments and the CloudSim Toolkit: Challenges and Opportunities[C]//Proc. of International Conference on High Performance Computing & Simulation. IS. 1.]: IEEE Press, 2009:1-11.

二级参考文献14

  • 1翁楚良,陆鑫达.一种基于市场机制的网格资源调价算法[J].计算机研究与发展,2004,41(7):1151-1156. 被引量:26
  • 2李志洁,程春田,黄飞雪,李欣.一种基于序贯博弈的网格资源分配策略[J].软件学报,2006,17(11):2373-2383. 被引量:27
  • 3FOSTER I. The grid: computing without bonds [J]. Sci Amer, 2003, 288(4): 78-85.
  • 4YANG Guang-wen, JIN Hai, LI Ming-lu, et al. Grid computing in China [J]. J Grid Comput, 2004, 2(2): 193-206.
  • 5JIN Hai. Challenges of grid computing[C] .Advances in Web-Age Information Management: 6th International Conference, LNCS 3739. Berlin:Springer-Verlag, 2005 : 25-31.
  • 6KRAUTER K, BUYYA R, MAHESWARAN M. A taxonomy and survey of grid resource management system for distributed computing [J]. Software: Practice and Experience, 2002, 32(2) : 135-164.
  • 7BUYYA R, ABRAMSON D, GIDDY J, et al. Economic models for resource management and scheduling in grid computing [J]. Concurrency and Computation: Practice and Experience, 2002, 14(13-15) : 1507-1542.
  • 8CHENG J, WELLMAN M. The WALRAS algorithm: a convergent distributed implementation of general equilibrium outcomes[J]. Comput Econ, 1998, 12(1): 1-24.
  • 9KAKARONTZAS G, LALIS S. A market-based protocol with leasing support for globally distributed computing [C]. Proceedings of the First IEEE/ACM International Symposium on Cluster Computing and the Grid. Washington D C.. IEEE Computer Society, 2001:562-567.
  • 10LI C L, LI L Y. Competitive proportional resource allocation policy for computational grid [J]. Future Gen Comput Syst, 2004, 20(6): 1041-1054.

共引文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部