A Push/Pull scheduling algorithm in P2P VoD

Video-on-Demand (VoD), which is an important application in peer-to-peer (P2P) networks, attracts a lot of researchers´ interest at present. Data scheduling is significant in P2P VoD applications to gain desirable user experience and better satisfaction. In unstructured mesh-based overlay, peers in the overlay learn about the chunks availability from neighbors using Buffer Map. The peer can only know the information of its neighbors and is not aware of other peers. So some peers (busy peer) could get a lot of requests and other peers(free peers) receive fewer requests. The busy peer usually ignores the surplus requests and the peers that send these ignored requests will request the chunk again after the timeout. At the same time, the free peers can´t effectively utilize the upload bandwidth. In this paper, we propose a hybrid Push/Pull algorithm in P2P VoD. Simulation results shows that the average utilization of upload bandwidth and average playback quality may be improved efficiently.