Online Traffic Engineering using Least Interference Optimization

Size: px
Start display at page:

Download "Online Traffic Engineering using Least Interference Optimization"

Transcription

1 Online Traffic Engineering using Least Interference Optimization A.B Bagula, M. Botha, and A.E Krzesinski Department of Computer Science University of Stellenbosch, 7 Stellenbosch, South Africa Tel: Fax: bagula@cs.sun.ac.za Abstract Flow-based routing algorithms have recently been proposed where the online routing process uses a priori knowledge of the ingress-egress pairs and an estimation of the traffic profile to reduce LSP rejection in MPLS networks. This paper presents a new routing scheme referred to as Least Interference Optimization (LIO) where the online routing process uses the current bandwidth availability and the traffic flow distribution to achieve traffic engineering in IP networks. A Least Interference Optimization Algorithm (LIOA) is presented which balances the number and quantity of flows carried by a link to achieve efficient routing of MPLS bandwidth-guaranteed label-switched paths (LSPs). Preliminary simulation results show that LIOA outperforms several widely known routing algorithms including the Minimum Hop Algorithm (MHA), Shortest Path First (SPF), Constraint Shortest Path First (CSPF) and Minimum Interference Routing Algorithm (MIRA) on several performance parameters including (1) the LSP rejection and (2) the ease of implementation. Index Terms Traffic engineering, online routing, MHA, SPF, CSPF, MIRA, LIOA. I. INTRODUCTION Traffic engineering (TE) is a network management technique which improves the use and efficiency of a network by explicitly steering the traffic through a routed or switched network to achieve performance goals such as delay minimization, throughput maximization, etc. The routing algorithms currently deployed in the Internet and the extensions proposed to adapt these algorithms for traffic engineering include the widely deployed Shortest Path First (SPF) and Constraint Shortest Path First (CSPF). SPF, the most widely used algorithm for intra-domain routing, uses by default a static model where traffic is routed based on link costs which are inversely proportional to the link capacity as proposed by Cisco. This static routing model may lead to unbalanced network loading by assigning bandwidth requests to overloaded portions of a network while leaving other parts of the network under-utilized. This work is supported by grant numbers and 2677 from the South African National Research Foundation, Siemens Telecommunications and Telkom SA Limited. One of the authors acknowledges a bursary from the Department of Labour (DoL). Opinions expressed and conclusions arrived at are those of the author and are not necessarily to be attributed to the DoL. CSPF was proposed as an algorithm which solves the problem of load balancing of SPF by using link costs which reflect the current resource availability. These include costs which are inversely proportional to the residual link capacities. However both SPF and CSPF are poorly equipped for traffic engineering support under heavy load conditions [1]. Multiprotocol Label Switching (MPLS) enables the construction of a connection-oriented network over the connectionless IP network using bandwidth guaranteed tunnels called Label Switched Paths (LSPs). The Minimum Interference Routing Algorithm (MIRA) [2] was proposed in the context of MPLS networks as a flow-based routing algorithm which sets up LSPs using knowledge of the ingress-egress pairs to prevent the creation of bottlenecks for flows in a network, thus reducing the rejection rate of LSP requests between a specified subset of ingress-egress pairs. However, MIRA causes additional routing complexity which does not necessarily translate into equivalent performance gains. This paper presents a Least Interference Optimization Algorithm (LIOA) for setting up bandwidth-guaranteed tunnels in MPLS networks. The main contributions of this paper are Cost-based route optimization. We present an online method for finding optimal routes using a link cost metric which reduces the interference among competing flows by reducing the numbers and magnitudes of the flows carried on the links. Our routing algorithm has the same complexity as classical routing algorithms such as Breadth First Search and Dijkstra s algorithm. Performance improvement. Our routing model is easy to implement (and thus easily deployed by ISPs) and offers substantial network performance improvement compared to the flow-based MIRA and the packet-based MHA, SPF, and CSPF algorithms. The remainder of this paper is organized as follows. Section II presents the least interference optimization model. Section III contains the performance evaluation. Our conclusions are presented in section IV.

