Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Fault tolerant design of multimedia servers
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Fault-tolerant architectures for continuous media servers
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Segmented information dispersal (SID) for efficient reconstruction in fault-tolerant video servers
MULTIMEDIA '96 Proceedings of the fourth ACM international conference on Multimedia
A survey of approaches to fault tolerant design of VOD servers: techniques, analysis and comparison
Parallel Computing - Special issues on applications: parallel data servers and applications
Cost Analyses for VBR Video Servers
IEEE MultiMedia
Scalable MPEG2 Video Servers with Heterogeneous QoS on Parallel Disk Arrays
NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
Efficient support for interactive service in multi-resolution VOD systems
The VLDB Journal — The International Journal on Very Large Data Bases
A generic platform for scalable access to multimedia-on-demand systems
IEEE Journal on Selected Areas in Communications
Disk-based storage for scalable video
IEEE Transactions on Circuits and Systems for Video Technology
Replica Striping for Multi-resolution Video Servers
IDMS/PROMS 2002 Proceedings of the Joint International Workshops on Interactive Distributed Multimedia Systems and Protocols for Multimedia Systems: Protocols and Systems for Interactive Distributed Multimedia
| Hi-index | 0.00 |
In this paper, we present a Quality of Service (QoS) negotiation scheme for efficient failure recovery in multi-resolution video servers with disk arrays. This scheme exploits multi-resolution property of video streams by negotiating service resolutions in order to provide graceful QoS degradation when a disk fails. Using the proposed scheme, not only can we increase the number of admitted clients greatly when all disks are operational but also utilize server resources efficiently. Furthermore, it can provide each client with acceptable QoS even in the presence of disk failure while maximizing server-perceived rewards. The effectiveness of the proposed algorithm is evaluated through simulation-based experiments.