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

Authors:
Hichem Ayed Harhira;Samuel Pierre
Affiliations:
Computer Engineering Department, Ecole Polytechnique de Montreal, CP. 6079 Succ. Centre Ville, Montreal, QC, Canada H3C 3A7;Computer Engineering Department, Ecole Polytechnique de Montreal, CP. 6079 Succ. Centre Ville, Montreal, QC, Canada H3C 3A7
Venue:
Computer Communications
Year:
2008

Citing 6
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Core Stateless Bandwidth Broker Architecture for Scalable Support of Guaranteed Services

IEEE Transactions on Parallel and Distributed Systems
Probabilistic delay guarantees using delay distribution measurement

Proceedings of the 12th annual ACM international conference on Multimedia
A framework for admission control and path allocation in DiffServ networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
A new approach to dynamic bandwidth allocation in Quality of Service networks: Performance and bounds

Computer Networks: The International Journal of Computer and Telecommunications Networking
A novel method for QoS provisioning with protection in GMPLS networks

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

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.