2 II. THE LEAST INTERFERENCE OPTIMIZATION MODEL Consider a network represented by a directed acyclic graph G(N, L) where N is the set of nodes and L is the set of links. Let C l denote the capacity of link l and let P i,e denote the set of feasible paths connecting the ingress-egress pair (i, e). Assume that a request to establish an LSP tunnel of bandwidth d i,e units between an ingress-egress pair (i, e) is received and that future demands concerning LSP requests are not known. The routing problem consists of finding the best feasible path p P i,e such that 0 < f l < C l (1) d i,e min l p (C l f l ) (2) L p = l p L l (I l, f l ) (3) L p = min p P i,e L p (4) where L l (I l, f l ) is the cost of link l when carrying I l flows, f l is the total flows on link l and L p is the cost of path p. Equations (1), (2), (3) and (4) express respectively the feasibility of the flows, the feasibility of the path, the additivity of the path cost function and the optimality of the routing process. A. The Minimum Interference Routing Algorithm The objective of MIRA is to find a path between a pair of nodes that blocks the least amount of available flow between all other source-destination nodes. The link penalty function MIRA uses the link penalty function expressing costs which determine the relative importance of the ingress-egress pairs. In MIRA, computing the link costs reduces to finding the set of critical links for all ingress-egress pairs where the set of critical links belong to min-cut sets computed using the current residual link capacity. The link penalty function is L l = 1/θ s,d (5) (s,d ):l C s,d where θ s,d is the max-flow between pair (s, d ) and C s,d is the set of critical links between the pairs (s, d ) as determined by the max-flow algorithm. The MIRA routing algorithm Consider a demand for d i,e bandwidth units between two nodes i and e. MIRA uses the link penalty function defined in equation (5) above and executes seven steps in routing this demand 1) Compute the max-flow values θ s,d for all (s, d ) pairs except (i, e). 2) Compute the set of critical links for all (s, d ) pairs except (i, e). A link is critical for a given ingress-egress pair if that link belongs to any min-cut for that ingressegress pair. 3) Compute the link costs L l. 4) Compute the reduced network. Eliminate all links with residual capacities less than d i,e to form a reduced network whose links have sufficient spare capacity to carry the demand d i,e. 5) Find the new least cost path. Use Dijkstra s algorithm to find the new least cost path p from i to e in the reduced network using the link costs L l. 6) Route the traffic demand. Assign the traffic demand d i,e to the path p. 7) Update the link flows. For each link l p : f l := f l + d i,e. B. The Least Interference Optimization Algorithm The objective of LIOA is to find a path between a pair of nodes that minimizes the number and the magnitude of the flows carried by the links on the path. A power-based penalty function The link penalty function is L l (I l, f l ) = I α l /S 1 α l (6) where the link interference I l is the number of flows carried on the link, the link slack S l = C l f l where C l is the link capacity, f l is the traffic carried by a link l and 0 α 1 is a parameter representing the trade-off between LIO and CSPF routing. The link penalty function (6) is minimized by minimizing the the link interference I l and maximizing the link slack S l. By dispersing traffic flows over the network through interference minimization, this link cost will minimize the number of LSPs blocked under congestion. Note that L l (I l, f l ) = 1/(C l f l ) α = 0 CSPF routing 1/C l α = f l = 0 SPF routing I l α = 1 LIO routing When 0 < α < 1 the link penalty function yields a mix of LIO and CSPF routing. The impact of the parameter α on the link penalty function is discussed further in Section III. A log-based penalty function A link penalty function based on the logarithm of the powerbased penalty function (6) is given by L l (I l, f l ) = α log(i l + 1) + (1 α) log(k/(c l f l )) where 0 < α 1, 1 k/(c l f l ) (I l + 1) α/(1 α) and k = max l C l avoids negative link costs. The LIO routing algorithm Consider a demand for d i,e bandwidth units between two nodes i and e. LIOA executes four steps in routing this demand 1) Compute the link costs { Cl f L(I l, f l ) = l d i,e Il α/(c l f l ) 1 α C l f l > d i,e.

3 2) Find the new least cost path. Apply Dijkstra s algorithm to find the least cost path p P i,e. 3) Route the traffic demand. Assign the traffic demand d i,e to path p. 4) Update the link flows and interference. For each link l p : I l := I l + 1; f l := f l + d i,e. The original MIRA algorithm [2] required as many maxflow computations as the number of ingress-egress pairs where each max-flow computation has O(N 3 ) complexity for a network of N nodes. Improved versions of MIRA known as S-MIRA and L-MIRA use approximations of the link interference [4]. These improvements result in a lower LSP rejection compared to the original MIRA algorithm but result in additional complexity which can outweigh the advantages offered by the approximations. The complexity of LIOA is determined by the shortest path computation which has complexity O(N + L) or O(N 2 ) depending on whether shortest paths are found using a Breadth First Search or Dijkstra s algorithm. III. PERFORMANCE EVALUATION We conducted simulation experiments using a fictitious representation of a South African network illustrated in figure 1 to compare the performance of five routing algorithms (1) Minimum Hop Algorithm (MHA) (2) Least Interference Optimization Algorithm (LIOA) (3) Shortest Path (SPF) (4) Constraint Shortest Path (CSPF) and (5) Minimum Interference Routing (MIRA). The test network has 23 nodes with 88 unidirectional links. The dark thick links have capacity 48 units and the light thin links have capacity 12 units corresponding respectively to OC-48 and OC-12 links. In our simulation experiments, each node is used as an ingress and egress node, leading to 506 ingress-egress pairs. 22 Springbok Klerksdorp 15 8 Kroonstad Upington 18 Kimberley 17 Bloemfontein 16 De Aar 19 Mafikeng 14 Pretoria 12 Messina 10 Pietersburg/Polokwane Johannesburg Nelspruit 9 Richards Bay 23 Pietermaritzburg 7 6 Durban Hop Algorithm (MHA), Shortest Path first (SPF) and Constraint Shortest Path First (CSPF) compare versus the MIRA algorithm. The second metric reveals the impact of bandwidth allocation on future admission control. LSP rejection refers to LSP requests which were not accepted due to random fluctuation of the bandwidth availability. A. LSP rejection We conducted simulation experiments to analyze (1) the behavior of the different algorithms (2) the impact of the LIOA calibration parameter α on the network performance and (3) the performance difference resulting from using the multiplicative and additive versions of the LIOA cost function. Different algorithms We simulated two LSP setup modes: static and dynamic. In the static mode, LSP requests were long-lived while the dynamic mode assumed that LSP requests are offered randomly, are kept for a random time period and finally torn down. Each simulation experiment consists of 20 trials. In the static case, the link capacities were scaled by LSP setups each requesting between 1 to 6 units of bandwidth were simulated. In the dynamic case, the link capacities were scaled by long-lived LSPs were first loaded. Thereafter 2000 more short-lived LSP requests were simulated. The LSP requests were for 1-6 units of bandwidth. Figure 2 compares the performance achieved by MIRA, SPF, MHA, CSPF and LIOA in dynamic mode. Figure 2 reveals that LIOA rejects fewer LSP requests compared to the three other algorithms Fig. 2. MHA CSPF SPF MIRA LIOA Network optimality: dynamic mode Cape Town Saldanha 21 1 Beaufort West Fig Mosselbaai 2 Bisho 5 4 East London 3 Port Elizabeth A South African network The relevant performance metrics are LSP rejection under congestion (heavy load conditions) and the quality of the paths found by the different algorithms. The first parameter was chosen to compare how algorithms such as LIOA, Minimum The results illustrated in figure 3 are found when MIRA, SPF, MHA, CSPF and LIOA are compared in static mode. These results reveal that LIOA rejects fewer requests compared to the three other algorithms. The calibration parameter α We conducted simulation experiments in dynamic mode to evaluate the impact of α as a parameter expressing the tradeoff between LIO and CSPF routing. Figure 4 reveals the lowest LSP rejection is obtained for α = 0.5, a value balancing LIO and CSPF routing.

4 Fig. 3. MHA CSPF SPF MIRA LIOA Network optimality: static mode α = 0.8 α = 0.2 α = 0.5 B. The quality of the paths We conducted simulation experiments in dynamic mode to compare the quality of the LSP pathsets found by LIOA and MIRA. A trial of 5500 events was used for each experiment. Let P L and P M denote the sets of paths found by LIOA and MIRA respectively. The pie chart in Figure 6 presents a graphical view of the correlation between the pathsets P L and P M. The slice labelled P L P M (strong) represents the LSPs common to both P L and P M whose LIOA and MIRA flow values differ by less than 5%. The slice labelled P L P M (weak) represents the LSPs common to both P L and P M whose LIOA and MIRA flow values differ by more than 5%. The slice labelled P L \ P M represents the LSPs discovered only by LIOA and the slice labelled P M \ P L represents the LSPs discovered only by MIRA. With reference to Figure 6 we see that 55% of the paths in LIOA and MIRA are strongly correlated (L L L M (strong)), 29% are weakly correlated (L L L M (weak)), 7% of the LSPs were found only by MIRA (L M \ L L ), and 9% of the LSPs were found only by LIOA (L L \ L M ). L L L M (strong) PSfrag replacements Fig. 4. The calibration parameter α L M \L L PSfrag replacements Power-based versus log-based metrics Figure 5 compares the two cost metrics (power- and logbased) using different values of the α parameter for the two metrics in dynamic mode. The figure shows that the two cost metrics achieve approximately the same performance when α = 0.5 for the power-based metric and α = 0.2 for the logbased metric. This reveals for the test network being simulated, our routing scheme is relatively insensitive to the composition rule of the link penalty function: an additive composition rule performs as well as a multiplicative composition rule Fig. 5. Log Power Power- versus log-based metrics Fig. 6. L L L M (weak) L L \L M LSP correlation between MIRA and LIOA In general we observe that LIOA achieves lower rejection compared to MIRA. This relative efficiency results from the set of weakly correlated LSPs where flows are more efficiently distributed by LIOA. IV. CONCLUSION This paper presents an efficient routing algorithm using the least interference optimization (LIO) concept to achieve online traffic engineering in IP networks. A new cost metric which balances the number and intensity of flows offered to a network is presented. We show that this metric achieves network optimization under heavy traffic load profiles. This cost metric may be implemented using either a power version based on a multiplicative composition rule or a logarithmic version based on an additive composition rule with the same efficiency. For the network model under consideration, simulation results reveal that the Least Interference Optimization Algorithm (LIOA) requiring neither a priori knowledge of the ingressegress pair nor the estimation of the traffic profile outperforms the widely known Minimum Hop Algorithm (MHA), Shortest

