A New Control Algorithm for Wide-Sense Nonblocking Multiplane Photonic Banyan-Type Switching Fabrics with Zero Crosstalk

Danilewicz, Grzegorz; Kabacinski, W.; Michalski, Marek; Żal, Mariusz

doi:10.1109/jsac-ocn.2008.029707

Cited by 16 publications

(7 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This representation is used to explain the idea of the algorithm. Each plane has its own matrix A [19]- [21], containing information about connections realized in this plane between input switch i = x/2 and output switch j = y/2 . Connection 12, 5 realized in plane p = 3 is represented by the value a 3,6,2 = 1.…”

Section: A Representation Of Sns' State In Matricesmentioning

confidence: 99%

See 1 more Smart Citation

The control algorithm and the FPGA controller for non-interruptive rearrangeable Log2(N, 0, p) switching networks

Kabacinski

Michalski

2013

2013 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

This paper presents the control algorithm for noninterruptive rearrangements in log2(N, 0, p) switching networks. The proposed algorithm is able to find a plane for any new connection in the rearrangeable switching network with no more than three rearrangements. Moreover, these rearrangements can be realized in the switching network without interrupting transmission for existing connections. Rearrangements are done by setting up a new connecting path before the old connecting path for the rearranged connection is disconnected. We also describe the FPGA implementation of this algorithm for the log2(32, 0, 4) switching network. This FPGA controller has been tested and verified.

show abstract

Section: A Representation Of Sns' State In Matricesmentioning

confidence: 99%

“…Connection x, y can be set up in plane p only when b p, x/2 , y/2 = 0, otherwise plane p is blocked for this connection. More details about matrices A and B can be found in our earlier works [15], [16] and [20], [21]. …”

Section: A Representation Of Sns' State In Matricesmentioning

confidence: 99%

The control algorithm and the FPGA controller for non-interruptive rearrangeable Log2(N, 0, p) switching networks

Kabacinski

Michalski

2013

2013 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

show abstract

“…A survey of different combinatorial properties of Clos networks, not only strict-sense nonblocking, but also wide-sense nonblocking and rearrangeable, can be found in [24], [25], [26]. In case of optical networks nonblocking conditions and control algorithms with crosstalk constraints were considered for instance in [27]. Up till now, considerations on Clos networks were limited only to cases with at most two multiplexing levels, i.e., apart of space-division switching, switching in one more domain was used (time or wavelength).…”

Section: Introductionmentioning

confidence: 99%

Strict-sense nonblocking networks with three multiplexing and switching levels

Kabacinski

Kleban

Michalski

et al. 2015

2015 International Symposium on Networks, Computers and Communications (ISNCC)

View full text Add to dashboard Cite

Changes in traffic characteristics impose new requirements on interconnection network in large data centers. These requirements force changes to be done in the network architecture and used technology. Traditional tree network topology is being replaced by Clos network, called also Leaf-Spine topology, and optical interconnection networks are added in parallel to conventional electronic switching networks. Circuit switching is also used in such network instead of packet switching. In this paper we analyze the three-stage Clos network in which three multiplexing schemes are used simultaneously on input, output, and interstage links and with circuit switching mode. Strict-sense nonblocking conditions for this network with three multiplexing levels (space, wavelength, and mode) are derived and proved. Up till now such network with at most two multiplexing levels (space and time, or space and wavelength) has been considered.

show abstract

“…In a W NB network, a connection between an idle inlet-outlet pair without disturbing the existing ones can be established if a rule is followed during the connection setup. A new algorithm has been provided recently in [7].…”

Section: Introductionmentioning

confidence: 99%

A Routing Algorithm for Rearrangeable Nonblocking Optical Banyan-type Networks

Guan

Tong

Chen

2012

2012 Seventh International Conference on Broadband, Wireless Computing, Communication and Applications

View full text Add to dashboard Cite

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 crosstalk 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.

show abstract

A New Control Algorithm for Wide-Sense Nonblocking Multiplane Photonic Banyan-Type Switching Fabrics with Zero Crosstalk

Cited by 16 publications

References 30 publications

The control algorithm and the FPGA controller for non-interruptive rearrangeable Log2(N, 0, p) switching networks

The control algorithm and the FPGA controller for non-interruptive rearrangeable Log2(N, 0, p) switching networks

Strict-sense nonblocking networks with three multiplexing and switching levels

A Routing Algorithm for Rearrangeable Nonblocking Optical Banyan-type Networks

Contact Info

Product

Resources

About