VOL. 3, NO. 3, March 2012 ISSN Journal of Emerging Trends in Computing and Information Sciences CIS Journal. All rights reserved.
|
|
- Shana Price
- 8 years ago
- Views:
Transcription
1 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, Department of ECE, The Oxford College Of Engineering, Bangalore, M.Tech NIT Kurukshetra, Pursuing PHD, 3 Lecturer, Department Of ECE, New Horizon College Of Engineering, Bangalore 1 santoshgk11@gmail.com, 2 talktoreema2002@yahoo.co.in, 3 mishra.ishani@gmail.com ABSTRACT Internet has become an integrated carrier gradually, which has multi business such as data, voice, video, multimedia and so on. New multimedia applications require the network to guarantee quality of service. MPLS network has the capability of routing with some specific constraints for supporting desired QoS, out of which bandwidth is the most important constraint. The efficient routing algorithm should have low computational complexity, high network utilization and low call blocking percentage. This paper proposes a new Bandwidth guaranteed QoS routing algorithm based on MPLS networks. It is based on three objectives: Minimum interference levels with other source destination node pairs, optimizing the network resource utilization using Dijkstra s algorithm and reducing algorithm complexity. The simulation results show that the proposed algorithm performs better in terms of network utilization, low call blocking percentage, reduced path length and low complexity. Keywords: MPLS, QoS Routing, Traffic Engineering, Path Selection, Multimedia Applications 1. INTRODUCTION Multi Protocol Label Switching (MPLS) was introduced to address the drawbacks of the conventional IP routing which forwards packets based on destination address only. To deal with the scalability of routing and also to meet the requirements of newly developed services, there is an increasing need for new routing functionality on routing protocols. By extending the IP routing functionality, traffic engineering can be carried out and thus improves the network performance. The most popular solutions to support QoS routing in the internet are Differentiated services (DiffServ) and MPLS. MPLS network has the capability of routing with some specific constraints for supporting desired QoS. MPLS is an efficient encapsulation mechanism which uses labels appended to packets for transport of data. Labels can be used as designators, for example, IP Prefixes, ATM VC or a bandwidth guaranteed path. MPLS networks inherit the advantages of connection oriented networks and the flexibility of connectionless networks. They provide QoS guaranteed services with a lower computational complexity and operational cost compared with IP networks with ATM connectivity structure. The most important advantage of MPLS networks is they can do traffic engineering for load balancing, which is able to improve the network performance in long run. MPLS offers the following benefits [1]: Enables service providers to keep up with internet growth Brings layer 2 benefits to layer 3, such as traffic engineering capability Supports multivendor solutions Architectural flexibility. The MPLS architecture is remarkably for its flexibility: Data can be transferred over any combination of Layer 2 technologies. Support is offered for all layers 3 protocols. Scaling is possible well beyond anything offered in today s networks. Figure 1: MPLS Architecture 1.1 MPLS Operation: MPLS [2] works by prefixing packets with an MPLS header, containing one or more labels. This is called a label stack. Each label stack entry contains four fields: A 20 bit label value. A 3-bit Traffic class field for QoS priority(experimental) and ECN(Explicit Congestion Notification) 384
2 A 1 bit bottom of stack flag. If this is set, it signifies that the current label is the last in the stack. An 8 bit TTL (Time to Live) field. These MPLS labelled packets are switched after a label lookup/switch instead of a lookup into the IP table. Label lookup and label switching are faster than a routing table or RIB (Routing Information Base) lookup because they take place directly within the switched fabric and not the CPU. Routers that perform routing based only on the label are called Label Switch Routers (LSRs). The entry and exit points of an MPLS network are called label edge routers (LER s) which, respectively, push an MPLS label onto an incoming packet and pop it off the outgoing packet. Labels are distributed between LER s and LSR s using the Label Distribution Protocol (LDP). LSR s in an MPLS network regularly exchange label and reachability information with each other using standardized procedures in order to build a complete picture of the network they can then use to forward packets. Label Switched paths (LSPs) are established by the network operator for a variety of purposes, such as to create network based IP virtual private networks or to route traffic along specified paths through the network. When an unlabeled packet enters the ingress router and needs to be passed on to an MPLS tunnel, the router first determines the forwarding equivalence class (FEC) the packet should be in and then inserts one or more labels in the packet s newly created MPLS header. The packet is then passed onto the next hop router for this tunnel. When a labelled packet is received by an MPLS Router, the topmost label is examined. least loaded path can balance the network load. There exist many QoS routing protocols in MPLS networks. All of them can find an optimal path by using their path selection algorithms. In this paper we focus on Bandwidth guaranteed paths and we are introducing a MPLS Routing algorithm called Bandwidth guaranteed MPLS Routing Algorithm (BGMRA) is provided to get performance improvement based on Time, path length, call back ratio and maximum flow. The rest of the paper is organized as follows. In section II, we presents related work. Our proposed routing algorithm is described in section III. Section IV contains the performance evaluation. Conclusions are set out in section V. 2. RELATED WORK First we review some of the most popular algorithms, such as the Minimum Hop algorithm (MHA), the widest shortest path algorithm (WSP),the minimum interference routing algorithm (MIRA), and Bandwidth guaranteed MPLS Routing Algorithm (BGMRA). These algorithms take into account the topological layout of the ingress and egress points of the network. 2.1 Min-Hop Algorithm The Min-Hop algorithm [5] chooses the path with the least number of links between source and destination. This scheme based on Dijkstra s algorithm is simple and computationally efficient. However, using MHA can result in heavily loaded bottleneck links in the network, as it tends to overload some links leaving others underutilized. 2.2 Widest Shortest path algorithm Figure 1: MPLS Cloud Based on the contents of the Label a swap, push or pop operation can be performed on the packet s label stack. Routers can have prebuilt lookup tables that tell them which kind of operation to do based on the topmost label of the incoming packet so they can process the packet very quickly. In a swap operation the label is swapped with a new label, and the packet is forwarded along the path associated with the new label. To ensure end to end QoS guarantees [3],[4], QoS routing protocols usually impose a minimum QoS requirement on the path for data transmission. Restricting the hop count of the path being elected can reduce the resource consumption while selecting the The widest shortest path algorithm [6] is an improvement of the Min- Hop algorithm, as it attempts to balance the network load. WSP chooses a feasible path with minimum number of links, and if there are multiple such paths, the one with the largest residual bandwidth, thus discouraging the use of already heavily loaded links. However, WSP still has the same drawbacks as MHA since the path selection is performed among the shortest feasible paths that are used until saturation before switching to longer feasible paths. 2.3 Shortest Widest Path Algorithm The shortest widest path algorithm [7] selects the path with the maximum available bandwidth and if there are more than one such path, the one with the least number of hops is chosen. SWP also create bottlenecks for future LSPs and lead to network under utilization. 2.4 Minimum Interference Routing Algorithm The key idea of MIRA [8] is to route a new connection over a path which least interferes with 385
3 possible future requests. MIRA exploits the knowledge of ingress-egress pairs in finding a feasible path. The main aim is to route a new connection through a path that does not interfere with a path that may be critical to satisfy a future demand. Here, a critical link, is identified as a link that can decrease the maximum flow (maxflow) value of one or more ingress-egress pair if critical link has been selected in a path. The algorithm attempts to avoid the critical links as much as possible during a path selection procedure. In Fact, MIRA considers the amount of interference on a particular ingress-egress pair (s,d) as the reduction in the maximal available bandwidth between (s,d).[9] With this type of algorithm, the path lengths can become long enough to make path practically unusable. 3. PROPOSED ALGORITHM This section presents a New Bandwidth Guaranteed QOS Routing Algorithm for MPLS Networks. This is our proposed algorithm called Bandwidth Guaranteed MPLS Routing Algorithm (BGMRA). To explain BGMRA consider a network with n nodes (routers). To setup the paths a subset of these routers is considered to be the ingress-egress routers. A path setup request arrives at the ingress router in which an explicit route for the request is computed locally. The ingress router set up the path to the egress and reserves resources on each link along the path. For computation of explicit route, ingress router requires to know current network topology and links reserved bandwidth which we are assuming to be known. The notations used in this paper are as follows: Consider a MPLS network to be undirected graph G(V,E) where V and E are set of nodes and links respectively. Let a LSP request R = [S, D, B] which specifies the source, destination and amount of Bandwidth required respectively, where S,D V. Path requests are considered one at a time and there is no prior knowledge of future requests. Our optimization goal is as follows: to determine a feasible path for each request which performs better in terms of call blocking ratio, path length, CPU time and maximum flow[10]. Our proposed algorithm is one of link constrained and path constrained routing. The designing objectives, weight calculation, path selection and the details of the routing algorithm for our proposed algorithm are described here: 3.1 Designing Objectives Minimize interference levels among sourcedestination node pairs, in order to reserve more resource for future bandwidth demands. Balancing traffic loads through underutilized paths in order to reduce network congestion. CC(jj) = Reduce algorithm complexity. 3.2 Calculation of Critical links TTTTTTTTTT dddddddddddddd pppppp llllllll LLLLLLLLLL h oooo aaaaaa pppppppppppppppp cccccccccccccccccccccc (1) From (1), critical links directly depends on the value of total demands per link. Higher value of criticality means that numbers of future requests are possible through these ingress-egress routers. So, avoid critical links with higher values to reduce network congestion. It also satisfies the first objective to minimize interference levels among source-destination node pairs. WW(jj) = 3.3 Calculation of Link Weight Here weight of link j could be determined by: CC (LL) RRRRRRRRRRRRRRRR bbbbbbbbbbbbbbbb h oooo tthee llllllll From (2), Weight of the link is directly proportional to critical links and hence higher the value of criticality, higher will be the weight of that particular link (j). Also, it is inversely proportional to the Residual bandwidth, so when residual bandwidth is less, weight of the link will be more. So in the proposed algorithm we are avoiding link with more weight, so as to balance traffic loads through under- utilized paths.[10] 3.4 Calculation of path The weight of path belonging to source destination node pair {S,D} is obtained by (3) (2) WW{SS, DD} = WW(jj ) wwheeeeee {jj LL{SS, DD}} (3) This path weight is used to route LSP from ingress node S to egress node D. The constraint is to avoid the path with more path weight. However, if there are many result paths with the same minimum path weight, the algorithm would pick a shortest path between those result paths in order to reserve network bandwidth. 3.5 Algorithm steps The algorithm steps are shown in Figure 3: Optimize the network resource utilization using Dijkstra s algorithm. Figure 3: Algorithm of BGMRA algorithm. 386
4 3.6 Simulation Test For simulation study, we develop extensive routing simulation program on MATLAB (R2011a). The topology adopted from [3],[1] is called MIRA topology and consists of 15 nodes as shown in Fig. 4(a). All the links are unidirectional. There are two different kinds of links in the network: the thin links have the capacity of 1200 units and the thick links have the capacity of 4800 units. A subset of the nodes in the network acts as the ingress- egress pairs. In the MIRA topology, four ingress egress pairs are considered, which are (1,13), (5,9), (4,2), (5,15). The second topology adopted from [5] which consists of 18 nodes and 30 links and is presented in Fig 4 (b). There are two different kinds of links in the network: the thin links have the capacity of 1200 units and the thick links have the capacity of 4800 units. These pairs in this topology are considered as ingress- egress pairs which are (1,17), (2,16) and (4,15). Figure 5: Simulation Program 4. PERFORMANCE EVALUATION Figure 4: MIRA Topology 1 From the simulation program, there are 4 measured parameters to test the performance of algorithms, i.e, call back ratio, mean length, maximum flow and CPU calculation time. These parameters can be obtained from(4) to (7). MPLS Routing algorithm must have low call back ratio, less mean path length, high maximum flow and low CPU calculation time CCCCCCCC bbbbbbbb RRRRRRRRRR = NNNNNNNNNNNN oooo rrrrrrrrrrrrrrrr rrrrrrrrrrrrrrrr TTTTTTTTTT nnnnnnnnnnnn oooo rrrrrrrrrrrrrrrr (4) MMMMMMMM LLLLLLLLLLh = TTTTTTTTTT nnnnnnnn eeee oooo llllllllll TTTTTTTTTT nnnnnnnnnnnn oooo rrrrrrrrrrrrrrrr NNNNNNNNNNNN oooo rrrrrrrrrrrrrrrr rrrrrrrrrrrrrrrr (5) MMMMMMMMMMMMMM FFFFFFFF = mmmmmmmm (aaaaaaaaaaaaaaaaaa bbbbbbbbbbbbbbbbh) (6) CCCCCC TTTTTTTT = TTTTTTTTTT SSSSSSSSSSSSSSSSSSSS TTTTTTTT (7) Figure 4(b): Network Topology 2 Flowchart of the simulation program is shown in Fig. 5 [13] 4.1 Results We have performed simulations using each of these two topologies and found better results in terms of Call back Ratio. Fig 6 and Fig. 7 shows the result of simulation on MIRA Topology and unflat topology 2. Fig. 6 (a) and 7 (a) show the mean path length. In these figures mean path length is plotted as a function of the number of requests. We observed that the requests are following longer path in the beginning to avoid interference with the paths which are more critical and finally to avoid long paths, we have used Dijkstra algorithm to reduce the average path length if two or more than two such paths exist. Fig.6 (b) and 7(b) shows plots for call blocking ratio versus number of requests. 387
5 We observed that with increasing number of requests, the call blocking ratio increases consistently. But our algorithm shows better results with more number of nodes i.e with the second topology as compared to first topology. Fig 6 and 7 shows plots for Maximum Flow. Maximum available Flow is decreasing as the number of requests is increasing.our algorithm is showing better results for more complex unflat topology considering 3000 requests. Fig 6 (d) and 7 (d) shows plots for CPU Time (in seconds) versus number of requests. We observed that the performance of CPU Time is increasing as the number of requests is increasing but our proposed algorithm shows better performance of CPU Time for more complex network with more nodes (which is shown in fig 7 (d)). 6 (a) Performance of Length 6 (d) Time Figure 6: Simulation Result about Topology 1 (a) Performance of Mean Path length (b) Performance of Call Back Ratio (c) Performance of Maximum Flow (d) Performance of CPU Time. 7 (a) Performance of Time 40 Length 7.9 Performance of Length (b) 10 Length Call Back Ratio Performance of Call Back Ratio 7 (b) Performance of Call Back Ratio 6(c ) 2000 Performance of Maximum Flow Call Back Ratio Maximum Flow
6 7 (c ) 1940 Performance of Maximum Flow [2] E. Rosen, A. Vishwanathan, R. Callon, Multiprotocol Label Switching Architecture, in: IETF RFC 3031, January Maximum Flow [3]S. Chen, K.Nahrstedt, An overview of quality of service routing for the next generation high speed networks: problems and solutions, IEEE Network 12 (6)(1988) [4] Bin Wang, Xu Su, C.L.P Chen, A new bandwidth guaranteed routing algorithm for MPLS traffic Engineering, in: IEEE International Conference on Communications, ICC 2002, vol 2, 2002, pp (d) Time Performance of Time [5] D.O.Awduche, L.Berger, D.Gain, T.Li, G.Swallow, and V.Srinivasan. Extensions to RSVP for LSP Tunnels. In Internet Draft draft-ietf-mpls-rsvp-lsp-tunnel-04.txt, September [6] ] R.Guerin, D.Williams, and A.Orda. QOS Routing Mechanisms and OSPF Extensions. In Proceedings of Globecom, Figure 7: Simulation Result about Topology 2 (a) Performance of Mean Path length (b) Performance of Call Back Ratio (c)performance of Maximum Flow (d) Performance of CPU Time. Simulation results show that we have optimized goal with a simple path computation technique. Our algorithm can lead to improved performance and provides better network utilization for Bandwidth guaranteed constrained applications since it selects the uncongested and shortest path to reach the destination node. 5. CONCLUSION In this paper, we have proposed a new Bandwidth guaranteed LSP Routing algorithm for MPLS networks, called BGMRA. Paths are selected based on critical links so as to minimize interference with the future requests. Simulation experiments have been conducted to examine the performance of new algorithms using two different network topologies. We observed that BGMRA performs better for complex network in terms of call blocking ratio. REFERENCES [1] CISCO IOS Release 12.0 Switching Services Configuration Guide [7] P.STEEKISTE; Q. MA. On Path Selection for Traffic with Bandwidth Guarantees, in proceedings of the IEEE International conference of Network Protocols, October [8] M. Kodialam, T.V. Lakshman, Minimum Interference Routing with applications to MPLS traffic engineering, IEEE INFOCOM 2000, March [9] Koushik Kar, Murali Kodialam, T. V. Lakshman, Minimum Interference Routing of Bandwidth Guaranteed Tunnels with MPLS Traffic Engineering Applications, IEEE Journal On Selected Areas In Communications, VOL. 18, No. 12, December [10] Alidadi A., Mahdavi M., Hashmi M.R., A New Low- Complexity QOS Routing Algorithm for MPLS Traffic Engineering, Proceedings of the 2009 IEEE 9 th Malaysia International Conference on Communications December 2009 Kuala Lumpur Malaysia, Pg [11] Kotti, A. Hamza, R. Bouleimen, K, Bandwidth Constrained Routing Algorithm for MPLS Traffic Engineering, Networking and Services, ICNS, Third International Conference on, June 2007 [12] Gopalan, K, and Chiueh, T.C. and Lin, Y.J, Load balancing routing with bandwidth- delay guarantees, IEEE Commiuiicurionr Magazine, Vol 42, pp , June [13] Piyaporn Krachodnok, Constrained Based Routing with Maximize Residual Bandwidth and Link Capacity- Minimize Total Flows Routing Algorithm for MPLS Networks, IEEE, ICICS 2005, Pg
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 informationRecent 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 informationWAN Topologies MPLS. 2006, Cisco Systems, Inc. All rights reserved. Presentation_ID.scr. 2006 Cisco Systems, Inc. All rights reserved.
MPLS WAN Topologies 1 Multiprotocol Label Switching (MPLS) IETF standard, RFC3031 Basic idea was to combine IP routing protocols with a forwarding algoritm based on a header with fixed length label instead
More informationGuaranteed 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 informationAnalysis 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 informationA 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 informationPath 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 informationIntroducing Basic MPLS Concepts
Module 1-1 Introducing Basic MPLS Concepts 2004 Cisco Systems, Inc. All rights reserved. 1-1 Drawbacks of Traditional IP Routing Routing protocols are used to distribute Layer 3 routing information. Forwarding
More informationMPLS - 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 informationImplementation 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 informationDESIGN AND VERIFICATION OF LSR OF THE MPLS NETWORK USING VHDL
IJVD: 3(1), 2012, pp. 15-20 DESIGN AND VERIFICATION OF LSR OF THE MPLS NETWORK USING VHDL Suvarna A. Jadhav 1 and U.L. Bombale 2 1,2 Department of Technology Shivaji university, Kolhapur, 1 E-mail: suvarna_jadhav@rediffmail.com
More informationA 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 informationInvestigation 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 informationPROTECTION 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 informationRSVP- 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 informationProject 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 informationOnline Traffic Engineering using Least Interference Optimization
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: +27
More informationMPLS 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 informationMulti Protocol Label Switching (MPLS) is a core networking technology that
MPLS and MPLS VPNs: Basics for Beginners Christopher Brandon Johnson Abstract Multi Protocol Label Switching (MPLS) is a core networking technology that operates essentially in between Layers 2 and 3 of
More informationCisco Configuring Basic MPLS Using OSPF
Table of Contents Configuring Basic MPLS Using OSPF...1 Introduction...1 Mechanism...1 Hardware and Software Versions...2 Network Diagram...2 Configurations...2 Quick Configuration Guide...2 Configuration
More informationComputer 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 informationExperiences with Class of Service (CoS) Translations in IP/MPLS Networks
Experiences with Class of Service (CoS) Translations in IP/MPLS Networks Rameshbabu Prabagaran & Joseph B. Evans Information and Telecommunications Technology Center Department of Electrical Engineering
More informationBuilding 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 informationEnterprise Network Simulation Using MPLS- BGP
Enterprise Network Simulation Using MPLS- BGP Tina Satra 1 and Smita Jangale 2 1 Department of Computer Engineering, SAKEC, Chembur, Mumbai-88, India tinasatra@gmail.com 2 Department of Information Technolgy,
More informationMPLS Concepts. Overview. Objectives
MPLS Concepts Overview This module explains the features of Multi-protocol Label Switching (MPLS) compared to traditional ATM and hop-by-hop IP routing. MPLS concepts and terminology as well as MPLS label
More informationMPLS is the enabling technology for the New Broadband (IP) Public Network
From the MPLS Forum Multi-Protocol Switching (MPLS) An Overview Mario BALI Turin Polytechnic Mario.Baldi@polito.it www.polito.it/~baldi MPLS is the enabling technology for the New Broadband (IP) Public
More informationVoIP 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 informationLesson 13: MPLS Networks
Slide supporting material Lesson 13: MPLS Networks Giovanni Giambene Queuing Theor and Telecommunications: Networks and Applications 2nd edition, Springer All rights reserved IP Over ATM Once defined IP
More informationAPPLICATION NOTE 211 MPLS BASICS AND TESTING NEEDS. Label Switching vs. Traditional Routing
MPLS BASICS AND TESTING NEEDS By Thierno Diallo, Product Specialist Protocol Business Unit The continuing expansion and popularity of the Internet is forcing routers in the core network to support the
More informationRecovery Modeling in MPLS Networks
Proceedings of the Int. Conf. on Computer and Communication Engineering, ICCCE 06 Vol. I, 9-11 May 2006, Kuala Lumpur, Malaysia Recovery Modeling in MPLS Networks Wajdi Al-Khateeb 1, Sufyan Al-Irhayim
More informationAn 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 informationMPLS-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 informationIntegrating Internet Protocol (IP) Multicast over Multiprotocol Label Switching (MPLS) for Real Time Video Conferencing Data Transmission
Integrating Internet Protocol (IP) Multicast over Multiprotocol Label Switching (MPLS) for Real Time Video Conferencing Data Transmission Majid Ashraf Derwesh Department of Electronics and Communication
More informationQuality 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 informationQuality 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 informationA 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 informationReview on QoS Improvement with MPLS Mechanism in NGN
Review on QoS Improvement with MPLS Mechanism in NGN Kanchan Dhuri 1, Alam Shaikh 2 P.G. Student, Department of Electronics and Telecommunication, Saraswati College of Engineering, Kharghar, Navi Mumbai,
More informationHow 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 informationAnalysis of Link Utilization in MPLS Enabled Network using OPNET IT Guru
Analysis of Link Utilization in MPLS Enabled Network using OPNET IT Guru Anupkumar M Bongale Assistant Professor Department of CSE MIT, Manipal Nithin N Assistant Professor Department of CSE MIT, Manipal
More informationA 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 informationPerformance 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 informationMikroTik RouterOS Introduction to MPLS. Prague MUM Czech Republic 2009
MikroTik RouterOS Introduction to MPLS Prague MUM Czech Republic 2009 Q : W h y h a v e n 't y o u h e a r d a b o u t M P LS b e fo re? A: Probably because of the availability and/or price range Q : W
More informationMPLS Based Recovery Mechanisms
MPLS Based Recovery Mechanisms Master Thesis Johan Martin Olof Petersson UNIVERSITY OF OSLO May 2005 2 Foreword This thesis is part of my Candidatus Scientiarum studies in communication systems at the
More informationComparative Analysis of Mpls and Non -Mpls Network
Comparative Analysis of Mpls and Non -Mpls Network Madhulika Bhandure 1, Gaurang Deshmukh 2, Prof. Varshapriya J N 3 1, 2, 3 (Department of Computer Science and IT, VJTI, Mumbai-19 ABSTRACT A new standard
More informationDistributed 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 informationMaster Course Computer Networks IN2097
Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Master Course Computer Networks IN2097 Prof. Dr.-Ing. Georg Carle Christian Grothoff, Ph.D. Chair for
More informationIP 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 informationSBSCET, Firozpur (Punjab), India
Volume 3, Issue 9, September 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Layer Based
More informationMPLS Multiprotocol Label Switching
MPLS Multiprotocol Label Switching José Ruela, Manuel Ricardo FEUP Fac. Eng. Univ. Porto, Rua Dr. Roberto Frias, 4200-465 Porto, Portugal INESC Porto, Campus da FEUP, Rua Dr. Roberto Frias, 378, 4200-465
More informationImplement 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 informationMPLS/BGP Network Simulation Techniques for Business Enterprise Networks
MPLS/BGP Network Simulation Techniques for Business Enterprise Networks Nagaselvam M Computer Science and Engineering, Nehru Institute of Technology, Coimbatore, Abstract Business Enterprises used VSAT
More informationMultiprotocol Label Switching (MPLS)
Multiprotocol Label Switching (MPLS) รศ.ดร. อน นต ผลเพ ม Asso. Prof. Anan Phonphoem, Ph.D. anan.p@ku.ac.th http://www.cpe.ku.ac.th/~anan Computer Engineering Department Kasetsart University, Bangkok, Thailand
More informationHPSR 2002 Kobe, Japan. Towards Next Generation Internet. Bijan Jabbari, PhD Professor, George Mason University
HPSR 2002 Kobe, Japan Towards Next Generation Internet Bijan Jabbari, PhD Professor, George Mason University May 28, 2002 Overview! Scalability and Interoperability in Internet! Impediments in Deployment
More informationISTANBUL. 1.1 MPLS overview. Alcatel Certified Business Network Specialist Part 2
1 ISTANBUL 1.1 MPLS overview 1 1.1.1 Principle Use of a ATM core network 2 Overlay Network One Virtual Circuit per communication No routing protocol Scalability problem 2 1.1.1 Principle Weakness of overlay
More informationOPNET simulation of voice over MPLS With Considering Traffic Engineering
Master Thesis Electrical Engineering Thesis no: MEE 10:51 June 2010 OPNET simulation of voice over MPLS With Considering Traffic Engineering KeerthiPramukh Jannu Radhakrishna Deekonda School of Computing
More informationMulti Protocol Label Switching with Quality of Service in High Speed Computer Network
Multi Protocol Label Switching with Quality of Service in High Speed Computer Network Jitendra Joshi, Sonali Gupta, Priti Gupta, Nisha Singh, Manjari Kumari Department of Computer Science and Engineering
More informationTRAFFIC 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 informationSupporting 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 informationFigure 1: Network Topology
Improving NGN with QoS Strategies Marcel C. Castro, Tatiana B. Pereira, Thiago L. Resende CPqD Telecom & IT Solutions Campinas, S.P., Brazil E-mail: {mcastro; tatibp; tresende}@cpqd.com.br Abstract Voice,
More informationInternetworking 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 informationBandwidth Management in MPLS Networks
School of Electronic Engineering - DCU Broadband Switching and Systems Laboratory 1/17 Bandwidth Management in MPLS Networks Sanda Dragos & Radu Dragos Supervised by Dr. Martin Collier email: dragoss@eeng.dcu.ie
More informationHow Routers Forward Packets
Autumn 2010 philip.heimer@hh.se MULTIPROTOCOL LABEL SWITCHING (MPLS) AND MPLS VPNS How Routers Forward Packets Process switching Hardly ever used today Router lookinginside the packet, at the ipaddress,
More informationDynamic 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 informationOverview. QoS, Traffic Engineering and Control- Plane Signaling in the Internet. Telematics group University of Göttingen, Germany. Dr.
Vorlesung Telematik (Computer Networks) WS2004/05 Overview QoS, Traffic Engineering and Control- Plane Signaling in the Internet Dr. Xiaoming Fu Recent trends in network traffic and capacity QoS principles:
More informationEnhanced 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 informationQoS Strategy in DiffServ aware MPLS environment
QoS Strategy in DiffServ aware MPLS environment Teerapat Sanguankotchakorn, D.Eng. Telecommunications Program, School of Advanced Technologies Asian Institute of Technology P.O.Box 4, Klong Luang, Pathumthani,
More informationDYNAMIC 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 informationMPLS 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 informationHow To Understand The Benefits Of An Mpls Network
NETWORKS NetIron XMR 16000 NETWORKS NetIron XMR 16000 NETWORKS NetIron XMR 16000 Introduction MPLS in the Enterprise Multi-Protocol Label Switching (MPLS) as a technology has been around for over a decade
More informationDisjoint 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 informationMENTER Overview. Prepared by Mark Shayman UMIACS Contract Review Laboratory for Telecommunications Science May 31, 2001
MENTER Overview Prepared by Mark Shayman UMIACS Contract Review Laboratory for Telecommunications Science May 31, 2001 MENTER Goal MPLS Event Notification Traffic Engineering and Restoration Develop an
More informationCourse Description. Students Will Learn
Course Description The next generation of telecommunications networks will deliver broadband data and multimedia services to users. The Ethernet interface is becoming the interface of preference for user
More informationPerformance Evaluation of Quality of Service Assurance in MPLS Networks
114 Performance Evaluation of Quality of Service Assurance in MPLS Networks Karol Molnar, Jiri Hosek, Lukas Rucka, Dan Komosny and Martin Vlcek Brno University of Technology, Communication, Purkynova 118,
More informationA 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 informationQoS Implementation For MPLS Based Wireless Networks
QoS Implementation For MPLS Based Wireless Networks Subramanian Vijayarangam and Subramanian Ganesan Oakland University, Rochester, Michigan Abstract : Voice has been the primary application in wireless
More informationHow To Make A Network Secure
1 2 3 4 -Lower yellow line is graduate student enrollment -Red line is undergradate enrollment -Green line is total enrollment -2008 numbers are projected to be near 20,000 (on-campus) not including distance
More informationRFC 2547bis: BGP/MPLS VPN Fundamentals
White Paper RFC 2547bis: BGP/MPLS VPN Fundamentals Chuck Semeria Marketing Engineer Juniper Networks, Inc. 1194 North Mathilda Avenue Sunnyvale, CA 94089 USA 408 745 2001 or 888 JUNIPER www.juniper.net
More informationImplementing VPN over MPLS
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 10, Issue 3, Ver. I (May - Jun.2015), PP 48-53 www.iosrjournals.org Implementing VPN over
More information- Multiprotocol Label Switching -
1 - Multiprotocol Label Switching - Multiprotocol Label Switching Multiprotocol Label Switching (MPLS) is a Layer-2 switching technology. MPLS-enabled routers apply numerical labels to packets, and can
More informationImplementing 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 informationMPLS Basics. For details about MPLS architecture, refer to RFC 3031 Multiprotocol Label Switching Architecture.
Multiprotocol Label Switching (), originating in IPv4, was initially proposed to improve forwarding speed. Its core technology can be extended to multiple network protocols, such as IPv6, Internet Packet
More informationQoS Performance Evaluation in BGP/MPLS VPN
1 QoS Performance Evaluation in BGP/MPLS VPN M. C. Castro, N. A. Nassif and W. C. Borelli 1 Abstract-- The recent exponential growth of the Internet has encouraged more applications, users and services
More informationA Simulation Study of Effect of MPLS on Latency over a Wide Area Network (WAN)
A Simulation Study of Effect of MPLS on Latency over a Wide Area Network (WAN) Adeyinka A. Adewale, Samuel N. John, and Charles Ndujiuba 1 Department of Electrical and Information Engineering, Covenant
More informationMPLS Architecture for evaluating end-to-end delivery
International Journal of Scientific and Research Publications, Volume 2, Issue 11, November 2012 1 MPLS Architecture for evaluating end-to-end delivery Nikita Wadhera Lovely Professional University Abstract-
More informationQoS Switching. Two Related Areas to Cover (1) Switched IP Forwarding (2) 802.1Q (Virtual LANs) and 802.1p (GARP/Priorities)
QoS Switching H. T. Kung Division of Engineering and Applied Sciences Harvard University November 4, 1998 1of40 Two Related Areas to Cover (1) Switched IP Forwarding (2) 802.1Q (Virtual LANs) and 802.1p
More informationA 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 informationVirtual Leased Lines - Martini
Virtual Lease Lines - Martini Virtual Leased Lines - Martini Martini Drafts draft -martini-l2circuit-encap-mpls -04.txt defines the handling and encapsulation of layer two packets. draft -martini-l2circuit-trans-mpls
More informationADAPTIVE 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 informationSupporting 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 informationMPLS. A Tutorial. Paresh Khatri. paresh.khatri@alcatel-lucent.com.au
MPLS A Tutorial Paresh Khatri paresh.khatri@alcatel-lucent.com.au Agenda 1. MPLS overview and LSP types 2. Distribution Protocol (LDP) 3. Questions Introduction Paresh Khatri (paresh.khatri@alcatel-lucent.com.au)
More informationENHANCING 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 informationMPLS Traffic Engineering - A Choice Of Signaling Protocols
MPLS Traffic Engineering - A Choice Of Signaling Protocols Analysis of the similarities and differences between the two primary MPLS label distribution protocols: RSVP and CR-LDP Paul Brittain, pjb@metaswitch.com
More informationMPLS-based Virtual Private Network (MPLS VPN) The VPN usually belongs to one company and has several sites interconnected across the common service
Nowdays, most network engineers/specialists consider MPLS (MultiProtocol Label Switching) one of the most promising transport technologies. Then, what is MPLS? Multi Protocol Label Switching (MPLS) is
More information2004 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 informationHow 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 informationService Assurance Tools
Managing MPLS with Service Assurance Tools Whitepaper Prepared by www.infosim.net August 2006 Abstract MPLS provides the foundation for the offering of next-generation services and applications such as
More informationThe 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 informationAn End-to-End QoS Architecture with the MPLS-Based Core
An End-to-End QoS Architecture with the MPLS-Based Core Victoria Fineberg, PE, Consultant, fineberg@illinoisalumni.org Cheng Chen, PhD, NEC, CChen@necam.com XiPeng Xiao, PhD, Redback, xiaoxipe@cse.msu.edu
More informationCisco IOS MPLS configuration
Introduction Cisco IOS MPLS configuration MPLS can be configured over different platforms It can be implemented on a purely router-based Internet backbone over an ATM switchednetwork -MPLS enables an ATM
More informationA Review on Quality of Service Architectures for Internet Network Service Provider (INSP)
A Review on Quality of Service Architectures for Internet Network Service Provider (INSP) Herman and Azizah bte Abd. Rahman Faculty of Computer Science and Information System Universiti Teknologi Malaysia
More information