Myeong Rai Cho

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 7, No. 10, pp. 3182-3194, Oct. 2000
10.3745/KIPSTE.2000.7.10.3182,   PDF Download:

Abstract

It is strongly believed that Video on Demand(VOD) will become one of the most promising services in Broadband Integrated Services Digital Network(B-ISDN) for the nest generation VOD service can be classified into two types of services 'Near VOD(NVOD) and Interactive VOD(IVOD). For both services, some video servers should be installed at some nodes(especially, at the root node for NVOD service) in the tree structured VOD network, so that each node with video server stores video programs and distributes stored programs to customers. We consider three kinds of costs·a program transmission cost, a program storage cost, and a video server installation cost. There exists a trade-off relationship among those three costs according to locations of video servers and the kinds of programs stored at each video server. 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 both IVOD and NVOD services is to determine where to install video servers for IVOD service, which and how many programs should be stored at each video server for both IVOD and NVOD services, so as to minimize the total cost which is the sum of three costs for both IVOD and NVOD services. In this paper 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.

Statistics
Cite this article