We consider a class of two-queue polling systems with exhaustive service, where the order in which the server visits the queues is governed by a discrete-time Markov chain. For this model, we derive an expression for the probability generating function of the joint queue length distribution at polling epochs. Based on these results, we obtain explicit expressions for the Laplace-Stieltjes trans...

Abstract In this paper, a new discrete-time GeomX /G/1 queue model with multiple vacations is analyzed. The Probability Generating Function (P.G.F.) of the queue length is obtained by using the method of an embedded Markov chain, and the mean of the queue length is obtained by using L’Hospital rule. Then the P.G.F. of the busy period is derived, and the probabilities for the system being in a b...

In this paper we describe G/G/R+s multi- repairmen machining system with balking. The system consists of M operating machines, S spare machines, R permanent and s additional repairmen. Assuming the discrete flow of machines by continuous one, the diffusion approximation technique for the machine repair system has developed. The system will be in normal working mode if there is M operating machi...

The loss probability of a queueing system provides in many cases insuucient information for performance evaluation, for example, of le transfer retransmission protocols and real-time applications with signal reconstruction. This paper evaluates and characterizes the correlation between packet losses for three queu-eing systems in discrete time that are motivated by BISDN applications. In the rs...

In the paper a finite-capacity discrete-time queueing system with geometric interarrival times and generally distributed processing is studied. Every time when service station becomes idle it goes for vacation of random duration that can be treated as power-saving mechanism. Application single policy one way to achieve symmetry in terms operating costs. A differential equations transient condit...

This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...