The main aim of the present paper is to draw the attention of the readers of this special issue to the modeling issues of sensor networks. The novelty of this investigation is the introduction of servers vacation combined with priority customers for finite-source retrial queues and its application to wireless sensor networks. In this paper we analyze a priority finite-source retrial queue with ...

A retrial queue with general retrial times, modified vacation policy and Bernoulli feedback is analyzed in this paper. If the server is busy or on vacation, an arriving customer either enters on orbit with probability b, or balks with probability 1-b. Otherwise the service of the arriving customer commences immediately. At the service completion epoch, the test customer may either enter the orb...

This paper studies the / / 1 Geo G queue model with , p N policy set-up time, multiple vacation and disasters. The server will start up the random set-up period with the probability p if the customer number is at least N at the end of a random length V of the holiday. Otherwise, the server takes vacation repeatedly with the probability p . Using embedded Markov chain and supplemental variable m...

We introduce a queueing system that alternates between two modes, so-called working mode and vacation mode. During the runs as an MX/G/1 queue. Once number of customers in drops to zero begins. general (a service might be included) which is different from one The period ends accordance with given stopping rule, then random are transferred For this model we show distributed sum independent varia...

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

queueing models with impatient customers, server vacations and a waiting server. The arrival process is assumed to be Poisson. The server is allowed to take a vacation whenever the system is empty after waiting for a random period of time. Whenever the server is on vacation, each customer in the queue independently of the other customers sets up an impatience timer. If the server does not retur...

We derive the performance measures for non-priority customers in a priority single-server queue with two types of Markovian arrival processes (MAPs). One type of customers has preemptive resume (or repeat) priority over the other. We regard the model with two types of MAP arrivals as an MAP/SM/l queue with only non-priority customers arrivals, semi-Markovian service times and some server vacati...

Abstract In this paper, we present an analysis for a general limited service Geom/G/1 queue model with multiple adaptive vacations (MAVs). The Probability Generating Function (P.G.F.) of the queue length is obtained by using an embedded Markov chain with a regeneration cycle approach. The P.G.F. of the waiting time is also derived based on the independence between the arrival process and the wa...

In many industrial situations, machines are subjected to random breakdowns. In this paper, we consider the asynchronous vacation policy for the multi-server machine repair problem with server breakdown and two types of spares. According to this policy, when a certain number of servers become idle at a service completion instant, the servers will take an asynchronous vacation of random length to...

We introduce a queueing system that alternates between two modes, so-called working mode and vacation mode. During the runs as an MX/G/1 queue. Once number of customers in drops to zero begins. general (a service might be included) which is different from one The period ends accordance with given stopping rule, then random are transferred For this model we show distributed sum independent varia...