Limiting removal depth in the pushout scheme for ATM networks

The asynchronous transfer mode (ATM) handles cells of different classes in various ways to provide the different services with their respective quality of service requirements. To decrease the loss probability of high priority cells at the expense of cells with lower priorities, two loss priority schemes have been proposed in the literature: capped threshold and push out. Since throughput is slightly greater in the push out scheme while buffer management complexity increases when passing from threshold to push out, it seems natural to prefer the threshold scheme. A limitation of the removal depth in the push out scheme, called L push out, is proposed. The most attractive feature in limiting push out is the decrease of buffer management complexity, since only a small part of the buffer seems to be necessary to reach both loss rates (those of both the low and the high priority class) using the push out strategy. Approximation analysis was used for random traffic and simulations for bursty traffic