Push-pull hybrid schemes for peer-to-peer (P2P) video live streaming applications achieve a short playback delay and are robust in the presence of peer churn. Most hybrid schemes construct an overlay randomly, which causes unnecessary traffic on the Internet. Simply applying the neighbor-with-nearby-peers strategy can localize the traffic but results in a large tree height, more lost chunks, and increased playback delay. In this paper, we propose a new neighboring strategy to construct a hierarchical overlay that has a low average edge cost and helps to build a short and robust tree. Using a heuristic degree-bounded shortest path tree algorithm and an efficient pull mechanism to recover late chunks, the hierarchical overlay achieves performance close to the random overlay but has only 1/3 of the network cost; 98% of peers receive all the chunk with playback delays well within the acceptable range.
展开▼
