Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||A new scheme to realize crosstalk-free permutation in vertically stacked optical MINs|
|Citation:||Photonic Network Communications, 2003; 5(1):89-102|
|Publisher:||Kluwer Academic Publ|
|X. Jiang, H. Shen, Md. M. Khandker and S. Horiguchi|
|Abstract:||Vertical stacking is a novel alternative for constructing nonblocking multistage interconnection networks (MINs). Rearrangeably nonblocking optical MINs are attractive since they have lower complexity than their strictly nonblocking counterparts. In this paper, we study the realization of crosstalk-free permutations in rearrangeably nonblocking, self-routing banyan-type optical MINs built on vertical stacking. An available scheme for realizing crosstalk-free permutation in this type of optical MINs requires to first decompose a permutation into multiple crosstalk-free partial permutations based on the Euler-Split technique, and then to realize them crosstalk-free in different planes (stacked copies) of the MIN simultaneously. The overall time complexity of this scheme to realize a crosstalk-free permutation in an N × N optical MIN is O(N log N) which is dominated by the complexity of crosstalk-free decomposition. In this paper, we propose a new scheme for realizing permutations in this class of vertically stacked optical MINs crosstalk-free. The basic idea of the new scheme is to classify permutations into permutation classes such that all permutations in one class share the same crosstalk-free decomposition pattern. By running the Euler-Split based crosstalk-free decomposition only once for a permutation class and applying the obtained crosstalk-free decomposition pattern to all permutations in the class, crosstalk-free decomposition of permutations can be realized in a more efficient way. We show that the number of permutations in a permutation class is huge (N!)N when log2N is even and (2N!)N/2 when log2N is odd), and thus the average time complexity of crosstalk-free decomposition of a permutation becomes O(N).|
|Keywords:||banyan network; optical switch; optical crosstalk; rearrangeably nonblocking|
|Description:||The original publication is available at www.springerlink.com|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.