Choosing the best logk(N,m,P) strictly nonblocking networks

被引：24

作者：

Hwang, FK ^{[1
]}

机构：

[1] Chiao Tung Univ, Dept Appl Math, Hsinchu 30050, Taiwan

来源：

IEEE TRANSACTIONS ON COMMUNICATIONS | 1998年 / 46卷 / 04期

关键词：

Banyan network; Clos network; strictly nonblocking network;

D O I：

10.1109/26.664299

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

We extend the log(2) (N, m, P) network proposed by Shyy and Lea to base k. We give a unifying proof (instead of three separate cases as done by Shyy and Lea) for the condition of being strictly nonblocking, and a simpler expression of the result. We compare the number of crosspoints for log(k) (n, m, p) over various k.

引用

页码：454 / 455

页数：2