Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 32128
A New Routing Algorithm: MIRAD

Authors: Amir Gholami Pastaki, Ali Reza Sahab, Seyed Mehdi Sadeghi


LSP routing is among the prominent issues in MPLS networks traffic engineering. The objective of this routing is to increase number of the accepted requests while guaranteeing the quality of service (QoS). Requested bandwidth is the most important QoS criterion that is considered in literatures, and a various number of heuristic algorithms have been presented with that regards. Many of these algorithms prevent flows through bottlenecks of the network in order to perform load balancing, which impedes optimum operation of the network. Here, a modern routing algorithm is proposed as MIRAD: having a little information of the network topology, links residual bandwidth, and any knowledge of the prospective requests it provides every request with a maximum bandwidth as well as minimum end-to-end delay via uniform load distribution across the network. Simulation results of the proposed algorithm show a better efficiency in comparison with similar algorithms.

Keywords: new generation networks, QoS, traffic engineering, MPLS, QoS based routing, LSP

Digital Object Identifier (DOI):

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1796


[1] A. Elwalid, S. H. L. C. Jin, and I. Widjaja, MATE: MPLS adaptive traffic engineering, INFOCOM, 2001.
[2] E. Rosen, A. Viswanathan and R. Callon, Multi-protocol label switching architecture, RFC 3031. 2001.
[3] Luc De Ghein, MPLS Fundamentals, First edition, Indianapolis, IN 46240 USA, 2007.
[4] M. Kodialam, T.V. Lakshman, Minimum interference routing with applications to MPLS traffic engineering, IEEE INFOCOM 2000, March 2000.
[5] D. Awduche, A. Chiu, A. Elwalid, I. Widjaja, and X. Xiao, "Overview and Principles of Internet Traffic Engineering", RFC 3272, May 2002.
[6] D.O. Awduche, L. Berger, D. Gan, T. Li, V. Srinivasan, G.Swallow, RSVP-TE: Extensions to RSVP for LSP tunnels,IETF RFC 3209, December 2001.
[7] R. Guerin, D. Williams, A. Orda, "oS routing Mechanisms and OSPF extensions", OBECOM, 1997.
[8] Kotti, A. Hamza, R. Bouleimen, K," Bandwidth Constrained Routing Algorithm for MPLS Traffic Engineering", Networking and Services, 2007. ICNS. Third International Conference on, 19-25 June 2007.
[9] Stiliadis, D. A. and Varma, "Latency-rate servers: A general model for analysis of traffic scheduling algorithms", Proceeding INFOCOM, San Francisco, CA, pp. 111-119, April 1996.
[10] Cruz, R. L., "A calculus for network delay, Part I: Network elements in isolation", IEEE Trans. Inform. Theory, Vol. 37, pp. 114-131, 1991.