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

Modèle d'optimisation pour la défragmentation de la capacité

International audienceL'évolution du trafic peut entraîner une dégradation de l'utilisation des ressources d'un réseau lié à la fragmentation de la bande passante. En effet, la route d'une connexion (e.g., LSP dans un réseau MPLS) dépend des ressources disponibles lors de son établissement, et peut donc être éloignée du plus court chemin. La défragmentation de la capacité sur la couche utilisateur est alors nécessaire pour optimiser l'utilisation des ressources. La reconfiguration vers un routage optimisé peut se faire à l'aide d'un processus itératif utilisant l'opération make-before-break (MBB). Le processus choisit une connexion, détermine une nouvelle route utilisant des ressources libres, bascule la connexion sur cette nouvelle route et libère les ressources qui ne sont plus utilisées. Puis, il considère une nouvelle connexion jusqu'à atteindre un routage optimisé. Le défi consiste à déterminer l'ordre dans lequel effectuer un nombre borné d'étapes de re-routages de connexions pour obtenir un routage optimisant l'utilisation des ressources. Nous proposons un modèle d'optimisation exact de reconfiguration MBB minimisant l'utilisation des ressources. Nos résultats numériques montrent que nous améliorons l'état-de-l'art en résolvant des instances sur des réseaux à 30 noeuds

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

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

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

Efficient Make Before Break Capacity Defragmentation

International audienceOptical multilayer optimization continuously reorganizes layer 0-1-2 network elements to handle both existing and dynamic traffic requirements in the most efficient manner. This delays the need to add new resources for new requests, saving CAPEX and leads to optical network defragmentation. The focus of this paper is on Layer 2, i.e., on capacity de-fragmentation at the OTN layer when routes (e.g., LSPs in MPLS networks) are making unnecessarily long detours to evade congestion. Reconfiguration into optimized routes can be achieved by redefining the routes, one at a time, so that they use the vacant resources generated by the disappearance of services using part of a path that transits the congested section. For the Quality of Service, it is desirable to operate under Make Before Break (MBB), with the minimum number of rerouting. The challenge is to identify the rerouting order, one connection at a time, while minimizing the bandwidth requirement. We propose an exact and scalable optimization model for computing a minimum bandwidth rerouting scheme subject to MBB in the OTN layer of an optical network. Numerical results show that we can successfully apply it on networks with up to 30 nodes, a very significant improvement with the state of the art. We also provide some defragmentation analysis in terms of the bandwidth requirement vs. the number of reroutings

Characterization of graphs and digraphs with small process number

International audienceWe introduce the process number of a digraph as a tool to study rerouting issues in \wdm networks. This parameter is closely related to the vertex separation (or pathwidth). We consider the recognition and the characterization of (di)graphs with small process number. In particular, we give a linear time algorithm to recognize (and process) graphs with process number at most 2, along with a characterization in terms of forbidden minors, and a structural description. As for digraphs with process number 2, we exhibit a characterization that allows one to recognize (and process) them in polynomial time

New Models and Algorithms in Telecommunication Networks

The telecommunications industry is growing very fast and frequently faces technological developments. Due to the competition between service providers and high expected reliability from their customers, they should be able first, to migrate their networks to the novel advancements in order to be able to meet their customers’ latest requirements and second, to optimally use the resources in order to maximize their profitability. Many researchers have studied different scenarios for Network Migration Problem (NMP). In these studies, a comparison between the legacy and new technologies is investigated in terms of time frames, reduction in expenditures, revenue increases, etc. There have been no prior studies considering the operational costs of NMP e.g., technicians, engineers and travels. The first contribution of the thesis is to propose a two-phase algorithm based on the solution of column generation models that builds a migration plan with minimum overall migration time or cost. The second contribution is an improved decomposition model for NMP by removing the symmetry between the network connections. We apply a branch-and-price algorithm in order to obtain an epsolin-optimal ILP solution. The third contribution of the thesis is to propose a new methodology for Wavelength Defragmentation Problem to recover the capacity of WDM networks in dynamic environments and optimize resource usages. Since rerouting the lightpaths in an arbitrary order may result in a huge number of disruptions, an algorithm based on a nested column generation technique is proposed. The solution is an optimized configuration in terms of resource usage (number of links) that is reachable by no disruptions from the current provisioning. All the algorithms presented in this thesis are based on Column Generation method, a decomposition framework to tackle large-scale optimization problems