Optimal real-time admission control algorithms for the video-on-demand (VOD) service

Publisher Website
Google Scholar
Abstract
In order to meet the Quality-Of-Service (QOS) requirements of the VOD (Video-On-Demand) service, and, on the other hand, to maximize the system throughput (rev- enue), it is essential that the admission control algorithm be carefully designed. In this paper, two new types of ad- mission control schemes for the VOD service are proposed. They are the Enhanced Strict Admission Control (ESAC) and the Probabilistic Admission Control (PAC). In the ESAC schemes, we propose to use more statistics (of small amount and easily pre-calculated) than the peak frame size of the stored video information to strictly guarantee the QOS requirement and to achieve potentially much higher throughput. In the PAC schemes, we propose to use simi- lar statistics as used in the ESAC schemes to achieve even higher throughput at the cost of some small and control- lable likelihood of lost/overdue data. The admission con- trol problems are formulated as feasibility problems where different systems of simultaneous equations are considered. For each admission control scheme, if the corresponding sys- tem of simultaneous equations has a feasible solution, then admit the call request; otherwise, reject the call. Special structures of the systems are identified so as to facilitate the development of optimal real-time admission control al- gorithms. Efficient optimal algorithms are also proposed to calculate the minimal buffer requirement for a given per- formance objective.

This publication has 3 references indexed in Scilit: