RWA problem for designing DWDM networks - delay against capacity optimisation
Kavian, Y. S., Rashvand, H. F., Ren, W., Leeson, Mark S., 1963-, Hines, Evor, 1957- and Naderi, M.. (2007) RWA problem for designing DWDM networks - delay against capacity optimisation. Electronics Letters, Vol.43 (No.16). pp. 892-893. ISSN 0013-5194Full text not available from this repository.
Official URL: http://dx.doi.org/10.1049/el:20071219
Adaptation of QoS in DWDM optical networks routing and the wavelength assignment (RWA) problem, known as an NP-hard problem, are addressed. The QoS constraint based routing RWA computes lightpaths for the original-destination node pair, (0, D), to meet the QoS propagation delay requirements. A heuristic algorithm based on a genetic algorithm (GA) is then developed to solve this problem. A simulation program is developed to demonstrate the efficiency of the GA for the COST 239 network. The trade-off between the capacity and the propagation delay has been analysed. Results show that the trade-off is 8.7% of the average capacity, increasing to 10.6% decrease for the average delay.
|Item Type:||Journal Article|
|Subjects:||T Technology > TK Electrical engineering. Electronics Nuclear engineering|
|Divisions:||Faculty of Science > Engineering|
|Journal or Publication Title:||Electronics Letters|
|Publisher:||Institution of Engineering and Technology|
|Date:||2 August 2007|
|Number of Pages:||2|
|Page Range:||pp. 892-893|
|Access rights to Published version:||Restricted or Subscription Access|
Actions (login required)