ArticlePDF Available

Algorithms for the Logical Topology Design in WDM All-Optical Networks

Authors:
Emilio Leonardi at Politecnico di Torino
Emilio Leonardi
M. Mellia
M. Mellia
M. Mellia
  • This person is not on ResearchGate, or hasn't claimed this research yet.
M. Ajmone Marsan
M. Ajmone Marsan
M. Ajmone Marsan
  • This person is not on ResearchGate, or hasn't claimed this research yet.
Download full-text PDF
Read full-text
Download citation

Abstract and Figures

In this paper we discuss the optimal design of logical topologies in alloptical WDM networks. We first explain the key aspects of the problem, and provide a mixed integer linear programming formulation, which however leads to unacceptably high complexity for networks of non-trivially small size.
Figures - uploaded by Emilio Leonardi
Author content
All figure content in this area was uploaded by Emilio Leonardi
Content may be subject to copyright.
Content uploaded by Emilio Leonardi
Author content
All content in this area was uploaded by Emilio Leonardi on Dec 02, 2014
Content may be subject to copyright.
0.01
0.012
0.014
0.016
0.018
0.02
0.022
0.024
0 20 40 60 80 100 120
Load
Lightpath
GLTDA
SMLTDA
D-MLTDA
RLTDA
PLTDA
I-MLTDA
LPLTDA
0
5
10
15
20
0 10 20 30 40 50 60
Gain
Lightpath
GLTDA
SMLTDA
D-MLTDA
PLTDA
I-MLTDA
LPLTDA
0
0.005
0.01
0.015
0.02
0.025
0.03
0 20 40 60 80 100 120
Load
Lightpath
GLTDA
SMLTDA
D-MLTDA
RLTDA
PLTDA
I-MLTDA
LPLTDA
0
5
10
15
20
25
30
35
40
45
50
0 10 20 30 40 50 60
Gain
Lightpath
GLTDA
SMLTDA
D-MLTDA
PLTDA
I-MLTDA
LPLTDA
0.05
0.1
0.15
0.2
0.25
0 20 40 60 80 100 120
Load
Lightpath
GLTDA
D-MLTDA
RLTDA
PLTDA
I-MLTDA
-80
-60
-40
-20
0
20
40
0 10 20 30 40 50 60
Gain
Lightpath
GLTDA
D-MLTDA
PLTDA
I-MLTDA
0
0.005
0.01
0.015
0.02
0.025
0.03
0.035
0.04
0.045
0 20 40 60 80 100 120
Gain
Lightpath
GLTDA
SLTDA
D-MLTDA
RLTDA
PLTDA
I-MLTDA
LPLTDA
-10
-5
0
5
10
15
20
25
30
0 10 20 30 40 50 60
Load
Lightpath
GLTDA
SLTDA
D-MLTDA
PLTDA
I-MLTDA
LPLTDA
0
0.01
0.02
0.03
0.04
0.05
0.06
0.07
0.08
0 20 40 60 80 100 120
Gain
Lightpath
GLTDA
SLTDA
D-MLTDA
RLTDA
PLTDA
I-MLTDA
LPLTDA
-20
0
20
40
60
0 10 20 30 40 50 60
Load
Lightpath
GLTDA
SLTDA
D-MLTDA
PLTDA
I-MLTDA
LPLTDA
0.05
0.1
0.15
0.2
0.25
0 20 40 60 80 100 120
Gain
Lightpath
GLTDA
D-MLTDA
RLTDA
PLTDA
I-MLTDA
-40
-20
0
20
40
0 10 20 30 40 50 60
Load
Lightpath
GLTDA
D-MLTDA
PLTDA
I-MLTDA
0.02
0.025
0.03
0.035
0.04
0 20 40 60 80 100 120
Load
Lightpath
GLTDA
SMLTDA
D-MLTDA
RLTDA
PLTDA
0
2
4
6
8
10
12
14
0 10 20 30 40 50 60
Gain
Lightpath
GLTDA
SMLTDA
D-MLTDA
PLTDA
0
0.02
0.04
0.06
0.08
0.1
0 20 40 60 80 100 120
Load
Lightpath
GLTDA
SMLTDA
D-MLTDA
RLTDA
PLTDA
I-MLTDA
-40
-20
0
20
40
0 10 20 30 40 50 60
Gain
Lightpath
GLTDA
SMLTDA
D-MLTDA
PLTDA
I-MLTDA
0.01
0.02
0.03
0.04
0.05
0.06
0.07
0.08
0.09
0.1
0 20 40 60 80 100 120
Load
Lightpath
D-MLTDA
RLTDA
PLTDA
-40
-30
-20
-10
0
10
20
0 10 20 30 40 50 60
Gain
Lightpath
D-MLTDA
PLTDA
0
0.01
0.02
0.03
0.04
0.05
0.06
0.07
0.08
0.09
0 20 40 60 80 100 120
Load
Lightpath
GLTDA
SMLTDA
D-MLTDA
RLTDA
PLTDA
-30
-25
-20
-15
-10
-5
0
5
10
15
20
0 10 20 30 40 50 60
Load
Lightpath
GLTDA
SMLTDA
D-MLTDA
PLTDA
0
0.02
0.04
0.06
0.08
0.1
0.12
0 20 40 60 80 100 120
Load
Lightpath
GLTDA
SMLTDA
D-MLTDA
RLTDA
PLTDA
I-MLTDA
-40
-20
0
20
40
0 10 20 30 40 50 60
Load
Lightpath
GLTDA
SMLTDA
D-MLTDA
PLTDA
I-MLTDA
0.05
0.1
0.15
0.2
0 20 40 60 80 100 120
Load
Lightpath
D-MLTDA
RLTDA
PLTDA
-40
-20
0
20
40
0 10 20 30 40 50 60
Load
Lightpath
D-MLTDA
PLTDA
... Ambos os problemas são modelados como um problema de Programação Linear Inteira Mista (MILP) e a busca pela solução exataé classificada como NP Completo [3], ou seja,é extremamente difícil, do ponto de vista computacional. Para contornar esta dificuldade, vários autores utilizam heurísticas para encontrar boas soluções para cada um dos subproblemas [4], [5], [6]. ...
View
Enhanced Algorithm for Logical Topology-Based Fault Link Recovery in Crossbar Networks
Chapter
  • May 2021
