Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access
Science of Continuous Media Application Design in Wireless Networks of Mobile Devices
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Comparison of replication strategies for content availability in C2P2 networks
Proceedings of the 6th international conference on Mobile data management
Hybrid Search Algorithms for P2P Media Streaming Distribution in Ad Hoc Networks
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
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
Managing ad-hoc networks through the formal specification of service requirements
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
Hi-index | 0.00 |
This paper investigates a novel streaming architecture consisting of home-to-home online (H2O) devices that collaborate with one another to provide on-demand access to large repositories of continuous media such as audio and video clips. An H2O device is configured with a high bandwidth wireless communication component, a powerful processor, and gigabytes of storage. A key challenge of this environment is how to place data across H2O devices in order to enhance startup latency, defined as the delay observed from when a user requests a clip, to the onset of its display. Our primary contribution is a novel replication technique that enhances startup latency, while minimizing the total storage space required from an environment consisting of N H2O devices. This technique is based on the following intuition: The first few blocks of a clip are required more urgently than its last few blocks, and should be replicated more frequently in order to minimize startup latency. We develop analytical models to quantify the number of replicas required for each block. In addition, we describe two alternative distributed implementation of our replication strategy. When compared with full replication, our technique provides on average greater than 97% (i.e., several orders of magnitude) savings in storage space, while ensuring zero startup latency and a hiccup-free reception.