Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/776322.776327acmconferencesArticle/Chapter ViewAbstractPublication PagesmmsysConference Proceedingsconference-collections
Article

MediSyn: a synthetic streaming media service workload generator

Published: 01 June 2003 Publication History

Abstract

Currently, Internet hosting centers and content distribution networks leverage statistical multiplexing to meet the performance requirements of a number of competing hosted network services. Developing efficient resource allocation mechanisms for such services requires an understanding of both the short-term and long-term behavior of client access patterns to these competing services. At the same time, streaming media services are becoming increasingly popular, presenting new challenges for designers of shared hosting services. These new challenges result from fundamentally new characteristics of streaming media relative to traditional web objects, principally different client access patterns and significantly larger computational and bandwidth overhead associated with a streaming request. To understand the characteristics of these new workloads we use two long-term traces of streaming media services to develop MediSyn, a publicly available streaming media workload generator. In summary, this paper makes the following contributions: i) we model the long-term behavior of network services capturing the process of file introduction and changing file popularity, ii) we present a novel generalized Zipf-like distribution that captures recently-observed popularity of both web objects and streaming media not captured by existing Zipf-like distributions, and iii) we capture a number of characteristics unique to streaming media services, including file duration, encoding bit rate, session duration and non-stationary popularity of media accesses.

References

[1]
General Pareto Distribution. http://www.math.uah.edu/stat/special/special12.html.]]
[2]
S. Acharya, B. Smith, and P. Parnes. Characterizing User Access to Videos on the World Wide Web. In Proceedings of ACM/SPIE Multimedia Computing and Networking, January 2000.]]
[3]
J. Almeida, J. Krueger, D. Eager, and M. Vernon. Analysis of Educational Media Server Workloads. In Proceedings of NOSSDAV, June 2001.]]
[4]
V. Almeida, A. Bestavros, M. Crovella, and A. de Oliveira. Characterizing Reference Locality in the WWW. In Proceedings of PDIS, December 1996.]]
[5]
V. Almeida, M. Cesirio, R. Fonseca, W. Meira Jr., and C. Murta. Analyzing the behavior of a proxy server in the light of regional and cultural issues. In Proceedings of WCW, June 1998.]]
[6]
P. Barford and M. Crovella. Generating Representative Web Workloads for Network and Server Performance Evaluation. In Proceedings of SIGMETRICS, June 1998.]]
[7]
R. Braynard, D. KostiΕ, A. Rodriguez, J. Chase, and A. Vahdat. Opus: an Overlay Peer Utility Service. In Proceedings of OPENARCH, June 2002.]]
[8]
L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. Web Caching and Zipf-like Distributions: Evidence, and Implications. In Proceedings of INFOCOM, March 1999.]]
[9]
J. Chase, D. Anderson, P. Thakar, A. Vahdat, and R. Doyle. Managing Energy and Server Resources in Hosting Centers. In Proceedings of the 18th ACM SOSP, October 2001.]]
[10]
L. Cherkasova and G. Ciardo. Characterizing Temporal Locality and its Impact on Web Server Performance. In Proceedings of ICCCN, October 2000.]]
[11]
L. Cherkasova and M. Gupta. Characterizing Locality, Evolution, and Life Span of Accesses in Enterprise Media Server Workloads. In Proceedings of NOSSDAV, May 2002.]]
[12]
M. Chesire, A. Wolman, G. Voelker, and H. Levy. Measurement and Analysis of a Streaming-Media Workload. In Proceedings of USITS, March 2001.]]
[13]
R. Jain. The art of computer systems performance analysis: technique for experimental design,measurement,simulation and modeling. John Wiley & Sons, 1992.]]
[14]
S. Jin and A. Bestavros. Temporal Locality in Web Requests Streams: Sources, Characteristics, and Caching Implications. Technical Report BUCS-TR-1999-009, Department of Computer Science, Boston University, August 1999.]]
[15]
S. Jin and A. Bestavros. GISMO: A Generator of Internet Streaming Media Objects and Workloads. Technical Report BUCS-TR-2001-020, Department of Computer Science, Boston University, October 2001.]]
[16]
D. Luperello, S. Mukherjee, and S. Paul. Streaming Media Traffic: an Empirical Study. In Proceedings of WCW, June 2002.]]
[17]
Hewlett Packard. Utility Data Center. http://www.hp.com/go/hpudc.]]
[18]
J. Padhye and J. Kurose. An Empirical Study of Client Interactions with a Continuous-Media Courseware Server. In Proceedings of NOSSDAV, June 1998.]]
[19]
S. Ross. Introduction to probability models. Academic Press, 1997.]]
[20]
S. Sen, J. Rexford, and D. Towsley. Proxy Prefix Caching for Multimedia Streams. In Proceedings of INFOCOM, March 1999.]]
[21]
W. Tang, Y. Fu, L. Cherkasova, and A. Vahdat. Long-term Streaming Media Server Workload Analysis and Modeling. HP Laboratories, Technical Report HPL-2003-23, February 2003.]]