Conventionally, virtual topology nodes are mapped with actual physical topology nodes and links mapped with lightpaths (LPs). But this is computationally unwieldy becoming huge and more complex with increasing network size. This work proposes a scheme for optimal utilization of the network, minimizing network congestion by allocating efficient LPs in existing physical systems. When network size increases, the degree of the sub-trees also increases but without any increase of carrier wavelengths; the number of hops (and carrier wavelengths) decreases as it generates direct paths between the longest path nodes. Structural metrics of the physical and logical topologies of this method are more efficient. It supports multicast connections and minimizes data replication. The outer iteration of the proposed algorithm is executed twice; the first iteration yields the network’s logical topology, while the second gives “complete bipartite graph.” Using the logical topology, the path length of the longest distance node is reduced, and direct connections between nodes are created. The reconfiguration is used only for the nearest node of logical topology, and this reduces the number of hops between the nearest nodes to three. The maximum path length is 6 for any n × n crossbar network. This will cause reduction in the number of protection cycle.
View
Dynamic structural percolation model of loss distribution for cyber risk of small and medium-sized enterprises for tree-based LAN topology
Article
  • Feb 2020
  • INSUR MATH ECON
Cyber risk due to breach can be seen as a risk of a financial loss due to breach of an institution’s IT infrastructure by unauthorized parties and exploiting, taking possession of, or disclosing data assets, thus creating financial and/or reputation damage. In this paper, as a primary contribution to the existing body of actuarial literature, we propose a structural model of aggregate loss distribution for cyber risk of small and medium-sized enterprises under the assumption of a tree-based LAN topology. Up to our knowledge, there exist no theoretical models of an aggregate loss distribution for cyber risk in this setting. To achieve our goal, we contextualize the problem in the probabilistic graph-theoretical framework using percolation models. We assume that the IT network topology is represented by a random graph allowing for heterogeneous loss topology and providing instructive numerical examples.
View
A Biological Approach to Physical Topology Design for Plasticity in Optical Networks
Article
  • May 2017
We previously proposed a virtual network topology (VNT) control method that is adaptive to traffic changes. However, the performance of VNTs is fundamentally determined by the physical infrastructure, and the physical network therefore needs to be designed so that it is capable of utilizing the adaptiveness of the VNT control method. In this paper, we propose a design method for optical networks, e.g., wavelength division multiplexing (WDM) networks. This method is based on a biological evolution model and provides adaptability under various patterns of traffic fluctuation and traffic growth. Our method determines the set of nodes to which transceivers should be added in order to give plasticity to the designed network, where plasticity represents changeability of VNT against environmental variation. Evaluation results show that our method accommodates more patterns of traffic fluctuation with lower link utilization than ad-hoc design methods do.
View
Adaptive Virtual Topology Control Based on Attractor Selection
Chapter
  • Mar 2017
