Current admission controls that seek to optimise network utilisation create a bias against large-bandwidth calls. A buffer without preemption model is proposed that holds a call in a buffer rather than directly rejecting it when the residual bandwidth is insufficient. No other call can be admitted until this queued call is served. Such a mechanism increases the throughput since the buffer can temporarily hold a call. It also reduces the bias for large-bandwidth calls since all calls are rejected when the buffer is not empty, even when the residual bandwidth is sufficient for small-bandwidth calls. The proposed approach is compared with two alternative models, namely no buffer and buffer with preemption models and the performance of the models is analysed by solving a multi-dimensional Markov chain. Analytical and numerical results indicate that the proposed model achieves perfect fairness. A modified model, in which a waiting threshold is added to prevent an overlong wait for the queued call is also presented. Also, different thresholds for various bandwidth calls are set to maintain the optimal fairness. Analytical and numerical results demonstrate that this latter model actually achieves optimal fairness, even when perfect fairness cannot be achieved.
References
-
-
1)
-
Tran-Gia, T., Hubner, F.: `An analysis of trunk reservation and grade of service blancing mechanisms in multiservice broadband networks', Proc. IFIP Workshop TC6, Modeling and Performance Evaluation of ATM Technology, 1993, La Martinique, French West Indies, p. 2.1.
-
2)
-
Lindberger, K.: `Dimensioning and design methods for integrated ATM networks', Proc. 14th Int. Teletraffic Cong., 1994, p. 897–906.
-
3)
-
Roberts, J., Mocci, U., Virtamo, J.: `Broadband network teletraffic: performance evaluation and design of broadband multiservice networks', COST 242, Final report of Action, 1996.
-
4)
-
K. Biswas ,
R. Izmailov
.
Design of a fair bandwidth allocation policy for VBR traffic in ATM networks.
IEEE/ACM Trans. Netw.
,
2 ,
212 -
223
-
5)
-
E. Knightly ,
N. Shroff
.
Admission control for statistical QoS: theory and practice.
IEEE Netw.
,
2 ,
20 -
29
-
6)
-
Lai, Y.C., Tsai, S.F.: `A fair measurement-based admission control in heterogeneous environments', Presented at M2USIC’ 2000, October 2000, Malaysia.
-
7)
-
S. Jamin ,
P.B. Danzig ,
S.J. Shenker ,
L. Zhang
.
A measurement-based admission control algorithm for integrated service packet networks.
IEEE/ACM Trans. Netw.
,
1 ,
56 -
70
-
8)
-
Narayanan, L., Saintillan, Y.: `Fair and efficient call routing and admission control algorithms', Proc. IEEE Global Telecommunications’ 99, 1999, p. 1527–1534.
-
9)
-
R. Guerin ,
H. Ahmadi ,
M. Naghshineh
.
Equivalent capacity and its application to bandwidth allocation in high-speed networks.
IEEE J. Sel. Areas Commun.
,
968 -
981
-
10)
-
Z. Dziong ,
G. Mason
.
Fair-efficient call admission control policies for broadband networks–a game theoretic framework.
IEEE/ACM Trans. Netw.
,
1 ,
123 -
136
-
11)
-
Fodor, G., Nordstrom, E., Blaajerg, S.: `Revenue optimization and fairness control of priced guaranteed and best effort services on an ATM transmission link', Proc. ICC’98, 1998, p. 1696–1705.
-
12)
-
Jamin, S., Shenker, S.J., Danzig, P.B.: `Comparison of measurement-based admission control algorithms for controlled-load service', Proc. IEEE INFOCOM’97, 1997, 3, p. 973–980.
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-com_20040958
Related content
content/journals/10.1049/ip-com_20040958
pub_keyword,iet_inspecKeyword,pub_concept
6
6