期刊文献+

一种基于微观经济学的网格资源分配模型 被引量:5

A Microeconomics-Based Resource Assignment Model for Grid Computing
下载PDF
导出
摘要 引入微观经济学知识,设计了一种双模式网格资源分配模型.在该模型下,根据供求关系影响提供者资源售价,以售价调节消费者资源占用量,支持提供者与消费者双赢的实现.在网格资源丰富时,采用博弈模式,基于Nash均衡和Pareto最优为消费者确定最优资源占用量,同时为提供者确定最优售价;在网格资源稀缺时,采用竞价模式为消费者分配资源.仿真结果表明,该模型是可行和有效的,具有较好的性能. Introducing the knowledge on microeconomics into grid computing, a dual-scheme resource assignment model is therefore developed. The way the supplier' s selling price affected by supply-demand relation is used to adjust consumer's occupancy of grid resource so as to support the implementation of a win-win relationship between the supplier and consumers. If the available grid resource is plentiful, the game playing scheme is used to determine the optimal resource occupancy for consumers on the bases of Nesh equilibrium and Pareto optimality, with the optimal selling price determined for the supplier. If the grid resource is scarce, the bidding scheme is used to assign the grid resource for consumers. Simulation results showed that the model is feasible and efficient with favorable performance.
出处 《东北大学学报(自然科学版)》 EI CAS CSCD 北大核心 2006年第7期731-734,共4页 Journal of Northeastern University(Natural Science)
基金 新世纪优秀人才支持计划项目 国家自然科学基金资助项目(60473089) 国家发改委CNGI示范工程资助项目(CNGI-04-13-2T CNGI-04-6-2T CNGI-04-15-7T)
关键词 网格 资源分配 微观经济学 NASH均衡 PARETO最优 竞价 grid computing resource assignment microeconomics Nash equilibrium Pareto optimality bidding
  • 相关文献

参考文献3

二级参考文献22

  • 1[2]Wang B, Hou J C. A survey on multicast routing and its QoS extensions: problems, algorithms, and protocols[J]. IEEE Network Magazine, 2000,14(1):22-36.
  • 2[3]Hwang F, Richards D. Steiner tree problems[J]. Networks, 1992,22(1):55-89.
  • 3[4]Gen M, Cheng R W. Genetic algorithms and engineering design[M]. New York: John Wiley & Sons, 1996.1-55.
  • 4[5]Mendivil F, Shonkwiler R, Spruill M C. Restarting search algorithms with applications to simulated annealing[J]. Advances in Applied Probability, 2000,33(1):242-259.
  • 5[7]Xin Y. Heuristic algorithms for multi-constrained quality-of-service routing[J]. IEEE/ACM Transaction on Networking, 2002,10(2):244-256.
  • 6[8]Wang X W, Cheng H, Cao J N, et al. QoS-driven multicast tree generation using genetic algorithm[J]. Lecture Notes in Computer Science, 2003,2834:121-131.
  • 7[9]Wang X W, Cheng H, Cao J N, et al. A Simulated-annealing-based QoS multicasting algorithm[A]. Proceedings of International Conference on Communication Technology[C]. Beijing: IEEE, 2003.469-473.
  • 8[10]Wang X W, Cheng H, Cao J N, et al. A Tabu-search-based QoS Multicasting Algorithm[A]. Proceedings of International Conference for Young Computer Scientists[C]. Harbin: CCF, 2003.63-66.
  • 9I Foster, C Kesselman. The Grid: Blueprint for a Future Computing Infrastructure[ M]. USA: Morgan Kaufmann Publishers, 1999. 36-78.
  • 10I Foster, C Kesselman, S Tuecke. The Anatomy of the Grid : Enabling Scalable Virtual Organizations [ J]. International Journal of Supercomputer Applications, 2001,15 ( 3 ) :81 - 105.

共引文献16

同被引文献47

引证文献5

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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