NOVEL ALGORITHM FOR CLOS-TYPE NETWORKS

被引：10
|
作者：
GORDON, J [1 ]
SRIKANTHAN, S [1 ]
机构：
[1] HATFIELD POLYTECH,DEPT ELECT ENGN,HATFIELD AL10 9AB,HERTS,ENGLAND
来源：
ELECTRONICS LETTERS | 1990年 / 26卷 / 21期
关键词：
Networks and network theory;
D O I：
10.1049/el:19901138
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
A new routing algorithm for controlling nonblocking type permutation networks is presented. Unlike algorithms based on matrix decomposition and looping niques, the algorithm uses a new method called does not use iterations, and has execution time 0(Nr1/2 where N is the total number of ports, and r is the number of first-stage switch. © 1990, The Institution of Electrical Engineers. All rights reserved.
引用
收藏
页码：1772 / 1774
页数：3
相关论文
共 50 条
  • [31] THE COMPLEXITY OF ROUTING IN CLOS PERMUTATION NETWORKS
    KOPPELMAN, DM
    ORUC, AY
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (01) : 278 - 284
  • [32] Modeling the blocking behavior of Clos networks
    Yang, YY
    Kessler, NH
    ADVANCES IN SWITCHING NETWORKS, 1998, 42 : 85 - 102
  • [33] CONTROL ALGORITHMS FOR REARRANGEABLE CLOS NETWORKS
    HWANG, FK
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (08) : 952 - 954
  • [34] Clos Networks: a correction of the Jacobaeus result
    Rigault, C
    ANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATIONS, 2002, 57 (11-12): : 1244 - 1252
  • [35] 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
  • [36] 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
  • [37] ON SELF-ROUTING IN CLOS CONNECTION NETWORKS
    DOUGLASS, BG
    ORUC, AY
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1993, 41 (01) : 121 - 124
  • [38] Multicast three-stage Clos networks
    Maier, Guido
    Pattavina, Achille
    COMPUTER COMMUNICATIONS, 2010, 33 (08) : 923 - 928
  • [39] On 3-rate rearrangeability of Clos networks
    Lin, GH
    Du, DZ
    Wu, WL
    Yoo, K
    ADVANCES IN SWITCHING NETWORKS, 1998, 42 : 315 - 333
  • [40] Monotone routing in multirate rearrangeable clos networks
    Hu, XD
    Jia, XH
    Du, DZ
    Hwang, FK
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2001, 61 (09) : 1382 - 1388
12345