Neural scheduling algorithms for time-multiplex switches

In an N/spl times/N time-multiplex switch, transmission conflict arises when two or more input adaptors transmit packets to the same output adaptor simultaneously. To resolve transmission conflict, we propose two neural-based scheduling algorithms which use a large number of simple processing elements to perform scheduling in parallel. The first algorithm uses N/sup 2/ hysteresis McCulloch-Pitts (1943) neurons to determine conflict-free transmission schedules with maximum throughput. The second algorithm resolves transmission conflict among the first M packets in each input queue. It determines suboptimal transmission schedules using only NM neurons (M>