Multiprotocol Label Switching Traffic Engineering Research Articles

MPLS Traffic Engineering in ISP Network

Multi Protocol Label Switching (MPLS) is an innovative and vibrant technology. The most famous applications of MPLS technology are MPLS VPN, MPLT Traffic engineering and MPLS QoS and Any Transport over MPLS (AToM). This study addressed only MPLS Traffic engineering, which is one of the driving factors of deploying MPLS in service provider networks. This research consists of two main sections; in the first section basic concepts of MPLS have been reviewed and in the second section, implementation of the MPLS based ISP network, configuration and verification of the results are covered. Simulation results show that on large service provider networks, no other technology can engineer traffic as efficiently as MPLS does. This research aims to provide guidelines for network engineers for efficiently engineering network traffic in the service provider network.

A coarse-grained differentiated routing algorithm in multi-protocol label switching traffic engineering

A new coarse-grained differentiated least interference routing algorithm (CDLI) with DiffServ-Aware was presented. This algorithm is composed of off-line and on-line stages, taking into account both real-time traffic and best-effort traffic. Off-line stage is to determine the shortest path set disjointed path (DP) database for real-time traffic, and to identify link critical value by traffic profile information of real-time traffic and DP database. On-line stage is at first to select route in the DP database for real-time traffic, if there is no path to meet the needs, the dynamic routing will be operated. On-line routing algorithm chooses the relatively short path for real-time traffic to meet their bandwidth requirements, and for best-effort traffic it chooses a lighter load path. The simulation results show that compared with the dynamic online routing algorithm (DORA) and constrained shortest path first (CSPF) algorithm, the new algorithm can significantly improve network throughput and reduce the average path length of real-time traffic. This guarantees quality of service (QoS) of real-time traffic while improving the utilization of network resources.

Using policy-based MPLS management architecture to improve QoS on IP network

Multi-Protocol Label Switching (MPLS) is in the process of standardization by the Internet Engineering Task Force (IETF). It is regarded as a technology for traffic engineering and QoS in IP-networks. We proposed an IETF Policy-based Network Management Framework and policies with MPLS specific classes. It uses a three-level policy architecture, which includes managing on device, network, and service level using policies for supporting Inter-serve and Diff-serve based end-to-end QoS in the Internet. A prototyping of policy-based management system for MPLS Traffic Engineering is operating on MPLS network elements. Several experiments illustrate the efficiency and feasibility in this architecture. The results show it can reduce the time of the setup of MPLS traffic engineering tunnel over hops and MPLS traffic engineering tunnel deletion. The proposed integrated policy based management architecture will allow network service providers to offer both quantitative and qualitative services while optimizing the use of underlying network resources.

Study of Minimum Interference Routing Algorithm for MPLS Traffic Engineering

Multiprotocol Label Switching (MPLS) enables the deployment of Internet traffic engineering to be sim- ple and efficient by using explicit routing of Label Switching Path (LSP). Hence, the LSP routing algorithm becomes the core and hot topic of traffic engineering. This paper analyzes the key ideas of Minimum Interference Routing Algorithm (MIRA) for LSP routing and then surveys the current improved schemes of MIRA. According to their technical methods, they are classified as reconfirming critical links class, utilizing traffic profile information class, adding admission control class, and solving multiple Quality of Service constraints class. After the key idea is analyzed for each class, their typical algorithms are presented and their advantages, suitable environments and shortcomings with a detailed comprehensive comparison are discussed. The end of the paper points out the future

M_CSPF: A Scalable CSPF Routing Scheme with Multiple QoS Constraints for MPLS Traffic Engineering

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

Localized Mobility Management in MPLS-based Access Networks

The continuous efforts made towards efficient mobility management in next-generation wireless networks are one of the major challenges for next-generation mobile systems. To track host mobility, the IETF has developed some mobility management protocols such as Mobile IP and Proxy Mobile IPv6. These protocols set up a tunnel to forward packets to the mobile node while the user is away from its home network. The tunneling method provided by Multi-Protocol Label Switching can be profitably used to take advantage of the Multi-Protocol Label Switching traffic engineering capability to achieve fast-reroute when a mobile node changes its point of attachment to the network. Moreover, service disruption during handoffs causes excessive packet loss that needs to be minimized to support quality of service requirements of emerging applications. We present a performance evaluation and numerical results of the most representative host-based and network-based mobility management approaches. We highlight the importance of the tunneling method with special attention to those protocols that have integrated Multi-Protocol Label Switching in its access network.

RATES: a server for MPLS traffic engineering

It has been suggested that one of the most significant reasons for multiprotocol label switching (MPLS) network deployment is network traffic engineering. The goal of traffic engineering is to make the best use of the network infrastructure, and this is facilitates by the explicit routing feature of MPLS, which allows many of the shortcomings associated with current IP routing schemes to be addressed. This article describes a software system called Routing and Traffic Engineering Server (RATES) developed for MPLS traffic engineering. It also describes some new routing ideas incorporated in RATES for MPLS explicit path selection. The RATES implementation consists of a policy and flow database, a browser-based interface for policy definition and entering resource provisioning requests, and a Common Open Policy Service protocol server-client implementation for communicating paths and resource information to edge routers. RATES also uses the OSPF topology database for dynamically obtaining link state information. RATES can set up bandwidth-guaranteed label-switched (LSPs) between specified ingress-egress pairs. The path selection for LSPs is on a new minimum-interference routing algorithm aimed at making the best use of network infrastructure in an online environment where LSP requests arrive one by one with no a priori information about future requests. Although developed for an MPLS application, the RATES implementation has many similarities in components to an intradomain differentiated services bandwidth broker.