Data allocation algorithms for distributed video servers
MULTIMEDIA '00 Proceedings of the eighth ACM international conference on Multimedia
Scheduled video delivery for scalable on-demand service
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Interactive video streaming with proxy servers
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Interactive virtual environments and distance education
| Hi-index | 0.00 |
We study video server performance and reliability. We classify several reliability schemes based on the redundancy technique used (mirroring vs. parity) and on the distribution granularity of redundant data. Then, we propose for each scheme its adequate data layout. To calculate the server reliability, we apply discrete modeling based on Markov chains. Further, we focus on the trade-off between achieving high reliability and low per stream cost. Our results show that, in contrast to intuition, for the same degree of reliability, mirroring-based schemes always outperform parity-based schemes in terms of per stream cost and also restart latency after disk failure. Our results also show that a mirroring scheme that copies original data of a single disk onto a subset of all disks significantly improves the server reliability and slightly increases the per stream cost as compared to the classical interleaved mirroring scheme.