Multi-path dynamic admission control in mpls networks with end-to-end delay guarantees

Authors:
Hichem Ayed Harhira;Samuel Pierre
Affiliations:
Ecole Polytechnique of Montreal, Montreal, PQ, Canada;Ecole Polytechnique of Montreal, Montreal, PQ, Canada
Venue:
Proceedings of the 2nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Year:
2007

Citing 4
Cited 0

Quality of service based routing: a performance perspective

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Probabilistic delay guarantees using delay distribution measurement

Proceedings of the 12th annual ACM international conference on Multimedia
Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Quality of Service (QoS) is more and more becoming a necessity for emerging applications carried by IP networks. Thus, dynamic admission control is a very important mechanism that aims, not onlyto ensure resources availability, but also to verify QoS constraints satisfaction. In this paper, we propose a novel admission control mechanism in MPLS-based packet-switched networks satisfying delay constraints for all the network connections. The admission control mechanism is based on solving an Integer Linear Programming model. Numerical results show that the proposed model can be solved to optimality in reasonable computation times while obtaining low blocking rates and interesting link's usage distributions.