A novel time-aware block scheduling model for media streaming in peer-to-peer overlay networks

Recently, media streaming applications called as data-driven approaches have attracted a lot of attention. In these applications, node independently selects its neighbors and obtains desirable blocks from neighbors. There are two steps in the applications. One is overlay construction, another is block scheduling. However, most of the related research works focused on the former issue, few concentrated on optimizing the block scheduling to improve the system performance, especially in peer-to-peer overlay network. In this paper, we propose a novel time-aware block scheduling model considering bandwidth and block deadline constraints to solve the problem. We then propose an algorithm to minimize the total time of block scheduling and take an example to explain the algorithm. Simulation results indicate that our proposed algorithm performs better with high average delivery ratio.