TY - GEN
T1 - SkipStream
T2 - 38th International Conference on Parallel Processing, ICPP-2009
AU - Yu, Qifeng
AU - Xu, Tianyin
AU - Ye, Baoliu
AU - Lu., Sanglu
AU - Chen, Daoxu
PY - 2009
Y1 - 2009
N2 - Providing continuous on-demand streaming services with VCR functionality over ubiquitous environments is challenging due to the stringent QoS requirements of streaming service as well as the dynamic characteristics of both underlying network and user behavior. In this paper, we propose SkipStream, a skip graph based Peer-to-Peer (P2P) on-demand streaming scheme with VCR support to address the above challenges. In the design of SkipStream, we first group users into a set of disjoint clusters in accordance with their playback offset and further organize the resulted clusters into a skip graph based overlay network. In addition, we present a distributed on-demand streaming scheduling mechanism to minimize the impact of VCR operations and balance system load among nodes adaptively. The average search latency of SkipStream is O(log(N))m where N is the number of disjoint clusters. We also evaluate the performance of SkipStream via extensive simulations. Experimental results show that SkipStream outperforms early skip list based scheme DSL by reducing the search latency 20%-60% in average case and over 50% in worst case.
AB - Providing continuous on-demand streaming services with VCR functionality over ubiquitous environments is challenging due to the stringent QoS requirements of streaming service as well as the dynamic characteristics of both underlying network and user behavior. In this paper, we propose SkipStream, a skip graph based Peer-to-Peer (P2P) on-demand streaming scheme with VCR support to address the above challenges. In the design of SkipStream, we first group users into a set of disjoint clusters in accordance with their playback offset and further organize the resulted clusters into a skip graph based overlay network. In addition, we present a distributed on-demand streaming scheduling mechanism to minimize the impact of VCR operations and balance system load among nodes adaptively. The average search latency of SkipStream is O(log(N))m where N is the number of disjoint clusters. We also evaluate the performance of SkipStream via extensive simulations. Experimental results show that SkipStream outperforms early skip list based scheme DSL by reducing the search latency 20%-60% in average case and over 50% in worst case.
UR - http://www.scopus.com/inward/record.url?scp=77951445132&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77951445132&partnerID=8YFLogxK
U2 - 10.1109/ICPP.2009.57
DO - 10.1109/ICPP.2009.57
M3 - Conference contribution
AN - SCOPUS:77951445132
SN - 9780769538020
T3 - Proceedings of the International Conference on Parallel Processing
SP - 269
EP - 276
BT - ICPP-2009 - The 38th International Conference on Parallel Processing
Y2 - 22 September 2009 through 25 September 2009
ER -