A MINIMUM INTERFERENCE ANYCAST ROUTING FOR MPLS TRAFFIC ENGINEERING WITH END-TO-END DELAY AS QOS PARAMETER

Navjotpal Kaur
DepMARTment of CSE/IT, Lovely Professional University, Phagwara (Punjab), India npaljune10@gmail.com

Abstract
Anycast is a new service of IPv6. How to guarantee its quality of service(QoS) has become an important subject. A modified anycast QoS routing algorithm supporting traffic engineering(MART) in multiprotocol label switching(MPLS) networks is proposed. In order to select a QoS path for clients bandwidth request, information regarding the sourcedestination pairs is used to reduce the interference between current request and future requests. MART first assigns links weight associated with links residual capacity, servers load and interference on the links from anycast servers to the client. Then it gets the best path by using Dijkstra algorithm. MART uses constraint routing label distribution protocol(CR-LDP) to reserve bandwidth on label switching path(LSP). Simulations show MART can balance the load of MPLS networks, optimize network resource utilization of anycast, and reduce delay and data loss during servers data transfer. Keywords: Anycast Routing, Traffic Engineering, MPLS, QoS, MIRAD

switching of ATM technology. MPLS has some technological advantages, e.g., explicit routing, quality of service (QoS) routing, supporting Diffserv, TE and label, which can solve the problems about network congestion, QoS, virtual private network(VPN), multicast and so on to some extent. MPLS is considered the core technology of the next generation networks. The most important function of MPLS is TE, which can balance network load among the possible forwarding paths. TE in MPLS networks, not only supports the service like the second layer TE but also supports load balance and the use of nonequivalent path. 1.2Anycast Service Anycast is a new Internet service of IPv6. A client can use an anycast address to access the most appropriate server which is one of the servers supplying same services. Anycast has numerous potential applications such as video on demand, IP telephony and other multimedia real-time services, it is recognized as a very useful service. Routing for anycast service is very important, which decides usability and efficiency of the service directly. Guaranteeing QoS can improve network services and meet different requirements of applications. Anycast QoS Routing has become an important research subject. 1.3Minimum Interference Algorithm (MIRAD) Routing

1. Introduction
1.1MPLS Traffic Engineering Traffic engineering(TE) can optimize the utilization of network resources and traffic performance. It has become an indispensable function in the large autonomous systems because of the expensive network resources and the Internet fierce competition. Multi-protocol Label Switching (MPLS) has the flexibility of IP technology and the rapid

MIRAD is an algorithm designed to overcome the limitations of the previously proposed MIRA algorithm for minimum interference. It calls a link the critical link, the link which is requested

frequently. If there is a flow through this kind of link, the maximum flow of other ingress egress pairs is reduced. This reduction is called interference. It is always tried to reduce this interference. The magnitude of the interference is computed using the maximum transferred flow. Each label switched path with (s , d ,b) i i characteristic is routed using the
following objective function.

Where max flow(s, d) is the maximum transferable flow from node s to node d. A. End-to-End Delay

link in the path which holds maximum value of the residual bandwidth will be increase by one unit. Delay of the path will be computed once more, and then the same procedure will iterate until the desired value of delay achieved. If the goal is not fulfilled, it means that the links are operating full-capacity. In this case the link which has the minimum bandwidth is identified as bottleneck and will be dismissed. Again with the new configuration, the shortest path will be selected and the delay computation will be performed. This procedure will continue until the desired path is obtained or the request is rejected.

According to LR server equation, end-to-end delay is the summation of all delays of the links in the path. For a typical path P, magnitude of end-to-end delay, Dm is computed as follow:

Where r is the request rate, t is maximum rate, b is volcanic rate, M is the maximum length of packet, is the maximum length of the label paths passage link (i,j). Cij is the link capacity. propij is the delay of link (i,j), R is the minimum bandwidth allocated to LSP. Accordingly, the first term identifies wave shaping delay in ingress nodes and the second indentifies the amount of delay in the buffer queue of the path nodes and their propagation delay. Propagation delay is a physical characteristic of a link.
B. MIRAD Algorithm

