By Topic

Dynamic multicast routing and wavelength assignment using generic graph model for 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
$33 $33
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

5 Author(s)
Y. Zhou ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore ; G. -S. Poo ; S. Chen ; P. Shum
more authors

The problem of dynamic multicast routing and wavelength assignment (MC-RWA) in the wavelength-routed wavelength-division-multiplexing networks is addressed. Current solutions to this problem always rely on homogeneous network constructions. However, future backbone networks tend to be heterogeneous in nature. Thus, the dynamic MC-RWA problem should be studied in a more realistic situation by considering the heterogeneity of network structures. A new graph model is proposed for the MC-RWA problem. This model is based on layered auxiliary graph which is generic and able to support various node architectures and heterogeneous network structures. Based on this graph model, the dynamic MC-RWA problem can be simply solved by an efficient multicast tree algorithm on various light-splitting and wavelength-conversion scenarios. In general, this graph model provides a universal platform to study different aspects of the dynamic MC-RWA as well as related problems.

Published in:

IET Communications  (Volume:2 ,  Issue: 7 )