By Topic

Dynamic routing and assignment of wavelength algorithms in multifiber wavelength division multiplexing networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shizhong Xu ; Nat. Key Lab. of Broadband Opt. Fiber Transmission & Commun. Networks, Univ. of Electron. Sci. & Technol. of China, Chengdu, China ; Lemin Li ; Sheng Wang

This paper studies multihop optical networks in which nodes employ wavelength routing switches that enable the establishment of wavelength division multiplexed (WDM) channels, called lightpaths, between node pairs. In fact, most optical networks are multifiber networks. The problem of dynamical routing and assignment of wavelength (RAW) in such networks is studied in this paper. Two resource assignment strategies, PACK and SPREAD, are proposed. By virtue of a layered-graph, routing and assignment of wavelength subproblems can be considered simultaneously. These two strategies can be used to solve the RAW problem in networks with even links as well as that in networks with uneven links. Simulation shows that layered-graph-based RAW algorithms perform better than the existing ones. It also shows that SPREAD with distributive use of network resources can achieve better performance than PACK with collective use of resources in multifiber networks. The layered-graph-based algorithms can effectively deal with the failure of the fiber/link and node. By making use of the special structure of the layered-graph, we propose a shortest path algorithm, whose complexity is lower than that of the standard shortest path algorithm.

Published in:

Selected Areas in Communications, IEEE Journal on  (Volume:18 ,  Issue: 10 )