1.4Anycast Routing Supporting TE With the sharp increasing of the Internet service type and traffic, anycast services such as IP telephony, streaming media need to ensure realtime. Based on MIRAD[6] and MPLS LSP, we propose an anycast QoS routing algorithm supporting TE with end-toend delay as an important parameter (MART), which assigns links weight associated with link residual capacity, interference and server load. Then it gets best path by Dijkstra algorithm using the link weight as parameter. MART can balance network load effectively, guaranteed bandwidth & end-to-end delay, and optimize the use of network resources.

Here, acuteness of critical ingress and egress links is obtained using MIRA algorithm in between inputs and outputs. Then, upper limit of the delay in the path is computed with (1). Should the computed value is greater than the desired one, the bandwidth of the

2. Algorithm Description
2.1 Problem Description
The network can be described as a graph: G = (V, E), where, V= {v1,v2,,vj}, it is the limited set of network nodes; E = (e1, e2,, en) is the set of links; B(e) is the reserved bandwidth of each link. G (S) =

(s1, s2,, sf), it is a group of source nodes that have request for routing, G(S) _V and f<n; G(T)={t1,t2, ,tq} is a group of destination nodes which provide the same service for source nodes, say, it is a group of anycast servers with the same anycast address, G(T) _V and q < n. _t G(T), _Lt , 0_ Lt_1, Lt is the load of the anycast server t,Lm is the minimum load and Ld is load deference threshold. The algorithm will select the server whose load is not too

heavy, rather than select the server with minimum load. Because the server with minimum load maybe is too far from the source, leading longer delay and waste of network resources. The algorithm aims at selecting a server which is near the client and its load is not too heavy [2, 3]. Server load can be measured by a specific procedure, the basic formula is as Eq. (3): L=R1I+R2C+R3D+R4M+R5N (3)

(4)

Where, R1, R2, R3, R4 and R5 is the adjustment factors, I is input indicators about the number of connections , C is CPU load, D is disk usage, M is memory usage, N is the number of current processes. Assessment and measurement of different services will be different. If a request can be expressed as: R=(S, T, Rb), where, S is the source node, T is a group of the destination nodes providing services, Rb is the bandwidth parameter. Selecting a path P with constrains can be expressed as: Lt -Lm _ Ld; B(P) _ Rb MPLS uses label request and label mapping as the main messages in constraint routing-label distribution protocol (CR-LDP). Some parameters for TE can be added into these messages, a MPLS explicit routing label switching path(ER-LSP) can be established dynamically based on some demands such as traffic attributes and QoS. Then the algorithm can reserve resources on the LSP and implement TE. 2.2Avoid Interference MART uses MIRAD to avoid interference. When MART selects a LSP for current request, interference is considered between request of current SD pair and future requests of other SD pairs on links. The LSP chose for the request must reduce interference & endto-end delay as much as possible [7]. The critical link in the algorithm means the current request of a SD has interference with future requests of other SD pairs. In addition, the algorithm also takes into account the impact of interference among servers. So MART chooses the smallest interference path which can meet the request of anycast services flow & iteratively calculates the end-to-end delay for it until the desired value is reached. The smallest interference path is defined as meeting bandwidth request and having smallest interference to future requests of other SD pairs. The interference degree for links weight is defined as Eq. (4):

CP is d is the ith critical path of (s, d); is 'd' means the important level of CP is d; is 'd' is positive when the link have interference with other links; otherwise, is'd' is zero; K is the total number of CPs between SDs.

2.3 Algorithm Steps of MART

MART sets initial weight of links which is a inverse function of the links remaining bandwidth, then it takes pruning and uses Dijkstra algorithm to select K shortest paths which meet the bandwidth requirements to target the critical paths, measures the interference degree of links considering the impact of server load; assigns links weight again according to the their initial weight and interference degree; iteratively calculates end-to-end delay, atlast; MART gets a LSP from server to client by using the final links weight, Dijkstra algorithm and CR-LDP, and reserves resources.

