Lower bounds for wide-sense nonblocking Clos network
详细信息    查看全文
  • 作者:Tsai ; Kuo-Hui ; Wang ; Da-Wei ; Hwang ; Frank
  • 刊名:Theoretical Computer Science
  • 出版年:2001
  • 出版时间:June 28, 2001
  • 年:2001
  • 卷:261
  • 期:2
  • 页码:323-328
  • 全文大小:96.5 K
文摘
The 3-stage Clos network is generally considered the most basic multistage interconnecting network (MIN). The nonblocking property of such network has been extensively studied in the past. However, there are only a few lower bound results regarding wide-sense nonblocking. We show that in the classical circuit switching environment, to guarantee wide-sense nonblocking for large r, 2n−1 center switches are necessary, where r is the number of input switches and n is the number of inlets of each input switch. For the multirate environment, we show that for large r, any 3-stage Clos network needs atleast 3n−2 center switches to guarantee wide-sense nonblocking. Our proof works even for the two-rate environment.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700