5 Path First (SPF), Constraint Shortest Path First (CSPF) and Minimum Interference Routing Algorithm (MIRA) algorithms on several performance aspects including the simplicity of the implementation and the optimization of the network. REFERENCES [1] I.W. Widjaja, I. Saniee, A. Elwalid, D. Mitra, Online Traffic Engineering with Design-Based Routing, 15th ITC Specialist Seminar on Internet Traffic Engineering and Traffic Management, Würzburg, Germany, July [2] K. Kar, M. Kodialam, T.V. Lakshman. Minimum Interference Routing with Application to MPLS Traffic Engineering, Proc. IEEE INFOCOM, Tel-Aviv, Israel, March [3] J. Stevens. Spatial Reuse through Dynamic Power and Routing Control in Common-Channel Random-Access Packet Radio Networks, SURAN Program Technical Note (SRNTN) 59, Richardson, TX:Rockwell Inc., August Available from Defense Technical Information Center (DTIC). [4] M. Kodialam, T. V. Lakshman. MPLS Traffic Engineering Using Enhanced Minimum Interference Routing: An Approach Based On Lexicographic Max-Flow, Proceedings of Eighth International Workshop on Quality of Service (IWQoS), Pittsburgh, USA, June [5] S. Suri, M. Waldvogel, P. Warkhede Profile-based Routing: A new Framework for MPLS Traffic Engineering, Quality of Future Internet Services, Lecture Notes in Computer Science, Vol 2156, September Antoine Bigomokero Bagula obtained the MEng in Computer Engineering from the Université Catholique de Louvain in Belgium and the MSc in Computer Science from the University of Stellenbosch. He is currently a lecturer and a PhD student in the Department of Computer Science at the University of Stellenbosch.

New QOS Routing Algorithm for MPLS Networks Using Delay and Bandwidth Constraints

New QOS Routing Algorithm for MPLS Networks Using Delay and Bandwidth Constraints New QOS Routing Algorithm for MPLS Networks Using Delay and Bandwidth Constraints Santosh Kulkarni 1, Reema Sharma 2,Ishani Mishra 3 1 Department of ECE, KSSEM Bangalore,MIEEE, MIETE & ISTE 2 Department

More information

A Load Balancing Scheme for Congestion Control in MPLS Networks

A Load Balancing Scheme for Congestion Control in MPLS Networks A Load Balancing Scheme for Congestion Control in MPLS Networks Elio Salvadori, Roberto Battiti UniversitàdiTrento Dipartimento di Informatica e Telecomunicazioni via Sommarive 14, 38050 Povo (TN), Italy

More information

VOL. 3, NO. 3, March 2012 ISSN 2079-8407. Journal of Emerging Trends in Computing and Information Sciences 2009-2012 CIS Journal. All rights reserved.

VOL. 3, NO. 3, March 2012 ISSN 2079-8407. Journal of Emerging Trends in Computing and Information Sciences 2009-2012 CIS Journal. All rights reserved. New Bandwidth Guaranteed QoS Routing Algorithm for MPLS Networks 1 Santosh Kulkarni, 2 Reema Sharma, 3 Ishani Mishra 1 HOD, Department of ECE, KSSEM Bangalore,MIEEE, MIETE & ISTE 2 Assistant Professor,

More information

Path Selection Analysis in MPLS Network Based on QoS

Path Selection Analysis in MPLS Network Based on QoS Cumhuriyet Üniversitesi Fen Fakültesi Fen Bilimleri Dergisi (CFD), Cilt:36, No: 6 Özel Sayı (2015) ISSN: 1300-1949 Cumhuriyet University Faculty of Science Science Journal (CSJ), Vol. 36, No: 6 Special

More information

Distributed Explicit Partial Rerouting (DEPR) Scheme for Load Balancing in MPLS Networks

Distributed Explicit Partial Rerouting (DEPR) Scheme for Load Balancing in MPLS Networks Distributed Eplicit Partial Rerouting (DEPR) Scheme for Load Balancing in MPLS Networks Sherif Ibrahim Mohamed shf_ibrahim@yahoo.com Khaled M. F. Elsayed, senior member IEEE khaled@ieee.org Department

More information

PATH SELECTION AND BANDWIDTH ALLOCATION IN MPLS NETWORKS

PATH SELECTION AND BANDWIDTH ALLOCATION IN MPLS NETWORKS PATH SELECTION AND BANDWIDTH ALLOCATION IN MPLS NETWORKS James E Burns and Teunis J Ott Telcordia Technologies Inc, 445 South Street, Morristown NJ 07960-6438, USA Anthony E Krzesinski and Karen E Müller

More information

Traffic protection in MPLS networks using an off-line flow optimization model

Traffic protection in MPLS networks using an off-line flow optimization model Traffic protection in MPLS networks using an off-line flow optimization model A.E. Krzesinski and K.E. Müller Department of Computer Science University of Stellenbosch, 76 Stellenbosch, South Africa Phone:

More information

Load Balancing Routing with Bandwidth-Delay Guarantees

Load Balancing Routing with Bandwidth-Delay Guarantees Load Balancing Routing with Bandwidth-Delay Guarantees Kartik Gopalan Tzi-cker Chiueh Yow-Jian Lin Florida State University Stony Brook University Telcordia Technologies kartik@cs.fsu.edu chiueh@cs.sunysb.edu

More information

Traffic Engineering Eye Diagram

Traffic Engineering Eye Diagram 1 Traffic Engineering Eye Diagram Karol Kowalik and Martin Collier Research Institute for Networks and Communications Engineering (RINCE) Dublin City University, Dublin 9, Ireland, Telephone: +353 1 700

More information

A Reactive Scheme for Traffic Engineering in MPLS Networks

A Reactive Scheme for Traffic Engineering in MPLS Networks A Reactive Scheme for Traffic Engineering in MPLS Networks Elio Salvadori, Roberto Battiti, Mikalai Sabel niversità di Trento, Dipartimento di Informatica e Telecomunicazioni via Sommarive 14, 38050 Povo

More information

Disjoint Path Algorithm for Load Balancing in MPLS network

Disjoint Path Algorithm for Load Balancing in MPLS network International Journal of Innovation and Scientific Research ISSN 2351-8014 Vol. 13 No. 1 Jan. 2015, pp. 193-199 2015 Innovative Space of Scientific Research Journals http://www.ijisr.issr-journals.org/

More information

Analysis of traffic engineering parameters while using multi-protocol label switching (MPLS) and traditional IP networks

Analysis of traffic engineering parameters while using multi-protocol label switching (MPLS) and traditional IP networks Analysis of traffic engineering parameters while using multi-protocol label switching (MPLS) and traditional IP networks Faiz Ahmed Electronic Engineering Institute of Communication Technologies, PTCL

