高级检索
    刘佳琦, 陈志刚, 李 登, 任 重. 移动P2P中基于惩罚培育的拓扑构造算法[J]. 计算机研究与发展, 2012, 49(2): 278-285.
    引用本文: 刘佳琦, 陈志刚, 李 登, 任 重. 移动P2P中基于惩罚培育的拓扑构造算法[J]. 计算机研究与发展, 2012, 49(2): 278-285.
    Liu Jiaqi, Chen Zhigang, Li Deng, Ren Zhong. A Topology Constructing Algorithm Based on Punishment and Cultivation in Mobile P2P[J]. Journal of Computer Research and Development, 2012, 49(2): 278-285.
    Citation: Liu Jiaqi, Chen Zhigang, Li Deng, Ren Zhong. A Topology Constructing Algorithm Based on Punishment and Cultivation in Mobile P2P[J]. Journal of Computer Research and Development, 2012, 49(2): 278-285.

    移动P2P中基于惩罚培育的拓扑构造算法

    A Topology Constructing Algorithm Based on Punishment and Cultivation in Mobile P2P

    • 摘要: 提出一种基于惩罚培育的拓扑构造算法,针对P2P系统中普遍存在的搭便车、sybil攻击、whitewashing等不合作行为,在移动P2P拓扑构造过程中采用节点自监督、自惩罚机制,构造自适应的拓扑,使不合作节点受到惩罚,以培育节点合作性,并保障合作节点能够更有效地获得服务.根据移动P2P网络的固有特性,构造了一个结合有限状态维护、局部连通和信息交互的,具有全局视图的移动P2P覆盖网拓扑.实验结果分析显示,该算法构造的拓扑结构具有较好的可扩展性、稳定性和较强的容错性,且提高了搜索效率.

       

      Abstract: A topology constructing algorithm based on punishment and cultivation called TCBPC is presented. Aiming at the non-cooperation behaviors such as free-riding, sybil attack and whitewashing, a self-supervising and self-punishing schema is presented to construct the adaptive topology. Based on the above schema, non-cooperation nodes are punished and cooperation nodes are encouraged, so as to guarantee cooperation nodes to achieve services efficiently. A mobile P2P overlay topology is constructed, which integrates the limited state maintenance, local communications, information exchange and global view. Simulation results show that the topology structure constructed by TCBPC algorithm has better scalability, stability, fault tolerance, and improves the searching efficiency.

       

    /

    返回文章
    返回