Routing and admission control with multiconstrained end-to-end quality of service in MPLS networks

Authors:
Desire Oulai;Steven Chamberland;Samuel Pierre
Affiliations:
Department of Computer Engineering, ícole Polytechnique de Montréal, C.P. 6079, Succ. Centre-Ville, Montréal, Que., Canada H3C 3A7;Department of Computer Engineering, ícole Polytechnique de Montréal, C.P. 6079, Succ. Centre-Ville, Montréal, Que., Canada H3C 3A7;Department of Computer Engineering, ícole Polytechnique de Montréal, C.P. 6079, Succ. Centre-Ville, Montréal, Que., Canada H3C 3A7
Venue:
Computer Communications
Year:
2008

Citing 8
Cited 0

Data networks

Data networks
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
A distributed algorithm for delay-constrained unicast routing

IEEE/ACM Transactions on Networking (TON)
Heuristic algorithms for multiconstrained quality-of-service routing

IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Optimal quality of service routing and admission control using the utility model

Future Generation Computer Systems - Selected papers on theoretical and computational aspects of structural dynamical systems in linear algebra and control
Call admission control for voice over IP: Research Articles

International Journal of Communication Systems - Voice Over IP–Theory and Practice
An overview of constraint-based path selection algorithms for QoS routing

IEEE Communications Magazine

Quantified Score

Hi-index	0.24

Visualization

Abstract

Multiprotocol label switching (MPLS) networks require dynamic flow admission control to guarantee end-to-end quality of service (QoS) for each Internet protocol (IP) traffic flow. In this paper, we propose to tackle the joint routing and admission control problem for the IP traffic flows in MPLS networks with multiconstrained end-to-end QoS. We propose a mathematical programming model for this problem that includes end-to-end delay and packet loss constraints. These constraints are imposed not only for the new traffic flow, but also for all already admitted flows in the network. Three objective functions are proposed and analyzed: the end-to-end delay, the end-to-end packet loss and the cost of the path used by the new flow. Numerical results show that considering end-to-end delay and packet loss constraints for all flows has a small impact on the flow blocking rate, but improves significantly the end-to-end QoS parameters. Moreover, the proposed approach is able to make the decision to admit or not a new flow in less than 270ms of computational time.