Genetic programming approaches for minimum cost topology optimisation of optical telecommunication networks

1997 ◽  
Author(s):  
P. Aiyarak
Keyword(s):  
Genetic Programming ◽  
Minimum Cost ◽  
Optical Telecommunication ◽  
Telecommunication Networks ◽  
Topology Optimisation

scholarly journals Optimizing Capacity Assignment in Multiservice MPLS Networks

2017 ◽  
Vol 29 (1) ◽  
Author(s):  
Abdoul Rassaki ◽  
Andre Nel
Keyword(s):  
Programming Model ◽  
Minimum Cost ◽  
Lagrangean Relaxation ◽  
Telecommunication Networks ◽  
Common Trunk ◽  
Topology Optimisation ◽  
Capacity Assignment ◽  
Optimum Selection ◽  
Flow Assignment ◽  
Experimental Findings

The general Multiprotocol Label Switch (MPLS) topology optimisation problem is complex and concerns the optimum selection of links, the assignment of capacities to these links and the routing requirements on these links. Ideally, all these are jointly optimised, leading to a minimum cost network which continually meets given objectives on network delay and throughput. In practice, these problems are often dealt with separately and a solution iterated. In this paper, we propose an algorithm that computes the shortest routes, assigns optimal flows to these routes and simultaneously determines optimal link capacities. We take into account the dynamic adaptation of optimal link capacities by considering the same Quality of Service (QoS) measure used in the flow assignment problem in combination with a blocking model for describing call admission controls (CAC) in multiservice broadband telecommunication networks. The main goal is to achieve statistical multiplexing advantages with multiple traffic and QoS classes of connections that share a common trunk present. We offer a mathematical programming model of the problem and proficient solutions which are founded on a Lagrangean relaxation of the problem. Experimental findings on 2-class and 6-class models are reported.

scholarly journals Exploiting the diversity of shortest pairs of edge-disjoint paths

2018 ◽  
Author(s):  
Marina Girolimetto ◽  
Rodrigo S. Tessinari ◽  
Fabio O. Lima ◽  
Claunir Pavan ◽  
Marcia H. M. Paiva
Keyword(s):  
Network Topology ◽  
Optical Network ◽  
Optical Telecommunication ◽  
Telecommunication Networks ◽  
Disjoint Paths ◽  
Node Pair ◽  
Edge Disjoint ◽  
Backup Paths ◽  
Tarjan’S Algorithm ◽  
Tarjan's Algorithm

In an optical network, given a pair of source and destination nodes, some algorithm can be used to find shortest pairs of edge-disjoint paths to be used as working and backup paths. The Suurballe and Tarjan's algorithm is a solution, but it can found different shortest pairs of pathways interconnecting the same pair of source and destination nodes. In this paper, two versions of the Suurballe and Tarjan's algorithm is proposed to deal with that diversity. For each node pair of a given network topology, these versions find the most balanced shortest pair of working and backup paths and the least balanced one. Both algorithms are tested and analyzed in a set of 40 2-edge-connected topologies of real-world optical telecommunication networks. A difference of up to 29% was found between the two strategies.

Sign in / Sign up

Export Citation Format

Share Document