More information

A MIXED-METRIC ROUTING WITH OPTIMAL FLOW DISTRIBUTION FOR MPLS NETWORKS

A MIXED-METRIC ROUTING WITH OPTIMAL FLOW DISTRIBUTION FOR MPLS NETWORKS Journal of Engineering Sciences, Assiut University, Vol. 33, No.1, pp. 159-172, January 2006 A MIXED-METRIC ROUTING WITH OPTIMAL FLOW DISTRIBUTION FOR MPLS NETWORKS Associate Professor at Communications

More information

Project Report on Traffic Engineering and QoS with MPLS and its applications

Project Report on Traffic Engineering and QoS with MPLS and its applications Project Report on Traffic Engineering and QoS with MPLS and its applications Brief Overview Multiprotocol Label Switching (MPLS) is an Internet based technology that uses short, fixed-length labels to

More information

Dynamic Sizing of Label Switching Paths in MPLS Networks

Dynamic Sizing of Label Switching Paths in MPLS Networks Dynamic Sizing of Label Switching Paths in MPLS Networks Gustavo B. Figueiredo 1 José. Augusto. S. Monteiro 2 Nelson. L. S da Fonseca 1 Antônio. A. A. Rocha 3 1 State University of Campinas Institute of

More information

Guaranteed QoS Routing Scheme in MPLS -Wireless Access Networks

Guaranteed QoS Routing Scheme in MPLS -Wireless Access Networks JKAU: Comp. IT, Vol. 2, pp: 45-56 (2013 A.D./ 1435 A.H.) DOI: 10.4197 / Comp. 2-3 Guaranteed QoS Routing Scheme in MPLS -Wireless Access Networks Jeddah University, Alkamil Branch, Alkamil, Saudi Arabia

More information

Building MPLS VPNs with QoS Routing Capability i

Building MPLS VPNs with QoS Routing Capability i Building MPLS VPNs with QoS Routing Capability i Peng Zhang, Raimo Kantola Laboratory of Telecommunication Technology, Helsinki University of Technology Otakaari 5A, Espoo, FIN-02015, Finland Tel: +358

More information

Enhanced Variable Splitting Ratio Algorithm for Effective Load Balancing in MPLS Networks

Enhanced Variable Splitting Ratio Algorithm for Effective Load Balancing in MPLS Networks Journal of Computer Science 4 (3): 232-238, 2008 ISSN 1549-3636 2008 Science Publications Enhanced Variable Splitting Ratio Algorithm for Effective Load Balancing in MPLS Networks 1 G. Murugesan, 2 A.M.

More information

A ROUTING ALGORITHM FOR MPLS TRAFFIC ENGINEERING IN LEO SATELLITE CONSTELLATION NETWORK. Received September 2012; revised January 2013

A ROUTING ALGORITHM FOR MPLS TRAFFIC ENGINEERING IN LEO SATELLITE CONSTELLATION NETWORK. Received September 2012; revised January 2013 International Journal of Innovative Computing, Information and Control ICIC International c 2013 ISSN 1349-4198 Volume 9, Number 10, October 2013 pp. 4139 4149 A ROUTING ALGORITHM FOR MPLS TRAFFIC ENGINEERING

More information

THE Differentiated Services and Multiprotocol Label Switching (MPLS) working groups of IETF are proposing

THE Differentiated Services and Multiprotocol Label Switching (MPLS) working groups of IETF are proposing Minimizing Re-Routing in MPLS Networks with Preemption-Aware Constraint-Based Routing Balázs Szviatovszki, Áron Szentesi, Alpár Jüttner Abstract The importance of providing bandwidth guarantees in packet

More information

ADAPTIVE RESOURCE ALLOCATION AND INTERNET TRAFFIC ENGINEERING ON DATA NETWORK

ADAPTIVE RESOURCE ALLOCATION AND INTERNET TRAFFIC ENGINEERING ON DATA NETWORK ADAPTIVE RESOURCE ALLOCATION AND INTERNET TRAFFIC ENGINEERING ON DATA NETWORK ABSTRACT Hatim Hussein Department of Electrical and Computer Engineering, George Mason University, Fairfax, Virginia, USA hhussei1@gmu.edu

More information

A New Fault Tolerant Routing Algorithm For GMPLS/MPLS Networks

A New Fault Tolerant Routing Algorithm For GMPLS/MPLS Networks A New Fault Tolerant Routing Algorithm For GMPLS/MPLS Networks Mohammad HossienYaghmae Computer Department, Faculty of Engineering, Ferdowsi University of Mashhad, Mashhad, Iran hyaghmae@ferdowsi.um.ac.ir

More information

Traffic Engineering With Traditional IP Routing Protocols

Traffic Engineering With Traditional IP Routing Protocols Traffic Engineering With Traditional IP Routing Protocols Bernard Fortz Jennifer Rexford Mikkel Thorup Institut d Administration et de Gestion Internet and Networking Systems Universite Catholique de Louvain

More information

A Performance Study of IP and MPLS Traffic Engineering Techniques under Traffic Variations

A Performance Study of IP and MPLS Traffic Engineering Techniques under Traffic Variations A Performance Study of IP and MPLS Traffic Engineering Techniques under Traffic Variations Sukrit Dasgupta Department of ECE Drexel University Philadelphia, PA, USA sukrit@ece.drexel.edu Jaudelice C. de

More information

2004 Networks UK Publishers. Reprinted with permission.

2004 Networks UK Publishers. Reprinted with permission. Riikka Susitaival and Samuli Aalto. Adaptive load balancing with OSPF. In Proceedings of the Second International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET

More information

How To Share Bandwidth On A Diffserv Network

How To Share Bandwidth On A Diffserv Network Proceedings of the 2007 IEEE International Conference on Telecommunications and Malaysia International Conference on Communications, 14-17 May 2007, Penang, Malaysia Bandwidth Sharing Scheme in DiffServ-aware

More information

How To Provide Qos Based Routing In The Internet

How To Provide Qos Based Routing In The Internet CHAPTER 2 QoS ROUTING AND ITS ROLE IN QOS PARADIGM 22 QoS ROUTING AND ITS ROLE IN QOS PARADIGM 2.1 INTRODUCTION As the main emphasis of the present research work is on achieving QoS in routing, hence this

More information

Bandwidth Sharing with Primary Paths for Protection Routing in an MPLS Network

Bandwidth Sharing with Primary Paths for Protection Routing in an MPLS Network Bandwidth Sharing with Primary Paths for Protection Routing in an MPLS Network Faisal Aslam, Saqib Raza and Zartash Afzal Uzmi Department of Computer Science Lahore University of Management Sciences, Pakistan

More information

Parallel LSPs for constraint-based routing and load balancing in MPLS networks

Parallel LSPs for constraint-based routing and load balancing in MPLS networks Parallel LSPs for constraint-based routing and load balancing in MPLS networks J. Tang, C.K. Siew and G. Feng Abstract: Two features of multiprotocol label switching are very useful in network traffic

More information

Supporting End-to-End QoS in DiffServ/MPLS Networks

