Monotone routing in multirate rearrangeable Clos networks
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › Comment/debate
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Pages (from-to) | 1382-1388 |
| Journal / Publication | Journal of Parallel and Distributed Computing |
| Volume | 61 |
| Issue number | 9 |
| Publication status | Published - 2001 |
Link(s)
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.
Citation Format(s)
Monotone routing in multirate rearrangeable Clos networks. / Hu, Xiao-Dong; Jia, Xiao-Hua; Du, Ding-Zhu et al.
In: Journal of Parallel and Distributed Computing, Vol. 61, No. 9, 2001, p. 1382-1388.
In: Journal of Parallel and Distributed Computing, Vol. 61, No. 9, 2001, p. 1382-1388.
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › Comment/debate
