Skip to content
Free planNo credit card requiredStart writing

article · 2016

Data Scheduling Algorithm for Layered P2P VoD Streaming Networks

Author(s Wen, Z Yeung, K Lei, Zheng Wen, Kwan L. Yeung, Zhibin Lei

Cited by 0Abstract and details only

Abstract

Abstract — Streaming layered video over peer-to-peer (P2P) networks has been recognized as an efficient way to address the receiver heterogeneity problem. The distinctive characteristics of layer encoded video also introduce complexities to data scheduling. In this paper, we propose a new data scheduling algorithm for layered P2P video-on-demand (VoD) streaming networks. Our algorithm consists of two parts: 1) layer adaptation, where peers adaptively adjust the number of subscribed layers to ensure a continuous playback of the highest possible video quality; and 2) piece selection, in which a peer selects a missing data piece to request based on its utility. The piece utility is calculated based on the playback constraint and the layer dependency of a piece. Through extensive packet-level simulations we show that our proposed data scheduling algorithm can effectively enhance the video playback quality. I.

Cite this paper

APA 7

Wen, A., Yeung, Z., Lei, K., Wen, Z., Yeung, K. L., & Lei, Z. (2016). Data Scheduling Algorithm for Layered P2P VoD Streaming Networks.

MLA 9

Wen, Author(s, et al. “Data Scheduling Algorithm for Layered P2P VoD Streaming Networks.” 2016.

Chicago

Wen, Author(s, Z Yeung, K Lei, Zheng Wen, Kwan L. Yeung, and Zhibin Lei. 2016. “Data Scheduling Algorithm for Layered P2P VoD Streaming Networks.”

Harvard

Wen, A. et al. (2016) ‘Data Scheduling Algorithm for Layered P2P VoD Streaming Networks’.

BibTeX
@article{wen2016data,
  title = {{Data Scheduling Algorithm for Layered P2P VoD Streaming Networks}},
  author = {Wen, Author(s and Yeung, Z and Lei, K and Wen, Zheng and Yeung, Kwan L. and Lei, Zhibin},
  year = {2016}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.