Title: | Choosing the best log(k)(N,m,P) strictly nonblocking networks |
Authors: | Hwang, FK 應用數學系 Department of Applied Mathematics |
Keywords: | Banyan network;Clos network;strictly nonblocking network |
Issue Date: | 1-Apr-1998 |
Abstract: | 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. |
URI: | http://dx.doi.org/10.1109/26.664299 http://hdl.handle.net/11536/32684 |
ISSN: | 0090-6778 |
DOI: | 10.1109/26.664299 |
Journal: | IEEE TRANSACTIONS ON COMMUNICATIONS |
Volume: | 46 |
Issue: | 4 |
Begin Page: | 454 |
End Page: | 455 |
Appears in Collections: | Articles |
Files in This Item:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.