IEEE Transactions on Parallel and Distributed Systems
Journal of Systems and Software
Optimized Distributed Delivery of Continuous-Media Documents over Unreliable Communication Links
IEEE Transactions on Parallel and Distributed Systems
A request distribution method for clustered VOD servers considering buffer sharing effects
Journal of Systems Architecture: the EUROMICRO Journal
A stepwise optimization algorithm of clustered streaming media servers
Journal of Systems and Software
HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
Load balancing in fault tolerant video server
IDEAL'07 Proceedings of the 8th international conference on Intelligent data engineering and automated learning
An efficient storage mechanism to distribute disk load in a VoD server
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
A peer-to-peer assisting scheme for live streaming services
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
User demand behavior based adaptive algorithm for service composition of streaming media
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
Optimal content placement for a large-scale VoD system
Proceedings of the 6th International COnference
Minimal cost reconfiguration of data placement in storage area network
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Leveraging video viewing patterns for optimal content placement
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Minimal cost reconfiguration of data placement in a storage area network
Theoretical Computer Science
| Hi-index | 0.00 |
A cost-effective approach to building up scalable Video-on-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial video replication and placement problem in a distributed storage VoD cluster for high quality and high availability services. We formulate it as a combinatorial optimization problem with objectives of maximizing the encoding bit rate and the number of replicas of each video and balancing the workload of the servers. It is subject to the constraints of the storage capacity and the outgoing network bandwidth of the servers. Under the assumption of single fixed encoding bit rate for all videos, we give an optimal replication algorithm and a bounded placement algorithm for videos with different popularities. To reduce the complexity of the replication algorithm, we present an efficient algorithm that utilizes the Zipf-like video popularitydistributions to approximate the optimal solution. For videos with scalable encoding bit rates, we propose a heuristic algorithm based on simulated annealing. We conduct a comprehensive performance evaluation of the algorithms and demonstrate their effectiveness via simulations over a synthetic workload set.