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...

The M/G/1 classic queueing system were extended by many authors in last two decades. The systems with server’s vacation are important models that extend the M/G/1 queueing system. Also another conditions such as admissibility restricted may occure in systems. From this motivation, in this system I consider a single server queue with batch arrival Poisson input. There is a restricted admissibili...

This paper examines the operating characteristics of an M/G/1 retrial queueing system under Bernoulli vacation schedule with setup times. The server renders first phase of essential service (FPS) to all the arriving units whereas second phase of multi-optional services (SPS) to only some of them who demand for the same. The server may breakdown according to Poisson process in working state i.e....

Five different classical bulk queueing models with variations are considered from chapter II to chapter VI. This chapter and chapter VIII are devoted for the analysis of two different retrial queueing models. Retrial queueing system is characterized by the feature that the arriving customers, who encounter the server busy, join a virtual pool called orbit. An arbitrary customer in the orbit gen...

This paper studies the N policy M/G/1 queue with server vacations; startup and breakdowns, where arrivals form a compound Poisson process and service times are generally distributed. The server is turned off and takes a vacation whenever the system is empty. If the number of customers waiting in the system at the instant of a vacation completion is less than N, the server will take another vaca...

A single-server queueing system of MX/G/1 type with unlimited buffer size is considered. Whenever the system becomes empty, the server takes a single compulsory vacation that is independent of the arrival process. The service of the first customer after the vacation is preceded by a random setup time. We distinguish two cases of the evolution of the system: when the setup time begins after the ...

A b s t r a c t Sinlulations of CPU scheduling or waiting-line models that involve a server dispersing shared service quanta across jobs can require significant processing t,ime, especially when siinulations are supported by thread-based systems. To effect a reductioil in simulation time we reduce the number of scheduled events: without affecting siinulation results. We present an algorithm for...

This paper revisits the classical model of ATM multiplexing. We exhibit an \exact" discrete-time model for the output queue of the switch, taking into account all peculiarities of the hardware functions, especially all synchronization-related features. The model however happens to present a complexity proportional to both the queue size and the number of inputs. A batch arrival model can be bui...