Performance of an input queuing multicast ATM switch with two priority classes

In future broadband high-speed networks, an ATM switch must be capable of handling the requirements of different services and should support a multicast function. We propose an N×N non-blocking input queuing multicast ATM switch with multiple priority classes. The N-input queues adopt a novel priority scheme with a window policy, which uses a priority without iteration (POI) method and a pipeline arbitration. The performance of an 8 ×8 multicast switch is simulated and the results are compared with these of the priority with iteration (PWI) method. Simulation results show that the performance of the switch with the proposed POI algorithm is similar to that with PWI algorithm, however, from an implementation point of view, a POI switch is much more easily realised. The POI scheme improves the performance of delay critical services and overcomes the starvation of delay-insensitive classes