Monotone routing in multirate rearrangeable clos networks

被引：10
|
作者：
Hu, XD [1 ]
Jia, XH
Du, DZ
Hwang, FK
机构：
[1] Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China
[2] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
[3] Univ Minnesota, Dept Comp Sci, Minneapolis, MN 55455 USA
[4] Natl Chiao Tung Univ, Dept Appl Math, Hsinchu, Taiwan
来源：
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 2001年 / 61卷 / 09期
关键词：
D O I：
10.1006/jpdc.2001.1755
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we study monotone routing ill 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. (C) 2001 Academic Press.
引用
收藏
页码：1382 / 1388
页数：7
相关论文
共 50 条
12345