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

摘要

In a P2P system, the media stream is divided into small data units known as chunks. Each peer in a P2P system has to take two important decisions at a given time i.e. how the chunks are to be shared? (chunk scheduling) and with which peer are they to be shared with (peer scheduling). Scheduling plays an important role in evaluating performance of P2P systems. 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. The results obtained under the specified experimental setup show that when Deadline Based chunk scheduling(DLc) is combined with different peer scheduling algorithms, the best results are obtained by its combination with Chunk Earliest Free Peer Scheduler (CEFp). For a constant peer scheduler CEFp combined with different chunk schedulers, the best results are obtained by combining it with Lastest Blind Chunk Scheduler (LBc). Finally, with varying neighborhood size, the best results are obtained by the combination of DLC/CAFp.