METHOD FOR SOLVING COLLISION OF SCHEDULING BETWEEN PACKETS

摘要

PROBLEM TO BE SOLVED: To solve collision between inputs in contention to obtain an access with respect to output designation in a non-blocking exchange network routing a packet from plural inputs to plural outputs such as a high speed broad band communication network. ;SOLUTION: An exchange is composed of a Batcher/Banyan network and includes a Batcher sorting network 42 and Banyan routing exchanges 43, 44. They are used to reduce output contention. In order to adjust the parallel processing, a buffer 45 is in existence to each output port to receive up to k-sets cells from the Banyan routing exchanges 43, 44. In order to judge impartially the contention among cells, a reservation link 46 is prepared, which solves the contention in existence among arbitration cycles and provides an access to each output in each arbitration cycle of contention parties.;COPYRIGHT: (C)1997,JPO