点击次数：

论文类型：会议论文

发表时间：2015-01-01

收录刊物：CPCI-S

页面范围：503-507

关键字：P2P; video on demand; Replication; Scheduling; Neighbor selecting

摘要：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.