کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
463603 | 697147 | 2013 | 12 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Binary quadratic programming formulation for routing and wavelength assignment problem in all-optical WDM networks Binary quadratic programming formulation for routing and wavelength assignment problem in all-optical WDM networks](/preview/png/463603.png)
Routing and wavelength assignment (RWA) is the most concern in wavelength routed optical networks. This paper proposes a novel binary quadratic programming (BQP) formulation for the static RWA problem in order to balance traffic load among a network links more fairly. Subsequently, a greedy heuristic algorithm namely variable-weight routing and wavelength assignment (VW-RWA) is proposed to solve the developed BQP problem. In this method, the weight of a link is proportional to the link congestion. Performance evaluation results for different practical network topologies show that our proposed algorithm can decrease the number of required wavelengths in the network, blocking rate and variance of used wavelengths in each link. Besides, it is shown that the number of required wavelengths to establish call requests for a given network topology can be reduced at lower cost compared to other heuristics.
Journal: Optical Switching and Networking - Volume 10, Issue 4, November 2013, Pages 354–365