Browse > Article

End-to-End Quality of Service Constrained Routing and Admission Control for MPLS Networks  

Oulai, Desire (Department of Computer and Software Engineering, Ecole Polytechnique de Montreal)
Chamberland, Steven (Department of Computer and Software Engineering, Ecole Polytechnique de Montreal)
Pierre, Samuel (Department of Computer and Software Engineering, Ecole Polytechnique de Montreal)
Publication Information
Abstract
Multiprotocol label switching (MPLS) networks require dynamic flow admission control to guarantee end-to-end quality of service (QoS) for each Internet protocol (IP) traffic flow. In this paper, we propose to tackle the joint routing and admission control problem for the IP traffic flows in MPLS networks without rerouting already admitted flows. We propose two mathematical programming models for this problem. The first model includes end-to-end delay constraints and the second one, end-to-end packet loss constraints. These end-to-end QoS constraints are imposed not only for the new traffic flow, but also for all already admitted flows in the network. The objective function of both models is to minimize the end-to-end delay for the new flow. Numerical results show that considering end-to-end delay (or packet loss) constraints for all flows has a small impact on the flow blocking rate. Moreover, we reduces significantly the mean end-to-end delay (or the mean packet loss rate) and the proposed approach is able to make its decision within 250 msec.
Keywords
Admission control mechanism; delay constraints; end-to-end QoS constraints; mathematical programming models; multiprotocol label switching (MPLS) networks; packet loss constraints; quality of service (QoS);
Citations & Related Records

Times Cited By Web Of Science : 0  (Related Records In Web of Science)
Times Cited By SCOPUS : 0
연도 인용수 순위
  • Reference
1 A. Capone, L. Fratta, and F. Martignon, "Dynamic routing of bandwidth guaranteed connections in MPLS networks," Int. J. Wireless and Optical Commun., vol. 1, no. 1, pp. 75-86, May 2003   DOI   ScienceOn
2 R. Widyono, "The design and evaluation of routing algorithms for realtime channels," University of California at Berkeley, Tech. Rep., ICSI TR 94-024, June 1994
3 X. Yuan, "Heuristic algorithms for multiconstrained quality-of-service routing," IEEE/ACM Trans. Netw., vol. 10, no. 2, pp. 244-256, Apr. 2002   DOI   ScienceOn
4 J. M. Jaffe, "AIgorithms for finding paths with multiple constraints," Netw., vol. 14, no. 1, pp. 95-116, Apr. 1983
5 D. Bertsekas and R. Gallager, Data networks. 2nd ed., Prentice-Hall, 1992
6 R. Braden, L, Zhang, S. Berson, S. Herzog, and S. Jamin, "Resource reservation protocol (RSVP) - Version 1 functional specification," IETF RFC 2205, Sept. 1997
7 M. R. Garey and D. S. Johnson, Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman, Co. New York, 1979
8 A. K. Parekh and R. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The multiple node case," IEEE/ACM Trans. Netw., vol. 2, no. 2, pp. 137-150, Apr. 1994   DOI   ScienceOn
9 Y. Cui, K. Xu, and J. Wu, "Precomputation for multiconstrained QoS routing in high-speed networks," in Proc. IEEE INFOCOM, Apr. 2003, vol. 2, pp. 1414-1424
10 A. B. Bagula, M. Botha, and A. E. Krzesinski, "Online tratìic engineering The least interference optimization algorithm," in Proc. IEEE ICC, June 2004, vol. 2, pp. 1232-1236
11 S. Khan, K. F. Li, E. G. Manning, R. Watson, and G. C. Shoja, "Optimal quality of service routing and admission control using the utility model," Future Generation Comput. Systems, vol. 19, no. 7, pp. 1063-1073, Oct. 2003   DOI   ScienceOn
12 Y. Cui, K. Xu, and J. Wu, "Multiconstrained end-to-end admission control in core-stateless networks," Comput. Science, vol. 3090, pp. 420-429, Feb 2004
13 D. S. Reeves and H. S. Salama, "A distributed algorithm for delayconstrained unicast routing," IEEE/ACM Trans. Netw., vol. 8, no. 2, pp 239-250, Apr. 2000   DOI   ScienceOn
14 ILOG, Inc., "Using the CPLEX callable library and CPLEX mixed integer library," ILOG, Inc., 2005
15 H. Uzunalioglu, D. J. Houck, and Y. T. Wang, "Call admission control for voice over IP," Int. J. Commun. Systems, vol. 19, no. 4, pp. 363-380, Apr 2006   DOI   ScienceOn
16 N. A. Ali, H. T. Mouftah, and S. Gazor, "Online distributed statisticaldelay MBAC with QoS guarantees for VPLS connections," Int. Conference on Telecom., June 2005, vol. 2, pp. 383-390
17 F. Kuipers, P. Van Mieghem, T. Korkmaz, and M. Krunz, "An overview of constraint-based path selection algorithms for QoS routing," IEEE Commun. Mag., vol. 40, no. 12, pp. 50-55, Dec. 2002   DOI   ScienceOn
18 E. N ordstrom and Z. Dziong, "CAC and routing for multi-service networks with blocked wide-band calls delayed, part1: Exact link MDP framework," Euro Trans. Telecom., vol. 17, no. 1, pp. 21-36, Jan. 2006   DOI   ScienceOn
19 M. S. Kodialam and T. V. Lakshman, "Minimum interference routing with applications to MPLS traffic engineering," in Proc. IEEE INFOCOM, Mar 2000, vol. 2, pp. 884-893
20 S. L. Spitler and D. C. Lee, "Optimal call admission control undεr packet and call level QoS constraints and effect of buffering," Int. J. Commun Systems, vol. 16, no. 7, pp. 647-662, May 2003   DOI   ScienceOn