期刊文献+

一种可容错的覆盖网节点合作激励策略 被引量:5

A Fault-Tolerant Cooperation Incentive Strategy for Overlay Network Nodes
下载PDF
导出
摘要 为了促进覆盖网节点之间的合作,以任意相邻的两个节点为博弈参与者,用纯策略博弈建立了问题模型,证明了静止状态下的节点相互转发博弈是典型的囚徒困境,以及在无限重复囚徒困境博弈情况下,基于针锋相对策略的合作均衡是脆弱的,偶然的网络故障会引发惩罚行为,从而导致节点间的不合作.提出一种可容错的针锋相对策略TTFT(Tolerant Tit-for-tat),使节点能够在一定时间内容忍网络故障的发生.证明了使用该策略可以在发生网络故障的情况下,在有限时间内使节点达到稳定的合作状态,并证明了作弊节点的收益增量相对较低,能够有效降低节点作弊的可能性.模拟试验表明,在多个节点交互的环境下,该策略可以容忍一定比率的故障,促进节点合作,显著提高全体节点的收益总额,并可以降低作弊节点的收益,有效防止作弊. Aiming at improving the cooperation of nodes in oveday networks,a novel incentive strategy which is used in the packet forwarding game between two neighboring nodes is proposed. An infinitely iterated game model is established to promote the cooperation.We proof that the cooperative equilibrium based on Tit-for-tat strategy is vulnerable in the realistic network environment.A fault Tolerant Tit-for-tat (TTFT) strategy is proposed to cope with the network failure. We proof that this strategy can maintain cooperation in case of network failure. Cheating towards this strategy can get few extra payoffs so that there is little motivation to cheat. The simulation shows that 1 ) the TIFF strategy can maintain the cooperation and significantly improve the overall payoff when unexpected network failure occurs;2) the TIFF can keep the payoff of cheating nodes in a relatively low level so that it can effectively avoid cheating.
出处 《电子学报》 EI CAS CSCD 北大核心 2010年第2期327-332,共6页 Acta Electronica Sinica
基金 国家自然科学基金(No.60673180) 国家863高技术研究发展计划(No.2006AA01A106 2006AA01A118 No.2009AA01Z144 No.2009AA01A131)
关键词 覆盖网 节点合作 无限重复博弈 针锋相对策略 容错 overlay network nodes cooperation infinitely iterated game tit-for-tat fault-tolerance
  • 相关文献

参考文献11

  • 1杨戈,廖建新,朱晓民,樊秀梅.流媒体分发系统关键技术综述[J].电子学报,2009,37(1):137-145. 被引量:39
  • 2Qiu Y, Marbach P. Bandwidth allocation in ad hoc networks: a price- based approach [ A ]. Proceedings of IEEE INFOCOM 2003 [ C]. San Francisco USA: IEEE Press, 2003.797 - 807.
  • 3Tan G, Jarvis S A. A payment-based incentive and service differentiation mechanism for peer-to-peer streaming broadcast [A ]. Proceedings of IWQoS 2007 [ C ]. New Haven, USA: IEEE Press,2007.41 - 50.
  • 4Zhou R, Hwang K. Gossip-based reputation aggregation for unstructured peer-to-peer networks [ A ]. Prcoeedings of IEEE IPDPS 2027[ C] .Long Beach,CA: IEEE Press,2007.1 - 10.
  • 5Wu C, Li B. Strategies of conflict in coexisting streaming overlays[ A]. Proceedings of IEEE. INFOCOM 2007 [ C ]. Anchorage, USA: IEEE Press, 2007.481 - 489.
  • 6Molander P. The optimal level of generosity in a selfish, uncertain environment[ J]. The Journal of Conflict Resolution, 1985, 29(4) :611 - 618.
  • 7Boyd R. Mistakes allow evolutionary stability in the repeated prisoner's dilemma[ J]. Jourrlal of Theoretical Biology, 1989, 136(1) :47 - 56.
  • 8Nowak M, Sigmund K. A strategy of win-stay, lose-shift that outperforms tit-for-tat in the prisoner's dilemma game[ J] .Nature, 1993,364(6432) :56 - 58.
  • 9Axelrod R. The evolution of cooperation[ J] .Science, 1981,211 (4489) : 1390 - 1396.
  • 10Lian Q, Peng Y, Yang M, et al. Robust incentives via multilevel tit- for-tat [ J]. Concurrency and Computation: Practice & Experience, 2008,20(2 ) : 167 - 178.

二级参考文献58

共引文献38

同被引文献49

  • 1Draguna VRABIE,Frank LEWIS.Adaptive dynamic programming for online solution of a zero-sum differential game[J].控制理论与应用(英文版),2011,9(3):353-360. 被引量:10
  • 2王庆利,王丹,井元伟,张嗣瀛.激励Stackelberg策略下的电价算法[J].东北大学学报(自然科学版),2006,27(1):1-4. 被引量:10
  • 3周三多.管理学[M].北京:高等教育出版社,2010.
  • 4Adar E, Huberman B. Free riding on Gnutella[R]. Palo Alto: Xerox PARC, 2000.
  • 5Liang J, Kumar R, Xi Y, et al. Pollution in P2P file sharing systems[C]// Proceedings of IEEE Infocom 2005. Piscataway, USA: IEEE Press, 2005.
  • 6Feldmany M, Laiz K. Quantifying disincentives in peer- to-peer networks [C] //Proceedings of Workshop on Economics of Peer-to-Peer Systems. Berkeley, USA.. Springer-Verlag, 2003 : 117 - 122.
  • 7Kamvar S D, Schlosser M T. EigenRep: reputation management in P2P networks[C] // Proceedings of the 12th International World Wide Web Conference. Budapest: ACM Press, 2003:123 - 134.
  • 8霍立文.P2P系统中安全激励机制的研究[EB/OL].[2010-05-163.http:ffmaze.tianwang.com/.
  • 9Xiong based t IEEE L, Liu L. PeerTrust rust for peer-to-peer el Transactions on supporting reputatlon- ectronic communities[J]. Knowledge and Data Engineering, 2004,16(7) :843 - 857.
  • 10Lamport L. Password authentication with insecure communication[J]. Communications of the ACM, 1981,24 : 770 - 772.

引证文献5

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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