3. Simulation
3.1Simulation Network Topology The simulation environment was established by using NS2(network simulator, version 2). We extended the LinkState module in NS2 to support QoS, integrated LinkState module and MPLS module. We got the simulation results of MART and compared the performances with other algorithms not considered minimum interference and TE. The simulation network topology is as Figure 1, which includes 15 nodes, 19 duplexing links. The number on a link such as 1.5, 2.5 or 3 is link bandwidth. Server node 11, 12, 13 and 14 are members of an anycast group, they have the same anycast address in a MPLS network. Node 1 to node 10 are MPLS nodes. Node 0 is the source node or client which sends an anycast request with a certain bandwidth.

3.2 Simulation Process In the simulation, the load threshold deference pd was set to 0.5; was set to 2; was set to 0.5. K was the number of critical paths between node pairs, its initial value was 4 in the simulation. Three algorithms were simulated, they were MART, ART which supports minimum interference routing, & ARQM which is an anycast QoS routing algorithm in MPLS networks [8]. Neither ARQM nor ART uses the thought of end-to-end delay as a QOS parameter. There were 10 data flows sent by node 0, the first started at 1.0 second, ended at 6.0 second. It required an anycast service every 0.4 seconds. The required bandwidth was 300kbit/s.

3.2Analysis on Simulation Results From Figure 2, the delay from server to client of MART was the smallest because it could guarantee QoS by considering end-to-end delay calculation as an important step. By using MART, all of 10 data flows could find the path met the bandwidth request. From Figure 3, the loss rate performance of MART was better than ART and ARQM. We could find that MART met the requirement of each traffic flow, so, loss rate of MART was almost 0. From Figure 4, we can find that MART could balance server load whose variance could maintain about 50, but the load variance of ARQM and ART became so big when network load increased that the server load became very unbalanced. In the all, MART had good performance in delay, packet loss, server load balance, network load balance, and other properties.

4. Conclusion
In anycast services, usually, in, some of the links from the server to client has been close to capacity constraints, while the others are almost idle; some nodes are congested , while the other nodes almost have no traffic. As result, it declines the performance of the network, and waste network physical resources. TE will solve these problems. MART uses the information of the source-destination pairs to reduce interference between current request and future requests when selecting a QoS path with desired end-to-end delay for clients request. The simulation results indicate that MART can improve network performance, guarantee bandwidth, ensure desired end-to-end delay, increase the utilization of network resources and implement traffic engineering.

5. REFERENCES
[1] Winter, Rolf, The Coming Age of MPLS, IEEE 2011 [2] Zhang Li, Jia Weijia,Yan Wei, et al. An anycast routing algorithm supporing QoS for service data [J]. Acta Electronica Sinica, 2004, 32(12): 2046-2050. [3] Zhang Li, Jia Weijia, Yan Wei, et al. Anycast routing algorithm special composite distance[J].Journal of computer Research and Development, 2005,42(1): 252-258. [4] M. Kodialam, T.V. Lakshman, Minimum interference routing with applications to MPLS traffic engineering, IEEE INFOCOM 2000, March 2000. [5] Ling Song, Feng Chen, et al. A Minimum interference anycast QOS routing for MPLS traffic engineering, China Mobile Group Guangxi Company, Nanning, China, 2009 [6] Amir Gholami Pastaki, et al. A New Routing Algorithm: MIRAD, World Academy of Science, Engineering and Technology 79 2011 [7] Zheng Zhimei, Cui Yong. A least interference path algorithm for MPLS traffic engineering[J]. Chinese Journal of Computers, 2007 [8] Chen Feng, Song Ling, Ma Qiang. Anycast QoS routing algorithm based on MPLS networks[J]. Computer Engineering, 2008