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

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

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

Full text

Pdf (270 KB)

Source

International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems archive
Proceedings of the 2nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks table of contents

Chania, Crete Island, Greece

SESSION: Performance evaluation table of contents

Pages: 45 - 49

Year of Publication: 2007

ISBN:978-1-59593-805-3

Authors

Hichem Ayed Harhira	Ecole Polytechnique of Montreal, Montreal, PQ, Canada
Samuel Pierre	Ecole Polytechnique of Montreal, Montreal, PQ, Canada

Sponsors

ACM: Association for Computing Machinery
SIGSIM: ACM Special Interest Group on Simulation and Modeling

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 33, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1298275.1298284 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	D. Oulai, S. Chamberland and S. Pierre, End-to-End delay constrained routing and admission control for MPLS networks, IEEE Communication Letters, Vol. 11, No. 2, February 2007, pp: 216--218.
	2	Kartik Gopalan , Tzi-cker Chiueh , Yow-Jian Lin, Probabilistic delay guarantees using delay distribution measurement, Proceedings of the 12th annual ACM international conference on Multimedia, October 10-16, 2004, New York, NY, USA [doi>10.1145/1027527.1027734]
	3	L. Qian, A. Krishnamurthy, Y. Wang, Y. Tang, P. Dauchy and A. Conte, A New Traffic Model and Statistical Admission Control Algorithm for Providing QoS Guarantees to On-Line Traffic, IEEE Globecom 2004, Dallas, pp: 1401--1405.
	4	W. Rhee, J. Lee, J. Yu and S. Kim, Scalable Quasi-Dynamic-Provisionning-Based Admission Control Mechanism in Differentiated Service Networks, ETRI journal, Vol. 26, No. 1, February 2004.
	5	N. Abu Ali, H. T. Muftah and S. Gazor, Online Distributed Statistical Delay MBAC with QoS Guaranteed for VPLS Connections, 8th International Conference on Telecommunications. CONTel 2005, Zagreb, pp:383--390.
	6	C. Courcoubetis, V. A. Siris and G. D. Stamoulis, Application of the many sources asymptotic and effective bandwidths to traffic engineering, Telecommun. Syst. Modeling, Anal., Des. Manage. vol. 12, No. 2-3, 1999, pp. 167--191.
	7	Michael R. Garey , David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, 1979
	8	ILOG, Inc., Using the CPLEX Callable Library and CPLEX Mixed Integer Library, ILOG, Inc., 2005.
	9	George Apostolopoulos , Roch Guérin , Sanjay Kamat , Satish K. Tripathi, Quality of service based routing: a performance perspective, Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication, p.17-28, August 31-September 04, 1998, Vancouver, British Columbia, Canada
	10	Ashwin Sridharan , Roch Guérin , Christophe Diot, Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks, IEEE/ACM Transactions on Networking (TON), v.13 n.2, p.234-247, April 2005 [doi>10.1109/TNET.2005.845549]