A NOVEL SWITCHING ARCHITECTURE FOR ATM NETWORKS

It is known that the flexibility and capacity of asynchronous transfer mode (ATR I) networks can meet the bandwidth requirements of multimed ia applications, In ATM networks, switching is one of the major bottle necks of end-to-end communication, In this letter, we propose using a multiple partitionable circular bus network (MPCBN) as an ATM switch, Connection requests are first transformed into a graph where vertices and edges represent connection requests and conflicts among connection requests, respectively. We then use a graph traversal algorithm to se lect a maximal set of requests for execution in physically partitioned buses, An approach of using finite projective planes is then used to reduce the number of switch points from O(N-2) fo O(N root N), where N is the number of ports of a switch. A performance evaluation for both uniform and bursty data sources shows that the approach of using fini te projective planes to reduce the number of switch paints results in a small increase of cell loss probability.