Skip to main content
Log in

A shared buffer architecture for interactive VOD servers

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Video-on-demand (VOD) servers need to be efficiently designed in order to support a large number of users viewing the same or different videos at different rates. While considering a disk-array based VOD server, use of a shared buffer at the server end may be more economical than the sole use of dedicated buffers at each user's end. In this paper, we propose a simple buffer sharing architecture that may be used when disk-array based video servers are used. Our aim is to support the maximum number of users for a given number of video server disks while employing a simple scheme requiring less buffer space. The number of video segment retrievals that can occur within a certain time (the service round) is maximum when the scan disk scheduling algorithm is used. Consequently, we shall assume use of the scan algorithm for disk retrieval. The VOD server has a buffer manager that directs retrieved segments to appropriate buffer locations depending on their release and deadlines. The release and deadlines of segments are such that buffer requirement at the user's set-top box is minimized to two video segments while avoiding video starvation and buffer overflow at the user's end. We propose a novel scheme for the operation of the shared buffer that aims at increasing buffer utilization and decreasing cell loss due to buffer overflow. An ATM based broadband network is assumed and all segments are stored in buffers as fixed length ATM cells. We also use a novel scheme for grouping frames into segments and illustrate its advantages over earlier ones.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. M.-S. Chen, D.D. Kandlur and P.S. Yu, Optimization of the grouped sweeping scheduling (GSS) with heterogeneous multimedia streams, in: Proceedings of the ACM International Conference on Multimedia (1993) 235-242.

  2. M.-S. Chen, D.D. Kandlur and P.S. Yu, Storage and retrieval methods to support fully interactive playout in a disk-array-based video server, Multimedia Syst. 3 (1995) 126-135.

    Article  Google Scholar 

  3. S. Chowdhury and K. Sohraby, Alternative bandwidth allocation algorithms for packet video in ATM networks, in: Proc. of IEEE INFOCOM (1992) pp. 1061-1068.

  4. A.W. Drake, Fundamentals of Applied Probability Theory (McGraw Hill Company, 1967) pp. 109-112.

  5. M.W. Garrett and W. Willinger, Analysis, modeling and generation of self-similar VBR video traffic, in: Proc. of SIGCOMM (1994) pp. 269-280.

  6. T.L. Kunii, Y. Shinagawa, R.M. Paul, M.F. Khan and A.A. Khokar, Issues in storage and retrieval of multimedia data, Multimedia Syst. 3 (1995) 298-304.

    Article  Google Scholar 

  7. D.J. Makaroff and R.T. Ng, Schemes for implementing buffer sharing in continuous-media systems, Inform. Syst. 20(6) (1995) 445-464.

    Article  Google Scholar 

  8. P. Pancha and M. El Zarki, MPEG coding for variable bit rate video transmission, IEEE Comm. Magazine (May 1994) 54-66.

  9. A.L.N. Reddy and J.C. Wyllie, I/O issues in a multimedia system, IEEE Comput. (March 1994) 69-74.

  10. S. Sengodan and V.O.K. Li, A quasi-static retrieval scheme for interactive disk-array based video servers, ICCCN (October 1996) 3-8.

  11. S. Sengodan and V.O.K. Li, A generalized grouping and retrieval scheme for stored MPEG video, IEEE ICC (June 1997).

  12. S. Sengodan and V.O.K. Li, A discard-free grouping and retrieval scheme for stored MPEG video, submitted for publication.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sengodan, S., Li, V.O. A shared buffer architecture for interactive VOD servers. Cluster Computing 2, 93–103 (1999). https://doi.org/10.1023/A:1019002019576

Download citation

  • Issue Date:

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

Keywords

Navigation