Skip to main content
SpringerLink
Log in

Efficient Movie Retrieval Strategies for Movie-on-Demand Multimedia Services on Distributed Networks

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

Abstract

In this paper, for a network-based multimedia Video/Movie-on-demand(VoD/MoD) service, we design and analyze efficient retrieval strategies to minimize both the access times of the movies and the block rates. We consider a heterogeneous set of servers and a generic network topology in which clients can request for movies from any site. We design and analyze a multiple servers retrieval strategy (MSRS) to retrieve the movies requested by the clients and present a rigorous analysis on its performance with respect to access times of the requested movies and the block rates. A generalized approach of MSRS is designed in a judicious manner using a two-step approach. In the first step, we partition the available bandwidth among the requested movies and in the second step, we derive optimal portions of the movies to be retrieved from each of the servers for each movie, based on allocated bandwidths in the first step. Thus, with the optimal playback portions of the movies using aggregate retrieval bandwidth from several servers, the access times of the movies are minimized. In the first step, in addition to the access times, we minimize the block rates by balancing the total accesses/requests among the servers. In generating the retrieval schedule, our scheme utilizes the available bandwidth (resource) among the servers and guarantees to use less buffer space than a single server retrieval strategy (SSRS). With this two-step approach, a complete flexibility is provided in tuning the access times of the movies and also shown to be robust to any variations in the user access rates of the movies, in reality. Rigorous simulation experiments are presented to observe the performance of MSRS with respect to some important system dependent parameters. Comparing with SSRS, MSRS shows better performance in the simulation.

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

Access this article

