On the use of priorities in ATM switching structures

The use of two priority in pure ATM switching structures is examined. This allows a very low cell loss to the highest priority bearer service, while the other bearer service is guaranteed only a limited cell loss probability. To obtain these performances, two physically different queues are proposed to be used in the switching matrices, and a contention resolution algorithm is used. Some simulations are performed using a mixing of bursty and nonbursty traffic sources. The conclusion is that, if pure ATM with only one bearer service is used, the necessary size of the queue increases if very bursty sources are received. On the other hand, if the proposed priority and algorithm scheme is used, and on the assumption that the higher priority bearer service needs a very low loss probability, but for the other a moderately low loss probability is enough, the size of the necessary queues is lower, and a more efficient use of a given quantity of queue memory is obtained. The final conclusion is that, but the use of two priorities, a more robust ATM switching scheme is obtained and less queue memory is required.<
>