Cited By

View all
  • (2023)HRFP: Highly Relevant Frequent Patterns-Based Prefetching and Caching Algorithms for Distributed File SystemsElectronics10.3390/electronics1205118312:5(1183)Online publication date: 1-Mar-2023
  • (2023)Application and user-specific data prefetching and parallel read algorithms for distributed file systemsCluster Computing10.1007/s10586-023-04160-127:3(3593-3613)Online publication date: 28-Oct-2023
  • (2022)JEDIProceedings of the 22nd ACM Internet Measurement Conference10.1145/3517745.3561466(679-693)Online publication date: 25-Oct-2022
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
NOSSDAV '03: Proceedings of the 13th international workshop on Network and operating systems support for digital audio and video
June 2003
188 pages
ISBN:1581136943
DOI:10.1145/776322
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 2003

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. streaming media
  2. workload analysis
  3. workload generator

Qualifiers

  • Article

Conference

NOSSDAV03
Sponsor:

Acceptance Rates

NOSSDAV '03 Paper Acceptance Rate 18 of 60 submissions, 30%;
Overall Acceptance Rate 118 of 363 submissions, 33%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)15
  • Downloads (Last 6 weeks)3
Reflects downloads up to 13 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2023)HRFP: Highly Relevant Frequent Patterns-Based Prefetching and Caching Algorithms for Distributed File SystemsElectronics10.3390/electronics1205118312:5(1183)Online publication date: 1-Mar-2023
  • (2023)Application and user-specific data prefetching and parallel read algorithms for distributed file systemsCluster Computing10.1007/s10586-023-04160-127:3(3593-3613)Online publication date: 28-Oct-2023
  • (2022)JEDIProceedings of the 22nd ACM Internet Measurement Conference10.1145/3517745.3561466(679-693)Online publication date: 25-Oct-2022
  • (2022)Analysis of Optimal File Placement for Energy-Efficient File-Sharing Cloud Storage SystemIEEE Transactions on Sustainable Computing10.1109/TSUSC.2020.30372607:1(75-86)Online publication date: 1-Jan-2022
  • (2022)Efficient Prefetching and Client-Side Caching Algorithms for Improving the Performance of Read Operations in Distributed File SystemsIEEE Access10.1109/ACCESS.2022.322111710(126232-126252)Online publication date: 2022
  • (2021)TRAGENProceedings of the 21st ACM Internet Measurement Conference10.1145/3487552.3487845(366-379)Online publication date: 2-Nov-2021
  • (2021)Modeling large-scale live video streaming client behaviorMultimedia Systems10.1007/s00530-021-00788-4Online publication date: 12-Apr-2021
  • (2021)Rank-Based Prefetching and Multi-level Caching Algorithms to Improve the Efficiency of Read Operations in Distributed File SystemsBig Data Analytics10.1007/978-3-030-93620-4_17(227-243)Online publication date: 18-Dec-2021
  • (2020)Hyperbolic Embeddings for Near-Optimal Greedy RoutingACM Journal of Experimental Algorithmics10.1145/338175125(1-18)Online publication date: 20-Mar-2020
  • (2020)An Experimental Study of Algorithms for Online Bipartite MatchingACM Journal of Experimental Algorithmics10.1145/337955225(1-37)Online publication date: 13-Mar-2020
  • Show More Cited By

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media