Title :
A Mathematical Model for the Admission Control Problem in MPLS Networks with End-to-End delay guarantees
Author :
Harhira, Hichem Ayed ; Pierre, Samuel
Author_Institution :
Ecole Polytech. de Montreal, Montreal
Abstract :
Dynamic admission control is a very important mechanism that aims, not only to check resources availability, but also to verify QoS constraints satisfaction. In this paper, we propose a new admission control mechanism in MPLS-based packet-switched networks. This admission control mechanism satisfies delay constraints for all the network connections. The admission control mechanism is based on solving a mixed linear programming model which is shown NP-hard. As real instances are relatively small sized (20 to 30 nodes), an exact resolution using the CPLEX software suite can be done. Numerical results are then given and discussed.
Keywords :
communication complexity; delays; linear programming; multiprotocol label switching; quality of service; telecommunication congestion control; telecommunication network routing; MPLS network; NP-hard; QoS constraints satisfaction; dynamic admission control; dynamic routing; end-to-end delay guarantees; linear programming; mathematical model; mathematical programming; multiprotocol label switching; packet-switched network; quality of service; Admission control; Bandwidth; Communication system traffic control; Computer networks; Delay; IP networks; Mathematical model; Multiprotocol label switching; Quality of service; Traffic control; Admission control; Dynamic routing; MultiProtocol Label Switching (MPLS); Quality of Service (QoS); mathematical programming;
Conference_Titel :
Computer Communications and Networks, 2007. ICCCN 2007. Proceedings of 16th International Conference on
Conference_Location :
Honolulu, HI
Print_ISBN :
978-1-4244-1251-8
Electronic_ISBN :
1095-2055
DOI :
10.1109/ICCCN.2007.4317982
