Skip to main content
SpringerLink
Log in

An Efficient Scheduling Algorithm for Information Delivery on VoD System

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Minimizing transmission and storage cost for delivering video programs is an important aspect of video-on-demand (VoD) systems. Since the size of data is quite large, “caching” programs at cheap storage sites for future delivery can be very beneficial. In this paper, we propose a scheduling algorithm to aim directly on VoD systems under the metropolitan-area network. By mapping any delivery schedule into a connected path under a special weighted graph, the original scheduling problem can be reduced to the optimal Steiner tree problem. After analyzing the characteristics of the Steiner tree under the special graph, we introduce the concept of potential value and then formulate the cost of each Steiner tree as an equation of potential value. We can hence obtain the cost of each delivery schedule through calculating the corresponding equation of the potential value. Therefore, by comparing the cost of any possible Steiner tree, we can eventually find the optimal total cost for servicing all requests. Also, the time complexity of our algorithm is O(m 3 n 2), where m is the number of servers and n is the number of requests.

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. L. D. Giovanni, A. M. Langellotti, L. M. Patitucci, and L. Petrini. Dimensioning of hierarchical storage for video on demand services. IEEE ICC/SUPERCOM'94, Vancouver, pp. 1739–1743, 1994.

  2. S. A. Barnett and G. J. Anido. A cost comparison of distributed and centralized approaches to video-on-demand. IEEE J. Select. Areas Commun., 14:1173–1183, Aug. 1996.

    Google Scholar 

  3. F. Schaffa and J. P. Nussbaumer. On bandwidth and storage tradeoffs in mutimedia distribution networks. IEEE INFOCOM'95, 1020–1026, April 1995.

  4. J. P. Nussbaumer, B. V. Patel, F. Schaffa, and J. P. G. Sterbenz. Networking requirements for interactive video on demand. IEEE Journal on Selected Areas in Communications, 13(5), 1955.

  5. S.-H. G. Chan and F. A. Tobogi. Caching schemes for distributed video services. Proceedings of IEEE International Conference on Communication, Vancouver, pp. 994–999, June 1999.

  6. D. L. Eager, M. C. Ferris, and M. K. Vernon. Optimized regional caching for on-demand data delivery. Proceedings of SPIE Conference Multimedia Computing and Networking, pp. 301–316, January 1999.

  7. N. Venkatasubramanian and S. Ramanthan. Load management in distributed video servers. IEEE 17th International Conference on Distributed Computing Systems, Los Alamitos, Calif., pp. 528–535, 1997.

  8. C. C. Bisdikian and B. V. Patel. Issues on movie allocation in distributed video-on-demand systems. IEEE International Conference on Communication, Piscataway, pp. 250–255, 1995.

  9. IEEE Std 802.6. Distributed queue dual bus (DQDB) subnetwork of a metropolitan area network (MAN). 1991.

  10. P. Venkat Rangan. System for efficient delivery of multimedia information. US Patent Pending, San Diego, CA, January 1994.

    Google Scholar 

  11. C. H. Papadimitriou, S. Ramanathan, and P. Venkat Rangan. Information caching for delivery of personalized video programs on home entertainment channels. Proceedings of IEEE International Conference on Multimedia Computing and Systems, Boston, pp. 214–223, May 1994.

  12. C. H. Papadimitriou, S. Ramanathan, and P. Venkat Rangan. Optimal information delivery. Proceedings of ISAAC' 95, Cairns, Australia, pp. 181–187, December 1995.

  13. C. H. Papadimitriou, S. Ramanathan, P. Venkat Rangan, and S. Sampathkumar. Multimedia information caching for personalized video-on-demand. Computer Communications, 18:204–216, March 1995.

    Google Scholar 

  14. R. M. Karp. Reducibility among computational problems. Complexity of Computer Computations, 1972.

  15. E. Horowitz, S. Sahni, and S. Rajasekaran. Computer algorithms/C++. Computer Science Press, New York, 1996.

    Google Scholar 

Download references

Authors
  1. Singling Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hann-jang Ho
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wen-wei Mai
    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

Lee, S., Ho, Hj. & Mai, Ww. An Efficient Scheduling Algorithm for Information Delivery on VoD System. The Journal of Supercomputing 28, 27–41 (2004). https://doi.org/10.1023/B:SUPE.0000014801.65020.53

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:SUPE.0000014801.65020.53

Search

Navigation