A fair admission control for large-bandwidth multimedia applications

Abstract

Current admission controls aiming to maximize network utilization create a bias against large-bandwidth calls. This paper proposes a BNP (buffer without preemption) model which will hold a call in a buffer rather than directly reject it when the residual bandwidth is insufficient. No other call can be admitted until this queued call is served. Such a mechanism increases throughput because the buffer can temporarily hold a call, and reduces the bias for largebandwidth calls because all calls will be rejected when the buffer is not empty, even the residual bandwidth is enough for small-bandwidth calls. The novel is compared with other two alternative models, NB (no buffer) and BP (buffer with preemption), and the performance of the models is analyzed by solving a two-dimensional Markov chain. The analytical results indicate that the proposed model can achieve perfect fairness. Meanwhile, some numerical results confirm that the novel approach achieves higher fairness than the two competing models.