Using an effective algorithm to resolve the video-on-demand service network resource allocation problem

Video-on-demand (VOD) can broadly be categorized into two groups, namely Interactive VOD (IVOD) and near VOD (NVOD). This paper examines the resource allocation problems in a VOD network which provides a mixture of IVOD and NVOD services (RAPINVOD). The RAPINVOD problem is to determine where to install VSs for IVOD services, taking into consideration customers' demand and which programs should be stored at each VS for both IVOD and NVOD services so that the total operating costs can be minimized. The paper addresses the RAPINVOD issue by using an effective dynamic programming algorithm which extends the key idea of the earlier dynamic programming for solving the resource allocation problem in a IVOD service.