Traffic savings through a cac procedure incorporating a fair bandwidth allocation policy for elastic services

Communications

Ioannis D. Moscholios¹  George K. Kokkinakis¹  Michael D. Logothetis¹ 

[1] Wire Communications Laboratory, Department of Electrical & Computer Engineering, University of Patras, Greece;

关键词: bandwidth allocation;    max-min fairness;    elastic traffic;    call blocking probability;   

DOI  :  10.26552/com.C.2004.4.13-16

来源: DOAJ

【 摘 要 】

We apply the max-min fairness policy (MMF) for elastic services with min and max bandwidth requirements (approximated MMF) not to a single link but to a whole connection-oriented network. To achieve it we propose a Call Admission Control (CAC) procedure consisting of several scenarios dependent on the number of paths between the origin-destination (O-D) network nodes. We evaluate the global network performance at the call level by comparing the maximum Call Blocking Probability (CBP) of the proposed scheme with that of a no fair bandwidth allocation policy scheme. Simulation results show significant traffic savings in the case of the approximated MMF policy.

【 授权许可】

Unknown