计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (24): 23-26.

• 博士论坛 • 上一篇    下一篇

P2P VOD系统邻居节点查找算法

冯侦探1,2,尤佳莉2,倪 宏2   

  1. 1.中国科学院 研究生院,北京 100049
    2.中国科学院 声学研究所 国家网络新媒体工程技术研究中心,北京 100190
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-08-21 发布日期:2011-08-21

Neighbor search algorithm for P2P VoD system

FENG Zhentan1,2,YOU Jiali2,NI Hong2   

  1. 1.Graduate University,Chinese Academy of Sciences,Beijing 100049,China
    2.National Network New Media Engineering Research Center,Institute of Acoustics,Chinese Academy of Sciences,Beijing 100190,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-08-21 Published:2011-08-21

摘要: P2P流媒体点播系统中,由于用户的VCR操作存在不确定性,在查找合作节点时存在一定困难。针对该问题,提出了一种基于预测的邻居节点选择算法。描述了基于虚拟直播频道的点播系统覆盖网构建方式,将系统中的节点通过DHT协议的方式组织起来。提出了一种基于用户行为的学习预测策略模型,根据该模型预测结果提前查找所需邻居节点。仿真实验表明,该算法能改善用户跳转响应延时,促进节点协作。

关键词: 点对点(P2P), 点播系统, 分布式哈希表, 预测, 邻居查找

Abstract: In P2P VoD(Video on Demand) system,it is difficult to find neighbors because the users’ VCR operations are uncertainty.Aiming at this problem,a neighbor search algorithm based on prediction is proposed in this paper.A method based on virtual live channel is described to build the overlay,in which peers are organized by DHT(Distributed Hash Table) protocol.A learning prediction model based on users’ behavior is proposed.According to the predicted results,the peer searches the neighbors in advance.The simulation results demonstrate that the algorithm can improve the VCR response latency and promote the peers’ cooperation.

Key words: Peer-to-Peer(P2P), Video on Demand(VoD) system, Distributed Hash Table(DHT), prediction, neighbor search