Optimized periodic broadcast of nonlinear media

被引：8

作者：

Carlsson, Niklas ^{[1
]}

Mahanti, Anirban ^{[2
]}

Li, Zongpeng ^{[3
]}

Eager, Derek ^{[1
]}

机构：

[1] Univ Saskatchewan, Dept Comp Sci, Saskatoon, SK S7N 5C9, Canada

[2] Indian Inst Technol Delhi, Dept Comp Sci & Engn, Delhi, India

[3] Univ Calgary, Dept Comp Sci, Calgary, AB T2N 1N4, Canada

来源：

IEEE TRANSACTIONS ON MULTIMEDIA | 2008年 / 10卷 / 05期

基金：

加拿大自然科学与工程研究理事会;

关键词：

nonlinear media; optimization; periodic broadcast; video delivery;

D O I：

10.1109/TMM.2008.922847

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Conventional video consists of a single sequence of video frames. During a client's playback period, frames are viewed sequentially from some specified starting point. The fixed frame ordering of conventional video enables efficient scheduled broadcast delivery, as well as efficient near on-demand delivery to large numbers of concurrent clients through use of periodic broadcast protocols in which the video file is segmented and transmitted on multiple channels. This paper considers the problem of devising scalable protocols for near on-demand delivery of "nonlinear" media files whose content may have a tree or graph, rather than linear, structure. Such media allows personalization of the media playback according to individual client preferences. We formulate a mathematical model for determination of the optimal periodic broadcast protocol for nonlinear media with piecewise-linear structures. Our objective function allows differing weights to be placed on the startup delays required for differing paths through the media. Studying a number of simple nonlinear structures we provide insight into the characteristics of the optimal solution. For cases in which the cost of solving the optimization model is prohibitive, we propose and evaluate an efficient approximation algorithm.

引用

页码：871 / 884

页数：14

共 16 条

[1] Periodic broadcast and patching services - implementation, measurement and analysis in an internet streaming video testbed [J].

Bradshaw, MK ;

Wang, B ;

Sen, S ;

Gao, LX ;

Kurose, J ;

Shenoy, P ;

Towsley, D .

MULTIMEDIA SYSTEMS, 2003, 9 (01) :78-93

[2]

Chawathe Y., 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), P795, DOI 10.1109/INFCOM.2000.832254

[3] Minimizing bandwidth requirements for on-demand data delivery [J].

Eager, D ;

Vernon, M ;

Zahorjan, J .

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2001, 13 (05) :742-757

[4]

Gotz D, 2006, P 14 ANN ACM INT C M, P357, DOI DOI 10.1145/1180639.1180717

[5]

Hu AL, 2001, IEEE INFOCOM SER, P508, DOI 10.1109/INFCOM.2001.916754

[6]

HUA KA, 1997, P ACM SIGCOMM, P89

[7]

Jannotti J, 2000, USENIX ASSOCIATION PROCEEDINGS OF THE FOURTH SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION, P197

[8] Harmonic broadcasting for video-on-demand service [J].

Juhn, LS ;

Tseng, LM .

IEEE TRANSACTIONS ON BROADCASTING, 1997, 43 (03) :268-271

[9]

Lao L, 2005, LECT NOTES COMPUT SC, V3462, P906

[10] Scalable on-demand media streaming with packet loss recovery [J].

Mahanti, A ;

Eager, DL ;

Vernon, MK ;

Sundaram-Stukel, DJ .

IEEE-ACM TRANSACTIONS ON NETWORKING, 2003, 11 (02) :195-209

← 1 2 →