Optimal Bandwidth Assignment for Multiple-Description-Coded Video

被引:12
作者
Xia, Pengye [2 ]
Chan, S. -H. Gary [2 ]
Jin, Xing [1 ]
机构
[1] Facebook Inc, Data Infrastruct Team, Palo Alto, CA 94304 USA
[2] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Kowloon, Hong Kong, Peoples R China
关键词
Multiple-description-coded video; optimal description bandwidth assignment; simulated annealing; streaming;
D O I
10.1109/TMM.2010.2098021
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In video streaming over multicast network, user bandwidth requirement is often heterogeneous possibly with orders of magnitude difference (say, from hundreds of kb/s for mobile devices to tens of Mb/s for high-definition TV). Multiple description coding (MDC) can be used to address this bandwidth heterogeneity issue. In MDC, the video source is encoded into multiple independent descriptions. A receiver, depending on its available bandwidth, joins different descriptions to meet their bandwidth requirements. An important but challenging problem for MDC video multicast is how to assign bandwidth to each description in order to maximize overall user satisfaction. In this paper, we investigate this issue by formulating it as an optimization problem, with the objective to maximize user bandwidth experience by taking into account the encoding inefficiency due to MDC. We prove that the optimization problem is NP-hard. However, if the description number is larger than or equal to a certain threshold (e. g., if the minimum and maximum bandwidth requirements are 100 kb/s and 10 Mb/s, respectively, such threshold is seven descriptions), there is an exact and simple solution to achieve maximum user satisfaction, i.e., meeting all the bandwidth requirements. For the case when the description number is smaller, we present an efficient heuristic called simulated annealing for MDC bandwidth assignment (SAMBA) to assign bandwidth to each description given the distribution of user bandwidth requirement. We evaluate our algorithm using simulations. SAMBA achieves virtually the same optimal performance based on exhaustive search. By comparing with other assignment algorithms, SAMBA significantly improves user satisfaction. We also show that, if the coding efficiency decreases with the number of descriptions, there is an optimal description number to achieve maximal user satisfaction.
引用
收藏
页码:366 / 375
页数:10
相关论文
共 26 条
[1]   OPTIMIZATION OF ENCODING CONFIGURATION IN SCALABLE MULTIPLE DESCRIPTION CODING FOR RATE-ADAPTIVE P2P VIDEO MULTICASTING [J].
Abanoz, T. Berkin ;
Tekalp, A. Murat .
2009 16TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOLS 1-6, 2009, :3741-+
[2]   A Flexible Multiple Description Coding Framework for Adaptive Peer-to-Peer Video Streaming [J].
Akyol, Emrah ;
Tekalp, A. Murat ;
Civanlar, M. Reha .
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2007, 1 (02) :231-245
[3]  
[Anonymous], P 6 IEEE CONS COMM N
[4]  
BADARNEH O, 2009, P CAN C EL COMP ENG, P604
[5]  
Castro M., 2003, Operating Systems Review, V37, P298, DOI 10.1145/1165389.945474
[6]  
CHEN YF, 2007, P ACM NOSSDAV JUN
[7]   Robust Video Coding Based on Multiple Description Scalar Quantization With Side Information [J].
Crave, Olivier ;
Pesquet-Popescu, Beatrice ;
Guillemot, Christine .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2010, 20 (06) :769-779
[8]   Wavelet-based unbalanced un-equivalent multiple description coding for P2P networks [J].
Firooz, Mohammad Hamed ;
Ronasi, Keivan ;
Pakravan, Mohammad Reza ;
Avanaki, Alireza Nasiri .
ICT-MICC: 2007 IEEE INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS AND MALAYSIA INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1 AND 2, PROCEEDINGS, 2007, :242-+
[9]   STOCHASTIC RELAXATION, GIBBS DISTRIBUTIONS, AND THE BAYESIAN RESTORATION OF IMAGES [J].
GEMAN, S ;
GEMAN, D .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1984, 6 (06) :721-741
[10]   Multiple description coding: Compression meets the network [J].
Goyal, VK .
IEEE SIGNAL PROCESSING MAGAZINE, 2001, 18 (05) :74-93