计算机应用 ›› 2010, Vol. 30 ›› Issue (2): 327-329.

• 网络与通信 • 上一篇    下一篇

基于能力因子的P2P邻居节点随机可变选择算法

陈瑞昭,刘永广   

  1. 广东轻工职业技术学院
  • 收稿日期:2009-07-30 修回日期:2009-09-15 发布日期:2010-02-10 出版日期:2010-02-01
  • 通讯作者: 陈瑞昭
  • 基金资助:
    广东省计算机网络重点实验室开放基金

Variable random neighbor selection algorithm in live peer-to-peer network based on capacity factor

  • Received:2009-07-30 Revised:2009-09-15 Online:2010-02-10 Published:2010-02-01
  • Contact: chen ruizhao

摘要: 在分析固定随机选择邻居节点算法的基础上,提出了一种适用于混合式P2P直播系统的邻居节点随机可变选择算法,新算法通过能力因子来衡量节点的良好度,对不同类的节点有不同的邻居数量的最大值,使得良好度高的节点能发挥更大的作用,仿真表明算法能降低数据传输的延迟,提高网络系统的性能。

关键词: 对等网络, 流媒体, 邻居节点选择, 能力因子, 数据交换

Abstract: Based on the analysis of the algorithms of fixed random neighbor selection, a new variable random neighbor selection algorithm adaptable to hybrid P2P in live multimedia streaming networks was presented. The new algorithm measured fitness degree of node with its capacity factor. Different types of nodes have different maximum neighbors. Simulations show that the new algorithm can reduce the transmission delay and improve the performance of network system.

Key words: peer-to-peer network, streaming media, neighbor peer selection, capacity factor, data exchange