A DYNAMIC PROGRAMMING MODEL FOR NETWORK SERVICE SCHEDULING

Jesuk Ko

2006

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.

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