Modern Operating Systems
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Cooperative Caching in Ad Hoc Networks
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Buffering and caching in large-scale video servers
COMPCON '95 Proceedings of the 40th IEEE Computer Society International Conference
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
PAVAN: a policy framework for content availabilty in vehicular ad-hoc networks
Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks
Comparison of replication strategies for content availability in C2P2 networks
Proceedings of the 6th international conference on Mobile data management
A replica allocation method adapting to topology changes in ad hoc networks
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
User mobility modeling and characterization of mobility patterns
IEEE Journal on Selected Areas in Communications
Static Replication Strategies for Content Availability in Vehicular Ad-hoc Networks
Mobile Networks and Applications
Multimedia data in hybrid vehicular networks
Proceedings of the 8th International Conference on Advances in Mobile Computing and Multimedia
Hi-index | 0.00 |
On-demand delivery of audio and video clips in peer-to-peer vehicular ad-hoc networks is an emerging area of research. Our target environment uses data carriers, termed zebroids, where a mobile device carries a data item on behalf of a server to a client thereby minimizing its availability latency. In this study, we quantify the variation in availability latency with zebroids as a function of a rich set of parameters such as car density, storage per device, repository size, and replacement policies employed by zebroids. Using analysis and extensive simulations, we gain novel insights into the design of carrier-based systems. Significant improvements in latency can be obtained with zebroids at the cost of a minimal overhead. These improvements occur even in scenarios with lower accuracy in the predictions of the car routes. Two particularly surprising findings are: (1) a naive random replacement policy employed by the zebroids shows competitive performance, and (2) latency improvements obtained with a simplified instantiation of zebroids are found to be robust to changes in the popularity distribution of the data items.