By Topic

Algorithms for allocating wavelength converters in all-optical 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

2 Author(s)
Gaoxi Xiao ; Dept. of Electr. Eng., Polytech. Univ., Brooklyn, NY, USA ; Leung, Y.-W.

In an all-optical wide area network, some network nodes may handle heavier volumes of traffic. It is desirable to allocate more full-range wavelength converters (FWCs) to these nodes, so that the FWCs can be fully utilized to resolve wavelength conflict. We propose a set of algorithms for allocating FWCs in all-optical networks. We adopt the simulation-based optimization approach, in which we collect utilization statistics of FWCs from computer simulations and then perform optimization to allocate the FWCs. Therefore, our algorithms are widely applicable and they are not restricted to any particular model or assumption. We have conducted extensive computer simulations on regular and irregular networks under both uniform and nonuniform traffic. Compared with the best existing allocation, the results show that our algorithms can significantly reduce: (1) the overall blocking probability (i.e., better mean quality of service) and (2) the maximum of the blocking probabilities experienced at all the source nodes (i.e., better fairness). Equivalently, for a given performance requirement on blocking probability, our algorithms can significantly reduce the number of FWCs required

Published in:

Networking, IEEE/ACM Transactions on  (Volume:7 ,  Issue: 4 )