Pattern-push: a low-delay mesh-push scheduling for live peer-to-peer streaming

  • Authors:

  • Guifeng Zheng;S.-H. Gary Chan;Xiaonan Luo;Ali C. Begen

  • Affiliations:

  • Key Laboratory of Digital Life, School of Software, Sun Yat-Sen University, Ministry of Education, China;Department of Computer Science & Engineering, The Hong Kong University of Science & Technology, Hong Kong, China;Key Laboratory of Digital Life, Institute of Computer Application, Sun Yat-Sen University, Ministry of Education, China;Video & Content Platforms Research & Advanced Development, Cisco Systems, Inc., San Jose, CA

  • Venue:
  • ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In live peer-to-peer (P2P) streaming, each peer (child) has a number of supplying parents whose packets have to be scheduled and delivered in time for continuous playback at the child. It is challenging to develop a scheduling algorithm that achieves low delay given heterogeneous bandwidth, propagation delays and available content in all the parents. This paper proposes a novel, simple and effective scheduling scheme called Pattern-Push. As compared to the traditional mesh-pull, pattern-push does not require continuous buffermap advertisements from the parents, and operates on the packet level instead of the larger segment level. In pattern-push, each parent pushes its packets according to a pattern as indicated by a starting packet ID and a cycle bitmap. Pattern-push requires only minimal feedback from the child, as the pattern only needs to be changed when the child detects a marked change in network conditions or its parents. Simulation results show that pattern-push achieves a significantly lower delay and overhead as compared with both traditional and recent scheduling algorithms proposed in the literature.