Name
Abstract | ||
|---|---|---|
Routing and Wavelength Assignment (RWA) problem is a classical problem in Wavelength Division Multiplexing (WDM) networks. It is reported that RWA. problem is a NP-hard problem as the global optimum is not achievable in polynomial time due to the memory limitation of digital computers. We model the RWA problem as an Integer Linear Programming (ILP) problem under wavelength continuity constraint and solve it using Genetic Algorithm (GA.) approach to obtain a near optimal solution. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-17563-3_70 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Routing and Wavelength,Assignment,Wavelength Division,Multiplexing,NP-hard Integer,Linear Programming,Wavelength Continuity,Constraint Genetic Algorithm | Wavelength-division multiplexing,Mathematical optimization,Computer science,Routing and wavelength assignment,Global optimum,Wdm optical networks,Integer programming,Time complexity,Multi-commodity flow problem,Genetic algorithm | Conference |
Volume | ISSN | Citations |
6466 | 0302-9743 | 1 |
PageRank | References | Authors |
0.37 | 7 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ravi Sankar Barpanda | 1 | 4 | 1.81 |
| Ashok Kumar Turuk | 2 | 63 | 18.86 |
| Bibhudatta Sahoo | 3 | 91 | 26.57 |
| Banshidhar Majhi | 4 | 356 | 49.76 |