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
A digital fountain approach to reliable distribution of bulk data
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Patching: a multicast technique for true video-on-demand services
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
Optimal and efficient merging schedules for video-on-demand servers
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
Competitive on-line stream merging algorithms for media-on-demand
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Analysis of educational media server workloads
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
Scalable on-demand media streaming with packet loss recovery
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Scalability of multicast delivery for non-sequential streaming access
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Quality of service evaluations of multicast streaming protocols
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Minimizing Bandwidth Requirements for On-Demand Data Delivery
IEEE Transactions on Knowledge and Data Engineering
Supplying Instantaneous Video-on-Demand Services Using Controlled Multicast
ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
Video-on-Demand Server Efficiency through Stream Tapping
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Measurement and analysis of a streaming-media workload
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Tailored Transmissions for Efficient Near-Video-On-Demand Service
ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
Analyzing client interactivity in streaming media
Proceedings of the 13th international conference on World Wide Web
Hi-index | 0.00 |
Previous analyses of scalable streaming protocols for delivery of stored multimedia have largely focused on how the server bandwidth required for full-file delivery scales as the client request rate increases or as the start-up delay is decreased. This previous work leaves unanswered three questions that can substantively impact the desirability of using these protocols in some application domains, namely: (1) Are simpler scalable download protocols preferable to scalable streaming protocols in contexts where substantial start-up delays can be tolerated? (2) If client requests are for (perhaps arbitrary) intervals of the media file rather than the full-file, are there conditions under which streaming is not scalable (i.e., no streaming protocol can achieve sub-linear scaling of required server bandwidth with request rate)? (3) For systems delivering a large collection of objects with a heavy-tailed distribution of file popularity, can scalable streaming substantially reduce the total server bandwidth requirement, or will this requirement be largely dominated by the required bandwidth for relatively cold objects?This paper addresses these questions primarily through the development of tight lower bounds on required server bandwidth, under the assumption of Poisson, independent client requests. Implications for other arrival processes are also discussed. Previous work and results presented in this paper suggest that these bounds can be approached by implementable policies. With respect to the first question, the results show that scalable streaming protocols require significantly lower server bandwidth in comparison to download protocols for start-up delays up to a large fraction of the media playback duration. For the second question, we find that in the worst-case interval access model, the minimum required server bandwidth, assuming immediate service to each client, scales as the square root of the request rate. Finally, for the third question, we show that scalable streaming can provide a factor of log K improvement in the total minimum required server bandwidth for immediate service, as the number of objects K is scaled, for systems with fixed minimum object request popularity.