Design and Evaluation of an Adaptive Reservation-Based Piggybacking Algorithm for Video Servers


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 7, No. 2, pp. 656-665, Feb. 2000
,   PDF Download:  
Keywords:
Abstract

A critical issue in the performance of a video-on-demand system is the I/O bandwidth required in order to satisfy client requests. Several approaches: batching, bridging, piggybacking are used ot reduce the I/O demand on the video server through sharing. Piggybacking is the policy for altering display rates of requests in progress fro the same object, for the purpose of merging their corresponding I/O streams into a single stream, which can serve the entire group of merged requests. In this paper, we propose a new policy called an adaptive reservation-based piggybacking that dynamically reserves the I/O stream capacity of video server for popular videos according to video server loads to immediately schedule the requests for popular videos. The performance of the proposed policy is evaluated through simulations, and is compared with that of simple piggybacking. As the result, we know that the adaptive reservation-based piggybacking provides better service probability, average waiting time and percentages saving in frames than simple piggybacking.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
I. Bae and K. Lee, "Design and Evaluation of an Adaptive Reservation-Based Piggybacking Algorithm for Video Servers," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 7, no. 2, pp. 656-665, 2000. DOI: .

[ACM Style]
Ihn-Han Bae and Kyung-Sook Lee. 2000. Design and Evaluation of an Adaptive Reservation-Based Piggybacking Algorithm for Video Servers. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 7, 2, (2000), 656-665. DOI: .