Abstract

AbstractIn this paper, we consider a discrete-time GI-D-c queueing system with general independent arrivals, deterministic service times of arbitrary length, multiple servers, an infinite buffer size and a first-come-first-served queueing discipline. A relationship between the probability distributions of the system contents and the packet delay is established. By means of this relation, an explicit expression for the generating function of the packet delay is obtained from the known generating function of the system contents, derived in previous work. In addition, some important characteristics of the packet delay, namely the mean, the variance and the tail distribution of the packet delay, are derived through some mathematical manipulations. Numerical examples are presented to illustrate the analysis.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call