Abstract-We are proposing an efficient admission control policy for Video-on-Demand (VOD) system. Traditional Admission control system uses either threshold or resource capacity to accept or reject any incoming request. The distinction of the proposed scheme from the previous work includes: (1) a new concept of integrating the both schemes (shared resource admission control and class base admission control) into one system, is introduced (2) another new concept of Probability, is introduced to access the shared resource (Ports, Bandwidth). In the proposed system, total capacity of VOD server (ports) is partitioned equal to the number of classes plus shared area. When a request arrives at VOD server, it will be admitted if there is capacity to its corresponding partition, otherwise we will check the capacity of shared area and admit it with some probability. If there is no capacity in shared area or no probability, the request will be rejected. The evaluation of the proposed system is done by the simulation model. Numbers of blocked requests are calculated for performance measure. It is observed from the simulation results that proposed admission control policy not only improves the performance of high-priority classes but also reduces a lot the total number of rejected requests.
I. INTRODUCTIONVideo-on-Demand (VOD) system is an interactive TV technology that allows the subscribers to view programs in real time or download the programs and watch them later. A VOD system at the consumer level can consist of a standard TV receiver along with a set-top box. The services are delivered over the Internet to home computers, portable computers, high-end cellular telephone sets and advanced digital media devices.Customer can request any video any time from anywhere. In response to a request, VOD server will deliver high quality digitized video directly to the client set-top box. A large number of video requests arrive per hour but on the other hand, VOD server has limited capacity in terms of available connection ports or bandwidth. There should be an admission control policy to decide the admission or rejection of the incoming requests to maintain quality of service at the guarantied level. Incoming request is admitted on the basis of either available resources or nature of a request. generate more revenue. The proposed admission control and request handling policy utilized the resources more efficiently such that maximum of the requests should be admitted, and most of the resources are used all the time, and always have a capacity to admit the request of most popular programs. This paper is organized as follows. Related work is discussed in Section II, proposed admission control policy is illustrated in the Section III, simulation model, and results is given in Section IV, and conclusion is presented in Section V.
II. RELATED WORKThe author [1] describes different deterministic and predictive admission control polices. In this paper, author presented four admission control algorithms maximum, Adaptive maximum, average a...