Optimal routing and wavelength assignment in WDM ring networks

Cited 49 time in webofscience Cited 0 time in scopus
  • Hit : 641
  • Download : 341
We consider the routing and wavelength assignment (RWA) problem on WDM ring networks without wavelength conversion. When the physical network and required connections are given, RWA is the problem to select a suitable path and wavelength among the many possible choices for each connection such that no two paths using the same wavelength pass through the same link. We give an integer programming formulation of the problem and propose an algorithm to solve it. Although the formulation has exponentially many variables, we solve the linear programming relaxation of it by using the column generation technique. We solve the column generation problem efficiently by decomposing the problem into several subproblems. After solving the linear programming relaxation, we apply the branch-and-price procedure to get an optimal solution. We test the proposed algorithm on some randomly generated data. Test results show that the algorithm gives optimal solutions to almost all instances under the given node limit of the branch-and-bound tree.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2000-10
Language
English
Article Type
Article
Keywords

ALGORITHM; DESIGN

Citation

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, v.18, no.10, pp.2146 - 2154

ISSN
0733-8716
URI
http://hdl.handle.net/10203/7551
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 49 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0