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

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.