Supporting End-to-End QoS in DiffServ/MPLS Networks Supporting End-to-End QoS in DiffServ/MPLS Networks Ji-Feng Chiu, *Zuo-Po Huang, *Chi-Wen Lo, *Wen-Shyang Hwang and Ce-Kuen Shieh Department of Electrical Engineering, National Cheng Kung University, Taiwan

More information

MPLS Traffic Engineering in ISP Network

MPLS Traffic Engineering in ISP Network MPLS Traffic Engineering in ISP Network Mohsin Khan Birmingham City University, England ABSTRACT Multi Protocol Label Switching (MPLS) is an innovative and vibrant technology. The most famous applications

More information

PROTECTION ALGORITHMS FOR BANDWIDTH GUARANTEED CONNECTIONS IN MPLS NETWORKS WONG SHEK YOON

PROTECTION ALGORITHMS FOR BANDWIDTH GUARANTEED CONNECTIONS IN MPLS NETWORKS WONG SHEK YOON PROTECTION ALGORITHMS FOR BANDWIDTH GUARANTEED CONNECTIONS IN MPLS NETWORKS WONG SHEK YOON (B.Eng.(Hons), NUS) A THESIS SUBMITTED FOR THE DEGREE OF MASTER OF ENGINEERING DEPARTMENT OF ELECTRICAL & COMPUTER

More information

Implementation of Traffic Engineering and Addressing QoS in MPLS VPN Based IP Backbone

Implementation of Traffic Engineering and Addressing QoS in MPLS VPN Based IP Backbone International Journal of Computer Science and Telecommunications [Volume 5, Issue 6, June 2014] 9 ISSN 2047-3338 Implementation of Traffic Engineering and Addressing QoS in MPLS VPN Based IP Backbone Mushtaq

More information

Rollout Algorithms for Topology Control and Routing of Unsplittable Flows in Wireless Optical Backbone Networks*

Rollout Algorithms for Topology Control and Routing of Unsplittable Flows in Wireless Optical Backbone Networks* Rollout Algorithms for Topology Control and Routing of Unsplittable Flows in Wireless Optical Backbone Networks* Abhishek Kashyap, Mehdi Kalantari, Kwangil Lee and Mark Shayman Department of Electrical

More information

IP Traffic Engineering over OMP technique

IP Traffic Engineering over OMP technique IP Traffic Engineering over OMP technique 1 Károly Farkas, 1 Zoltán Balogh, 2 Henrik Villför 1 High Speed Networks Laboratory Department of Telecommunications and Telematics Technical University of Budapest,

More information

A simulation study of GELS for Ethernet over WAN

A simulation study of GELS for Ethernet over WAN A simulation study of GELS for Ethernet over WAN Saqib M. Ilyas, Atif Nazir, Fawaz S. Bokhari, Zartash A. Uzmi Computer Science and Engineering Lahore University of Management Sciences, Lahore, Pakistan

More information

DYNAMIC ROUTING OF BANDWIDTH GUARANTEED CONNECTIONS IN MPLS NETWORKS

DYNAMIC ROUTING OF BANDWIDTH GUARANTEED CONNECTIONS IN MPLS NETWORKS International Journal on Wireless & Optical Communications Vol., No. (2003) 75 86 c World cientific Publishing Company DYNAMIC ROUING OF BANDWIDH GUARANEED CONNECION IN MPL NEWORK ANONIO CAPONE, LUIGI

More information

Multi-Commodity Flow Traffic Engineering with Hybrid MPLS/OSPF Routing

Multi-Commodity Flow Traffic Engineering with Hybrid MPLS/OSPF Routing Multi-Commodity Flow Traffic Engineering with Hybrid MPLS/ Routing Mingui Zhang Tsinghua University Beijing, China mingui.zhang@gmail.com Bin Liu Tsinghua University Beijing, China liub@tsinghua.edu.cn

More information

Multiple Layer Traffic Engineering in NTT Network Service

Multiple Layer Traffic Engineering in NTT Network Service Multi-layer traffic engineering in photonic-gmpls-router networks Naoaki Yamanaka, Masaru Katayama, Kohei Shiomoto, Eiji Oki and Nobuaki Matsuura * NTT Network Innovation Laboratories * NTT Network Service

More information

Quality of Service Routing in MPLS Networks Using Delay and Bandwidth Constraints

Quality of Service Routing in MPLS Networks Using Delay and Bandwidth Constraints Quality of Service Routing in MPLS Networks Using Delay and Bandwidth Constraints Mohammad HossienYaghmae Computer Department, Faculty of Engineering, Ferdowsi University of Mashad, Mashhad, Iran hyaghmae@ferdowsi.um.ac.ir

More information

Simulation of Heuristic Usage for Load Balancing In Routing Efficiency

Simulation of Heuristic Usage for Load Balancing In Routing Efficiency Simulation of Heuristic Usage for Load Balancing In Routing Efficiency Nor Musliza Mustafa Fakulti Sains dan Teknologi Maklumat, Kolej Universiti Islam Antarabangsa Selangor normusliza@kuis.edu.my Abstract.

More information

A Localized Adaptive Proportioning Approach to QoS Routing

A Localized Adaptive Proportioning Approach to QoS Routing QOS ROUTING A Localized Adaptive Proportioning Approach to QoS Routing Srihari Nelakuditi and Zhi-Li Zhang, University of Minnesota Here we assume source routing with bandwidth guarantees. ABSTRACT In

More information

Performance of networks containing both MaxNet and SumNet links

Performance of networks containing both MaxNet and SumNet links Performance of networks containing both MaxNet and SumNet links Lachlan L. H. Andrew and Bartek P. Wydrowski Abstract Both MaxNet and SumNet are distributed congestion control architectures suitable for

More information

Evolution of QoS routing in the Internet

Evolution of QoS routing in the Internet Evolution of QoS routing in the Internet Olivier Bonaventure Dept. Computing Science and Engineering Université catholique de Louvain http://www.info.ucl.ac.be/people/obo June 4th, 2004 Page 1 Agenda Routing

More information

Supporting Differentiated Services with Per-Class Traffic Engineering in MPLS

Supporting Differentiated Services with Per-Class Traffic Engineering in MPLS Supporting Differentiated Services with Per-Class Traffic Engineering in MPLS Melody Moh moh @IX. sjsu. edu Dept of Math. & Computer Science Belle Wei bwei@email.sjsu.edu Dept of Electrical Engineering

More information

Performance Analysis of MPLS TE Queues for QoS Routing

Performance Analysis of MPLS TE Queues for QoS Routing Performance Analysis of MPLS TE Queues for QoS Routing Yihan Li, Shivendra Panwar Electrical and Computer Engineering Department, Polytechnic University, Brooklyn, NY C.J. (Charlie) Liu AT&T Laboratories,

More information

Chapter 1. Introduction

Chapter 1. Introduction Chapter 1 Introduction 1.1. Motivation Network performance analysis, and the underlying queueing theory, was born at the beginning of the 20th Century when two Scandinavian engineers, Erlang 1 and Engset

More information

Traffic Engineering. Traffic Engineering

