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
Role-based multicast in highly mobile but sparsely connected ad hoc networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
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
Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access
C2P2: A Peer-to-Peer Network for On-Demand Automobile Information Services
DEXA '04 Proceedings of the Database and Expert Systems Applications, 15th International Workshop
PAVAN: a policy framework for content availabilty in vehicular ad-hoc networks
Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks
Placement of continuous media in wireless peer-to-peer networks
IEEE Transactions on Multimedia
An evaluation of availability latency in carrier-based wehicular ad-hoc networks
MobiDE '06 Proceedings of the 5th ACM international workshop on Data engineering for wireless and mobile access
Data Replication in Cooperative Mobile Ad-Hoc Networks
Mobile Networks and Applications
| Hi-index | 0.01 |
This study investigates alternative continuous media replication techniques and their impact on content availability in a mobile car-to-car peer-to-peer (C2P2) network of devices. Using aggregate availability latency as a metric, we compare a simple random replication mechanism with a family of techniques that compute the degree of replication for each title based on its popularity, i.e., frequency of access. We use a simulation study along with some supporting analytical analysis for this comparison. Obtained results demonstrate the following key lesson. When total storage capacity of the network is significantly larger than the clip repository size, a random replication technique is sufficient. Otherwise, there is a large parameter space where the frequency-based replication schemes provide superior performance.