Skip to main content
Log in

Prioritized Admission Strategies to Improve User-Perceived Performance in Interactive VOD Servers

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

In the past, much emphasis has been given to the data throughput of VOD servers. In Interactive Video-on-Demand (IVOD) applications, such as digital libraries, service availability and response times are more visible to the user than the underlying data throughput. Data throughput is a measure of how efficiently resources are utilized. Higher throughput may be achieved at the expense of deteriorated user-perceived performance metrics such as probability of admission and queuing delay prior to admission. In this paper, we propose and evaluate a number of strategies to sequence the admission of pending video requests. Under different request arrival rates and buffer capacities, we measure the probability of admission, queueing delay and data throughput of each strategy. Results of our experiments show that simple hybrid strategies can improve the number of admitted requests and reduce the queuing time, without jeopardizing the data throughput. The techniques we propose are independent of the underlying disk scheduling techniques used. So, they can be employed to improve the user-perceived performance of VOD servers, in general.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. D.P. Anderson, “A file system for continuous media,” ACM Transactions on Computer Systems, Vol. 10, No. 4, pp. 311–337, 1992.

    Google Scholar 

  2. A. Dan, P. Shahabuddin, D. Sitaram, and D. Towsley, “Channel allocation under batching and VCR control in video-on-demand systems,” Journal of Parallel and Distributed Computing, Vol. 30, No. 2, pp. 168–179, 1995.

    Google Scholar 

  3. A. Dan and D. Sitaram, “Ageneralized interval caching policy for mixed interactive and long vedioworkloads,” in Proceedings of SPIE Conference on Multimedia Computing & Networking, 1996, pp. 344–351.

  4. A. Dan, D. Sitaram, and P. Shahabuddin, “Dynamic batching policies for an on-demand video server,” ACM/Springer Multimedia Systems, Vol. 4, pp. 112–121, 1996.

    Google Scholar 

  5. H. Frank, “Analysis and optimization of disk storage devices for time-sharing systems,” Journal of the ACM, Vol. 16, pp. 602–620, 1969.

    Google Scholar 

  6. D.J. Gemmell and S. Christodoulakis, “Principles of delay-sensitive multimedia data storage and retrieval,” ACM Transactions on Information Systems, Vol. 10, No. 1, pp. 51–90, 1992.

    Google Scholar 

  7. D.J. Gemmel and J. Han, “Multimedia network file servers: Multichannel delay-sensitive data retrieval,” ACM/Springer Multimedia Systems, Vol. 1, pp. 240–252, 1994.

    Google Scholar 

  8. D.J. Gemmell, H.M. Vin, D.D. Kandlur, P.V. Rangan, and L.A. Rowe, “Multimedia storage servers: A tutorial,” IEEE Computer, pp. 40–49, 1995.

  9. D.R. Kenchammana-Hosekote and J. Srivastava, “Scheduling continuous media in a video-on-demand server,” IEEE International Conference on Multimedia Computing and Systems, 1994, pp. 19–28.

  10. T.D.C. Little and J.F. Gibbon, “Real-time scheduling for multimedia services,” SPIE High-Speed Fiber Networks and Channels II, Vol. 1784, pp. 320–331, 1992.

    Google Scholar 

  11. K.K. Ramakrishnan, L. Vaitzblit, C. Gray, U. Vahalia, D. Ting, P. Tzelnic, S. Glaser, and W. Duso, “Operating system support for a video-on-demand file service,” ACM/Springer Multimedia Systems, Vol. 3, pp. 53–65, 1995.

    Google Scholar 

  12. A.L. Reddy and J. Wilie, “Disk scheduling in a multimedia I/O system,” in Proc. First ACM Conference on Multimedia, 1993, pp. 289–297.

  13. T.P.J. To and B. Hamidzadeh, “A greedy-but-safe dynamic scheduling strategy for an interactive video-ondemand server,” IEEE International Conference on Multimedia Computing and Systems, 1996, pp. 136–143.

  14. T.P.J. To and B. Hamidzadeh, “Dynamic real-time scheduling strategies for interactive continuous media servers”, ACM/Springer Multimedia Systems, to appear.

  15. H.M. Vin, A. Goyal, A. Goyal, and P. Goyal, “An observation-based admission control algorithm for multimedia servers,” IEEE International Conference on Multimedia Computing and Systems, 1994, pp. 234–243.

  16. P.S. Yu, M.S. Chen, and D.D. Kandlur, “Grouped sweeping scheduling for DASD-based multimedia storage management,” ACM/Springer Multimedia Systems, Vol. 1, pp. 99–109, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hamidzadeh, B., To, TP.J. Prioritized Admission Strategies to Improve User-Perceived Performance in Interactive VOD Servers. Multimedia Tools and Applications 13, 5–34 (2001). https://doi.org/10.1023/A:1009610406858

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009610406858

Navigation