Routing and wavelength assignment (RWA) problem is an important issue in optical transport networks based on wavelength division multiplexing (WDM) technique. It is typically solved using a combination of linear programming and graph coloring, or path selection based graph algorithms. Such methods are either complex or make extensive use of heuristics. In this paper we propose a novel and efficient approach which basically obtains the maximum edge disjoint paths (EDPs) for each source-destination demand pair. And those EDPs obtained are stored in Lookup Table and used for the update of weight matrix. Routes are determined in order by the weight matrix for the demand set. The comprehensive computer simulation shows that the proposed algorithm uses similar or fewer number of wavelengths with significantly less execution time than bounded greedy approach (BGA) for EDP  which is currently known to be effective in practice.
Swipe to navigate through the chapters of this book
- A Practical RWA Algorithm Based on Lookup Table for Edge Disjoint Paths
Myung Hee Kim
Byung Ho Yae
- Springer Berlin Heidelberg
- Sequence number
Neuer Inhalt/© ITandMEDIA