Heuristic solution of MMKP in different distributed admission control and QoS adaptation architectures for video on demand service

This paper presents the application of multidimensional multiple-choice knapsack problem (MMKP) to admission control and QoS adaptation of multimedia sessions to maximize revenue from multimedia services for distributed video on demand service (DVoDS) over the Internet. We have discussed different distributed admission control and QoS adaptation architectures and their request handling policies. We have introduced the mapping of utility model-distributed (UM-D) by different admission controllers to the MMKP, a variant of the classical 0-1 knapsack problem. An exact solution of MMKP, an NP-hard problem, is not applicable for the online admission control problem in the VoD system. Therefore we have applied heuristics, IHEU and C-HEU for solving the MMKP for online real-time admission control and QoS adaptation. We present a qualitative analysis of the performance of these heuristics as well as greedy approach to solve admission control problems based on the worst-case complexity analysis and the experimental results from different sized data sets. The performance of different distributed admission control architectures applied in a simulated environment over a set of media server farm has been discussed detail using the experimental outcome