Traffic Engineering. Traffic Engineering MPLS Traffic Engineering George Swallow swallow@cisco.com Traffic Engineering 1999, Cisco Systems, Inc. 1 What is Traffic Engineering Taking control of how traffic flows in your network in order to - Improve

More information

Investigation and Comparison of MPLS QoS Solution and Differentiated Services QoS Solutions

Investigation and Comparison of MPLS QoS Solution and Differentiated Services QoS Solutions Investigation and Comparison of MPLS QoS Solution and Differentiated Services QoS Solutions Steve Gennaoui, Jianhua Yin, Samuel Swinton, and * Vasil Hnatyshin Department of Computer Science Rowan University

More information

Recent Research and Comparison of QoS Routing Algorithms for MPLS Networks

Recent Research and Comparison of QoS Routing Algorithms for MPLS Networks Recent Research and Comparison of QoS Routing Algorithms for MPLS Networks Santosh Kulkarni 1, Reema Sharma 2, Ishani Mishra 3 1 HOD, Department of ECE, KSSEM Bangalore, MIEEE, MIETE & ISTE. 2 Assistant

More information

MikroTik RouterOS Workshop Load Balancing Best Practice. Warsaw MUM Europe 2012

MikroTik RouterOS Workshop Load Balancing Best Practice. Warsaw MUM Europe 2012 MikroTik RouterOS Workshop Load Balancing Best Practice Warsaw MUM Europe 2012 MikroTik 2012 About Me Jānis Meģis, MikroTik Jānis (Tehnical, Trainer, NOT Sales) Support & Training Engineer for almost 8

More information

Shared Backup Path Optimization in Telecommunication Networks

Shared Backup Path Optimization in Telecommunication Networks Shared Backup Path Optimization in Telecommunication Networks Balázs Gábor Józsa and Dániel Orincsay Abstract This paper presents new approaches for off-line global path optimization in telecommunication

More information

A New Forwarding Policy for Load Balancing in Communication Networks

A New Forwarding Policy for Load Balancing in Communication Networks A New Forwarding Policy for Load Balancing in Communication Networks Martin Heusse Yvon Kermarrec ENST de Bretagne BP 83, 985 Brest Cedex, France Martin.Heusse@enst-bretagne.fr Abstract We present in this

More information

A Fast Path Recovery Mechanism for MPLS Networks

A Fast Path Recovery Mechanism for MPLS Networks A Fast Path Recovery Mechanism for MPLS Networks Jenhui Chen, Chung-Ching Chiou, and Shih-Lin Wu Department of Computer Science and Information Engineering Chang Gung University, Taoyuan, Taiwan, R.O.C.

More information

Traffic Engineering Management Concepts

Traffic Engineering Management Concepts 3 CHAPTER This chapter includes an overview of Cisco Prime Fulfillment and of some of the concepts used in this guide. This chapter includes the following sections: Prime Fulfillment TEM Overview, page

More information

Internetworking II: VPNs, MPLS, and Traffic Engineering

Internetworking II: VPNs, MPLS, and Traffic Engineering Internetworking II: VPNs, MPLS, and Traffic Engineering 3035/GZ01 Networked Systems Kyle Jamieson Lecture 10 Department of Computer Science University College London Taxonomy of communica@on networks Virtual

More information

100Gigabit and Beyond: Increasing Capacity in IP/MPLS Networks Today Rahul Vir Product Line Manager Foundry Networks rvir@foundrynet.

100Gigabit and Beyond: Increasing Capacity in IP/MPLS Networks Today Rahul Vir Product Line Manager Foundry Networks rvir@foundrynet. 100Gigabit and Beyond: Increasing Capacity in IP/MPLS Networks Today Rahul Vir Product Line Manager Foundry Networks rvir@foundrynet.com 1 Agenda 2 40GE/100GE Timeline to Standardization The Ethernet Alliance

More information

MPLS Environment. To allow more complex routing capabilities, MPLS permits attaching a

MPLS Environment. To allow more complex routing capabilities, MPLS permits attaching a MPLS Environment Introduction to MPLS Multi-Protocol Label Switching (MPLS) is a highly efficient and flexible routing approach for forwarding packets over packet-switched networks, irrespective of the

More information

VoIP versus VoMPLS Performance Evaluation

VoIP versus VoMPLS Performance Evaluation www.ijcsi.org 194 VoIP versus VoMPLS Performance Evaluation M. Abdel-Azim 1, M.M.Awad 2 and H.A.Sakr 3 1 ' ECE Department, Mansoura University, Mansoura, Egypt 2 ' SCADA and Telecom General Manager, GASCO,

More information

Network traffic engineering

Network traffic engineering Toolbox, hybrid IP/MPLS optimisation method and fairness Research Unit in Networking EECS Department University of Liège 13 September 005 Outline 1 3 4 5 Outline MPLS principles 1 MPLS principles 3 4 5

More information

An Efficient Fault Tolerance Model for Path Recovery in MPLS Networks

An Efficient Fault Tolerance Model for Path Recovery in MPLS Networks An Efficient Fault Tolerance Model for Path Recovery in MPLS Networks Arunkumar C K M.Tech student, Dept. of ECE, Dayananda Sagar College of Engineering, VTU, Banglore, India ABSTRACT: Increasing demand

More information

Router Scheduling Configuration Based on the Maximization of Benefit and Carried Best Effort Traffic

Router Scheduling Configuration Based on the Maximization of Benefit and Carried Best Effort Traffic Telecommunication Systems 24:2 4, 275 292, 2003 2003 Kluwer Academic Publishers. Manufactured in The Netherlands. Router Scheduling Configuration Based on the Maximization of Benefit and Carried Best Effort

More information

Path Selection Methods for Localized Quality of Service Routing

Path Selection Methods for Localized Quality of Service Routing Path Selection Methods for Localized Quality of Service Routing Xin Yuan and Arif Saifee Department of Computer Science, Florida State University, Tallahassee, FL Abstract Localized Quality of Service

More information

Maximizing Restorable Throughput in MPLS Networks

Maximizing Restorable Throughput in MPLS Networks Maximizing Restorable Throughput in MPLS Networks Reuven Cohen Gabi Nakibly Technion Israel Institute of Technology, Computer Science, Haifa, Israel Abstract MPLS recovery mechanisms are increasing in

More information

A Hybrid Fault-Tolerant Algorithm for MPLS Networks. Maria Hadjiona, Chryssis Georgiou, Maria Papa, Vasos Vassiliou. University of Cyprus

A Hybrid Fault-Tolerant Algorithm for MPLS Networks. Maria Hadjiona, Chryssis Georgiou, Maria Papa, Vasos Vassiliou. University of Cyprus Technical Report A Hybrid Fault-Tolerant Algorithm for MPLS Networks Maria Hadjiona, Chryssis Georgiou, Maria Papa, Vasos Vassiliou University of Cyprus Computer Science Department TR 07 06 December 2007

More information

Building Alternate Multicasting Trees in MPLS Networks

Building Alternate Multicasting Trees in MPLS Networks Treasures at UT Dallas Eric Jonsson School of Engineering and Computer Science 5-2009 Building Alternate Multicasting Trees in MPLS Networks Limin Tang, et al. Follow this and additional works at: http://

