Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Minimizing Bandwidth Requirements for On-Demand Data Delivery
IEEE Transactions on Knowledge and Data Engineering
A Parallel Continous Media Server for Internet Environmets
HPCN Europe 1998 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
An Architecture for a Scalable Video-on-Demand Server Network with Quality-of-Service Guarantees
IDMS '00 Proceedings of the 7th International Workshop on Interactive Distributed Multimedia Systems and Telecommunication Services
Solving a Media Mapping Problem in a Hierarchical Server Network with Parallel Simulated Annealing
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
| Hi-index | 0.00 |
This paper presents a novel broadband multimedia service called TV-Anytime. The basic idea of this service is to store broadcast media assets onto media server systems and allow clients to access these streams at any time. We propose a hierarchical structure of a distributed server network to support a high quality TV-anytime service. A key issue, how to map the media assets onto such a hierarchical server network is addressed and formalized as a combinatorial optimization problem. In order to solve this optimization problem, a set of heuristic solutions by use of a parallel simulated annealing library is proposed and verified by a set of benchmark instances. Finally, the TV Cache is presented as a prototype of a scalable TV-Anytime system.