Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/12430
Title: An efficient data scheduling scheme for P2P storage-constrained IPTV system
Authors: Tu, X
Jin, H
Cao, J 
Guo, S
Zheng, L
Lv, Z
Keywords: Optimal scheduling
Peer-to-peer computing
Streaming media
Issue Date: 2013
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on systems, man, and cybernetics. Part A, Systems and humans, 2013, v. 43, no. 2, p. 379-389 How to cite?
Journal: IEEE transactions on systems, man, and cybernetics. Part A, Systems and humans 
Abstract: In a mesh-based peer-to-peer live-streaming system, a data scheduler decides which segments and from where it should fetch to the local buffer of a peer. The scheduling strategy is critical when the local buffer is limited for caching segments, particularly for a storage-constrained Internet Protocol Television system such as a set-top box. The main objective is to deliver data to as many peers as possible in a timely manner, i.e., streaming data should be received before their playback deadlines. One popular approach used in existing systems is to let peers preferentially request data segments that are rarest and of the earliest playback deadlines among neighboring peers. However, it has been ignored that a fresh segment with a higher sequence identity but a later playback deadline may have a longer time to be shared with other peers. In this paper, we propose a novel data scheduling scheme, called ColorStream, which can achieve higher system throughput and shorter start-up delay. When deciding which segments to get, in addition to rarity and urgency, ColorStream also considers the freshness of segments because distributing fresher ones implies to be shared by more peers in the future. It categorizes the segments and peers by labeling them with colors and lets each peer request with preference the rare and urgent segments that have the same color as its own. This technique allows more fresh segments to be requested without abandoning rare and urgent segments and also balances the workload of data dissemination among peers. Simulations have been conducted to evaluate the performance of the proposed ColorStream scheme. The results show that, compared with existing schemes, ColorStream can greatly improve the performance under various conditions in terms of throughput and start-up delay.
URI: http://hdl.handle.net/10397/12430
ISSN: 1083-4427
EISSN: 1083-4419
DOI: 10.1109/TSMCA.2012.2189878
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

2
Last Week
0
Last month
0
Citations as of Sep 23, 2017

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
0
Citations as of Sep 22, 2017

Page view(s)

45
Last Week
5
Last month
Checked on Sep 24, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.