nD-dBPN: New self-routing permutation networks based on the de Bruijn digraphs

被引：3

作者：

Samsudin, A ^{[1
]}

Lee, KY ^{[1
]}

机构：

[1] Univ Denver, Dept Math & Comp Sci, Denver, CO 80208 USA

来源：

1998 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING - PROCEEDINGS | 1998年

关键词：

non-blocking networks; permutation networks; de Bruijn digraphs; banyan networks;

D O I：

10.1109/ICPP.1998.708535

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

A new class of self-routing permutation network based on the de Bruijn digraphs is proposed. The new networks are modular and scalable, and have an optimal crosspoint complexity. Compared to the crossbar switches of the same size, nD-dBPN uses less cross-points, and operates faster With its optimal configuration, the new network uses O(N log N) cross-points compared to O(N-2) cross-points of the crossbar switches. The 2D-dBPN has the same crosspoint complexity as the 3-stage Clos network, but it has a constant control complexity compared to Omega(N-3/2) of the Clos network.

引用

页码：604 / 611

页数：8

共 21 条

[1] NEW SELF-ROUTING PERMUTATION NETWORKS
LEE, SC
LU, M
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1994, 43 (11) : 1319 - 1323
[2] A new self-routing permutation network
Cheng, WJ
Chen, WT
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1996, 45 (05) : 630 - 636
[3] Cayley digraphs based on the de Bruijn networks
Espona, M
Serra, O
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1998, 11 (02) : 305 - 317
[4] On Routing in a Two-Tier Overlay Network based on de Bruijn Digraphs
Darlagiannis, Vasilios
Mauthe, Andreas
Heckmann, Oliver
Liebau, Nicolas
Steinmetz, Ralf
[J]. 2006 IEEE/IFIP NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM, VOLS 1 AND 2, 2006, : 186 - +
[5] NEW PERFORMANCE BOUNDS OF A CLASS OF SELF-ROUTING NETWORKS
LEA, CT
[J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1992, 40 (03) : 636 - 641
[6] DESIGN OF NONEQUIVALENT SELF-ROUTING NETWORKS BASED ON A MATRIX MODEL
NAVANEETHAN, P
JENKINS, L
[J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1991, 12 (01) : 70 - 73
[7] Design of a new multicast addressing scheme for self-routing ATM tree networks
Choi, JS
Lee, KS
Sohn, SH
[J]. IEICE TRANSACTIONS ON COMMUNICATIONS, 1998, E81B (02) : 297 - 299
[8] A Tree Based Self-routing Scheme for Mobility Support in Wireless Sensor Networks
Kim, Young-Duk
Yang, Yeon-Mo
Kang, Won-Seok
Kim, Jin-Wook
An, Jinung
[J]. MOBILE LIGHTWEIGHT WIRELESS SYSTEMS, 2009, 13 : 114 - +
[9] Optimal Self-Routing Split Modules for Radix-based Interconnection Networks
Jain, Tripti
Schneider, Klaus
[J]. PROCEEDINGS OF THE 2018 16TH ACM/IEEE INTERNATIONAL CONFERENCE ON FORMAL METHODS AND MODELS FOR SYSTEM DESIGN (MEMOCODE), 2018, : 99 - 108
[10] Heuristic for Routing and Wavelength Assignment in de Bruijn WDM Networks Based on Graph Decomposition
Chatterjee, Monish
Goswami, Akik
Mukherjee, Sabyasachi
Bhattacharya, Uma
[J]. 2011 IEEE 5TH INTERNATIONAL CONFERENCE ON ADVANCED NETWORKS AND TELECOMMUNICATION SYSTEMS (ANTS), 2011,

← 1 2 3 →