Abstract

The Call Admission Control (CAC) method presented in this paper is based on the statistical properties of the network’s traffic variables. It probabilistically estimates the time until the release of a seized channel: the admission control depends on the computed mean remaining time averaged along all channels at a specific instant and on a time threshold. The policy produces a smooth transition between the QoS metrics, giving the operator the freedom to design the network at the desired QoS point. Another valuable property is that the algorithm is straightforward and fed only by simple teletraffic metrics: distribution and the first and second moments of Channel Holding Time (CHT). Simplicity is important for a CAC method because decisions for accepting or rejecting calls must be computed quickly and frequently.

Abstract

Introduction of modern and diverse applications in telecommunication field has raised challenges in networking area regarding efficient use of network resources and with optimizing performance. Therefore MPLS/GMPLS (Generalized multiprotocol label switching) networks were introduced to provide a better quality of service to meet users' requirements as well as to optimize network resources. GMPLS networks use traffic engineering techniques for more efficient communication within the network and help to optimize network resources. This paper proposes BAT inspired metaheuristic algorithm for selecting an efficient route in MPLS/ GMPLS networks. In our investigation we considered routing costs as an objective function with goal to minimize it. The paper uses BAT algorithm with various levels of loudness parameter. The simulation results show performance improvements in MPLS/GMPLS networks of different size. Document type: Conference object