In this paper, we analyze some output characteristics of a discrete-time two-class priority queue by means of probability generating functions. Therefore, we construct a Markov chain which - after analysis - provides a.o. the probability generating functions of the lengths of the busy periods of...

In this rejoinder, we respond to the comments and questions of three discussants of our paper on queueing models for the analysis of communication systems. Our responses are structured around two main topics: discrete-time modeling and further extensions of the presented queueing analysis....

Queueing models can be used to model and analyze the performance of various subsystems in telecommunication networks; for instance, to estimate the packet loss and packet delay in network routers. Since time is usually synchronized, discrete-time models come natural. We start this paper with a...

We consider a discrete-time infinite-capacity queueing system with a general uncorrelated arrival process, constant-length service times of multiple slots, multiple servers and a first-come-first-served queueing discipline. Under the assumption that the queueing system can reach a steady state,...

In this paper, we study the behavior of a discrete-time multiserver buffer system with infinite buffer size. Packets arrive at the system according to a two-state Markovian arrival process. The service times of the packets are assumed to be constant, equal to multiple slots. The behavior of the...

In this paper, we study the behavior of a discrete-time multiserver buffer system with infinite buffer size. Packets arrive at the system according to a two-state Markovian arrival process. The service times of the packets are assumed to be constant, equal to multiple slots. The behavior of the...

We consider the problem of evaluating and constructing appointment schedules for patients in a health care facility where a single physician treats patients in a consecutive manner, as is common for general practitioners, clinics and for outpatients in hospitals. Specifically, given a...

In this paper, we present an in-depth analytical study of a semi-preemptive priority scheduling discipline. This discipline eliminates the deficits of both the full- and non-preemptive versions. Under the non-preemptive category, in particular, higher-priority customers may have to wait even...

This paper considers a simple discrete-time queueing model with two types (classes) of customers (types 1 and 2) each having their own dedicated server (servers A and B resp.). New customers enter the system according to a general independent arrival process, i.e., the total numbers of arrivals...