DASD dancing: a disk load balancing optimization scheme for video-on-demand computer systems
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Design and implementation of scalable continuous media servers
Parallel Computing - Special issues on applications: parallel data servers and applications
A performance study of dynamic replication techniques in continuous media servers
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Buffering and caching in large-scale video servers
COMPCON '95 Proceedings of the 40th IEEE Computer Society International Conference
Placement of continuous media in wireless peer-to-peer networks
IEEE Transactions on Multimedia
Comparison of replication strategies for content availability in C2P2 networks
Proceedings of the 6th international conference on Mobile data management
A heterogeneous peer-to-peer network testbed
ICUFN'09 Proceedings of the first international conference on Ubiquitous and future networks
Static Replication Strategies for Content Availability in Vehicular Ad-hoc Networks
Mobile Networks and Applications
Cooperation stimulation strategies for peer-to-peer wireless live video-sharing social networks
IEEE Transactions on Image Processing
Hi-index | 0.00 |
This study investigates a novel streaming architecture consisting of home-to-home online (H2O) devices that collaborate to provide on-demand access to a large selection of audio and video clips. An H2O device consists of a high bandwidth wireless communication component, a powerful processor, and gigabytes of storage. This study investigates three families of replication strategies for a H2O cloud. We evaluate these using analytical models. The obtained results demonstrate the superiority of one strategy that determines the number of replicas for a clip i based on (a) the bandwidth required to display clip i proportional to the bandwidth required by the other clips in the database, and (b) the square root of the frequency of access to the clips.