In this paper, application of an evolutionary strategy to positioning a GI/M/1/N -type finite-buffer queueing system with exhaustive service and a single vacation policy is presented. The examined object is modeled by a conditional joint transform of the first busy period, the first idle time and the number of packets completely served during the first busy period. A mathematical model is defin...

We study the impact of service time distributions on the distribution ofthe maximum queue length during a busy period for the Mx/G/1 queue. The maximum queue length is an important random variable to understand when designing the buffer size for finite-buffer (M/G/1/n) systems. We show the somewhat surprising result that, for three variations of the preemptive last-come-first-served discipline,...

In this paper, we present an exact transient (discrete-time) queuing analysis of a statistical multiplexer with a finite number of input links and whose arrival process is correlated and consists of a train of a fixed number of fixed-length packets. The functional equation describing this queuing model is manipulated and transformed into a mathematical tractable form. This allows us to derive t...