One approach for accommodating traffic on a wavelength-routed optical network is to construct a virtual topology by establishing a set of lightpaths between nodes. To adapt to various changes in network environments, we propose an adaptive virtual topology control method, which reconfigures virtual topologies according to changing network environments, in IP over wavelength-routed wavelength division multiplexing networks. To achieve adaptability in the virtual topology control method, we focus on attractor selection, which models behaviors where biological systems adapt to unknown changes in their surrounding environments. The biological system driven by attractor selection adapts to environmental changes by selecting attractors of which the system condition is preferable. Our virtual topology control method uses deterministic and stochastic behaviors and controls these two appropriately by simple feedback of IP network conditions. Unlike current heuristic virtual topology control methods developed in the area of engineering, our method does not rely on pre-defined algorithms and uses stochastic behaviors for adapting to changes in network environments. The simulation results indicate that our virtual topology control method based on attractor selection adaptively responds to changes in network environments caused by node failure and constructs operational virtual topologies in more than 95% of simulation trials when 20% of nodes in the physical network fail simultaneously.
View
View
Fast Routing and Wavelength Assignment Heuristics for Large-Scale WDM Optical Networks
Article
  • Dec 2003
We consider the routing and wavelength assignment (RWA) problem for large-scale WDM optical networks where each transmission request is served by an all-optical light-path without wavelength conversion. Two heuristic RWA algorithms are proposed in order to minimize the number of wavelengths required for a given set of connection requests. The proposed algorithms are evaluated and compared with the existing algorithms for two realistic networks constructed based on the locations of major cities in Ibaraki Prefecture and those in Kanto District in Japan.
View
Efficient Traffic Grooming Scheme for WDM Network
Article
  • Jan 2009
One major objective in WDM network design is to develop a logical topology and a routing scheme over the topology that minimizes the congestion of the network. This combined topology design and traffic grooming problem becomes computationally intractable, even for moderate sized networks. One standard approach is to decouple the problem of logical topology design and the problem of routing over the logical topology. Heuristics for finding the logical topology exist and a straight-forward linear program (LP), based on the node-arc formulation is normally used to solve the routing problem over a given logical topology. However, the traffic grooming problem is in itself an inherently difficult problem, and standard LP formulations are not able to solve this problem for large networks. In this paper,we have introduced a novel approach for traffic grooming, over a given logical topology, using the concept of approximation algorithms. This technique allows us to efficiently route traffic for practical sized networks and obtain solutions, which are guaranteed to be within a specified bound of the optimal solution. Simulation results from different networks demonstrate that approximation algorithms can be used to quickly generate near-optimal solutions to the traffic routing problem in WDM networks.
View
Topology selection criteria for a virtual topology controller based on neural memories
Conference Paper
Full-text available
  • Jun 2014
This work extends a previously proposed algorithm for virtual topology reconfiguration in all optical networks. Earlier, an algorithm using auto-associative neural memories has been presented. The algorithm stores topologies by assigning equal weights. In this work, we analyzed the effect of weighing topologies differently based on maximum flow, average weighted hop and the age of topology. Although we focus on optical networks, the algorithm and the analysis we present here can be useful in other network domains, such as wireless networks.
View
Propagation of Light in Unguided Media
Chapter
  • Oct 2011
This book provides a comprehensive description of an optical communications technology known as free space optical-a next-generation communications network that uses optical signals through the atmosphere instead of fiber, RF, or microwaves. This technology potentially offers more complex ultrabandwidth communication services simultaneously to multiple users and in a very short time, compared to fiber optic technology. This text presents established and new advancements drawn from the latest research and development in components, networking, operation, and practices. This book describes the FSO network concepts in simple language. It provides comprehensive coverage in an easy-to-understand, progressive style that starts from the physics of the atmosphere and how it affects optical communications; continues with the design of a network node; and concludes with fiberless network applications from point-to-point to mesh topology. Important areas discussed include: Propagation of light in the atmosphere and phenomena that affect light propagation. FSO transceiver design. Point-to-point FSO systems. Ring FSO systems. Mesh-FSO systems and integrating the Mesh-FSO with the public network. WDM Mesh-FSO. FSO network security. FSO-specific applications. To meet the needs of both academia and industry, key mathematical formulas are presented along with descriptions, while extensive mathematical analyses are minimized or avoided. Free Space Optical Networks for Ultra-Broad Band Services serves as an ideal text for network communication professionals who enter the free space optical communication field, graduate students majoring in optical communications, optical communication engineers, researchers, managers, and consultants.
View
Algorithms for Optimized Node Arrangements in ShuffleNet Based Multihop Lightwave Networks
Article
  • Jan 1995
