A queueing model for optimal control of partial buffer sharing in ATM

This system generates some decision-making problems, among which are the following. (1) What are the appropriate priority control schemes? (2) What would be the optimal buffer size for each class of data to meet the quality of service (QoS)? This article addresses these decision-making problems. We derive the cell loss probabilities, means number of cells, mean waiting time and optimal buffer sizes to control the proposed priority scheme. Some numerical examples are presented. We model the optimal control of the partial buffer sharing mechanism of ATM by a queuing system M1,M2/G/1/K + 1. We first derive the system equations and then develop a recursive method to compute the loss probabilities at an arbitrary time epoch. We then build an approximation scheme to compute the mean waiting time for each class of cells. An algorithm is developed for finding the optimal threshold and buffer capacity for a given QoS.