publication . Preprint . 2010

An algorithm for routing optimization in DiffServ-aware MPLS networks

Luigi Atzori; Fabio D'Andreagiovanni; Carlo Mannino; Tatiana Onali;
Open Access
  • Published: 01 Apr 2010
This paper addresses the constrained-based routing problem in DiffServaware MPLS networks. We consider a dynamic context in which new requests appear over time, asking for reconfigurations of the previous allocation. In the classical approach, a multi-phase heuristic procedure is adopted: the new requests are evaluated considering available bandwidth; if the bandwidth is not sufficient, preemption and rerouting of one or more connections are performed in sequence. As an alternative, we propose a single-phase approach that simultaneously takes into account both preemption and rerouting. In contrast with the standard approach, we always find an optimal solution wh...
free text keywords: DiffServ-aware MPLS networks, routing optimization, Multicommodity Flow Problem.
17 references, page 1 of 2

[1] D. Awduche, J. Malcolm, J. Agogbua, M. O'Dell and J. McManus, RFC 2702: Requirements for Tra c Engineering Over MPLS , RFC Editor, 1999.

[2] F. Le Faucheur, RFC 4124: Protocol Extensions for Support of Di servaware MPLS Tra c Engineering , 2005.

[3] K. Kar, M. Kodialam, T.V. Lakshman, Minimum Interference Routing with Application to MPLS Tra c Engineering , Proc. IEEE INFOCOM, vol. 2, pp. 884-893, Tel-Aviv, Israel, March 2000.

[4] A.B. Bagula, M. Botha, and A.E Krzesinski, Online Tra c Engineering: The Least Interference Optimization Algorithm, IEEE International Conference on Communications, 2004 [OpenAIRE]

[5] S. Suri, M. Waldvogel and P. Ramesh Warkhede Pro le-Based Routing: A New Framework for MPLS Tra c Engineering , Quality of Future Internet Services: Second COST 263 International Workshop, Qo s 2001, Proceedings, Coimbra, Portugal, 2001.

[6] A. Juttner, B. Szviatovszki, A. Szentesi, D. Orincsay, J. Harmatos Ondemand optimization of label switched paths in MPLS network, Computer Communications and Networks conference, 2000.

[7] J.C. de Oliveira, C. Scoglio, I.F. Akyildiz, and G. Uhl New Preemption Policies for Di Serv-Aware Tra c Engineering to Minimize Rerouting in MPLS Networks, IEEE/ACM Transactions on Networking, vol. 12, no. 4, 2004.

[8] D.O. Awduche, MPLS and Tra c Engineering in IP Networks , IEEE Communication Magazine, vol. 37, no. 12, 1999.

[9] A. Karaman, Constraint-Based Routing in Tra c Engineering , IEEE International Symposium on Computer Networks (ISCN'06), pp. 1-6, 2006. [OpenAIRE]

[10] G. R. Malan and F. Jahanian, An Extensible Probe Architecture for Network Protocol Performance Measurement, Proc. ACM SIGCOMM '98, 1998.

[11] D. Bertsimas, J.H. Tsitsiklis, Introduction to Linear Optimization, Athena Scienti cs, 1997.

[12] S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, W. Weiss. RFC2475: An Architecture for Di ferentiated Service, RFC Editor, 1998.

[13] W.J. Cook, W.H. Cunningham, W.R. Pulleyblank, A. Schrijver Combinatorial Optimization, John Wiley & Sons, 1998.

[14] W.M. Carlyle, J.O. Royset, R.K. Wood, Lagrangian Relaxation and Enumeration for Solving Constrained Shortest-Path Problems, Networks, Vol.52, No.4, pp. 256-270, 2008. [OpenAIRE]

[15] K. Holmberg, D. Yuan, A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation, INFORMS Journal of Computing, Vol.15, No.1, pp.42-57, 2003.

17 references, page 1 of 2
Any information missing or wrong?Report an Issue