Metropolitan area video-on-demand service using pyramid broadcasting
Multimedia Systems
Skyscraper broadcasting: a new broadcasting scheme for metropolitan video-on-demand systems
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Harmonic broadcasting is optimal
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling techniques for media-on-demand
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A Low Bandwidth Broadcasting Protocol for Video on Demand
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
Video-on-demand broadcast protocols are commonly used to deliver video content to a large uncoordinated set of consumers. Since broadcast protocols are not attuned to individual user requests, some delay in service is unavoidable. The worst-case delay, expressed as a function of the available bandwidth, has been well studied; matching upper and lower bounds have been established in a very general setting. In this paper we turn our attention to average-case delay. We establish asymptotically tight lower bounds on average-case delay in the situation where receiver and sender bandwidths are equal. It follows from our results that existing worst-case-optimal broadcast protocols are, to within a small constant factor, optimal in the average case as well.