The capabilities of emerging optical technology, viz. dense wavelength division multiplexing (WDM) and tunable optical transmitters and receivers (transceivers) can be exploited to construct lightwave networks, as follows. First, by employing WDM, the huge optical bandwidth (in the order of Terahertz) is partitioned into a number of smaller capacity channels (in the order of Gigahertz) which are compatible with the electronic interface speeds. Second, each node with its tunable transmitter(s) and receiver(s) can access a subset of the available channels by tuning its transceivers to the appropriate wavelengths. Now, the system can be configured as a broadcast-and-select network in which all of the inputs from various nodes are combined in a star coupler and the mixed optical information is broadcast to all the outputs. Thus, a multitude of virtual network configurations can be superimposed over any given physical network topology. The goal of this study is to exploit the aforementioned capabilities of lightwave technology in order to construct optimized regular multihop networks when the traffic flow among the network nodes is asymmetric. The specific problem addressed here is as follows: Given that the network nodes must be connected in a regular interconnection pattern and that the node positions in the regular network can be adjusted by properly tuning their (optical) transceivers, what is the best node placement in a given regular topology? We have chosen ShuffleNet based regular structure as the model of our network topology. ShuffleNet can interconnect a large number of nodes with a small number of transceivers per node such that information from a source can reach its destination in a small number of hops. However, finding the optimal node placement is a computationally hard problem. So, we formulate efficient heuristic algorithms to design optimized ShuffleNet structures for a given traffic matrix. Also, a scheme is developed to dynamically rearrange the logical node positions to a new optimized configuration, within the ShuffleNet framework, when the pattern of offered load changes.
View
Node placement optimization in ShuffleNets
Conference Paper
The node placement problem in ShuffleNets is a combinatorial optimization problem. An efficient node placement algorithm called the gradient algorithm is proposed. A communication cost function between a node pair is defined and the gradient algorithm places the node pairs one by one based on the gradient of the cost function. Then two lower bounds on the traffic weighted mean internodal distance h¯ are proposed. The performance of the gradient algorithm is compared to the lower bounds as well as some algorithms in the literature. Significant reduction of h¯ is obtained with the use of the gradient algorithm, especially for highly skewed traffic distributions. For a ShuffleNet with N=64 nodes, the h¯ found is only 22% above the lower bound for the uniform random traffic distribution, and 14.7% for a highly skewed traffic distribution with skew factor γ=100
View
View
The Flow Deviation Method: An Approach to Store-and-Forward Communication Network Design
Article
  • Jan 1973
  • NETWORKS
Two problems relevant to the design of a store-and-forward communication network (the message routing problem and the channel capacity assignment problem) are formulated and are recognized to be essentially non-linear, unconstrained multicommodity (m.c.) flow problems. A “Flow Deviation” (FD) method for the solution of these non-linear, unconstrained m.c. flow problems is described which is quite similar to the gradient method for functions of continuous variables; here the concept of gradient is replaced by the concept of “shortest route” flow. As in the gradient method, the application of successive flow deviations leads to local minima. Finally, two interesting applications of the FD method to the design of the ARPA Computer Network are discussed.
View
Computational experience with a difficult mixedinteger multicommodity flow problem
Article
  • Jan 1995
The following problem arises in the study of lightwave networks. Given a demand matrix containing amounts to be routed between corresponding nodes, we wish to design a network with certain topological features, and in this network, route all the demands, so that the maximum load (total flow) on any edge is minimized. As we show, even small instances of this combined design/routing problem are extremely intractable. We describe computational experience with a cutting plane algorithm for this problem.
View
Single-Layer Optical Platform Based on WDM/TDM Multiple Access for Large-Scale “Switchless” Networks
Article
  • Feb 2000
  • EUR T TELECOMMUN
