By Topic

An efficient multicast routing algorithm in WDM 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
$33 $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)
Kuo-Bin Tseng ; Dept. of Electron. Eng., Nat. Taiwan Univ. of Sci. & Technol., Taipei, Taiwan ; Jhin-Fang Huang

With the rapid development of high-performance networking technologies, multicast routing with lightpath has become a very important and challenging issue in the field of the wavelength division multiplexing (WDM) network. We present an efficient heuristic algorithm that sets up and releases the lightpaths for multicast routing in WDM networks. A distinguishing feature of our algorithm is that it not only minimizes the number of wavelengths required for multicast demand, but also minimizes the hop length of all multicast networks. The performance of the algorithm is analyzed through simulation and compared with the random wavelength multicast algorithm. Our algorithm achieves much better call-connection probability than the previous algorithm.

Published in:

Communications, Circuits and Systems, 2004. ICCCAS 2004. 2004 International Conference on  (Volume:1 )

Date of Conference:

27-29 June 2004