Close category search window
 

A Mathematical Model for the Admission Control Problem in MPLS Networks with End-to-End delay guarantees

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Harhira, H.A. ; Ecole Polytech. de Montreal, Montreal ; Pierre, Samuel

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

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.