By Topic

On-line multicast routing in WDM grooming 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)
A. Vishwanath ; Dept. of Comput. Sci., Australian Nat. Univ., Canberra, ACT, Australia ; W. Liang

This paper considers the problem of on-line multicast routing in WDM grooming optical mesh networks without wavelength conversion capability. In such networks, provisioning of connection requests with fractional wavelength capacity requirements is achieved by dividing a wavelength into multiple time slots and multiplexing traffic on the wavelength. We present an on-line multicast traffic grooming algorithm for the concerned problem. The objective is to efficiently route multicast requests with sub-wavelength capacity requirements onto high-capacity wavelengths, and balance the load on the links in the network at the same time. To do so, we propose a cost function, which not only encourages grooming new requests onto the wavelengths that are being used by existing traffic, but also performs load balancing by intelligently increasing the cost of using wavelengths on links. The performance results obtained by experiments on a representative sized mesh network show that the proposed algorithm outperforms the other existing algorithms.

Published in:

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.

Date of Conference:

17-19 Oct. 2005