Label Switched Paths Research Articles

Analisis Routing Protocol Is-Is Dengan MPLS Traffic Engineering Menggunakan GNS3

In the digital era is , the internet becomes a necessity . the increasing number of internet usage by various parties encourages ISPs to improve their service quality . To overcome the problem the IETF has introduced a service Multiprotcol . MPLS-TE allows for schemes TE where the tip router of the label switched path (LSP) can calculate the many routes efficiently through the network to the router tip of the tail of the LSP. TE consists of three steps principal that is the size , model, and control . MPLS-TE allows for schemes TE where the tip router of the label switched path (LSP) can calculate the many routes efficiently through the network to the router tip of the tail of the LSP. ISIS is one of the routing protocol that was created for the OSI mode, using the method of link state as a method of collecting the route , ISIS also will perform the collection of information and the status of all the links that exist in the network . Analysis of the IS-IS routing protocol with the Multiprotocol label switch Traffic Engineering based on the parameters of quality of service (QoS), namely throughput and packet loss where the simulation uses the GNS3 network emulator. The test results prove that the values of throughput and packet loss are not much different.

Service-aware LSP selection with fuzzy based packet scheduling scheme for non-real time traffics

An essential solution is available in Multi-protocol label switching (MPLS), which solve the problems faced by present-day networks: speed, scalability, quality-of-service (QoS) management, and traffic engineering. This paper is an extension of work on Fuzzy based Packet Scheduling Algorithm (FPSA) combined with Packets Processing Algorithm (PPA) in an Internet Protocol/Multi-Protocol Label Switching (IP/MPLS) networks. This will make provision for an intelligent service to the Label Switched Path (LSP) in MPLS networks. Several research work have been proposed on the MPLS Traffic Engineering. However, it is still imperative to further research on the effect of bandwidth increment on the core network using different mechanisms such as the analytical model of MPLS, expert-based packet scheduling algorithm for MPLS QoS support. Since MPLS is not able to provide intelligent routing, it is necessary to propose an intelligent expert system of FPSA combined with PPA. And analytical model of packet forwarding in the MPLS network would be given to provide suitable solution to traffic congestion and reliable services. Furthermore, the network model created using Network Simulator (NS 2), which carries non-real time application such as File Transfer Protocol (FTP) with bandwidth variations. The results obtained from trace files are interpreted by AWK script and used for the further analysis.

Bilevel Multi-Objective Gray Wolf Algorithm Based on Packet Transport Network Optimization

Packet transport network (PTN), as an efficient transmission network technology in mobile communications in the big data era, is used by more and more communication operators. The existing PTN resource utilization rate is low, the network security is poor, so the existing PTN needs to be optimized in all aspects. For the optimization of the PTN, it is necessary to consider the decision of both the operator user and the service product supplier. Therefore, this paper proposes a bilevel multi-objective gray wolf algorithm based on PTN optimization problem. The operator user is the upper-level decision maker, and the objective function is to pay the product supplier the lowest cost. The product supplier is the lower-level decision maker, it mainly includes two major objective functions. The first objective function is to maximize the Label switching path overlap rate(LSPOR) evaluation score to solve the abnormal Label Switching Path (LSP) problem in the network, and the second is to maximize the committed bandwidth with utilizing rate(CBWUR) evaluation score to solve the problem of excessive Committed Information Rate(CIR) bandwidth usage in the network. According to the three scale network situation in Hubei, China, the improved multi-objective gray wolf algorithm is used to solve the PTN bilevel programming problem. The experimental results show that the model increases the utilization rate of network resources, and reduces the cost to be paid by the upper-level decision makers.

Squatting and kicking model evaluation for prioritized sliced resource management

Effective management and allocation of resources remains a challenging paradigm for future large-scale networks such as 5G, especially under a network slicing scenario where the different services will be characterized by differing Quality of Service (QoS) requirements. This makes the task of guaranteeing the QoS levels and maximizing the resource utilization across such networks a complicated task. Moreover, the existing allocation strategies with link sharing tend to suffer from inefficient network resource usage. Therefore, we focused on prioritized sliced resource management in this work and the contributions of this paper can be summarized as formally defining and evaluating a self-provisioned resource management scheme through a smart Squatting and Kicking model (SKM) for multi-class networks. SKM provides the ability to dynamically allocate network resources such as bandwidth, Label Switched Paths (LSP), fiber, slots among others to different user priority classes. Also, SKM can guarantee the correct level of QoS (especially for the higher priority classes) while optimizing the resource utilization across networks. Moreover, given the network slicing scenarios, the proposed scheme can be employed for admission control. Simulation results show that our model achieves 100% resource utilization in bandwidth-constrained environments while guaranteeing higher admission ratio for higher priority classes. From the results, SKM provided 100% acceptance ratio for highest priority class under different input traffic volumes, which, as we articulate, cannot be sufficiently achieved by other existing schemes such as AllocTC-Sharing model due to priority constraints.

