DocumentCode
3209308
Title
Fast broadcasting for hot video access
Author
Juhn, Li-Shen ; Tseng, Li-Ming
Author_Institution
Dept. of Comput. Sci. & Inf. Eng., Nat. Central Univ., Chung-Li, Taiwan
fYear
1997
fDate
27-29 Oct 1997
Firstpage
237
Lastpage
243
Abstract
Using multiple channels to broadcast a popular video can reduce the viewer´s waiting time. With the same bandwidth allocation as conventional broadcasting schemes, pyramid broadcasting schemes can provide users with shorter waiting time. This paper presents a new broadcasting method, which can reduce the user´s waiting time much greater than previous schemes. With the same waiting requirement for a popular movie, the new algorithm needs much less bandwidth and, thus, greatly saves the bandwidth requirements. At the client end, the buffer requirement is in between previous pyramid schemes. However, using the new scheme, if a set-top box has no buffer, its user can still have the movie with longer waiting time, but previous pyramid schemes cannot provide continuous video service without buffer
Keywords
bandwidth compression; frequency allocation; interactive television; television broadcasting; broadcasting; buffer requirement; hot video access; multiple channels; pyramid broadcasting schemes; set-top box; Bandwidth; Channel allocation; Computer science; Digital video broadcasting; Indexing; Motion pictures; Multimedia communication; TV broadcasting; Video on demand; Watches;
fLanguage
English
Publisher
ieee
Conference_Titel
Real-Time Computing Systems and Applications, 1997. Proceedings., Fourth International Workshop on
Conference_Location
Taipei
Print_ISBN
0-8186-8073-3
Type
conf
DOI
10.1109/RTCSA.1997.629229
Filename
629229
Link To Document