Joint routing and admission control problem under statistical delay and jitter constraints in MPLS networks

Admission control algorithms are crucial for ensuring a near optimal resource allocation while guaranteeing the required Quality of Service (QoS) constraints. In this paper, a new routing and Admission Control mechanism in multi-protocol label switching (MPLS) based networks is proposed. The proposed mechanism relies on the packets' delay distributions that are empirically built on every link, to make adequate admission decisions. As a new connection request arrives, the admission control mechanism computes a feasible path, satisfying the connection's statistical QoS constraints (the maximum end-to-end delay, jitter and the QoS violation probability). For that, we formulate this problem as an Integer Linear Programming (ILP) model that is solved to optimality using the CPLEX mathematical programming tool for real-size networks. Simulation results show that the new admission control mechanism allows for low blocking rates while statistically satisfying the QoS constraints for both the new and the ongoing connections.

[1]  Tzi-cker Chiueh,et al.  Probabilistic delay guarantees using delay distribution measurement , 2004, MULTIMEDIA '04.

[2]  George D. Stamoulis,et al.  Application of the many sources asymptotic and effective bandwidths to traffic engineering , 1999, Telecommun. Syst..

[3]  Yuke Wang,et al.  A new traffic model and statistical admission control algorithm for providing QoS guarantees to on-line traffic , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[4]  Caterina M. Scoglio,et al.  A novel method for QoS provisioning with protection in GMPLS networks , 2006, Comput. Commun..

[5]  Sang-Ha Kim,et al.  Scalable Quasi‐Dynamic‐Provisioning‐Based Admission Control Mechanism in Differentiated Service Networks , 2004 .

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Marco Ajmone Marsan,et al.  An analytical framework for SLA admission control in a DiffServ domain , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[8]  Guy Pujolle,et al.  A new approach to dynamic bandwidth allocation in Quality of Service networks: Performance and bounds , 2007, Comput. Networks.

[9]  Samuel Pierre,et al.  A Mathematical Model for the Admission Control Problem in MPLS Networks with End-to-End delay guarantees , 2007, 2007 16th International Conference on Computer Communications and Networks.

[10]  H.T. Mouftah,et al.  Online distributed statistical-delay MBAC with QoS guarantees for VPLS connections , 2005, Proceedings of the 8th International Conference on Telecommunications, 2005. ConTEL 2005..

[11]  Yiwei Thomas Hou,et al.  A core stateless bandwidth broker architecture for scalable support of guaranteed services , 2004, IEEE Transactions on Parallel and Distributed Systems.

[12]  Wilbur B. Davenport.  Probability and Random Processes: An Introduction for Applied Scientists and Engineers , 1975 .

[13]  C. Casetti,et al.  A framework for admission control and path allocation in DiffServ networks , 2007, Comput. Networks.