Abstract
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 (CBR) 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,...,M, is modeled by a Poisson process with rate λ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 (CAC). These formulae follow from a simple new expression for the exact asymptotics of a M/D/1 queue.
Similar content being viewed by others
References
F. Baccelli and D. McDonald, Rare events for stationary processes, submitted to Ann. Probab. (1997).
T.M. Chen, J. Walrand and D.G. Messerschmitt, Dynamic priority protocols for packet voice, IEEE J. Selected Areas Commun. 3(5) (1989) 632-643.
J.L. Everett, State probabilities in congestion problems characterized by constant holding times, J. Oper. Res. Soc. Amer. 1 (1953) 279-285.
W. Feller, An Introduction to Probability Theory and Its Applications (Wiley, New York, 1971).
M. Grossglauser and S. Keshav, On CBR service, in: Infocom '96 (1996) pp. 129-137.
F. Guillemin and J. Roberts, Jitter and bandwidth enforcement, in: Globecom '91 (1991) pp. 261-265.
J. Keilson, Markov Chain Models — Rarity and Exponentiality (Springer, New York, 1979).
J.F.C. Kingman, A martingale inequality in the theory of queues, Proc. Camb. Phil. Soc. 59 (1963) 359-361.
D. McDonald, Asymptotics of first passage times for random walk in an orthant, to appear in Ann. Appl. Probab. (1998).
T.L. Saaty, Elements of Queueing Theory with Applications (Dover, New York, 1961).
H. Saito, Optimal queueing discipline for real-time traffic at ATM switching nodes, IEEE Trans. Commun. 38(12) (1990) 2131-2136.
F. Spitzer, Principles of Random Walk, 2nd ed. (Springer, Berlin, 1975).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Huang, A., McDonald, D. Connection admission control for constant bit rate traffic at a multi‐buffer multiplexer using the oldest‐cell‐first discipline. Queueing Systems 29, 1–16 (1998). https://doi.org/10.1023/A:1019167610627
Issue Date:
DOI: https://doi.org/10.1023/A:1019167610627