Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/LCOMM.2005.1506721 | IEEE Communications Letters |
Keywords | Field | DocType |
Wavelength routing,Wavelength assignment,Optical fiber networks,Integer linear programming,Computer networks,Evolutionary computation,Computational efficiency,Computational complexity,Optical wavelength conversion,Heuristic algorithms | Mathematical optimization,Search algorithm,Computer science,Static routing,Algorithm,Routing and wavelength assignment,Assignment problem,Integer programming,Linear programming,Optimization problem,Tabu search | Journal |
Volume | Issue | ISSN |
9 | 9 | 1089-7798 |
Citations | PageRank | References |
12 | 0.76 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ying Wang | 1 | 16 | 3.32 |
| Tee Hiang Cheng | 2 | 163 | 22.72 |
| Meng Hiot Lim | 3 | 383 | 17.25 |