Request generation for a peer-based PVR
Pages 99 - 104
Abstract
Capacity planning, as well as protocol design and storage system design for video distribution systems are dependent on an understanding of the anticipated workload. Previous studies have focused on aggregate statistics of video popularity over time, and only recently has work been done which analyzes user behaviour variability over time. We are interested in a video storage/distribution system that uses peer resources to help content providers distribute video content to nodes in a network over long periods of time. Such a system is intended to operate on local principles of utility associated with each peer. More than ever, a workload model based on long-term user behaviour is required. In particular, it is unclear how request patterns driven by local utility can be shaped to match expected large-scale aggregate request characteristics such as a Zipf-distribution for overall popularity. In this paper, we describe early work in developing a workload generator for a Peer-based PVR (Personal Video Recorder) system to demonstrate some of these challenges.
References
[1]
K. N. Choong, B. M. Ali, V. Prakash, and Y. C. Yee. The Case for a Dynamic Proxy Framework with Voluntary/Incentive-based Client Hosting Scheme. Journal of Network and Computer Applications, 30:167--185, 2007.
[2]
R. Garcia, X. G. Paneda, D. Melendi, and V. Garcia. Probabilistic Analysis and Interdependence Discovery in the User Interactions of a Video News on Demand Service. Computer Networks, 53(12):2038--2049, 2009.
[3]
P. Gill, M. Arlitt, Z. Li, and A. Mahanti. YouTube Traffic Characterization: A View From The Edge. In IMC, pages 15--28, San Diego, CA, October 2007.
[4]
C. Griwodz, M. Bar, and L. Wolf. Long-term Movie Popularity Models in Video-on-Demand Systems or The Life of an on-Demand Movie. In ACM Multimedia, pages 349--357, Seattle, WA, October 1997.
[5]
L. Guo, E. Tan, S. Chen, Z. Ziao, and X. Zhang. The Stretched Exponential Distribution of Internet Media Access Patterns. In PODC, pages 283--294, Toronto, ON, Canada, August 2008.
[6]
K. Hua, Y. Chai, and S. Sheu. Patching: A Multicast Technique for True Video-on-Demand Services. In ACM Multimedia, pages 191--200, September 1998.
[7]
K. Hua and S. Sheu. Skyscraper Broadcasting: A New Broadcasting Scheme for Metropolitan Video-On-Demand Systems. In ACM SIGCOMM, pages 89--100, September 1997.
[8]
Y. Huang, T. Fu, D. Ching, J. Lui, and C. Huang. Challenges, Design and Analysis of a Large-scale P2P-VOD system. In ACM SIGCOMM, pages 375--388, Seattle, WA, USA, August 2008.
[9]
S. Jin and A. Bestavros. Gismo: a Generator of Internet Streaming Media Objects and Workloads. SIGMETRICS Perform. Eval. Rev., 29(3):2--10, 2001.
[10]
J. Ostrowski and N. Sarhan. Characterization of Social Video. In MMCN, pages 347--356, San Jose, CA, January 2009.
[11]
V. Shrivastava and S. Banerjee. Natural Selection in Peer-to-Peer Streaming: From the Cathedral to the Bazaar. In NOSSDAV '05, pages 93--98, Stevenson, WA, June 2005.
[12]
W. Tang, Y. Fu, L. Cherkasova, and A. Vahdat. Long-term Streaming Media Server Workload Analysis and Modeling. Technical Report HPL-2003-23, HP Labs, Palo Alto, CA, January 2003.
[13]
S. Viswanathan and T. Imielinski. Metropolitan Area Video-On-Demand Service Using Pyramid Broadcasting. Multimedia Systems, 4:197--208, 1996.
Index Terms
- Request generation for a peer-based PVR
Recommendations
An Efficient Hybrid Peer-to-Peer System for Distributed Data Sharing
Peer-to-peer overlay networks are widely used in distributed systems. Based on whether a regular topology is maintained among peers, peer-to-peer networks can be divided into two categories: structured peer-to-peer networks in which peers are connected ...
Locality in structured peer-to-peer networks
Distributed hash tables (DHTs), used in a number of structured peer-to-peer (P2P) systems, provide efficient mechanisms for resource placement and location. A key distinguishing feature of current DHT systems, such as Chord, Pastry, CAN and Tapestry, is ...
Trustworthiness of acquaintances in Peer-to-Peer overlay networks
Various types of applications manipulate objects distributed in Peer-to-Peer overlay networks. An acquaintance peer of a peer p is a peer whose service the peer p knows and with which the peer p can directly communicate. We discuss types of acquaintance ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
June 2010
138 pages
ISBN:9781450300438
DOI:10.1145/1806565
- General Chair:
- Dick C.A. Bulterman,
- Program Chair:
- Mohamed Hefeeda
Copyright © 2010 ACM.
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
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 02 June 2010
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
NOSSDAV '10
Sponsor:
NOSSDAV '10: The 20th International Workshop on Network and Operating Systems Support for Digital Audio and Video
June 2 - 4, 2010
Amsterdam, The Netherlands
Acceptance Rates
Overall Acceptance Rate 118 of 363 submissions, 33%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 105Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 19 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in