Towards Data Revelation and Scheduling Policy in Mesh-Based Peer-to-Peer Streaming

Abstract

The data revelation policy in traditional mesh-based peer-to-peer streaming protocols always make peers announce all available data to their neighbors.However, we find that, in a low bandwidth network environment, this policy suffers from serious data loss. In addition, only data deadline and bandwidth are considered in the data scheduling algorithms in the existed protocols,which leads to the slow dissemination of newly generated content data.This paper first presents a strategic segment revelation policy that the source under-report the available data to its neighbors, while other peers announce all available data.According to simulation results, this policy can accelerate the dissemination of new segments, especially in low bandwidth environment. Then we propose a simple model of data scheduling which reveals the relation of download rate and other key factors in data scheduling. Based on this model, we further propose a greedy data scheduling algorithm, each data segment is given a priority according to its deadline and distribution among neighbors, and the segments with higher priority would be earlier requested such that these segments can be downloaded in the shortest time. The simulation results also indicate that the greedy data scheduling algorithm performs near-optimally in terms of bandwidth utilization.