202

Design Schemes for MPLS Fast ReRoute

Olexandr Lemeshko1, Alla Romanyuk2, Helen Kozlova2
1. TCS Department, Kharkiv national university of radioelectronics, UKRAINE, Kharkiv, Lenina ave., 14, E-mail: avlem@ukr.net 2. Department N401, Kharkiv Air Force University named after Ivan Kozhedub, UKRAINE, Kharkiv, Sumska street, 77/79, E-mail: rainbow_kh@ukr.net

Abstract Design of schemes for MPLS Fast ReRoute is proposed in the paper. The scheme allows for the same flow calculate two types of paths: primary and backup. Depending on the parameters of the scheme it is possible to implement different schemes of reservation: link, node or path protection. In the course of solving the problem of MPLS Fast Reroute the classical metric of primary and backup paths is minimized. The nonlinear restrictions, which are responsible for prevention of node, link or path intersection of primary and backup routes is introduced in the structure of the scheme. Keywords scheme, MPLS, Fast ReRoute, QoS, protection.

k xij xk ji = 0; k K , i sk , d k ; j :(i , j )E j :( j ,i )E k xij xk (1) ji = 1; k K , i = sk ; j :(i , j )E j :( j ,i )E k xij xk ji = 1; k K , i = d k . j :(i , j )E j :( j ,i )E Condition of the communication channels overload prevention: (2) r k xijk ij ; (i, j) E ,

k K

I. INTRODUCTION
While solving technical problems of traffic management and ensuring quality of service more and more attention is given to the problems of fault-tolerant routing. Increasing the level of fault-tolerance of routing is necessarily accompanied by improving the quality of service in the network [1]. Fast ReRoute technology is used in MPLS network for implementing fault-tolerant routing. A high interest in this technology is proved by existence many of scientific works in this theme, for example [2]. An approach to solve the problem of IP/MPLS is proposed in this work based on developing the scheme which allows implementing different schemes of reservation: link, node or path protection.

and also conditions of realization of multipath routing strategy: k 0 xij 1. (3)

Conditions of realization of single path routing strategy: k xij {0;1}. (4)

Besides the model is added by conditions guaranteeing of quality of service assurance [3, 4] that is very important for multiservice networks. For calculating the backup route is necessary to calculate variables which characterizes the part of k-flow intensity, running in the link of backup route. The variables are also restricted by restrictions like (1)-(4). For preventing crossing the primary and the backup routes is necessary to perform the next conditions: if (i, j ) -link protection
k k xij xij = 0 ;

II. SCHEME FOR MPLS FAST REROUTE

Let the nodes of an m-node network be represented by the integers 1, 2, m , and let a link from node i to node j be represented by (i, j) . Let E = {(i, j ) : a link goes from i to j} be the set of links. For each link (i, j ) E its bandwith ij is typical, and with each traffic flow from the set K the subset is being confronted: r k , sk and d k intensity of k -th flow,
k source node and destination node respectively. Quantity xij is

(5)

if i-th node protection

k k xij xij i:(i , j )E

= 0;

(6)

if all path protection

(i , j )E

xijk xijk = 0 .

(7)

control variable, which characterizes the part of k -th flow intensity, running in the link (i, j ) E of primary path. For the purpose of prevention of network nodes overload it is necessary to meet the condition of flux conservation:

k k The calculation of variables xij and xij for solving task

MPLS Fast ReRoute is supposed by minimization of the following cost function: k k k k F= cij xij + cij xij , (8)
kK (i , j )E

cost of primary path

142 4 43 4

kK (i , j )E

cost of backup path

14 4 244 3

k k routing metric of primary path, cij routing where cij

metric of backup path. While implementing a single-path fault-tolerant routing, the problem (8) of optimizing with restrictions (1), (2), (4)-(7)

CADSM2013, 19-23 February, 2013, Polyana-Svalyava (Zakarpattya), UKRAINE

