Designing an efficient scheduling algorithm for P2PTV system

  • Kai Zhang
  • , Kan Li*
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Scheduling the transmission of stream chunks is one of the main challenges in P2PTV system. In this paper, in order to improve the performance of push-based scheduling algorithm by exploiting chunk and peer's characteristics in the heterogeneous scenario, we first present a 2-stage buffer window model and define redistribution capacity factor to describe chunk and peer's characteristics. Then, we propose a new scheduling algorithm, called Urgent then Latest chunk / Redistribution Capacity peer (UL/RC). The UL/RC includes two components: UL chunk scheduler and RC peer scheduler. UL chunk scheduler uses the urgent chunk priority strategy to achieve low loss rate. RC peer scheduler employs high redistribution capacity peer priority strategy to achieve low delivery delay. Experimental results indicate that our scheduling algorithm outperforms state-of-the-art approaches.

Original languageEnglish
Title of host publicationFuture Control and Automation - Proceedings of the 2nd International Conference on Future Control and Automation, ICFCA 2012
Pages43-50
Number of pages8
EditionVOL. 2
DOIs
Publication statusPublished - 2012
Event2nd International Conference on Future Control and Automation, ICFCA 2012 - Changsha, China
Duration: 1 Jul 20122 Jul 2012

Publication series

NameLecture Notes in Electrical Engineering
NumberVOL. 2
Volume173 LNEE
ISSN (Print)1876-1100
ISSN (Electronic)1876-1119

Conference

Conference2nd International Conference on Future Control and Automation, ICFCA 2012
Country/TerritoryChina
CityChangsha
Period1/07/122/07/12

Keywords

  • P2PTV
  • delivery delay
  • heterogeneity
  • loss rate
  • scheduling algorithm

Fingerprint

Dive into the research topics of 'Designing an efficient scheduling algorithm for P2PTV system'. Together they form a unique fingerprint.

Cite this