More information

Traffic Engineering & Network Planning Tool for MPLS Networks

Traffic Engineering & Network Planning Tool for MPLS Networks Traffic Engineering & Network Planning Tool for MPLS Networks Dr. Associate Professor, Department of Electrical Engineering Indian Institute of Technology Bombay, Powai, Mumbai 76 Founder & Director, Vegayan

More information

ENHANCING FAULT TOLERANCE AND REROUTING STRATEGIES IN MPLS NETWORKS

ENHANCING FAULT TOLERANCE AND REROUTING STRATEGIES IN MPLS NETWORKS ENHANCING FAULT TOLERANCE AND REROUTING STRATEGIES IN MPLS NETWORKS 1 Rajni Arya, 2 Komal Garg (Guide) 1 M.Tech. Scholar, 2 Assistant Professor, C.S.E Department, R.P.S. Group of Institutions, Mohindergarh,

More information

On the Trade-Off between Control Plane Load and Data Plane Efficiency in Software Defined Networks

On the Trade-Off between Control Plane Load and Data Plane Efficiency in Software Defined Networks 1 Technion - Computer Science Department - Tehnical Report CS-01-0 - 01 On the Trade-Off between Control Plane Load and Data Plane Efficiency in Software Defined Networks Abstract Software Defined Networking

More information

Quality of Service using Traffic Engineering over MPLS: An Analysis. Praveen Bhaniramka, Wei Sun, Raj Jain

Quality of Service using Traffic Engineering over MPLS: An Analysis. Praveen Bhaniramka, Wei Sun, Raj Jain Praveen Bhaniramka, Wei Sun, Raj Jain Department of Computer and Information Science The Ohio State University 201 Neil Ave, DL39 Columbus, OH 43210 USA Telephone Number: +1 614-292-3989 FAX number: +1

More information

Performance Evaluation for VOIP over IP and MPLS

Performance Evaluation for VOIP over IP and MPLS World of Computer Science and Information Technology Journal (WCSIT) ISSN: 2221-0741 Vol. 2, No. 3, 110-114, 2012 Performance Evaluation for VOIP over IP and MPLS Dr. Reyadh Shaker Naoum Computer Information

More information

LMPS: Localized Multi-Path Selection for QoS Routing in VoIP Networks Khaled M. F. Elsayed khaled@ieee.org

LMPS: Localized Multi-Path Selection for QoS Routing in VoIP Networks Khaled M. F. Elsayed khaled@ieee.org LMPS: Localized Multi-Path Selection for QoS Routing in VoIP Networks Khaled M F Elsayed khaled@ieeeorg Hassan Fadel Amin M Nassar anassar@engcuedueg hassanfadel@egticomeg Department of Electronics and

More information

Junos MPLS and VPNs (JMV)

Junos MPLS and VPNs (JMV) Junos MPLS and VPNs (JMV) Course No: EDU-JUN-JMV Length: Five days Onsite Price: $32500 for up to 12 students Public Enrollment Price: $3500/student Course Level JMV is an advanced-level course. Prerequisites

More information

Leveraging Advanced Load Sharing for Scaling Capacity to 100 Gbps and Beyond

Leveraging Advanced Load Sharing for Scaling Capacity to 100 Gbps and Beyond Leveraging Advanced Load Sharing for Scaling Capacity to 100 Gbps and Beyond Ananda Rajagopal Product Line Manager Service Provider Solutions Foundry Networks arajagopal@foundrynet.com Agenda 2 Why Load

More information

Dynamic Network Resources Allocation in Grids through a Grid Network Resource Broker

Dynamic Network Resources Allocation in Grids through a Grid Network Resource Broker INGRID 2007 Instrumenting the GRID Second International Workshop on Distributed Cooperative Laboratories Session 2: Networking for the GRID Dynamic Network Resources Allocation in Grids through a Grid

More information

The Design of Segment-based Protection Algorithms

The Design of Segment-based Protection Algorithms QoS Aware Path Protection Schemes for MPLS Networks Ashish Gupta, Ashish Gupta, B.N. Jain Department of Computer Science and Engg. Indian Institute of Technology New Delhi, India ag, ashish, bnj @cse.iitd.ac.in

More information

Traffic Engineering for Multiple Spanning Tree Protocol in Large Data Centers

Traffic Engineering for Multiple Spanning Tree Protocol in Large Data Centers Traffic Engineering for Multiple Spanning Tree Protocol in Large Data Centers Ho Trong Viet, Yves Deville, Olivier Bonaventure, Pierre François ICTEAM, Université catholique de Louvain (UCL), Belgium.

More information

Juniper Networks NorthStar Controller

Juniper Networks NorthStar Controller Juniper Networks NorthStar Controller Functionality Test Report Introduction IP/MPLS has been the technology of choice for service providers for the better part of a decade and a half. Backbone network

More information

Policy-Based Fault Management for Integrating IP over Optical Networks

Policy-Based Fault Management for Integrating IP over Optical Networks Policy-Based Fault Management for Integrating IP over Optical Networks Cláudio Carvalho 1, Edmundo Madeira 1, Fábio Verdi 2, and Maurício Magalhães 2 1 Institute of Computing (IC-UNICAMP) 13084-971 Campinas,

More information

MPLS Study. Project: Competence Center for ATM Components - DFN ComAC-

MPLS Study. Project: Competence Center for ATM Components - DFN ComAC- MPLS Study Project: Competence Center for ATM Components - DFN ComAC- *0'#)2.86 5HVHDUFK#,QVWLWXWH#IRU#2SHQ#&RPPXQLFDWLRQ#6\VWHPV #.DLVHULQ0$XJXVWD0$OOHH#64 '0438;

More information

Dynamic Congestion-Based Load Balanced Routing in Optical Burst-Switched Networks

Dynamic Congestion-Based Load Balanced Routing in Optical Burst-Switched Networks Dynamic Congestion-Based Load Balanced Routing in Optical Burst-Switched Networks Guru P.V. Thodime, Vinod M. Vokkarane, and Jason P. Jue The University of Texas at Dallas, Richardson, TX 75083-0688 vgt015000,

More information

IP Core Transport Network

IP Core Transport Network UDC 635.14:621.391 IP Core Transport Network VAkira Hakata VMasafumi Katoh VHaruo Yamashita VSatoshi Nojima (Manuscript received February 28, 2001) This paper proposes a next-generation IP core transport

More information

FuDyLBA: A Traffic Engineering Load Balance Scheme for MPLS Networks Based on Fuzzy Logic

FuDyLBA: A Traffic Engineering Load Balance Scheme for MPLS Networks Based on Fuzzy Logic FuDyLBA: A Traffic Engineering Load Balance Scheme for MPLS Networks Based on Fuzzy Logic Joaquim Celestino Júnior, Pablo Rocha Ximenes Ponte, Antonio Clécio Fontelles Tomaz, Ana Luíza Bessa de Paula Barros

More information

MPLS - A Choice of Signaling Protocol

MPLS - A Choice of Signaling Protocol www.ijcsi.org 289 MPLS - A Choice of Signaling Protocol Muhammad Asif 1, Zahid Farid 2, Muhammad Lal 3, Junaid Qayyum 4 1 Department of Information Technology and Media (ITM), Mid Sweden University Sundsvall

