Long-term movie popularity models in video-on-demand systems: or the life of an on-demand movie
MULTIMEDIA '97 Proceedings of the fifth ACM international conference on Multimedia
Disk load balancing for video-on-demand systems
Multimedia Systems
Scheduling unrelated machines with costs
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Approximation algorithms for data placement on parallel disks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Data migration to minimize the average completion time
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for data migration with cloning
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Performance Study of Dynamic Replication Techniques in Continuous Media Servers
MASCOTS '00 Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Threshold-Based Dynamic Replication in Large-Scale Video-on-Demand Systems
RIDE '98 Proceedings of the Workshop on Research Issues in Database Engineering
Optimal Video Replication and Placement on a Cluster of Video-on-Demand Servers
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
Improved results for data migration and open shop scheduling
ACM Transactions on Algorithms (TALG)
Dynamic placement for clustered web applications
Proceedings of the 15th international conference on World Wide Web
Understanding user behavior in large-scale video-on-demand systems
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Algorithms for data placement, reconfiguration and monitoring in storage networks
Algorithms for data placement, reconfiguration and monitoring in storage networks
CSSE '08 Proceedings of the 2008 International Conference on Computer Science and Software Engineering - Volume 03
Incremental list coloring of graphs, parameterized by conservation
Theoretical Computer Science
| Hi-index | 5.23 |
Video-on-Demand (VoD) services require frequent updates in file configuration on the storage subsystem, so as to keep up with the frequent changes in movie popularity. This defines a natural reconfiguration problem in which the goal is to minimize the cost of moving from one file configuration to another. The cost is incurred by file replications performed throughout the transition. The problem shows up also in production planning, preemptive scheduling with set-up costs, and dynamic placement of Web applications. We show that the reconfiguration problem is NP-hard already on very restricted instances. We then develop algorithms which achieve the optimal cost by using servers whose load capacities are increased by O(1), in particular, by factor 1+@d for any small 0