We study a finite buffer N-policy GI/M(n)/1 queue with Bernoulli-schedule vacation interruption. The server works with a slower rate during vacation period. At a service completion epoch during working vacation, if there are at least N customers present in the queue, the server interrupts vacation and otherwise continues the vacation. Using the supplementary variable technique and recursive met...

This paper treats two-threshold policies for an M/G/1 queue with two types of generally distributed random vacations: type 1 (long) and type 2 (short) vacations. Upon returning from a vacation, the server observes the queue length. If this is less than the lower threshold, the server takes a type 1 vacation; if it is between the two thresholds, the server takes a type 2 vacation; and if it is a...

A multiple optional vacation policy for the unreliable server batch arrival queueing system with essential and multi optional services under N-policy is investigated. According to vacation policy, the server takes an essential phase of vacation after the completion of service of an individual customer when queue becomes empty. On returning from the vacation, if the server finds the queue empty,...

This paper proposes three wake-up approaches to reduce the battery power consumption for a mobile multimedia handset. These approaches switch the system into the sleep mode when the memory queue for the arriving packets is empty. Depending on the approaches, various wake-up mechanisms are considered. The threshold approach switches on the system when the number of packets in the memory queue is...

In this article, the authors introduce a simple approach for modeling and analyzing a SII G / / 1 queue where the server may take repeated vacations. When a busy period ends, the server takes a vacation of random duration. At the end of each vacation, the server may either start a new vacation or resume service. If a queue is found of less than n customers, the server will always take a new vac...

We study MX/G/1 nonpreemptive and preemptive-resume priority queues with/without vacations under random order of service (ROS) discipline within each class. By considering the conditional waiting times given the states of the system, which an arbitrary message observes upon arrival, we derive the Laplace-Stieltjes transforms of the waiting time distributions and explicitly obtain the first two ...

AbstractIn this paper, a single server bulk service queuing system with interrupted vacation, request for Re-service and Balking is considered. At a service completion, if the server finds at least „a‟ customers waiting for service say ξ, he serves a batch of min (ξ ,b ) customers, whereb ≥ a. At the completion of an essential service, the leaving batch of customers may request for a re-service...

This paper presents a finite buffer renewal input single working vacation and vacation interruption queue with state dependent services and state dependent vacations, which has a wide range of applications in several areas including manufacturing, wireless communication systems. Service times during busy period, vacation period and vacation times are exponentially distributed and are state depe...

The present paper deals with the problem of calculating queue length distributions in a polling model with (exhaustive) k-limited service under the assumption of general arrival, service and setup distributions. The interest for this model is fueled by an application in the field of logistics. Knowledge of the queue length distributions is needed to operate the system properly. The multi-queue ...

The present paper deals with the problem of calculating queue length distributions in a priority queueing model with a preemptive-resume policy under the assumption of general arrival and service distributions. The multi-queue priority system is decomposed into single-queue vacation systems, for which the visit and inter-visit distributions are approximated by the idle and busy period of a ΣGI/...