The study of unreliable server retrial bulk queue with multiphase optional service is analyzed by incorporating the features balking, Bernoulli vacation and feedback. On occasion when occupied customers, an arriving customer finding long queue, can join orbit receives its later on making re-attempt. system reinforced multi phase along essential joining opt any one services after getting service...

We consider a M/G/1 queue where the server may take repeated vacations. Whenever a busy period terminates the server takes a vacation of random duration. At the end of each vacation the server may either take a new vacation or resume service; if the queue is found empty the server always takes a new vacation. The cost structure includes a holding cost per unit of time and per customer in the sy...

In this paper a single server preemptive priority queuing system consisting of two types of customer units with Poisson arrival, exponential service time distribution and exponential vacation is analyzed. Two type of customer units of which higher priority units of unlimited Poisson input are served by bulk service rule and limited Poisson input of low priority units served singly. The bulk ser...

We consider two variants of a two-station tandem network with blocking. In both variants the first server ceases to work when the queue length at the second station hits a ‘blocking threshold.’ In addition, in variant 2 the first server decreases its service rate when the second queue exceeds a ‘slow-down threshold,’ which is smaller than the blocking level. In both variants the arrival process...

As a model for streaming multimedia applications, we study an unreliable retrial queue with infinite-capacity orbit and normal queue for which the retrial rate and the server repair rate are controllable. Customers join the retrial orbit if and only if their service is interrupted by a server failure. Interrupted customers do not rejoin the normal queue but repeatedly attempt to access the serv...

To describe the congestion in large-scale service systems, we introduce and analyze a non-Markovian open network of many-server fluid queues with customer abandonment, proportional routing and time-varying model elements. A proportion of the fluid completing service at each queue is routed immediately to each other queue, while the fluid not routed to other queues leaves the network. The fluid ...

Consider a single server queue with renewal arrivals and i.i.d. service times in which the server operates under a processor sharing service discipline. To describe the evolution of this system, we use a measure valued process that keeps track of the residual service times of all jobs in the system at any given time. From this measure valued process, one can recover the traditional performance ...

Abstract This paper considers a FIFO single-server queue with service interruptions and multiple batch Markovian arrival streams. The server state (on and off), the type of arriving customers and their batch size are assumed to be governed by a continuous-time Markov chain with finite states. To put it more concretely, the marginal process of the server state is a phase-type alternating Markov ...

The author considers a batch arrival queueing system in which two types of customers (namely positive and negative) arrive. The arrival of a negative customer to a queueing system removes one positive customer who is in service if any. A cycle starts whenever the system empties and the server is turned off and stays idle in the system. The idle period ends as soon as a batch of positive custome...

In this paper, a multi phase M/G/1queueing system with Bernoulli feedback where the server takes multiple vacation is considered. All the poisson arrivals with mean arrival rate will demand any of the multi essential services.. The service times of the first essential service are assumed to follow a general distribution Bi(v). After the completion of any of the n services, if the customer is di...