Name
Abstract | ||
|---|---|---|
The 3-stage Clos network C ( n , m , r ) in the multirate environment has recently been studied for strictly nonblocking and rearrangeably nonblocking, but not much is known for wide-sense nonblocking. This is not really surprising since very little is known about wide-sense nonblocking even for the classical circuit switching environment. In this paper, we propose a class of “quota” algorithms and show that by using such an algorithm the number m of center switches required is always less than that for strictly nonblocking. In particular, when no bound is set for the rate (except it is greater than zero and not exceeding the link capacity), then m required for strictly nonblocking is unbounded, while 5.75 n suffice for our algorithm. Better results for the 2-rate and 3-rate environments are also obtained. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1016/S0304-3975(96)00151-X | Theor. Comput. Sci. |
Keywords | DocType | Volume |
Wide-sense nonblocking,3-stage Clos network | Journal | 182 |
Issue | ISSN | Citations |
1-2 | Theoretical Computer Science | 8 |
PageRank | References | Authors |
0.89 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| B. Gao | 1 | 23 | 2.03 |
| F. K. Hwang | 2 | 332 | 100.54 |