Title :
A Routing Algorithm for Rearrangeable Nonblocking Optical Banyan-type Networks
Author :
Guan, D.J. ; Li-Da Tong ; Chen, I.Y.
Author_Institution :
Dept. of Comput. Sci. & Eng., Nat. Sun Yat-sen Univ., Kaohsiung, Taiwan
Abstract :
A Banyan-type network is a typical network topology for optical interconnection networks. In this paper, we propose a routing algorithm to generate the nonblocking connections for any request on a Banyan-type network with a given cross talk constraint, in which the number of planes exactly equals to the necessary and sufficient condition derived in our previous results. In addition, we analyze this routing algorithm by relating to the study of graph theory and found it is a polynomial time algorithm.
Keywords :
graph theory; multistage interconnection networks; optical crosstalk; optical fibre networks; optical interconnections; telecommunication network routing; crosstalk constraint; graph theory; network topology; nonblocking connections; optical interconnection networks; polynomial time algorithm; rearrangeable nonblocking optical Banyan-type networks; routing algorithm; Crosstalk; Optical crosstalk; Optical fiber networks; Optical interconnections; Optical switches; Routing; Banyan-type networks; Rearrangeably nonblocking; crosstalk; optical networks; routing algorithm;
Conference_Titel :
Broadband, Wireless Computing, Communication and Applications (BWCCA), 2012 Seventh International Conference on
Conference_Location :
Victoria, BC
Print_ISBN :
978-1-4673-2972-9
DOI :
10.1109/BWCCA.2012.55
