Routing In MPLS Networks Research Articles

Using a Fuzzy Rule-based Algorithm to Improve Routing in MPLS Networks

Using a Fuzzy Rule-based Algorithm to Improve Routing in MPLS Networks

Bidirectional Multi-Constrained Routing Algorithms

QoS routing plays a critical role in providing QoS support in the Internet. Most existing QoS routing algorithms employ the strategy of unidirectional search in route selection. Bidirectional search has been recognized as an effective strategy for fast route acquisition in identifying the shortest path connecting a pair of nodes. However, its efficiency has not been well established in the context of route selection subject to multiple additive constraints, which is in general NP-Complete. In this paper, we study how to employ bidirectional search to support efficient QoS routing subject to multiple additive constraints. The major contributions in this paper are as follows. First, we propose a <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$k$</tex> </formula> shortest path algorithm using bidirectional search, whose complexity is deduced to be <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$O(\sqrt{k}\vert V \vert\lg (\vert V \vert) + k\vert E\vert)$</tex> </formula> , where <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$\vert V \vert$</tex> </formula> and <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$\vert E \vert$</tex> </formula> represent the number of nodes and links in the network, respectively. Second, we show that bidirectional search can significantly accelerate the convergence of several existing QoS routing algorithms. Third, we propose a novel cost-effective bidirectional multi-constrained routing algorithm, which can greatly alleviate the forwarding state scalability issue by supporting stateless QoS routing in IP networks via IP tunneling or constraints-based alternate routing in MPLS networks via label stacks. It has the fastest known on-line running time <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$O(\vert V\vert)$</tex> </formula> . Theoretical and simulation results are given to demonstrate the high performance of our proposed algorithm in identifying QoS-satisfied paths and also in efficient resource utilization as compared with existing algorithms.

Swarm Based Fault Tolerant Routing in MPLS Networks

In MPLS/GMPLS networks, during fault prevalence, heavy data loss occurs within minimum duration of time. Also it is difficult to handle these faults as it may cause critical network survivability issue. Most of the existing literature works estimates the failure probability, bandwidth and delay of all routes using the traditional shortest path algorithm which leads to huge delay and overhead. In order to overcome these issues, in this paper, we propose ant colony optimization (ACO) algorithm for routing in GMLPS/MPLS. In this technique, swarm intelligence based fault tolerant routing is performed. This involves the selection of optimal path with maximum available bandwidth and minimum delay. In order to enhance the security of MPLS network, the threshold secret sharing mechanism is considered. By simulation results, we show that the proposed approach minimizes the delay and route failures while increasing the bandwidth utilization and throughput.

The Efficiency of Constraint Based Routing in MPLS Networks

The paper presents the simulation results and evaluates the efficiency of constraint base routing algorithms used in MPLS network from the point of their usability in Next Generation Networks. The efficiency of constraint based routing is evaluated according following criteria: optimal path selection, routing priority of traffic flows selected for constraint routing and bandwidth allocation by MAM or RDM bandwidth constraints models.

Hierarchical Multiobjective Routing in MPLS Networks with Two Service Classes – A Meta-Heuristic Solution

The paper begins by reviewing a two-level hierarchical multicriteria routing model for MPLS networks with two service classes (QoS and BE services) and alternative routing, as well as the foundations of a heuristic resolution approach, previously proposed by the authors. Afterwards a new approach, of meta-heuristic nature, based on the introduction of simulated annealing and tabu search techniques, in the structure of the dedicated heuristic, is described. The application of the developed procedures to a benchmarking case study will show that, in certain initial conditions, this approach provides improvements in the final results especially in more “difficult” situations detected through sensitivity analysis.