Efficient admission control algorithms for multimedia servers |
| |
Authors: | Xiaoye Jiang Prasant Mohapatra |
| |
Affiliation: | (1) Department of Electrical and Computer Engineering, 201 Coover Hall, Iowa State University, Ames, IA 50011, USA; e-mail: prasant@iastate.edu , US |
| |
Abstract: | In this paper, we have proposed efficient admission control algorithms for multimedia storage servers that are providers
of variable-bit-rate media streams. The proposed schemes are based on a slicing technique and use aggressive methods for admission
control. We have developed two types of admission control schemes: Future-Max (FM) and Interval Estimation (IE). The FM algorithm uses the maximum bandwidth requirement of the future to estimate the bandwidth requirement. The IE
algorithm defines a class of admission control schemes that use a combination of the maximum and average bandwidths within
each interval to estimate the bandwidth requirement of the interval. The performance evaluations done through simulations
show that the server utilization is improved by using the FM and IE algorithms. Furthermore, the quality of service is also
improved by using the FM and IE algorithms. Several results depicting the trade-off between the implementation complexity,
the desired accuracy, the number of accepted requests, and the quality of service are presented. |
| |
Keywords: | :Admission control – Future-Max algorithm – Interval estimation algorithm – Multimedia storage server – Quality of service |
本文献已被 SpringerLink 等数据库收录! |
|