论文成果
A search-efficient neighboring optimization algorithm in P2P-VoD networks
  • 点击次数:
  • 论文类型:会议论文
  • 发表时间:2015-04-11
  • 收录刊物:EI、Scopus
  • 文献类型:A
  • 页面范围:503-508
  • 摘要:A theoretic model for the P2P-VoD search problem which takes both the peers   accessibility and the search  s cost into account has been presented, and the algorithm for choosing and adjusting a peer  s neighbor peers, under which a peer  s neighbor peers always have the similar interests to that of the peer has also been proposed in this paper. Simulations show that this algorithm can largely improve the search efficiency of the peer  s requested movies and the performance of P2P VoD systems. ? 2015 Taylor & Francis Group, London.

上一条: A free rider aware topological construction strategy for search in unstructured P2P networks

下一条: Perspective of space and time based replica population organizing strategy in unstructured peer-to-peer networks