Marcus Rocha
ABSTRACT
Recently, a number of scalable stream sharing protocols have been proposed with the promise of great reductions in the server and network bandwidth required for delivering popular media content. Although the scalability of these protocols has been evaluated mostly for sequential user accesses, a high degree of interactivity has been observed in the accesses to several real media servers. Moreover, some studies have indicated that user interactivity can severely penalize the scalability of stream sharing protocols.This paper investigates alternative mechanisms for scalable streaming to interactive users. We first identify a set of workload aspects that are determinant to the scalability of classes of streaming protocols. Using real workloads and a new interactive media workload generator, we build a rich set of realistic synthetic workloads. We evaluate Bandwidth Skimming and Patching, two state-of-the-art streaming protocols, covering, with our workloads, a larger region of the design space than previous work. Finally, we propose and evaluate five optimizations to Bandwidth Skimming, the most scalable of the two protocols. Our best optimization reduces the average server bandwidth required for interactive workloads in up to 54%, for unlimited client buffers, and 29%, if buffers are constrained to 25% of media size.
- J. Almeida, J. Krueger, D. Eager, and M. Vernon. Analysis of Educational Media Server Workloads. In Proc. NOSSDAV, Port Jefferson, NY, June 2001.]] Google Scholar
Digital Library
- A. Bar-Noy and R. Ladner. Competitive On-Line Stream Merging Algorithms for Media-on-Demand. Journal of Algorithms, 48(1):59--90, Aug. 2003.]] Google ScholarDigital Library
- M. Bradshaw, B. Wang, S. Sen, L. Gao, J. Kurose, P. Shenoy, and D. Towsley. Periodic Broadcast and Patching Services- Implementation, Measurement and Analysis in an Internet Streaming Video Testbed. Multimedia Systems, 9(1):78--93, July 2003.]] Google ScholarDigital Library
- M. Chesire, A. Wolman, G. Voelker, and H. Levy. Measurement and Analysis of a Streaming Media Workload. In Proc. Symp. on Internet Technologies and Systems, San Francisco, CA, Mar. 2001.]] Google ScholarDigital Library
- E. Coffman, P. Momcilovic, and P. Jelenkovic. The Dyadic Stream Merging Algorithm. Journal of Algorithms, 43(1):120--137, Apr. 2002.]] Google ScholarDigital Library
- C. Costa, I. Cunha, A. Borges, C. Ramos, M. Rocha, J. Almeida, and B. Ribeiro-Neto. Analyzing Client Interactivity in Streaming Media. In Proc. World Wide Web Conference, New York, NY, May 2004.]] Google ScholarDigital Library
- D. Eager and M. Vernon. Dynamic Skyscraper Broadcasts for Video-on-Demand. In Proc. International Workshop on Advances in Multimedia Information Systems, Istanbul, Turkey, Sep. 1998.]] Google ScholarDigital Library
- D. Eager, M. Vernon, and J. Zahorjan. Bandwidth Skimming: ATechnique for Cost-Effective Video on Demand. In Proc. Multimedia Computing and Networking, San Jose, CA, Jan. 2000.]]Google Scholar
- D. Eager, M. Vernon, and J. Zahorjan. Minimizing Bandwidth Requirements for On-Demand Data Delivery. IEEE Transactions on Knowledge and Data Engineering, 13(5):742--757, Sep. 2001.]] Google ScholarDigital Library
- eTeach. http://eteach.cs.wisc.edu/index.html.]]Google Scholar
- L. Gao and D. Towsley. Supplying Instantaneous Video-on-Demand Services Using Controlled Multicast. In Proc. IEEE Multimedia Computing Systems, Florence, Italy, June 1999.]] Google ScholarDigital Library
- K. Hua, Y. Cai, and S. Sheu. Patching: AMulticast Technique for True Video-on-Demand Services. In Proc. ACM MULTIMEDIA, Bristol, UK, Sep. 1998.]] Google ScholarDigital Library
- S. Jin and A. Bestravros. Scalability of Multicast Delivery for Non-sequential Streaming Access. In Proc. SIGMETRICS, Marina Del Rey, CA, June 2002.]] Google ScholarDigital Library
- J. Liu and J. Xu. Proxy Caching for Media Streaming over the Internet. IEEE Communications Magazine, 42(8):88--94, Aug. 2004.]]Google ScholarDigital Library
- H. Ma, K. Shin, and W. Wu. Best-effort Patching for Multicast True VoDService. Multimedia Tools Applications, 26(1):101--122, May 2005.]] Google ScholarDigital Library
- J. Padhye and J. Kurose. An Empirical Study of Client Interactions with a Continuous-Media Courseware Server. In Proc. NOSSDAV, Cambridge, UK, July 1998.]]Google Scholar
- RIPPLES/MANIC. http://manic.cs.umass.edu.]]Google Scholar
- H. Tan, D. Eager, and M. Vernon. Delimiting the Range of Effectiveness of Scalable On-Demand Streaming. In Proc. International Symposium on Computer Performance Modeling and Evaluation, Rome, Italy, Sep. 2002.]]Google ScholarDigital Library
- H. Tan, D. Eager, M. Vernon, and H. Guo. Quality of Service Evaluations of Multicast Streaming Protocols. In Proc. ACM SIGMETRICS, Marina Del Rey, CA, June 2002.]] Google ScholarDigital Library
- Universo Online. http://www.uol.com.br.]]Google Scholar
- B. Vickers, C. Albuquerque, and T. Suda. Source-adaptive Multilayered Multicast Algorithms for Real-time Video Distribution. IEEE/ACM Transactions on Networking, 8(6):720--733, Dec. 2000.]] Google ScholarDigital Library
- Y. Zhao, D. Eager, and M. Vernon. Network Bandwidth Requirements for Scalable On-Demand Streaming. In Proc. IEEE INFOCOM, New York, NY, June 2002.]]Google Scholar
Index Terms
- Scalable media streaming to interactive users
Recommendations
Scalable, Adaptive Streaming for Nonlinear Media
Streaming linear media objects has become ubiquitous on today's Internet. Interactive, nonlinear media objects, such as large 3D models and visualization databases, have proven difficult to stream. The Channel Set Adaptation (CSA) framework lets clients ...
Delimiting the range of effectiveness of scalable on-demand streaming
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 ...
Scalable streaming for heterogeneous clients
MM '06: Proceedings of the 14th ACM international conference on MultimediaPeriodic broadcast protocols enable the efficient streaming of highly popular media files to large numbers of concurrent clients. Most previous periodic broadcast protocols, however, assume that all clients can receive at the same rate, and also assume ...
Comments