Scheduling policies for an on-demand video server with batching
MULTIMEDIA '94 Proceedings of the second ACM international conference on Multimedia
Using rotational mirrored declustering for replica placement in a disk-array-based video server
Proceedings of the third ACM international conference on Multimedia
Tertiary storage: an evaluation of new applications
Tertiary storage: an evaluation of new applications
An online video placement policy based on bandwidth to space ratio (BSR)
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
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
Approximation algorithms for data placement in arbitrary networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for data management in networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Dynamic Replica Placement for Scalable Content Delivery
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
QoS-Based Resource Discovery in Intermittently Available Environments
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Supporting mobile multimedia applications in MAPGrid
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
| Hi-index | 0.00 |
In this paper, we address the problem of data placement in a grid based multimedia environment, where the resource providers, i.e. servers, are intermittently available. The goal is to optimize the system performance by admitting maximum number of users into the system while ensuring user Quality of Service (QoS). We define and formulate various placement strategies that determine the degree of replication necessary for video objects by using a cost-based optimization procedure based on predictions of expected requests under various time-map scenarios and QoS demands. We also devise methods for dereplication of videos based on changes in popularity and server usage patterns. Our performance results indicate the benefits obtained the judicious use of dynamic placement strategies.