A DYNAMIC PROGRAMMING MODEL FOR NETWORK SERVICE SCHEDULING

Jesuk Ko

Abstract

Video on Demand (VOD) is one of the most promising services in Broadband Integrated Services Digital Network (B-ISDN) for the next generation. VOD can be classified into two types of services: Near VOD (NVOD) and Interactive VOD (IVOD). For either service, some video servers should be installed at some nodes in the tree structured VOD network, so that each node with a video server stores video programs and distributes stored programs to customers. Given a tree-structured VOD network and the total number of programs being served in the network, the resource allocation problem in a VOD network providing a mixture of IVOD and NVOD services is to determine where to install video servers for IVOD service and both IVOD and NVOD services. In this study we develop an efficient dynamic programming algorithm for solving the problem. We also implement the algorithm based on a service policy assumed in this paper.

References

  1. Brubeck, D.W., 1996. Hierarchical storage management in distributed VOD system. IEEE Multimedia. 3, 37-47.
  2. Fu, X., Sun, J., and Cai, A., 2000. Scheduling of hierarchical storage in distributed VOD systems. Journal-China Institute of Communications. 21, 64-69.
  3. Gelman, A.D. and Halfin, S., 1999. Analysis of resource sharing in information providing services. IEEE GLOBECOM'99, 312-316.
  4. Giovanni, L.De., Langellotti, A.M., Patitucci, L.M., and Petrini, L., 1994. Dimensioning of hierarchical storage for video on demand services. IEEE ICC'94, 1739- 1743.
  5. Hessenmuller, H., 1994. The use of large CATV networks as an infrastructure for interactive video services. Australian Telecommunication Networks & Applications Conference, 69-74.
  6. Hodge, W., Mabon, S., and Jone T. Powers, Jr., 1998. Video on demand: architecture, systems, and applications. SMPTE Journal, 791-803.
  7. Hodge, W. and Milligan, C., 1994. True video on demand vs. near video on demand, statistical modeling, cost & performance trade-offs. NCTA Technical Paper, 157- 172.
  8. IGI Consulting, 2000. Video dialtone & video on demand. VDT 2000, 3.
  9. Ishihara, T., Tanaka, J., Nakajima, I., Okuda, M., and Yamashita, H., 1996. Modeling and evaluation of broadband access networks for multimedia services. IEEE GLOBECOM'96, 117-125.
  10. Jun, S.B. and Lee, W.S., 1998. Video allocation methods in a multi-level server for large-scale VOD services. IEEE Transactions on Consumer Electronics. 44, 1309-1318.
  11. Kim, Y.G., Cho, M.R., and Kim, J.Y., 1996. Storage allocation in multi-level VOD network using dynamic programming. IE Interfaces. 9(3), 202-213.
  12. Schaffa, F. and Nussbaumer, J-P., 1995. On bandwidth and storage tradeoffs in multimedia distribution networks. IEEE INFOCOM'95, 1020-1026.
  13. Petit, G.H., Deloddere, D., and Verbiest, W., 1998. Bandwidth resource optimization in video-on-demand network architectures. IEEE GLOBECOM'98, 91-97.
  14. Sinkoskie, W.D., 1991. System architecture for a large scale video on demand service. Computer Networks and ISDN Systems. 22, 155-162.
  15. Sincoskie, W.D., 1997. Video on demand: is it feasible?. IEEE GLOBECOM'97, 201-205.
Download


Paper Citation


in Harvard Style

Ko J. (2006). A DYNAMIC PROGRAMMING MODEL FOR NETWORK SERVICE SCHEDULING . In Proceedings of the Third International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-972-8865-59-7, pages 47-53. DOI: 10.5220/0001199000470053


in Bibtex Style

@conference{icinco06,
author={Jesuk Ko},
title={A DYNAMIC PROGRAMMING MODEL FOR NETWORK SERVICE SCHEDULING},
booktitle={Proceedings of the Third International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2006},
pages={47-53},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001199000470053},
isbn={978-972-8865-59-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Third International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - A DYNAMIC PROGRAMMING MODEL FOR NETWORK SERVICE SCHEDULING
SN - 978-972-8865-59-7
AU - Ko J.
PY - 2006
SP - 47
EP - 53
DO - 10.5220/0001199000470053