1998
DOI: 10.1090/dimacs/042/12
|View full text |Cite
|
Sign up to set email alerts
|

Non-blocking routing properties of Clos networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2002
2002
2013
2013

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 0 publications
0
4
0
Order By: Relevance
“…Again, a realization of muticast switch based on Benes network will be discussed next to illustrating the generalized nonblocking copy process based on rank-based assignment algorithm and interval splitting algorithm proposed in [25], [26].…”
Section: Crosstalk-free Multicast Switching Networkmentioning
confidence: 99%
See 2 more Smart Citations
“…Again, a realization of muticast switch based on Benes network will be discussed next to illustrating the generalized nonblocking copy process based on rank-based assignment algorithm and interval splitting algorithm proposed in [25], [26].…”
Section: Crosstalk-free Multicast Switching Networkmentioning
confidence: 99%
“…11, the central module assigned to a connection corresponds to the color on each edge. It has shown in [25], [26] that if the set of connection requests is monotonic, the corresponding bipartite graph can be edge-colored by a rank-based algorithm. In the example shown in Fig.…”
Section: A Benes Copy Networkmentioning
confidence: 99%
See 1 more Smart Citation
“…In this paper, the interest is on the time dilation approach to solve the optical crosstalk problem in the omega networks, a class of self-routable networks, which is topologically equivalent to the baseline, butterfly, cube networks et [10]. The time dilation approach solves the crosstalk problem by ensuring that only one signal is allowed to pass through each switching element at a given time in the network [11] [12].…”
Section: Introductionmentioning
confidence: 99%