Wide-sense nonblocking networks
SIAM Journal on Discrete Mathematics
Nonblocking multirate networks
SIAM Journal on Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Approximations for the disjoint paths problem in high-diameter planar networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On-line Algorithms for Path Selectionin a Nonblocking Network
SIAM Journal on Computing
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Competitive non-preemptive call control
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Short paths in expander graphs
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
On-line admission control and circuit routing for high performance computing and communication
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
A network is called nonblocking if every unused input can be connected by a path through unused edges to any unused output, regardless of which inputs and outputs have been already connected. The Beneš network of dimension n is shown to be strictly nonblocking if only a suitable chosen fraction of 1/n of inputs and outputs is used. This has several consequences. First, there is a very simple strict sense nonblocking network with N = 2n inputs and outputs, namely a (n + logn+1)- dimensional Beneš network. Its depth is O(log N), it has O(N log2 N) edges and it is not constructed of expanders. Secondly it leads to a (3 logN)-competitive randomized algorithm for a (logN)-dimensional Beneš network and a O(log2 N)-competitive randomized algorithm for a (logN)-dimensional hypercube, for routing permanent calls.