More information

Quality of Service in the Internet. QoS Parameters. Keeping the QoS. Traffic Shaping: Leaky Bucket Algorithm

Quality of Service in the Internet. QoS Parameters. Keeping the QoS. Traffic Shaping: Leaky Bucket Algorithm Quality of Service in the Internet Problem today: IP is packet switched, therefore no guarantees on a transmission is given (throughput, transmission delay, ): the Internet transmits data Best Effort But:

More information

MPLS-TP. Future Ready. Today. Introduction. Connection Oriented Transport

MPLS-TP. Future Ready. Today. Introduction. Connection Oriented Transport MPLS-TP Future Ready. Today Introduction As data traffic started dominating telecom networks, there was a need for transport data networks, as opposed to transport TDM networks. Traditional transport technologies

More information

Implementing MPLS VPN in Provider's IP Backbone Luyuan Fang luyuanfang@att.com AT&T

Implementing MPLS VPN in Provider's IP Backbone Luyuan Fang luyuanfang@att.com AT&T Implementing MPLS VPN in Provider's IP Backbone Luyuan Fang luyuanfang@att.com AT&T 1 Outline! BGP/MPLS VPN (RFC 2547bis)! Setting up LSP for VPN - Design Alternative Studies! Interworking of LDP / RSVP

More information

An Open Source Traffic Engineering Toolbox

An Open Source Traffic Engineering Toolbox An Open Source Traffic Engineering Toolbox G. Leduc a, H. Abrahamsson e S. Balon a, S. Bessler b M. D Arienzo h O. Delcourt a J. Domingo-Pascual d S. Cerav-Erbas g I. Gojmerac b X. Masip d A. Pescapè h

More information

A New Path Selection Algorithm for MPLS Networks Based on Available Bandwidth Estimation

A New Path Selection Algorithm for MPLS Networks Based on Available Bandwidth Estimation A New Path Selection Algorithm for MPLS Networks Based on Available Bandwidth Estimation Tricha Anjali 1, Caterina Scoglio 1, Jaudelice C. de Oliveira 1, Leonardo C. Chen 1, Ian F. Akyildiz 1, Jeff A.

More information

CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING

CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING CHAPTER 6 CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING 6.1 INTRODUCTION The technical challenges in WMNs are load balancing, optimal routing, fairness, network auto-configuration and mobility

More information

Implement a QoS Algorithm for Real-Time Applications in the DiffServ-aware MPLS Network

Implement a QoS Algorithm for Real-Time Applications in the DiffServ-aware MPLS Network Implement a QoS Algorithm for Real-Time Applications in the DiffServ-aware MPLS Network Zuo-Po Huang, *Ji-Feng Chiu, Wen-Shyang Hwang and *Ce-Kuen Shieh adrian@wshlab2.ee.kuas.edu.tw, gary@hpds.ee.ncku.edu.tw,

More information

Load Balancing by MPLS in Differentiated Services Networks

Load Balancing by MPLS in Differentiated Services Networks Load Balancing by MPLS in Differentiated Services Networks Riikka Susitaival, Jorma Virtamo, and Samuli Aalto Networking Laboratory, Helsinki University of Technology P.O.Box 3000, FIN-02015 HUT, Finland

More information

RSVP- A Fault Tolerant Mechanism in MPLS Networks

RSVP- A Fault Tolerant Mechanism in MPLS Networks RSVP- A Fault Tolerant Mechanism in MPLS Networks S.Ravi Kumar, M.Tech(NN) Assistant Professor Gokul Institute of Technology And Sciences Piridi, Bobbili, Vizianagaram, Andhrapradesh. Abstract: The data

More information

On the Scalability-Performance Tradeoffs in MPLS and IP Routing

On the Scalability-Performance Tradeoffs in MPLS and IP Routing On the Scalability-Performance Tradeoffs in MPLS and IP Routing SELMA YILMAZ IBRAHIM MATTA Computer Science Department Boston University Boston, MA 225, USA selma,matta @cs.bu.edu Technical Report BUCS-TR-22-3

More information

A NEW APPROACH TO ENHANCE SECURITY IN MPLS NETWORK

A NEW APPROACH TO ENHANCE SECURITY IN MPLS NETWORK A NEW APPROACH TO ENHANCE SECURITY IN MPLS NETWORK S.Veni 1 and Dr.G.M.Kadhar Nawaz 2 1 Research Scholar, Barathiar University, Coimbatore, India venii_k@yahoo.com 2 Director, Dept. of MCA, Sona College

More information

DiffServ Aware MPLS Traffic Engineering for ISP Networks: State of the Art and New Trends

DiffServ Aware MPLS Traffic Engineering for ISP Networks: State of the Art and New Trends Invited paper DiffServ Aware MPLS Traffic Engineering for ISP Networks: State of the Art and New Trends Armand Toguyéni and Ouajdi Korbaa Abstract In the recent ten years, with the development of new applications

More information

Computer Network Architectures and Multimedia. Guy Leduc. Chapter 2 MPLS networks. Chapter 2: MPLS

Computer Network Architectures and Multimedia. Guy Leduc. Chapter 2 MPLS networks. Chapter 2: MPLS Computer Network Architectures and Multimedia Guy Leduc Chapter 2 MPLS networks Chapter based on Section 5.5 of Computer Networking: A Top Down Approach, 6 th edition. Jim Kurose, Keith Ross Addison-Wesley,

More information

ENHANCED PROVISIONING ALGORITHM FOR VIRTUAL PRIVATE NETWORK IN HOSE MODEL WITH QUALITY OF SERVICE SUPPORT USING WAXMAN MODEL

ENHANCED PROVISIONING ALGORITHM FOR VIRTUAL PRIVATE NETWORK IN HOSE MODEL WITH QUALITY OF SERVICE SUPPORT USING WAXMAN MODEL R. RAVI: ENHANCED PROVISIONING ALGORITHM FOR VIRTUAL PRIVATE NETWORK IN HOSE MODEL WITH QUALITY OF SERVICE SUPPORT USING WAXMAN MODEL ENHANCED PROVISIONING ALGORITHM FOR VIRTUAL PRIVATE NETWORK IN HOSE

More information

Introduction to LAN/WAN. Network Layer

Introduction to LAN/WAN. Network Layer Introduction to LAN/WAN Network Layer Topics Introduction (5-5.1) Routing (5.2) (The core) Internetworking (5.5) Congestion Control (5.3) Network Layer Design Isues Store-and-Forward Packet Switching Services

More information

TRAFFIC ENGINEERING AND PATH PROTECTION IN MPLS VIRTUAL PRIVATE NETWORKS

TRAFFIC ENGINEERING AND PATH PROTECTION IN MPLS VIRTUAL PRIVATE NETWORKS TRAFFIC ENGINEERING AND PATH PROTECTION IN MPLS VIRTUAL PRIVATE NETWORKS AThesis Submitted to the Graduate Faculty of the Louisiana State University and Agricultural and Mechanical College in partial fulfillment

More information