203 refers to the class of problems Mixed-Integer Nonlinear Programming (MINLP). While implementing a multipath reliable routing, when the restrictions (1)-(3), (5)-(7) are valid, this is already the problem of Nonlinear Programming (NLP). path like in example 2.The primary and backup routes do not contain shared nodes and links(apart from nodes source and destination).

IV. CONCLUSION
In the paper the design schemes for MPLS Fast ReRoute is proposed. The scheme allows for the same flow calculate two types of paths: primary and backup. Depending on the parameters of the scheme it is possible to implement different schemes of reservation: link, node or path protection. In the course of solving the problem of MPLS Fast Reroute the classical metric of primary and backup routes is minimized. The nonlinear restrictions, which are responsible for prevention of node, link or path intersection of primary and backup routes is introduced in the structure of the scheme. According to the strategy of multipath routing the problem of MPLS Fast Reroute is formulated as MINLP or NLP problem. The efficiency of proposed scheme while solving the problem of MPLS Fast Reroute for different models of reservation is represented in examples. Increasing the level of fault-tolerance while solving the problems of routing allows to improve indicators of quality of service in IP/MPLS network: throughput, delay, jitter etc. This scheme could be adapted for multilevel solving of problems of routing. [5].

III. EXAMPLES OF SOLVING PROBLEMS MPLS FAST REROUTE

Let us consider some examples of application alleged model while solving the problem of reliable routing in MPLSnetwork, which structure is presented on the figure 1. The network consists of 5 nodes (Label Switch Router, LSR) and 6 links, in which gaps indicates their bandwith. (1/). Source node LSR 1, destination node LSR 5. Intensity of flow equal 50 1/c. Let it network uses a single-path routing, routing k metric a minimum hops ( cij = 1 ).

Fig. 1. Example structure MPLS-network

Example 1. MPLS Fast ReRoute with link protection. Let (3,5)-link protection. Then path LSR1->LSR3->LSR5 (2 hops) will be calculated as a primary Label Switched Path (LSP), and path LSR1->LSR3->LSR4->LSR5 (3 hops) will be calculated as a backup route. The backup route does not contain (3,5)-link (fig. 2).

REFERENCES
[1] S. Alvarez, QoS for IP/MPLS Networks, Cisco Press, 2006, 336 p. [2] K. Xi, H. Jonathan Chao, IP fast reroute for double-link failure recovery, Proceeding GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications. 2009, pp. 10351042. [3] A.V. Lemeshko, Probabilistic-Temporal Model of QOS-Routing with Precomputation of Routes under the Terms of Non-Ideal Reliability of Telecommunication Network, Telecommunications and Radio Engineering, Vol. 66, Issue 13, 2007, pp. 1151-1166. [4] .V. Lemeshko, O.A. Drobot, Mathematical Model of Multipath QoS-based Routing in Multiservice Networks, Modern Problems of Radio Engineering, Telecommunications and Computer Science. Proceedings of conference International TCSET2006. Lviv-Slavsko. 2006, pp. 72-74. [5] O.V. Lemeshko, A.M. Hailan, A.S. Ali, A flow-based model of two-level routing in multiservice network, Modern Problems of Radio Engineering, Telecommunications and Computer Science. Proceedings of the international Conference TCSET2010, LvivSlavsko: Publishing House of Lviv Polytechnic, 2010, pp. 225.

Fig. 2. MPLS Fast ReRoute with (3,5)-link protection

Example 2. MPLS Fast ReRoute with node protection. Let 2-th node protection. Then the path LSR1->LSR3->LSR 5 (2 hops), will be calculated as a primary LSP and the path LSR1->LSR3->LSR4->LSR 5 (3 hops) as a backup route (fig. 3). The backup route does not contain 2-th node.

Fig. 3. MPLS Fast ReRoute with 2-th node protection

Example 3. MPLS Fast ReRoute with path protection. Let LSR1-LSR3-LSR5 path protection. Then path LSR1>LSR3->LSR4->LSR5 (3 hops), will be used as a backup

CADSM2013, 19-23 February, 2013, Polyana-Svalyava (Zakarpattya), UKRAINE