Concurrent programming in ERLANG (2nd ed.)
Concurrent programming in ERLANG (2nd ed.)
Buffering and caching in large-scale video servers
COMPCON '95 Proceedings of the 40th IEEE Computer Society International Conference
Research on Model and Scheduling Algorithm for Double-Mode VoD Servers
ICCNMC '03 Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing
Dynamic Buffer Allocation in Video-on-Demand Systems
IEEE Transactions on Knowledge and Data Engineering
A cost comparison of distributed and centralized approaches to video-on-demand
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
A VOD server's caching and scheduling performance determine its service performance efficiency. This paper describes a new cache model and content replacement strategy, based on the Zipf-like Law and the characteristics of media stream service, which can reduce the disk I/O ratio by 6.22%. A performance analytical model for a disk load schedule was constructed, based on the Stochastic Process and Queuing Theory, and a new disk load strategy suitable for VOD systems was also formulated. This strategy reduces the disk block time by 3.71% on average. This paper also describes a content schedule scheme which was designed by constructing, analyzing and simplifying the SPN model deduced from the MSMQ theory. This scheme can guarantee the quality of service(QoS) and distribute program content automatically. An experiment was conducted, and the results showed that VOD servers embedded with the new cache and using the new schedule strategy could reduce the average response time to user requests by 7% to 19%.