Performance of MPLS-based Virtual Private Networks and Classic Virtual Private Networks Using Advanced Metrics

Multiprotocol Label Switching (MPLS) is effective in managing and utilizing available network bandwidth. It has advanced security features and a lower time delay. The existing literature has covered the performance of MPLS-based networks in relation to conventional Internet Protocol (IP) networks. But, too few literatures exist on the performance of MPLS-based Virtual Private Networks (VPN) in relation to traditional VPN networks. In this paper, a comparison is made between the effectiveness of the MPLS-VPN network and a classic VPN network using simulation studies done on OPNET®. The performance metrics used to carry out the comparison include; End to End Delay, Voice Packet Sent/Received and Label Switched Path’s Traffic. The simulation study was carried out with Voice over Internet Protocol (VoIP) as the test bed. The result of the study showed that MPLS-based VPN networks outperform classic VPN networks.

Connection Provisioning for PCE-Based GMPLS Optical Networks

Generalized Multiprotocol Label Switching (GMPLS) networks is capable of allocating suitable route based on the size of the network and computational constraints. In this paper, we propose a connection provisioning strategy for updating the Traffic Engineering Database of Path Computation Element (PCE) in GMPLS optical networks. Control and management plane are used for resource optimization in PCE-based centralized network. We have also proposed connection provisioning for Label Switched Path (LSP) to optimize the resources and to maximize the connection establishment. For provisioning a connection with LSP requests, we have formulated the Integer Linear Programming and constraints to minimize the blocking of connections and network performance. The results obtained shows that the proposed strategy has better network resource utilization with minimum blocking of connections.

SDN‐based resource allocation in MPLS networks: A hybrid approach

SummaryThe highly dynamic nature of the current network traffics makes the network managers to exploit the flexibility of the state‐of‐the‐art paradigm called SDN. In this way, there has been an increasing interest in hybrid networks of SDN‐MPLS. In this paper, a new traffic engineering architecture for SDN‐MPLS network is proposed. To this end, OpenFlow‐enabled switches are applied over the edge of the network to improve flow‐level management flexibility while MPLS routers are considered as the core of the network to make the scheme applicable for existing MPLS networks. The proposed scheme re‐assigns flows to the Label‐Switched Paths (LSPs) to highly utilize the network resources. In the cases that the flow‐level re‐routing is insufficient, the proposed scheme re‐computes and re‐creates the undergoing LSPs. To this end, we mathematically formulate two optimization problems, ie, i) flow re‐routing and ii) LSP re‐creation, and propose a heuristic algorithm to improve the performance of the scheme. Our experimental results show the efficiency of the proposed hybrid SDN‐MPLS architecture in traffic engineering superiors traditionally deployed MPLS networks.

Label space reduction based on LSP multiplexing in MPLS Openflow hybrid network

In MPLS network, each Label Switch Path (LSP) must be identified with a unique forwarding label in each network element. In recent years, with the continuous development of public cloud services, virtual private networks, and mobile computing, the label consumption in MPLS network is expanding rapidly, leading to increased management complexity, expanded ISP operational and capital expenditure, more router table look-up latency, and reduced network performance as well as scalability. To solve these problems, the label space reduction problem (LASPARED) has been presented and studied to optimize the planning of LSPs in MPLS network, so that the number of labels used in the network can be minimized. Label merging and tunneling are two main ways to solve this problem. However, both of the methods have limitations and need to be further improved. In this paper, different from merging and tunneling, we propose a third way to solve LASPARED problem in an MPLS Openflow hybrid network scheme: LSP multiplexing. With the network programmability and packet-editing capability provided by Openflow, we use label stacking and TTL to control packet switching between different LSPs, so that traffics with different source and destination may be able to share the same LSP. Analysis and simulations show that, compared with merging and tunneling, our method can achieve the best label reduction effect as well as the least number of LSPs regardless of topology structures.

