Comparison of routing and wavelength assignment algorithms for optical networks

Ohta, Satoru; Greca, A.

doi:10.1109/hpsr.2001.923621

Cited by 8 publications

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several heuristic RWA algorithms have been proposed in the literature [16] [17]. The algorithms we use are reported in a technical report [18], one with the Wavelength Continuity Constraint (WCC) and one without.…”

Section: Numerical Resultsmentioning

confidence: 99%

Physical Topology Design for All-Optical Networks

Liu

Tobagi

2006

2006 3rd International Conference on Broadband Communications, Networks and Systems

View full text Add to dashboard Cite

There are many advantages of deploying an alloptical network. Unfortunately, there are still few guidelines on how to properly design the physical topology for such a network. We propose an efficient physical topology design algorithm and we use the asymptotic growth rate of the provisioned capacity as a metric to compare various design alternatives. A higher asymptotic growth rate translates directly into higher deployment cost for large networks. Our study shows that taking fiber length into consideration can lead to lower capacity requirement. We also find that a sufficiently large fiber-to-node ratio is necessary in order to minimize the asymptotic growth in the provisioned capacity, increase capacity utilization and minimize the need for wavelength conversion. We study a real network and find that its fiber-to-node ratio is too low. As a result, large provisioned capacity is required and less than 55% of the capacity is usable. By increasing the ratio, we can reduce the provisioned capacity and achieve close to 80% utilization.

show abstract

Section: Numerical Resultsmentioning

confidence: 99%

Physical Topology Design for All-Optical Networks

Liu

Tobagi

2006

2006 3rd International Conference on Broadband Communications, Networks and Systems

View full text Add to dashboard Cite

show abstract

“…To evaluate the stability of our proposed algorithm, the following simulation is run. The test network is a large network with 50 nodes and 164 unidirectional links [7]. The lightpath requests set ∆ is randomly generated with at most one request for each node pair.…”

Section: Simulationsmentioning

confidence: 99%

“…Another set of simulation is run for a large network [7]. The |∆| varies from 200 to 500 with a step increase of 100.…”

Section: Simulationsmentioning

confidence: 99%

A tabu search algorithm for static routing and wavelength assignment problem

2005

View full text Add to dashboard Cite

Static routing and wavelength assignment (RWA) is usually formulated as an optimization problem with the objective of minimizing wavelength usage (MWU). Existing solution methodologies for the MWU problem are usually based on a two-step approach, where routing and wavelength assignment are done independently. Though this approach can reduce computational cost, the optimality of the solution is compromised. We propose a novel tabu search (TS) algorithm, which considers routing and wavelength assignment jointly without increasing the computational complexity. The performance of the proposed TS algorithm is compared with the Integer Linear Programming (ILP) method, which is known to solve the MWU to optimality. The results for both small and large networks show that our proposed TS algorithm works almost as well as the ILP solution and is much more computationally efficient.

show abstract

“…Namely, how to select and assign the suitable route wavelength for arrived business [1]. The objectives of RWA are to minimize the required number of wavelengths [2] [3], or to minimize the blocking probability under given number of wavelengths and dynamic connection requests [4], or to minimize the network cost, e.g., wavelength converters. RWA problems have been researched under specific conditions such as static light-path establish (SLE) and dynamic light-path establish (DLE), with/without wavelength converters.…”

Section: Introductionmentioning

confidence: 99%

Key links forecast with dynamic weight algorithm for RAW in optical networks

Shan

Dong

Zhu

2008

2008 2nd International Conference on Anti-Counterfeiting, Security and Identification

View full text Add to dashboard Cite

It had been proved that routing and wavelength assignment (RWA) in an arbitrary mesh optical network is an NP-complete problem. Previous works intended to solve this problem through various approaches, such as heuristics algorithm or graph theory. However, the computational time would increase exponentially with the problem size. Especially to a dynamic traffic model, the connection requests arrive and depart in a random manner and light-path's occupation depends on the current network utilization status, RWA problem become more complicated. Furthermore, the estimation model for link blocking probability is also quite inaccurate. People can find from realistic network where many more connections are requested between some source and destination node pairs than others. We consider the network performance deterioration is more likely caused by certain key links of network, which is related to static factor, such as particular network topology, and dynamic factors, such as wavelength exhausted rate as well as the number of free wavelength. In this paper, we propose an efficiently approximate approach, which comprehensively consider the factors of hops and free wavelengths based on the concept of key links, then dynamically choose and assign the optimal route and wavelength for arrival connection requests. The analysis result shows our algorithm can achieve better load balance and lower blocking probability with less computing complexity comparing to common RWA algorithms, particularly for larger sized networks.Index Terms-optical network, routing and wavelength assignment (RWA), computing complexity, blocking probability, load balance I.

show abstract

Comparison of routing and wavelength assignment algorithms for optical networks

Cited by 8 publications

References 7 publications

Physical Topology Design for All-Optical Networks

Physical Topology Design for All-Optical Networks

A tabu search algorithm for static routing and wavelength assignment problem

Key links forecast with dynamic weight algorithm for RAW in optical networks

Contact Info

Product

Resources

About