I/O Scheduling for VBR Video Streams in Video Servers
Xi Fu · Chinese Journal of Computers · 2000
Problems of I/O Scheduling for VBR video streams in video servers are discussed in this paper. At first this paper presents a disk scheduling algorithm, named Bi-SCAN. Apply BiSCAN to I/O scheduling of VBR video streams it then suggests two deterministic admission control algorithms, which can guarantee the quality of service. To improve the efficiency of resource allocation, it also proposes a statistic admission control algorithm based on statistic multiplex. The algorithm converts the statistic characteristic of VBR video data into that of the number of data blocks that the disk should render during the service round. This simplifies the problem of admission control of VBR video streams. The simulation results match calculations well, and show that a number of times of concurrent users can be added to the system with an overload probability of 10~(-6) compared with deterministic methods.