This paper investigates the queueing process of a bulk service queueing system under Bernoulli schedule. It also generalizes some known scenarios concerning the choice of service and re-service types. The queueing process is studied both in discrete time and in continuous time. Performance measures are derived and used to implement an optimal management policy of the system.

This note presents a concurrent estimation technique that broadens the set of queueing systems where concurrent estimation techniques are applicable. Our technique utilizes a proportional relation and concurrently estimates performance measures with respect to various buffer capacity values in a queueing system. Our technique applies to a queueing system that characterizes a router/switch in pa...

Queueing network models have used lucratively to analyze the validation of multi resource system such as Computer systems and Communication Networks. This paper covenantal with the Stochastic analysis of queueing network with several classes of customers. Stochastic analysis describes the nature of the queueing networks and their applications, calculating the system performance. The measurable ...

Many authors have analyzed queueing systems with server breakdowns. Kendall (1953) studied stochastic processes occurring in the theory of queues and their analysis by the method of imbedded Markov chains. Buzacott and Hanifin (1978) classified the machine failures as operation dependent failures and time dependent failures. Shanthikumar (1982) analyzed a M/G/1 queueing system with time and ope...

Queueing network models have been extensively applied to represent and analyze resource sharing systems such as communication and computer systems and they have proved to be a powerful and versatile tool for system performance evaluation and prediction. Product form queueing networks have a simple closed form expression of the stationary state distribution that allow to define efficient algorit...