Name
Abstract | ||
|---|---|---|
In this paper, we study monotone routing in the symmetric three-stage Clos network with general bandwidth, and propose a new approach to analyze the multirate rearrangeability. For networks with small size switches, we show that monotone routing is better than the previous methods. © 2001 Academic Press. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1006/jpdc.2001.1755 | Journal of Parallel and Distributed Computing |
Field | DocType | Volume |
Telecommunications network,Computer science,Clos network,Computer network,Bandwidth (signal processing),Monotone polygon,Distributed computing,Commutation | Journal | 61 |
Issue | ISSN | Citations |
9 | 07437315 | 4 |
PageRank | References | Authors |
0.47 | 4 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hu Xiao-Dong | 1 | 144 | 14.06 |
| Xiaohua Jia | 2 | 4609 | 303.30 |
| D.-Z. Du | 3 | 219 | 52.53 |
| F.K Hwang | 4 | 48 | 18.86 |