Optimizing Segment Routing using Evolutionary Computation

Segment Routing (SR) combines the simplicity of Link-State routing protocols with the flexibility of Multiprotocol Label Switching (MPLS). By decomposing forwarding paths into segments, identified by labels, SR improves Traffic Engineering (TE) and enables new solutions for the optimization of network resources utilization. This work proposes an Evolutionary Computation approach that enables Path Computation Element (PCE) or Software-defined Network (SDN) controllers to optimize label switching paths for congestion avoidance while using at the most three labels to configure each label switching path.

Improving Quality of Service by Label Space Reduction in Multi-Protocol Label Switching (MPLS) Networks

Label Switching in Multi-Protocol Label Switching Networks is a most researched area in recent years. Many techniques have been proposed and implemented and their merits and demerits have been considered. Label Space Reduction is an issue which directly affects the quality of service of the MPLS network. The aim of the work is to design a network which optimizes the quality of service parameters like packet delivery ratio and throughput of the network. In many previous works tunnels are created which deals in only one label for the tunnel instead of swapping labels at each Label Switch Router (LSR). But the entry and exit points inside the tunnel are fixed which makes it difficult for the packets to enter and exit the tunnels. Also the packets entering will have to exit at fixed point and then it follows some other route to reach the destination which only increases the end to end delay and the packet drop in the network. In our proposed approach LCS algorithm is used to find the length of the tunnel according to the number of Label Switched Paths (LSPs) so that the packet can enter into the tunnel and exit at any point in the tunnel. Also each LSR maintains a table so that it tracks the labels which are assigned to the packets entering the tunnel and exiting at any point over the length of the tunnel. This technique results in the reduced number of packets lost in the network and also delay is reduced thus improving the throughput of the network. The results shown in the coming sections also proves the approach and the labels are significantly reduced along with the improvement of other performance parameters like throughput of the network, end to end delay and the packet delivery ratio.

A scalable mechanism for establishing multi-point to multi-point traffic engineering paths in multiprotocol label switching networks

Network scalability is a major issue in core networks where multiprotocol label switching (MPLS) is largely deployed. In this paper, we propose a scalable solution for deploying bidirectional multicast trees in MPLS traffic engineering (TE) networks. The deployment of such trees is performed by defining the concept of multi-point to multi-point (MP2MP) TE label switched paths (LSP). Hence, one MP2MP TE LSP can be used instead of a full mesh of point to point (P2P) or point to multi-point (P2MP) TE-LSP in order to support value added applications such as video-conferencing. This leads to reduce the number of TE-LSPs in MPLS-TE networks and hence it improves their scalability. The paper presents the signalling procedures required to incorporate the new proposed MP2MP TE LSP in MPLS networks in addition to a simulation study in order to assess the scalability enhancement introduced by our contribution.

