非结构化P2P网络引导型进化博弈算法

发布时间：2018-01-04 06:24

本文关键词：非结构化P2P网络引导型进化博弈算法　出处：《电信科学》2016年01期 　论文类型：期刊论文

【摘要】：为促进动态开放性对等网络中节点间的合作,在SLACER(selfish link-based adaptation for cooperation excluding rewiring,基于自私连接排除重构的自适应合作)算法的基础上引入标兵节点,提出了引导型进化博弈算法G-SLACER(guided-SLACER)。通过初始化,网络节点总数的30%为标兵节点;拓扑重构过程中,新增一条到最具优势节点的引导型连接;为鼓励节点相互学习,加大网络整体收益。实验结果表明,G-SLACER算法针对不同规模的网络均具有良好的通用性,网络中CCP(cooperative connected path,合作连接路径)的稳定性增强。与其他进化博弈算法相比,G-SLACER算法形成的P2P网络的合作状态出现得更早、更平稳。
[Abstract]:In order to promote the cooperation between nodes in dynamic open peer-to-peer networks. At SLACER (. Selfish link-based adaptation for cooperation excluding rewiring. A self-adaptive cooperative algorithm based on selfish connection exclusion and reconstruction is introduced. A guided evolutionary game algorithm, G-SLACERN guided-SLACERN, is proposed. Through initialization, 30% of the total number of network nodes is the model node. In the process of topology reconfiguration, a new leading connection is added to the most advantageous node. In order to encourage nodes to learn from each other and increase the overall income of the network, the experimental results show that the G-SLACER algorithm has good versatility for different scale networks. The stability of CCP(cooperative connected path (cooperative connection path) is enhanced, compared with other evolutionary game algorithms. G-SLACER algorithm forms the P2P network cooperation state appears earlier, more stable.
【作者单位】：西安邮电大学通信与信息工程学院;
【基金】：陕西省教育厅科技计划基金资助项目(No.07JK377)~~
【分类号】：TP393.02
【正文快照】： 1^S 对等网络由于自组织、低部署维护成本w,网络中的节点行为自由,属性自私。对等节点参与网络活动时,注重个体利益忽略集体利益,如文件共享系统中的“free riding”现象。P2P网络是一种分布式的动态网络,随着各对等节点的动态加人与退出,整个网络的拓扑结构始终处于动态变化

【参考文献】