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.
Published in:
Computer Communications and Networks, 2007. ICCCN 2007. Proceedings of 16th International Conference on
Date of Conference: 13-16 Aug. 2007