Traffic savings through a CAC procedure incorporating a fair bandwidth allocation policy for elastic services
Traffic savings through a CAC procedure incorporating a fair bandwidth allocation policy for elastic services
Author(s): M. D. Logothetis, Ioannis D. Moscholios, George K KokkinakisSubject(s): Methodology and research technology, ICT Information and Communications Technologies
Published by: Žilinská univerzita v Žilině
Keywords: bandwidth allocation; max-min fairness; elastic traffic; call blocking probability;
Summary/Abstract: 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
Journal: Komunikácie - vedecké listy Žilinskej univerzity v Žiline
- Issue Year: 6/2004
- Issue No: 4
- Page Range: 13-16
- Page Count: 4
- Language: English
