DocumentCode
2809613
Title
End-to-End Packet Loss Constrained Routing and Admission Control for MPLS Networks
Author
Oulai, Desire ; Chamberland, Steven ; Pierre, Samuel
Author_Institution
Ecole Polytech. de Montreal, Montreal
fYear
2007
fDate
22-26 April 2007
Firstpage
341
Lastpage
344
Abstract
Dynamic connection admission control (CAC) is an important mechanism to guarantee end-to-end quality of service (QoS) for specific Internet protocol (IP) traffic flows in multiprotocol label switching (MPLS) networks. Most of the solutions proposed in the literature target to satisfy the QoS constraints for the new request without considering them for the already admitted flows in the network. In this paper, we propose a joint routing and admission control mechanism for the IP traffic flows in MPLS networks. The solutions are obtained by solving exactly a mathematical programming model including end-to-end packet loss constraints for all traffic flows. Numerical results show that the model can be solved rapidly even for real-size instances of the problem.
Keywords
IP networks; mathematical programming; multiprotocol label switching; routing protocols; telecommunication congestion control; telecommunication traffic; IP traffic flows; Internet protocol traffic flows; MPLS networks; dynamic connection admission control; mathematical programming model; multiprotocol label switching networks; packet loss constrained routing; quality of service; Admission control; Communication system traffic control; IP networks; Mathematical programming; Multiprotocol label switching; Protocols; Quality of service; Routing; Traffic control; Web and internet services;
fLanguage
English
Publisher
ieee
Conference_Titel
Electrical and Computer Engineering, 2007. CCECE 2007. Canadian Conference on
Conference_Location
Vancouver, BC
ISSN
0840-7789
Print_ISBN
1-4244-1020-7
Electronic_ISBN
0840-7789
Type
conf
DOI
10.1109/CCECE.2007.91
Filename
4232750
Link To Document