Resource allocation problems: algorithmic approaches
Resource allocation problems: algorithmic approaches
Scheduling policies for an on-demand video server with batching
MULTIMEDIA '94 Proceedings of the second ACM international conference on Multimedia
Choosing the best storage system for video service
Proceedings of the third ACM international conference on Multimedia
Disk load balancing for video-on-demand systems
Multimedia Systems
Data allocation algorithms for distributed video servers
MULTIMEDIA '00 Proceedings of the eighth ACM international conference on Multimedia
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Load management in distributed video servers
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Striping Doesn't Scale: How to Achieve Scalability for Continuous Media Servers with Replication
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Scheduling and data distribution in a multiprocessor video server
ICMCS '95 Proceedings of the International Conference on Multimedia Computing and Systems
Performance improvements of large-scale video servers by video segment allocation
Systems and Computers in Japan
Efficient algorithms of video replication and placement on a cluster of streaming servers
Journal of Network and Computer Applications
A Case Study of Load Sharing Based on Popularity in Distributed VoD Systems
IEEE Transactions on Multimedia
| Hi-index | 0.00 |
In this paper, we examine the data replication problem in a particular Grid Delivery Network (GDN) which is a system that provides video services, among which is Video On Demand (VOD). In this system, the data are divided into fixed size blocks which must be replicated on hosts to decrease the total download time. We propose a probabilistic model to optimise the average download time of requests based on the host's availability and the document size distribution. The objective function induced by this model is a non-linear integer problem. It can be solved in real values by Lagrangian optimisation. We prove that in a particular case, this problem can be reduced to a knapsack problem. We propose approximation algorithms and validate them using simulations with varying characteristics.