The European Union ACTS project SONATA will define and demonstrate a cswitchlessn all-optical network to provide a future single-layer, advanced transport architecture on a national scale. The single-hop, shared-access network employs time and wavelength agility (a WDMA/TDMA protocol), using fast tunable transmitters and receivers to route individual customer connections as well as bandwidth pipes through a single wavelength router (suitably replicated for resilience). No electronic switching nodes or cross-connects (telephony, IP, ATM, SDH) are required within the transport network, nor optical cross-connects (save the wavelength routing node), thus providing major transport architecture simplifications and hardware reductions. The network is scalable to 200 Tbit/s throughput over 1, 000 krn, connecting 20 million terminals operating at 622 Mbit/s over 50.000-way split c<hyperPONss, by means of 800 WDM channels with 0.05 nm channel spacing (6.25 GHz). Details of network dimensioning, physical layer modeling and network control issues are presented.
View
Node placement optimization in ShuffleNets
Article
  • Jun 1998
Node placement problem in ShuffleNets is a com- binatorial optimization problem. In this paper an efficient node placement algorithm, called the gradient algorithm, is proposed. A communication cost function between a node pair is defined and the gradient algorithm places the node pairs one by one, based on the gradient of the cost function. Then two lower bounds on the traffic weighted mean internodal distance are proposed. The performance of the gradient algorithm is compared to the lower bounds as well as to some algorithms in the literature. Significant reduction of is obtained with the use of the gradient algorithm, especially for highly skewed traffic distributions. For a ShuffleNet with nodes, the found is only 22% above the lower bound for the uniform random traffic distribution, and 14.7% for a highly skewed traffic distribution with skew factor
View
Design of logical topologies: A linear formulation for wavelength routed optical networks with no wavelength changers
Conference Paper
  • Jan 2001
In this paper we present a exact linear formulation (mixed integer linear program) for designing a logical topology with no wavelength changers. Since the objective of our linear formulation is minimizing the maximum offered load on any link, which is called congestion, the resulting logical topology reflects the traffic intensities between the nodes. Our linear formulation yields a logical topology and routing and wavelength assignment for the logical links. Previously (see IEEE Journal on Selected Areas in Communications, vol.40, no.1, p.840-51, 1996) the problem of logical topology design is considered but the number of wavelengths the fiber can support is not a constraint. In this paper we take into consideration the number of wavelengths the fiber supports, the hop length of a logical link, and show the trade-offs involved in minimizing congestion. Since the whole problem is linearizable the solution obtained by relaxation of the integer constraints yields a lower bound on the congestion. This can be used to compare the efficiency of heuristic algorithms. We solve the problem exactly for a small size network and for large size networks we develop some heuristic algorithms to obtain a feasible solution using the solution obtained by relaxing the integer constraints. We introduce a cutting plane which enables us to reduce the previously obtained upper bounds on congestion. Numerical results for a six node wide area network and the National Science Foundation Network (NSFNET) are presented for various cases
View
A study of upper and lower bounds for minimum congestion routing in lightwave networks
Conference Paper
  • Jul 1994
This paper considers the combined problem of finding allocation of wavelengths to the stations (configuration) and finding the associated routing of the traffic to minimize congestion (the amount of maximum flow on any link). This work presents efficient algorithms for computing both upper and lower bounds on the congestion. The upper bounds-to obtain approximate solutions of this problem-are based modification of two heuristics (i) variable depth local search, and (ii) simulated annealing. A more significant contribution is a lower bound computation based on building flow trees to find a lower bound on the total flow, and then distributing the total flow over the links provide a lower bound on the congestion. This technique yields a tool which can be used in evaluating the quality of heuristic algorithms, and determining a termination criteria during minimization. This technique can be applied to other problems with flow-based objectives. Performance of the heuristics is analysed, and compared via simulation studies. It is shown that the heuristics perform on the average, within 20% of the computed lower bound, and 15% better than the previous methods to solve this problem
View
Algorithms for optimized node arrangements in ShuffleNet based multihop lightwave networks
Conference Paper
  • Feb 1993
The unique capabilities of lightwave technology are exploited in order to construct optimized regular multihop networks when the traffic flow among the network nodes is asymmetric. The specific problem addressed is as follows: given that the network nodes must be connected in a regular interconnection pattern and that the node positions in the regular network can be adjusted by properly tuning their (optical) transceivers, what is the best node placement in a given regular topology? In particular, the ShuffleNet-based regular topology is examined. ShuffleNet has the property of producing large connected graphs with small degree and diameter. In order words, it can interconnect a large number of nodes with a small number of transceivers per node such that information from a source can reach its destination in a small number of hops. Since finding the optimal node placement is a computationally hard problem, efficient heuristic algorithms are formulated to design optimized ShuffleNet structures for a given traffic matrix
View