Harmonic broadcasting for video-on-demand service

Author

Juhn, Li-Shen ; Tseng, Li-Ming

Author_Institution

Dept. of Comput. Sci. & Inf. Eng., Nat. Central Univ., Chung-Li, Taiwan

Volume

43

Issue

3

fYear

1997

fDate

9/1/1997 12:00:00 AM

Firstpage

268

Lastpage

271

Abstract

Using conventional broadcasting, if we want to support a 120-minute popular movie every 10 minutes, we need 12 video channels. Assuming the set-top box at the client end can buffer portions of the playing video on a disk, pyramid broadcasting schemes can reduce the bandwidth requirements to 5.7 channels. We present a new scheme which only needs 3.2 channels. For a movie with length D minutes, if we want to reduce the viewer waiting time to D/N minutes, we only need to allocate H(N) video channels to broadcast the movie periodically, where H(N) is the harmonic number of N, H(N)=1+1/2+…+1/N. In order to support video-on-demand service for a popular movie, the new scheme greatly reduces the bandwidth requirements

Keywords

bandwidth compression; buffer storage; data compression; harmonics; interactive video; telecommunication channels; television broadcasting; video coding; video discs; TV broadcasting; bandwidth reduction; buffer storage; disk; harmonic broadcasting; movie; pyramid broadcasting schemes; set-top box; video channels; video on demand service; viewer waiting time reduction; Bandwidth; Channel allocation; Computer science; Digital video broadcasting; Motion pictures; Tin;

fLanguage

English

Journal_Title

Broadcasting, IEEE Transactions on

Publisher

ieee

ISSN

0018-9316

Type

jour

DOI

10.1109/11.632927

Filename

632927