Log in via an institution

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. C.C. Aggarwal, J.L. Wolf, and P.S. Yu, “Design and analysis of permutation-based pyramid broadcasting,” Multimedia System, Vol. 7, pp. 439–448, 1999.

    Google Scholar 

  2. S.A. Barnett and G.J. Anido, “A cost comparison of distributed and centralized approaches to video-ondemand,” IEEE Journal on Selected Areas in Communications, Vol. 14, No. 6, 1996.

  3. P. Basu, R. Krishnan, and T.D.C. Little, “Optimal stream clustering problems in Video-on-Demand,” in Proc. Parallel and Distributed Computing and Systems, Las Vegas, NV, Oct. 1998.

  4. P. Basu, A. Narayanan, R. Krishnan, and T.D.C. Little, “An implementation of dynamic service aggregation for interactive video delivery,” in Proc. SPIE—Multimedia Computing and Networking, San Jose, CA, Jan. 1998.

  5. K.S. Candan, B. Prahakaran, and V.S. Subrahamanian, “Retrieval schedules based on resource availability and flexible presentation specifications,” Multimedia System, No. 6, pp. 232–250, 1998.

    Google Scholar 

  6. P. Chen, E. Lee, G. Gibson, R. Katz, and D. Patterson, “RAID: high-performance, reliable secondary storage,” ACM Comput. Surv., Vol. 26, No. 2, pp. 145–185, 1994.

    Google Scholar 

  7. A. Dan and D. Sitaram, “Multimedia caching strategies for heterogeneous application and server environments”, Multimedia Tools and Applications,Vol. 4, No. 3, 1997.

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

    Google Scholar 

  9. H. Fahmi, S. Baqai, A. Bashandy, and A. Ghafoor, “Dynamic resource allocation for multimedia document retrieval over high speed LANs,” Multimedia Tools and Applications, Vol. 8, No. 1, pp. 91–114, 1999.

    Google Scholar 

  10. D.J. Gemmell, H.M. Vin, D.D. Kandlur et al., “Multimedia storage servers: A tutorial,” IEEE Computer, pp. 40–49, May 1995.

  11. D. Ghose and H-J. Kim, “Scheduling video streams in video-on-demand systems: A survey,” Multimedia Tools and Applications, Vol. 11, pp. 167–195, 2000.

    Google Scholar 

  12. K.A. Hua and S. Sheu, “Skyscraper broadcasting: A new broadcasting scheme for metropolitan video-on-demand systems,” in Proceedings of the ACM SIGCOMM'97 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, Cannes France, Sep. 1997.

  13. R.H. Hwang and Y.C. Sun, “Optimal video placement for hierarchical video-on-demand systems,” IEEE Transactions on Broadcasting, Vol. 44, No. 4, 1998.

  14. D. Jadav, A.N. Choudhary, and P.B. Berra, “Techniques for increasing the stream capacity of a highperformance multimedia server,” IEEE Transactions on Knowledge and Data Engineering, Vol. 11, No. 2, 1999.

  15. X. Jiang and P. Mohapatra, “Stream scheduling algorithms for multimedia storage servers,” International Conference on Parallel Processing, Minneapolis, Aug. 1998.

  16. M.F. Khan, A. Ghafoor, and M.N. Ayyaz, “Design and evaluation of disk scheduling policies for high-demand multimedia servers,” ICDE 1999, pp. 592–599.

  17. R. Krishnan, D. Venkatesh, and T.D.C. Little, “A failure and overload tolerance mechanism for continuous media servers,” in Proc. ACM Multimedia, Seattle, WA, November 1997.

  18. S. Lau and J.C.S. Lui, “Scheduling and data layout policies for a near-line multimedia storage architecture,” Multimedia System, No. 5, pp. 310–323, 1997.

    Google Scholar 

  19. A. Leff, J. Wolf, and P.S. Yu, “Efficient LRU-based buffering in a LAN remote caching architecture,” IEEE Trans. Parallel and Distributed Systems, Vol. 7, No. 2, pp. 191–206, 1996.

    Google Scholar 

  20. P.W.K. Lie, J.C.S. Lui, and L. Golubchik, “Threshold-based dynamic replication in large-scale video-on-demand systems,” Multimedia Tools and Applications, Vol. 11, No. 1, pp. 35–62, 2000.

    Google Scholar 

  21. A. Merchant, Q. Ren, and B. Sengupta, “Hierarchical storage servers for video on demand: Feasibility, design and sizing,” in Proceedings of IEEE Globecom'96, London, UK, 18–22 Nov. 1996, pp. 272–278.

  22. T. Miyoshi and Y. Tanaka, “Optimal hierarchical structure of broadcast network,” Electronics and Communications in Japan, Part 1: Communications, Vol. 82, No. 2, 1999.

  23. H.H. Pang, B. Jose, and M.S. Krishnan, “Resource scheduling in a high-performance multimedia server,” IEEE Transactions on Knowledge and Data Engineering, Vol. 11, No. 2, 1999.

  24. B. Ping, B. Prabhakaran, and A. Srinivasan, “Retrieval scheduling for collaborative multimedia presentations,” To appear in ACM/Springer-Verlag Multimedia Systems, 2000.

  25. P.V. Rangan and H.M. Vin, “Efficient storage techniques for digital continuous media,” it IEEE Trans. on knowledge and data engineering, Vol. 5, No. 4, 1993.

  26. H. Shachnai and P.S. Yu, “The role of wait tolerance in effective batching: A paradigm for multimedia scheduling systems,” Research Report RC 20038, IBM T.J.Watson Research Center, Yorktown heights, NY, April 1995.

    Google Scholar 

  27. B. Veeravalli and G.D. Barlas, “Access time minimization for distributed multimedia applications,” Multimedia Tools and Applications, Kluwer Academic Publishers, Vol. 12, Nos. 2/3, pp. 235–256, 2000.

    Google Scholar 

  28. H.M. Vin, P. Goyal, A. Goyal, and A. Goyal, “Astatistical admission control algorithm for multimedia servers,” in Proceedings of the ACM Multimedia'94, San Francisco, Oct. 1994, pp. 33–40.

  29. H.M. Vin, A. Goyal, and P. Goyal, “Algorithms for designing large-scale multimedia servers,” Computer Communications, Vol. 18, No. 3, pp. 192–203, 1995.

    Google Scholar 

  30. VoD service provided by Media Corporation of Singapore in http: //one.mediacity.com.sg.

  31. S. Viswanathan and T. Imielinski, “Metropolitan area video-on-demand service using pyramid broadcasting,” Multimedia Systems, Vol. 4, pp. 197–208, 1996.

    Google Scholar 

  32. Y. Wang, J.C.L. Liu, D.H.C. Du, and J. Hsieh, “Efficient video file allocation schemes for video-on-demand services,” Multimedia System, No. 5, pp. 283–296, 1997.

    Google Scholar 

  33. J.L. Wolf, P.S. Yu, and H. Shachnai, “DASD dancing,” in Proceedings of ACM Sigmetrics Conference, May 1995, pp. 157–166.

  34. P.S. Yu, J.L. Wolf, and H. Shachnai, “Design and analysis of a look-ahead scheduling scheme to support pauseresume for video-on-demand applications,” ACMJournal of Multimedia Systems, Vol. 3, No. 4, pp. 137–150, 1995.

    Google Scholar 

Download references

Authors
  1. Li-gang Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Veeravalli
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C.C. Ko
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dong, Lg., Veeravalli, B. & Ko, C. Efficient Movie Retrieval Strategies for Movie-on-Demand Multimedia Services on Distributed Networks. Multimedia Tools and Applications 20, 99–133 (2003). https://doi.org/10.1023/A:1023654818590

Download citation

  • Issue Date:

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

Search

Navigation