Performance analysis of WDM optical shuffle - exchange and debruijn networks

Authors:
N. Nagarajan;D. Savithri;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, 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

Citing 5
Cited 0

Permutation routing in wavelength-routed wrapped-around shuffle networks using fewer wavelengths

Computer Networks and ISDN Systems
Multicast routing and wavelength assignment in multihop optical networks

IEEE/ACM Transactions on Networking (TON)
Multicasting and Broadcasting in Large WDM Networks

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Fundamentals of Data Structures in C++

Fundamentals of Data Structures in C++
Wavelength conversion in WDM networking

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the performance analysis of a class of WDM optical networks with regular topologies such as shuffle-exchange and deBrujin. The performance metrics of interest are minimizing the number of hops and the wavelengths required. We consider only static traffic demand and we have not used any wavelength converters or light splitters in these networks. Further, the analysis is made for wide-sense nonblocking multicast session. A heuristic algorithm is proposed in this paper for routing, which greatly reduces the number of wavelengths required for intermediate nodes than the end nodes of both the topologies considered by us. The cost functions are determined for both cases in terms of the hop count and the number of usage of wavelengths. We compare our results with breadth-first-search algorithm and prove that the performance due to our algorithm is relatively better than breadth-first-search algorithm.