TY - GEN
T1 - Supporting VCR-like operations in derivative tree-based P2P streaming systems
AU - Xu, Tianyin
AU - Chen, Jianzhong
AU - Li, Wenzhong
AU - Lu, Sanglu
AU - Guo, Yang
AU - Hamdi, Mounir
PY - 2009
Y1 - 2009
N2 - Supporting user interactivity in peer-to-peer streaming systems is challenging. VCR-like operations, such as random seek, pause, fast forward and rewind, require timely P2P overlay topology adjustment and appropriate bandwidth resource re-allocation. If not handled properly, the dynamics caused by user interactivity may severely deteriorate users' perceived video quality, e.g., longer start-up delay, frequent playback freezing, or blackout altogether. In this paper, we propose a derivative tree-based overlay management scheme to support user interactivity in P2P streaming system. Derivative tree takes advantage of well organized buffer overlapping to support asynchronous user requests while brings high resilience to the impact of VCR-like operations. A session discovery service is introduced to quickly locate parent peer. We show that the overhead of VCR-like operations in derivative-tree based scheme is O(log(N)), where N is the number of sessions. Simulation experiments further demonstrate the efficiency of the proposed scheme.
AB - Supporting user interactivity in peer-to-peer streaming systems is challenging. VCR-like operations, such as random seek, pause, fast forward and rewind, require timely P2P overlay topology adjustment and appropriate bandwidth resource re-allocation. If not handled properly, the dynamics caused by user interactivity may severely deteriorate users' perceived video quality, e.g., longer start-up delay, frequent playback freezing, or blackout altogether. In this paper, we propose a derivative tree-based overlay management scheme to support user interactivity in P2P streaming system. Derivative tree takes advantage of well organized buffer overlapping to support asynchronous user requests while brings high resilience to the impact of VCR-like operations. A session discovery service is introduced to quickly locate parent peer. We show that the overhead of VCR-like operations in derivative-tree based scheme is O(log(N)), where N is the number of sessions. Simulation experiments further demonstrate the efficiency of the proposed scheme.
UR - http://www.scopus.com/inward/record.url?scp=70449471049&partnerID=8YFLogxK
U2 - 10.1109/ICC.2009.5199502
DO - 10.1109/ICC.2009.5199502
M3 - Conference contribution
AN - SCOPUS:70449471049
SN - 9781424434350
T3 - IEEE International Conference on Communications
BT - Proceedings - 2009 IEEE International Conference on Communications, ICC 2009
T2 - 2009 IEEE International Conference on Communications, ICC 2009
Y2 - 14 June 2009 through 18 June 2009
ER -