Future high-capacity optical telecommunication networks

2000 ◽  
Vol 358 (1765) ◽  
pp. 303-329 ◽  
Author(s):  
Polina Bayvel
Keyword(s):  
High Capacity ◽  
Optical Telecommunication ◽  
Telecommunication Networks

Design of High Capacity Survivable Networks

2007 ◽  
pp. 1-19
Author(s):  
Varadharajan Sridhar ◽  
June Park
Keyword(s):  
Network Architecture ◽  
High Capacity ◽  
Cost Effective ◽  
Telecommunication Networks ◽  
Survivable Networks ◽  
Network Nodes ◽  
Network Cost ◽  
Telecommunications Network ◽  
Terminal Reliability ◽  
Network Component

Survivability, also known as terminal reliability, refers to keeping at least one path between specified network nodes so that some or all of traffic between nodes is routed through. Survivability in high capacity telecommunication networks is crucial as failure of network component such as nodes or links between nodes can potentially bring down the whole communication network, as happened in some real-world cases. Adding redundant network components increases the survivability of a network with an associated increase in cost. In this chapter we consider the design of survivable telecommunications network architecture that uses high-capacity transport facilities. The model considers selection of capacitated links and routing of multicommodity traffic flow in the network that minimizes overall network cost. Two node disjoint paths are selected for each commodity. In case of failure of the primary path, a portion of the traffic for each commodity is rerouted through the secondary path. The methodology presented in this chapter can be used by the network designer to construct cost-effective high capacity survivable networks.

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