Broadcasting approaches for VoD services
Distributed multimedia databases
Multicast Video-on-Demand services
ACM SIGCOMM Computer Communication Review
The dyadic stream merging algorithm
Journal of Algorithms
Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Competitive on-line stream merging algorithms for media-on-demand
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Seamless channel transition for the staircase video broadcasting scheme
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 2004 ACM workshop on Next-generation residential broadband challenges
Generalized Fibonacci broadcasting an efficient VOD scheme with user bandwidth limit
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
A new fixed-delay broadcasting protocol for near video-on-demand services
ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
Interactive slotted stream tapping
Computer Communications
The enhanced staircase broadcasting for VBR videos
Computer Communications
A broadcasting scheme with supporting VCR functions for near video-on-demand systems
Computer Communications
A zero-overhead error-correcting nVoD schema
Multimedia Tools and Applications
Seamless channel transition for broadcatch scheme
PSIVT'06 Proceedings of the First Pacific Rim conference on Advances in Image and Video Technology
High performance hybrid streaming scheme and VCR support
Transactions on Edutainment VIII
| Hi-index | 0.00 |
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.