Efficient window method in optical multistage interconnection networks

Abstract

One undesirable problem introduced by the Optical Multistage Interconnection network is a crosstalk that is caused by coupling two signals within a switching element. To avoid a crosstalk, many approaches have been proposed such as time domain and space domain approaches. Because the messages should be partitioned into several groups to send to the network, window method is used to find out which messages should not be in the same group. In this paper fast window method based on bitwise operations (BWM) is represented. This algorithm reduces the execution time approximately more than ten times compared with previous algorithms.

The Development of Crosstalk-Free Scheduling Algorithms for Routing in Optical Multistage Interconnection Networks

“… All Bitwise-Based algorithms have shown to successfully reduce the execution time of the original algorithm Abed, et al, 2008), except that the number of passes obtained by the new algorithm is the same as before it is implemented using the Bitwise approach. Among all Zero-based algorithms, none of the previous researchers improved the performance of the algorithm in terms of the number of passes to route a permutation.…”

On the Minimization of Crosstalk Conflicts in a Destination Based Modified Omega Network

“…Using any one of the following three techniques we can minimize the crosstalk: the Space Domain Approach [12][13][14][15][16][17][18][19][20], the Wavelength Domain Approach [12][13][14][15][16][17][18][19][20], and the Time Domain Approach (TDA) [12][13][14][15][16][17][18][19][20]. The Time Domain Approach [13,14] reduces the crosstalk problem by allowing only one source and its corresponding destination address to be active at a time within a SE in the network.…”

“…The conventional system uses electronic signals in switching, but optical communication uses optical signals. This interconnection has proficient potential and it offers better performance than the electrical interconnections [9][10][11][12][13][14][15][16][17][18].…”

Link Conflict in Multistage Interconnection Networks

“…To solve the link conflict problem, the time domain approach is used. From previous researches we analyzed that Space domain approach [1], time domain approach [10], [12], [15] and wavelength domain approach [2], [6], [7] are the three approaches which can be used for to avoid conflicts. In Time Domain Approach, the connections are established at different time periods when two or more wavelengths try to access the same wavelength at same time [1], [10], [12], [15].…”

“…From previous researches we analyzed that Space domain approach [1], time domain approach [10], [12], [15] and wavelength domain approach [2], [6], [7] are the three approaches which can be used for to avoid conflicts. In Time Domain Approach, the connections are established at different time periods when two or more wavelengths try to access the same wavelength at same time [1], [10], [12], [15]. Some algorithms in which time domain approach is used are Windows Method [1], [5], Improved Windows Method [1], [3], Bitwise Window Method [14][15], Four Heuristic Algorithms [19], Simulated Annealing (SA) [4], and Zero algorithms [3], [8].…”