Routing and wavelength assignment for a class of regular optical WDM networks under wide-sense nonblocking multicast

  • Authors:

  • N. Nagarajan;D. Savithri;K. Kalamani;S. K. Srivatsa

  • Affiliations:

  • Department of Mechatronics Engineering, Sri Krishna College of Engg. & Technology, Coimbatore, Tamilnadu, India;Department of Computer Applications, Sri Krishna College of Engg. & Technology, Coimbatore, Tamilnadu, India;Department of Electronics and Communication Engineering, Sri Krishna College of Engg. & Technology, Coimbatore, Tamilnadu, India;Department of Electronics and Communication Engineering, Madras Institute of Technology, Chennai, Tamilnadu, India

  • Venue:
  • ICAI'05/MCBC'05/AMTA'05/MCBE'05 Proceedings of the 6th WSEAS international conference on Automation & information, and 6th WSEAS international conference on mathematics and computers in biology and chemistry, and 6th WSEAS international conference on acoustics and music: theory and applications, and 6th WSEAS international conference on Mathematics and computers in business and economics
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multicast connections need to be established in an all-optical network when the information from a single source is to be distributed to a number of destinations. A set of multicast connections that do not involve the same source wavelength at the input side and the same destination wavelength at the output side is referred to as multicast assignment. This becomes an important requirement in high-performance networks. In this paper, we study multicast communication in a class of optical WDM networks with regular topologies such as cube-connected cycles, butterfly, pyramid, shuffle-exchange and de Bruijn. For each type of network, we have derived the necessary and sufficient conditions on the minimum number of wavelengths required for a WDM network to be wide-sense nonblocking either by some commonly used routing algorithms or under our proposed heuristic algorithms incorporating certain commonly used routing algorithms depending on the network.