Joo Yung Lee , Sook Jeong Ha , Ihn Han Bae

The KIPS Transactions:PartB , Vol. 9, No. 6, pp. 835-844, Dec. 2002
10.3745/KIPSTB.2002.9.6.835,   PDF Download:

Abstract

The number of channels available to a video server is limited since the number of channels a video server can supportis determined by its communication bandwidth. Several approaches such as batching, piggybacking and patching have been proposed to reduce I/O demand on the video server by sharing multicast data. Patching has been shown to be efficient in the matter of the cost for VOD systems. Unlike converntional multicast techniques, patching is a dynamic multicast scheme which enables a new request to join an ongoing multicast. In addition, true VOD can be achieved since a new request can be served immediately without having to wait for the next multicast. In this paper, we propose two types of channel reservation patching a fixed channel reservation patching and a variable channel reservation patching. To immediately schedule the requests for popular videos, these algorithms reserve the channels of video server for the fixed number of popular videos of for the variable number of popular videos which is determined dynamically according to the load of video server. The performance of the proposed algorithms is evaluated through simulations, and compared with that of simple patching. Our performance measures are average defection rate, average latency, service fairness and the amount of buffered data according to video server loads. Simulation results show that the proposed channel reservation patching algorithms provide better performance compared to simple patching algorithm.

Statistics
Cite this article