Connection admission control for constant bit rate traffic at a multi-buffer multiplexer using the oldest-cell-first discipline.

*(English)*Zbl 0913.90106Summary: Consider an ATM multiplexer where \(M\) input links contend for time slots on an output link which transmits \(C\) cells per second. Each input link has its own queue of size \(B\) cells. The traffic is delay sensitive so \(B\) is small (e.g., \(B= 20\)). We assume that each of the \(M\) input links carries constant bit rate traffic from a large number of independent virtual connections (VCs) which are subject to jitter. The fluctuations of the aggregate traffic arriving at queue \(i\), \(i= 1,\dots,M\), is modeled by a Poisson process with rate \(\lambda_i\). The quality of service (QoS) of one connection is determined in part by the queueing delay across the multiplexer and the cell loss ratio (CLR) or proportion of cells from this connection lost because the buffer is full. The oldest-customer(cell)-first (OCF) discipline is a good compromise between competing protocols like round-robin queueing or serving the longest queue. The OCF discipline minimizes the total cell delay among all cells arriving at the contending queues. Moreover, the CLR is similar to that obtained by serving the longest queue. We develop QoS formulae for this protocol that can be calculated on-line for connection admission control. These formulae follow from a simple new expression for the exact asymptotics of an \(M/D/1\) queue.

##### MSC:

90B22 | Queues and service in operations research |

60K25 | Queueing theory (aspects of probability theory) |