TY - GEN
T1 - Performance bound analysis for crowdsourced mobile video streaming
AU - Gao, Lin
AU - Tang, Ming
AU - Pang, Haitian
AU - Huang, Jianwei
AU - Sun, Lifeng
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/4/26
Y1 - 2016/4/26
N2 - Adaptive bitrate (ABR) streaming enables video users to adapt the playing bitrate to the real-time network conditions to achieve the desirable quality of experience (QoE). In this work, we propose a novel crowdsourced streaming framework for multi-user ABR video streaming over wireless networks. This framework enables the nearby mobile video users to crowdsource their radio links and resources for cooperative video streaming. We focus on analyzing the social welfare performance bound of the proposed crowdsourced streaming system. Directly solving this bound is challenging due to the asynchronous operations of users. To this end, we introduce a virtual time-slotted system with the synchronized operations, and formulate the associated social welfare optimization problem as a linear programming. We show that the optimal social welfare performance of the virtual system provides effective upper-bound and lower-bound for the optimal performance (bound) of the original asynchronous system, hence characterizes the feasible performance region of the proposed crowdsourced streaming system. The performance bounds derived in this work can serve as a benchmark for the future online algorithm design and incentive mechanism design.
AB - Adaptive bitrate (ABR) streaming enables video users to adapt the playing bitrate to the real-time network conditions to achieve the desirable quality of experience (QoE). In this work, we propose a novel crowdsourced streaming framework for multi-user ABR video streaming over wireless networks. This framework enables the nearby mobile video users to crowdsource their radio links and resources for cooperative video streaming. We focus on analyzing the social welfare performance bound of the proposed crowdsourced streaming system. Directly solving this bound is challenging due to the asynchronous operations of users. To this end, we introduce a virtual time-slotted system with the synchronized operations, and formulate the associated social welfare optimization problem as a linear programming. We show that the optimal social welfare performance of the virtual system provides effective upper-bound and lower-bound for the optimal performance (bound) of the original asynchronous system, hence characterizes the feasible performance region of the proposed crowdsourced streaming system. The performance bounds derived in this work can serve as a benchmark for the future online algorithm design and incentive mechanism design.
UR - https://www.scopus.com/pages/publications/84992390939
U2 - 10.1109/CISS.2016.7460530
DO - 10.1109/CISS.2016.7460530
M3 - 会议稿件
AN - SCOPUS:84992390939
T3 - 2016 50th Annual Conference on Information Systems and Sciences, CISS 2016
SP - 366
EP - 371
BT - 2016 50th Annual Conference on Information Systems and Sciences, CISS 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 50th Annual Conference on Information Systems and Sciences, CISS 2016
Y2 - 16 March 2016 through 18 March 2016
ER -