Multipartner Demonstration of BGP-LS-Enabled Multidomain EON Control and Instantiation With H-PCE [Invited

The control of multidomain elastic optical networks (EONs) is possible by combining Hierarchical Path Computation Element (H-PCE)-based computation, Border Gateway Protocol with Extensions for Traffic Engineering Link State Information (BGP-LS) topology discovery, remote instantiation via Path Computation Element Communication Protocol (PCEP), and signaling via Resource Reservation Protocol with Extensions for Traffic Engineering (RSVP-TE). Two evolutionary architectures are considered, one based on stateless H-PCE, PCEP instantiation, and end-to-end RSVP-TE signaling (SL-E2E), and a second one based on stateful active H-PCE with perdomain instantiation and stitching. This paper presents the first multiplatform demonstration that fully validates both control architectures achieving multiprotocol interoperability. SL-E2E leads to slightly faster provisioning but needs to keep the state of the stitching of the end-to-end label-switched paths in the parent PCE.

On the performance of online and offline green path establishment techniques

Abstract To date, significant effort has gone into designing green traffic engineering (TE) techniques that consolidate traffic onto the minimal number of links/switches/routers during off-peak periods. However, little works exist that aim to green Multi-Protocol Label Switching (MPLS) capable networks. Critically, no work has studied the performance of green label switched paths (LSPs) establishment methods in terms of energy savings and acceptance rates. Henceforth, we add to the current state-of-the-art by studying green online and offline (LSP) establishment methods. Online methods rely only on past and current LSP requests while offline ones act as a theoretical benchmark whereby they also have available to them future LSP requests. We introduce a novel metric that takes into account both energy savings and acceptance rates. We also identify a new simpler heuristic that minimizes energy use by routing source–destination demands over paths that contain established links and require the fewest number of new links. Our evaluation of two offline and four online LSP establishment methods over the Abilene and AT&T topologies with random LSP setup requests show that energy savings beyond 20 % are achievable with LSP acceptance rates above 90 %.

Active Stateful PCE With Hitless LDPC Code Adaptation [Invited

The path computation element (PCE) architecture was originally proposed with a stateless condition, i.e., considering only network reserved resources during constraint-based path computations. More recently, a stateful architecture was introduced to additionally maintain the state of computed and established label switch paths (LSPs). Furthermore, the PCE architecture evolved to active functionality, enabling the PCE to directly issue recommendations to the network. In this study, we present and discuss several use cases where the active stateful architecture can provide some benefits. They include impairmentaware path computations in the context of multirate optical networks, recovery solutions, global defragmentation, and dynamic LSP adaptations. The latter use case is then specifically demonstrated in a network testbed including a flexigrid optical network operated with a multicarrier 1 Tb/s transmission with coherent detection. Novel advanced digital signal processing (DSP) monitoring functionalities are introduced and experimentally demonstrated. These monitoring functionalities are utilized to trigger a new hitless dynamic adaptation technique operating on the applied low-density parity check (LDPC) transmitted coding. The technique has been successfully demonstrated to increase transmission robustness upon impairment degradation, such that no traffic disruption is experienced. Moreover, to accommodate the LSP coding adaptation, network reconfiguration has been performed, successfully driven by the PCE thanks to the active functionality.

On methodologies to estimate optical-layer power consumption and cost for long-haul WDM networks with optical reach constraint

This paper deals with the methodologies to obtain the estimates of optical-layer power consumption and cost for long-haul optical networks using wavelength-division multiplexing (WDM) with IP-over-WDM and IP-over-MPLS-over-WDM network settings. Such optical networks generally employ wavelength routing at intermediate nodes and are known as wavelength-routed optical networks (WRONs). In WRON-based long-haul networks, optical reach (OR) of a transponder represents the maximum distance over which its optical signal can travel without any optical/electrical/optical regeneration and plays a significant role in deciding the power consumption and cost of the optical layer. In IP-over-WDM network setting, IP routers are directly interfaced with WRON and bandwidth requests are equal to the lightpath capacity. In IP-over-MPLS-over-WDM network setting, IP routers are interfaced with WRON via MPLS routers and bandwidth requests arrive as label-switched paths, which are generally lower than the lightpath capacity. We examine the above networks with mixed-OR nodes (transponders in each WRON node having different OR values but all transmitting at 10 Gbps) and fixed-OR nodes (transponders in each WRON node having same OR value and 10 Gbps transmission rate). In this investigation, two types of control planes are considered, namely unified control plane and isolated control plane. The network with unified control plane supports automated and dynamic resource provisioning for both short-term and long-term bandwidth requests. The study on nonautomated network using isolated control plane considers resource provisioning only for long-term bandwidth requests. Simulation-based network provisioning is carried out using C++, considering appropriate traffic models, OR constraints, node configurations and network architectures. The results of our simulations indicate in general how OR of the transponders can influence the total network cost and power consumption in optical layer. Overall, the nonautomated networks with mixed-OR configuration are found to save power and offer lower cost with respect to fixed-OR configuration, while the automated networks with mixed-OR configuration can save power while the cost increases with respect to fixed-OR option.

A Rapid Switching Technology of IP Data Packet Based on Multi-Protocol

The rapid development of network raise the role of WAN. As a large-scale backbone network, the failure of network components can lead to huge loss of data and revenue. How to improve the data switching speed and Quality of Service of network data is more and more important problem which Internet Server Provides cared. Multi-Protocol Lable Switching (MPLS) is a new WAN technology which is currently being standardized by IETF. This paper analysise the architecture of MPLS and describe the mechanism of label switching protocol. In addition, this study analyses the encapsulation of data packet at the Label Switching Routers which is on the boundary of MPLS network. A Label Switching Path (LSP) is built by Label Distribute Protocol in core network. A conclution of “one time routed, more times switching” routed was reached.

Design and implementation of a PCE-based software-defined provisioning framework for carrier-grade MPLS-TP networks

In this paper, we present a path computation element (PCE)- based provisioning framework for carrier-grade multi-protocol label switching-transport profile (MPLS-TP) networks. In the proposed framework, a centralized PCE integrates the service function as well as the path provisioning function into a unified provisioning controller. The service function allows the provisioning manager to initiate the establishment of a label-switched path (LSP). The provisioning function computes an optimal path, sets up and maintains the LSP in a unified way while directly configuring the LSP over the switches. The management function, as a separation from the provisioning function, can fully utilize the MPLS-TP switch to keep monitoring the performance of the provisioned LSP tunnels in a distributed way. The balanced partitioning of service provisioning and management functions reduces traffic load on the controller and improves the scalability. The software-defined provisioning control using an extended PCE communication protocol enables the cooperation between them to monitor and customize the LSPs flexibly and efficiently. We implement and show that the proposed framework not only simplifies the provisioning procedure with a single instance, but reduces the provisioning time in a MPLS-TP test bed.

Multirate Multiservice All-Optical Code Switched GMPLS Core Network Utilizing Multicode Variable-Weight Optical Code-Division Multiplexing

A multicode variable-weight (MCVW) technique is proposed for generalized multiprotocol label switching (GMPLS) optical networks in order to support multirate and integrated multimedia services. Under this technique, the number of simultaneously assigned codewords to each user is a function of the data rate of the service class, while quality-of-service differentiation is achieved using variable-weight codewords for each service class. The traffic behavior of the network is modeled using a multiservice loss model, and the probability density functions of the number of busy codes in the fiber link are obtained by the Kaufman–Roberts algorithm. In order to analyze the performance of the proposed multiservice multicode GMPLS optical network, several measures are derived and investigated, specifically, the bit-error rate, probability of degradation, blocking probability, and steady-state throughput. These performance measures are obtained for two different receiver structures, namely, correlation receivers with and without hard limiters. The performance of our optical GMPLS network, based on the multicode switching path, is compared with that of traditional optical GMPLS networks, based on the label switching path. The results show the superiority of the proposed technique when compared to traditional ones.

Dynamic and Adaptive Control Plane Solutions for Flexi-Grid Optical Networks Based on Stateful PCE

Adaptive flexi-grid optical networks should be able to autonomously decide where and when to dynamically setup, reoptimize, and release elastic optical connections, in reaction to network state changes. A stateful path computation element (PCE) is a key element for the introduction of dynamics and adaptation in generalized multiprotocol label switching (GMPLS)-based distributed control plane for flexi-grid DWDM networks (e.g., global concurrent reoptimization, defragmentation, or elastic inverse-multiplexing), as well as for enabling the standardized deployment of the GMPLS control plane in the software defined network control architecture. First, this paper provides an overview of passive and active stateful PCE architectures for GMPLS-enabled flexi-grid DWDM networks. A passive stateful PCE allows for improved path computation considering not only the network state (TED) but also the global connection state label switched paths database (LSPDB), in comparison with a (stateless) PCE. However, it does not have direct control (modification, rerouting) of path reservations stored in the LSPDB. The lack of control of these label switched paths (LSPs) may result in the suboptimal performance. To this end, an active stateful PCE allows for optimal path computation considering the LSPDB for the control of the state (e.g., increase of LSP bandwidth, LSP rerouting) of the stored LSPs. More recently, an active stateful PCE architecture has also been proposed that exposes the capability of setting up and releasing new LSPs. It is known as active stateful PCE with instantiation capabilities. This paper presents the first prototype implementation and experimental evaluation of an active stateful PCE with instantiation capabilities for the GMPLS-controlled flexi-grid DWDM network of the ADRENALINE testbed.

The study of multi-granularity switching based on parallel processing routing technology

A novel parallel processing optical code label-switched paths (PP-OC-LSPs) is proposed to achieve efficient conversion performance for core router and large throughput in optical network, which combines the merits of optical label switching (OLS), optical code-generalized multi-protocol label switching (OC-GMPLS), and optical code division multiplexing-paths (OCDM-paths) technology. In the proposed technology, the smallest switching granularity is an optical code which carries the label information of data packets and would be parallel converted in the core router. In the edge node, the label and payload are separated by using the optical polarity characteristics, and encoded/decoded with two different code series based on OCDM techniques so as to process them in parallel. Compared with the OLS, its switching capability has been extended to support fiber switching, wavelength switching, and OCDM switching. We present simulation results to demonstrate its performance over OCDM-paths technology.