1990
DOI: 10.1109/26.61445
|View full text |Cite
|
Sign up to set email alerts
|

Multi-log/sub 2/N networks and their applications in high-speed electronic and photonic switching systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

2
101
0

Year Published

1991
1991
2010
2010

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 159 publications
(103 citation statements)
references
References 12 publications
2
101
0
Order By: Relevance
“…By applying the Euler-split technique for coloring a bipartite graph [4] to decompose the CFPP into two sub-CFPPs so as to realize each sub-CFPP in one sub-Benes of the (2N/K)× (2N/K) Benes, we can guarantee that there is only one active link passing through each input/output switch of each sub-Benes. Applying this process recursively, we can finally realize a CFPP rearrangeably nonblocking and crosstalk-free in one stacked Benes of the VSB(N,K) network, as discussed in [10,11,13,21]. A high-level description of the complete CFPP routing algorithm in one (2N/K)× (2N/K) Benes of a VSB(N,K) network can then be obtained by slightly modifying the routing algorithm reported in [21]: Routing Algorithm (Routing of a CFPP in one L×L Benes of a VSB(N,K) network, here L=2N/K)…”
Section: Realizing Cfpp In Benes Networkmentioning
confidence: 99%
“…By applying the Euler-split technique for coloring a bipartite graph [4] to decompose the CFPP into two sub-CFPPs so as to realize each sub-CFPP in one sub-Benes of the (2N/K)× (2N/K) Benes, we can guarantee that there is only one active link passing through each input/output switch of each sub-Benes. Applying this process recursively, we can finally realize a CFPP rearrangeably nonblocking and crosstalk-free in one stacked Benes of the VSB(N,K) network, as discussed in [10,11,13,21]. A high-level description of the complete CFPP routing algorithm in one (2N/K)× (2N/K) Benes of a VSB(N,K) network can then be obtained by slightly modifying the routing algorithm reported in [21]: Routing Algorithm (Routing of a CFPP in one L×L Benes of a VSB(N,K) network, here L=2N/K)…”
Section: Realizing Cfpp In Benes Networkmentioning
confidence: 99%
“…By now, several routing algorithms have been proposed for multi-log 2 N networks, such as random routing [2]- [4], packing [2], save the unused [2], etc. It is notable that the available results on routing algorithms of multi-log 2 N networks mainly focus on the nonblocking condition analysis when a specified routing algorithm is applied [1], [2], [5]- [8]. The recent results in [2] indicate that although some routing algorithms are apparently very different, such as save the unused, packing, minimum index, etc., they actually require a same number of planes to guarantee the nonblocking property of multilog 2 N networks.…”
Section: Introductionmentioning
confidence: 99%
“…The multi-log 2 N network architecture, which is based on the vertical stacking of multiple log 2 N networks [1], is attractive for constructing the optical switches due to its small depth, absolute loss uniformity, etc.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The optical switching networks (or switches), that can switch optical signals in optical domain with an ultra-high speed, will be the key supporting elements for the operation and efficiency of future high-capacity optical networks. The multi-log 2 N network architecture, which is based on the vertical stacking of multiple log 2 N networks [1], has been attractive for constructing the optical switching networks due to its small depth, absolute loss uniformity, etc.…”
Section: Introductionmentioning
confidence: 99%