標題: Lower bounds for wide-sense nonblocking Clos network
作者: Tsai, KH
Wang, DW
Hwang, F
應用數學系
Department of Applied Mathematics
公開日期: 28-六月-2001
摘要: 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 I 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. (C) 2001 Elsevier Science B.V. All rights reserved.
URI: http://dx.doi.org/10.1016/S0304-3975(00)00147-X
http://hdl.handle.net/11536/29562
ISSN: 0304-3975
DOI: 10.1016/S0304-3975(00)00147-X
期刊: THEORETICAL COMPUTER SCIENCE
Volume: 261
Issue: 2
起始頁: 323
結束頁: 328
顯示於類別:會議論文


文件中的檔案:

  1. 000169541100009.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。