Harmonic broadcasting for video-on-demand service
Li-Shen Juhn
Li-Ming Tseng
Dept. of Comput. Sci. & Inf. Eng., Nat. Central Univ., Chung-Li;
This paper appears in: Broadcasting, IEEE Transactions on
Publication Date: Sep 1997
Volume: 43,
Issue: 3
On page(s): 268-271
ISSN: 0018-9316
References Cited: 2
CODEN: IETBAC
INSPEC Accession Number: 5700641
Digital Object Identifier: 10.1109/11.632927
Current Version Published: 2002-08-06
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
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
