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 条

[21] Nonblocking, repackable, and rearrangeable Clos networks: Fifty years of the theory evolution
Jajszczyk, A
IEEE COMMUNICATIONS MAGAZINE, 2003, 41 (10) : 28 - 33
[22] On minimal congestion routing in rearrangeable lightwave networks
SkorinKapov, J
Labourdette, JF
KOI'96 - 6TH INTERNATIONAL CONFERENCE ON OPERATIONAL RESEARCH, PROCEEDINGS, 1996, : 57 - 61
[23] THE COMPLEXITY OF ROUTING IN CLOS PERMUTATION NETWORKS
KOPPELMAN, DM
ORUC, AY
IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (01) : 278 - 284
[24] A NEW ROUTING ALGORITHM FOR A CLASS OF REARRANGEABLE NETWORKS
FENG, TY
SEO, SW
IEEE TRANSACTIONS ON COMPUTERS, 1994, 43 (11) : 1270 - 1280
[25] A new routing algorithm for a class of rearrangeable networks - Comment
Marom, DM
Mendlovic, D
IEEE TRANSACTIONS ON COMPUTERS, 1997, 46 (06) : 734 - 734
[26] ON SELF-ROUTING IN CLOS CONNECTION NETWORKS
DOUGLASS, BG
ORUC, AY
IEEE TRANSACTIONS ON COMMUNICATIONS, 1993, 41 (01) : 121 - 124
[27] On Multicast Scheduling and Routing In Multistage Clos Networks
Tang, Bin
3RD ACS/IEEE INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS, 2005, 2005,
[28] Strictly nonblocking three-stage clos networks with some rearrangeable multicast capability
Hwang, FK
Liaw, SC
Tong, LD
IEEE TRANSACTIONS ON COMMUNICATIONS, 2003, 51 (11) : 1765 - 1767
[29] On evil-twin routing in clos networks
Chen, Z
Liu, ZJ
Qiu, ZL
Tao, XM
IEEE COMMUNICATIONS LETTERS, 2004, 8 (05) : 314 - 316
[30] Low Complexity Routing Algorithm for Rearrangeable Switching Networks
Chakrabarty, Amitabha
Collier, Martin
2013 IEEE 27TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA), 2013, : 145 - 152

← 1 2 3 4 5 →