The algorithm for choosing nonblocking sets of data cells from the queues can significantly affect the throughput and queuing behavior. The authors present an algorithm that is shown to have maximum throughput. This algorithm is reduced on a banyan network to a constraint satisfaction problem by using an equivalence approach. To gain the required computational speed, the massive parallelism of neural networks is used. A neural network design using multiple overlapping winner-take-all circuits is defined. This is shown to be stable and to result only in nonblocking sets of data cells. An efficient interface between the neural network and the queue is also defined. The performance of the banyan with a neural network controller is compared to a noninternal-blocking switch with various controllers. The banyan is within a factor of two of the nonblocking switch.>
No takes yet. Share an insight, caveat, or question.
Brown et al. (1990) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: