MPCBN: a high performance ATM switch

It has been recognized that the main bottleneck of ATM networks is the switch itself. We propose using a multiple partitionable circular bus network (MPCBN) as an ATM switch. To achieve parallel execution of cell transfer requests, we use a graph coloring algorithm for conflict resolution. An approach of using finite projective places is then used to reduce the number of switch points from O(N²) to O(N√N), where N is the number of ports of a switch. A performance evaluation shows that the amount of decrease of network throughput is minimal. The switching architecture is then further extended to the third dimension using Latin squares. The three dimensional switch is of switch point complexity of O(N^1.2.5), and provides multiple routing paths between a pair of ports. Lastly, we propose a finite projective plane topology for network interconnection