Abstract: We present a new perturbation bound in an / /1 M G queueing system with breakdowns and repairs. Our analysis is based on bounding the distance of stationary distributions in a suitable functional space. This leads to understand how the breakdowns of the server will affect the system's level of performance. In order to give an idea about the application of our approach in practice, we ...

Peer-to-peer systems have largely replaced the client-server architecture. There are different solutions for the arising problems of efficient object location, scalability, and robustness, resulting in different approaches. We give a short overview of the concepts of structured and unstructured peer-to-peer networks and discuss the handling of those problems in each case. In particular, the Bit...

We consider in this paper an M/G/1 type queueing system with the following extensions. First, the server is unreliable and is subject to random breakdowns. Second, the server also implements the well-knownN-policy.Third, instead of a Bernoulli vacation schedule, the more general notion of binomial schedule withK vacations is applied. A cost function with two decision variables is developed. A n...

In this paper, we consider retrial queueing systems with batch arrivals in which the server is subject to controllable interruptions (called vacations) and random interruptions (breakdowns). No specific assumption is taken regarding probability distributions of parametric random variables. The purpose of this work is to show effect of above mentioned parameters (in particular retrial and breakd...

Present investigation deals with optimal management policy for Markovian queue with server breakdowns, vacations and setup. The customers arrive in Poisson fashion to get the service. The server may breakdown during the service and goes for repair immediately. By applying probability generating function technique queue length distribution is obtain for different states of the server. Further we...

Abstract—This study considers the M/M/1/N queue with working breakdowns and server vacations. We assume that the arrivals occur according to a Poisson process. The server is subject to breakdowns and repairs while in operation. At failure times, the server still works at a lower service rate rather than completely stopping service. When there are no customers in the system, the server takes mul...

We consider a single-server queueing system with Poisson arrivals and general service times. While the server is up, it is subject to breakdowns according to a Poisson process. When the server breaks down, we may either repair the server immediately or postpone the repair until some future point in time. The operating costs of the system include customer holding costs, repair costs and running ...