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

We extend the log/sub 2/ (N, m, P) network proposed by Shyy and Lea (1991) 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/sub k/(N, m, p) over various k.