doi:10.1016/j.peva.2005.03.001
Copyright © 2006 Elsevier B.V. All rights reserved.
A discrete-time queueing model with periodically scheduled arrival and departure slots
References and further reading may be available for this article. To view references and further reading you must
purchase this article.
Johan van Leeuwaardena,
,
, Dee Denteneerb and Jacques Resingc
aEURANDOM, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
bDigital Signal Processing Group, Philips Research, 5656 AA Eindhoven, The Netherlands
cDepartment of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
Received 25 September 2003;
revised 15 February 2005.
Available online 7 April 2005.
Abstract
We consider a time-slotted queueing model where each time slot can either be an arrival slot, in which new packets arrive, or a departure slot, in which packets are transmitted and hence depart from the queue. The slot scheduling strategy we consider describes periodically, and for a fixed number of time slots, which slots are arrival and departure slots. We consider a static and a dynamic strategy. For both strategies, we obtain expressions for the probability generating function of the steady-state queue length and the packet delay. The model is motivated by cable-access networks, which are often regulated by a request–grant procedure in which actual data transmission is preceded by a reservation procedure. Time slots can then either be used for reservation or for data transmission.
Keywords: Cable-access networks; Discrete-time queue; Frame-based scheduling; Steady-state packet delay
Fig. 1. Schematic view of a cable network regulated by a request–grant mechanism.
Fig. 2. The fixed boundary model. A frame of f slots consists of c arrival slots, followed by a maximum of s=f−c departure slots.
Fig. 3.
for f=18,
for Poisson and geometric distribution.
Fig. 4.
for f=18,
for Poisson and geometric distribution.
Fig. 5. Distribution
, f=9, c=0,2,4, Y geometrically distributed with mean 1.
Fig. 6. Mean packet delay, fixed vs. flexible boundary models, f=9, c=2, Y Poisson distributed.
Fig. 7. Packet delay variance, fixed vs. flexible boundary models, f=9, c=2, Y Poisson distributed.
Table 1.
Characteristics of the backlog for f=9 and 

Table 2.
Characteristics of the packet delay for f=9 and 


Corresponding author. Tel.: +31 40 2474768; fax: +31 40 2465995.