Efficient admission control algorithms for multimedia servers

In this paper, we have proposed efficient admission control algorithms for multimedia storage servers that are providers of variable-bit-rate media st reams. The proposed schemes are based on a slicing technique and use aggres sive methods for admission control. We have developed two types of admissio n control schemes: Future-Max (FM) and Interval Estimation (IE). The FM alg orithm uses the maximum bandwidth requirement of the future to estimate the bandwidth requirement. The IE algorithm defines a class of admission contr ol schemes that use a combination of the maximum and average bandwidths wit hin each interval to estimate the bandwidth requirement of the interval. Th e performance evaluations done through simulations show that the server uti lization is improved by using the FM and IE algorithms. Furthermore, the qu ality of service is also improved by using the FM and IE algorithms. Severa l results depicting the trade-off between the implementation complexity, th e desired accuracy, the number of accepted requests, and the quality of ser vice are presented.