A heuristic chunk scheduling algorithm reducing delay for Mesh-Pull P2P live streaming

Many Mesh-Pull P2P live streaming systems deployed in Internet catch a large number of users during recent years. While they have high scalability and low cost, they suffer from bad delay performance. In this paper, we aim at reducing the delay caused by chunk scheduling for Mesh-Pull P2P live streaming in the environment of heterogeneous upload bandwidth, heterogeneous and dynamic propagation delays. And we quantify and model the delivery latency of chunk scheduling as an optimization problem by introducing the propagation delay(usually ignored) between peers to the design of chunk scheduling, and put forward a heuristic pull-based chunk scheduling algorithm. Through simulation, our algorithm can adapt to random variance of propagation delays and outperform the two classical Mesh-Pull chunk scheduling algorithms not only in delay performance but also in chunk loss ratio.