Fourth International Workshop on Real-Time Computing Systems and Applications (RTCSA'97)
Fast broadcasting for hot video access
Taipei, TAIWAN
October 27-October 29
ISBN: 0-8186-8073-3
Li-Shen Juhn, Dept. of Comput. Sci. & Inf. Eng., Nat. Central Univ., Chung-Li, Taiwan
Li-Ming Tseng, Dept. of Comput. Sci. & Inf. Eng., Nat. Central Univ., Chung-Li, Taiwan
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.
Index Terms:
interactive television; broadcasting; hot video access; multiple channels; pyramid broadcasting schemes; buffer requirement; set-top box
Citation:
Li-Shen Juhn, Li-Ming Tseng, "Fast broadcasting for hot video access," rtcsa, pp.237, Fourth International Workshop on Real-Time Computing Systems and Applications (RTCSA'97), 1997