对等网副本散布问题纯策略纳什均衡研究  

The Research of Pure Strategy Nash Equilibria on Replica Placement Problem in P2P Environment

作　　者：王文方[1] 刘晓光[1] 王刚[1] 刘璟[1] 

机构地区：[1]南开大学信息技术科学学院,天津300071

出　　处：《计算机科学》2006年第7期29-30,共2页Computer Science

基　　金：国家自然科学基金项目(60273031);高等学校博士点专项科研基金项目(20020055021);天津市科技发展计划重点基金项目(043800311)。

摘　　要：在对等网环境中为增强数据的可靠性与访问效率,需要将数据副本进行有效的散布。应用博弈论原理研究副本散布问题是一种有效的新方法。分析了当前使用博弈论方法研究所存在的问题,提出副本散布问题的基本博弈模型,首次证明了多对象且节点容量有限情况下纯策略纳什均衡的存在性,较以前的研究成果更具有实用价值,且是今后进一步研究的基础。In Peer-to-Peer systems, the replica of data object can be used to improve the performance,availabilit, and reliability. There is much work on the replica placement problem. However,most of it optimize for overall system performance. In reality,nodes may want to maximize their own performance. Game-theoretic approach to analyze the replica placement problem is more suitable for these scenario. There is not much research in replica placement game. In this paper, we module the replica placement problem as a static non-cooperative game, and we prove the existence of pure strategy Nash equilibria in multiple objects capacitated game. It is more practicable than former work,and it will be the base for future work.

关 键 词：对等网 副本散布 纯策略纳什均衡 

分 类 号：TP311.132[自动化与计算机技术—计算机软件与理论]