Performance Comparison of Chunk and Peer Scheduling Algorithms of Peer-to-Peer Streaming Systems

With increasing popularity of Peer to Peer systems for video streaming, it is important that the expectations of the users regarding the quality of such systems are being met. In a P2P system, the media stream is divided into small data units known as chunks. Each peer in a Peer to Peer (P2P) system has to take two important decisions at a given time. First, which chunks are to be shared and second with which peer. This paper compares the performance of different combinations of chunk/peer schedulers in terms of chunk diffusion delay, average chunk distribution delay and max chunk distribution delay. By doing so, the best possible combination of the two schedulers for the given experimental setup is explored. The results obtained under the specified experimental setup show that when chunk scheduling algorithm Deadline Based Chunk Scheduler (DLc) is combined with different peer scheduling algorithms, the best results are obtained by its combination with Chunk Earliest Free Pair Scheduler (CEFp). For a constant peer scheduler CEFp combined with different chunk schedulers, the best results are obtained by combining it with Latest Blind Chunk Scheduler (LBc). Finally, with varying neighborhood size, the best results are obtained by the combination of DLC and Chunk Almost Free Peer Scheduler (CAFp).