(Created page with " == Abstract == ming at simultaneously minimizing the network wavelength requirement (NWR) and the network bandwidth requirement (NBR) for a given traffic matrix, we focus on...") |
m (Scipediacontent moved page Draft Content 381193470 to Wu Yeung 2007a) |
(No difference)
|
ming at simultaneously minimizing the network wavelength requirement (NWR) and the network bandwidth requirement (NBR) for a given traffic matrix, we focus on the static routing problem in WDM networks with full wavelength conversion. A new algorithm MET (most even traffic distribution) is proposed. MET consists of two steps, the initial shortest-path-based route assignment, followed by a rerouting process to refine the solution. Unlike existing approaches, MET makes each rerouting decision by judiciously balancing the overall network traffic loads. A uniformity function is defined and embodied in MET to characterize the traffic load distribution in the network. Numerical results show that MET outperforms the best existing algorithm (Min-hops) by requiring less amount (about 10% saving) of network bandwidth (NBR) and less number of wavelengths (NWR).
The different versions of the original document can be found in:
Published on 01/01/2007
Volume 2007, 2007
DOI: 10.1109/hpsr.2006.1709715
Licence: Other
Are you one of the authors of this document?