Multirate logd(N,e,p) networks

Conventional studies have shown that an unbuffered network, while having a simpler design, produces a lower throughput than a buffered network. But conventional studies ignored the combinatorial aspect of the performance evaluation. The present authors compare the two approaches in designing nonblocking networks. The base of the comparison is log_d(N,e,p) networks. It is shown that if fixed path routing is adopted to maintain the packet sequence of a buffered network, then its throughput is even lower than that of an unbuffered network