Parallel routing and wavelength assignment for optical multistage interconnection networks

Lu, Enyue; Zheng, S. Q.

doi:10.1109/icpp.2004.1327924

Cited by 13 publications

(5 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several methods have been proposed for routing on Beneš network [7], [18], [8], [20], [2] using rearrangement method. Beneš networks have been proposed for use in large parallel processing systems [21], [24], optical communications system [12], [13], [14] and in other high speed communication systems. With all the proposed routing methods and applications Beneš networks or in that case rearrangeable networks have not see that much practical application.…”

Section: Introductionmentioning

confidence: 99%

Efficient Implementation of Symmetric Multistage Repackable Networks

Chakrabarty

Collier

2010

2010 International Conference on Computational Intelligence and Communication Networks

View full text Add to dashboard Cite

We revisited the problem of efficient implementation of large scale switching systems using repackable networks [16], which offer performance approaching that of strict sense nonblocking networks. In particular, we study repackable networks with more than three stages. Our method uses bypass path(s) for designing the repackable network to maintain path continuity while at repacking. This is essential if networks are not to be limited to time-slatted operations. We investigate the minimum number of bypass links required for different network sizes. The required minimum number of bypass links for a network depends on the number of links forming a rearrangement chain [2]. This paper shows minimum number of links required to complement a repackable and thereby demonstrate its attractive scaling properties. It also proposes some future applications where these network can be applicable.

show abstract

Section: Introductionmentioning

confidence: 99%

Efficient Implementation of Symmetric Multistage Repackable Networks

Chakrabarty

Collier

2010

2010 International Conference on Computational Intelligence and Communication Networks

View full text Add to dashboard Cite

show abstract

“…Multistage interconnection networks (MINs) have been proposed as interconnecting structures in various types of communication applications ranging from parallel systems [1], switching architectures [2], to multicore systems [3]. Advances in optical technologies have drawn the interest for optical implementation in MINs to achieve high bandwidth capacity at the rate of terabits per second.…”

Section: Introductionmentioning

confidence: 99%

Fast ZeroX algorithm for efficient message routing in optical multistage interconnection networks

Shahida

Othman

Khazani

2008

2008 International Conference on Computer and Communication Engineering

View full text Add to dashboard Cite

Based on the ZeroX algorithm, we proposed a fast and efficient crosstalk-free algorithm called the Fast ZeroX algorithm for solving optical crosstalk problem in Omega networks. In our approach, we introduced the concept of inverse Conflict Matrix (iCM), another representation of a conflict matrix in which it summarizes all possible conflicts between each node in the network. Using iCM, the ZeroX algorithm is simplified, thus improved by reducing the time needed for routing process. From our simulation results, it is shown that our approach yields better performance in terms of minimal routing time in comparison to the original ZeroX algorithm.

show abstract

“…The three approaches include the the space domain (Qiao, 1996), time domain (Qiao, et al, 1994) and wavelength domain (Lu, et al, 2004) dilation. Space domain approach duplicates and combines a MIN to avoid crosstalk within individual SE.…”

Section: Time Domain Approachmentioning

confidence: 99%