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 条
  • [31] On minimum congestion routing in rearrangeable multihop lightwave networks
    Skorin-Kapov, Jadranka
    Labourdette, Jean-Francois
    Journal of Heuristics, 1995, 1 (01) : 129 - 145
  • [32] A new evaluation criterion for Clos- and Benes-type rearrangeable switching networks
    Gragopoulos, I
    Pavlidou, FN
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1997, 45 (01) : 119 - 126
  • [33] Semi-rearrangeably nonblocking operation of Clos networks in the multirate environment
    Liotopoulos, FK
    Chalasani, S
    IEEE-ACM TRANSACTIONS ON NETWORKING, 1996, 4 (02) : 281 - 291
  • [34] Blocking probability of bicast connections in a rearrangeable clos network
    Datta, S
    Kobayashi, H
    2004 IEEE/SARNOFF SYMPOSIUM ON ADVANCES IN WIRED AND WIRELESS COMMUNICATION, 2004, : 107 - 110
  • [35] Parallel routing algorithms in Benes-Clos networks
    Lee, TT
    Liew, SY
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2002, 50 (11) : 1841 - 1847
  • [36] Non-blocking routing properties of Clos networks
    Lee, TT
    To, PP
    ADVANCES IN SWITCHING NETWORKS, 1998, 42 : 181 - 195
  • [37] RANDOMIZED SELF-ROUTING ALGORITHMS FOR CLOS NETWORKS
    YOUSSEF, A
    COMPUTERS & ELECTRICAL ENGINEERING, 1993, 19 (06) : 419 - 429
  • [38] A distributed semi-rearrangeable nonblocking path hunt algorithm for Clos networks with TDM links
    Ayandeh, S
    2002 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, CONFERENCE PROCEEDINGS, 2002, : 2832 - 2842
  • [39] Parallel routing algorithms in Benes-Clos networks
    Lee, TT
    Liew, SY
    IEEE INFOCOM '96 - FIFTEENTH ANNUAL JOINT CONFERENCE OF THE IEEE COMPUTER AND COMMUNICATIONS SOCIETIES: NETWORKING THE NEXT GENERATION, PROCEEDINGS VOLS 1-3, 1996, : 279 - 286
  • [40] Adaptive Routing Strategy for Large Scale Rearrangeable Symmetric Networks
    Chakrabarty, Amitabha
    Collier, Martin
    Mukhopadhyay, Sourav
    INTERNATIONAL JOURNAL OF GRID AND HIGH PERFORMANCE COMPUTING, 2010, 2 (02) : 53 - 63
12345