Date Added: May 2012
During the last decade, the authors witnessed a rapid growth in deployment of pull-based P2P streaming applications. In these applications, each node selects some other nodes as its neighbors and requests streaming data from them. This scheme allows eliminating data redundancy and recovering from data loss, but it pushes the complexity to the receiver node side. In this paper, they theoretically study the scheduling problem in pull-based P2P video streaming and they model it as an assignment problem. Then, they propose AsSched, new scheduling algorithm for layered streaming, in order to optimize the throughput and the delivery ratio of the system.