We study an M/G/1 processor sharing queue with multiple vacations. The server only takes a vacation when the system has become empty. If he finds the system still empty upon return, he takes another vacation, and so on. Successive vacations are identically distributed, with a general distribution. When the service requirements are exponentially distributed we determine the sojourn time distribu...

 This paper deals with batch arrival unreliable queue with two phases of service and vacation under Bernoulli vacation schedule, which consist of a breakdown period and a delay period. For this model, we first derive the joint distribution of state of the server and queue size, which is one of the chief objectives of this paper. Secondly, we derive the pgf of the stationary queue size distribu...

We consider a system consisting of two not necessarily identical exponential servers having a common Poisson arrival process. Upon arrival, customers inspect the first queue and join it if it is shorter than some threshold n. Otherwise, they join the second queue. This model was dealt with, among others, by Altman et al. (2004). We first derive an explicit expression for the Laplace-Stieltjes t...

In this paper, we propose a queueing model based on an integer-valued rst-order autoregressive(INAR(1)) process. We derive the queue length distribution and its asymptotic decay rate of the proposed model. Also, our numerical study shows that the new model can be considered as an alternative approach to the well-known MMPP=D=1 queue in terms of performance and amount of computational work. c © ...

W consider how two networked large-scale service systems that normally operate separately, such as call centers, can help each other when one encounters an unexpected overload and is unable to immediately increase its own staffing. Our proposed control activates serving some customers from the other system when a ratio of the two queue lengths (numbers of waiting customers) exceeds a threshold....

This paper presents a three-level supply chain model which includes single supplier, several distribution centers and sets of retailers. For this purpose, by adopting the queuing approach, a mixed nonlinear integer programming model is formulated. The proposed model follows minimizing the total cost of the system by determining: 1) the number and location of distribution centers between candida...

Consider a single-server queue with a renewal arrival process and generally distributed processing times in which each customer independently reneges if service has not begun within a generally distributed amount of time. We establish that both the workload and queue-length processes in this system can be approximated by a regulated Ornstein-Uhlenbeck (ROU) process when the arrival rate is clos...

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

This paper proposes a new discrete-time queue analytical model based on BLUE algorithm in order to determine the network congestion in preliminary stages. We compare the original BLUE, which has been implemented in Java, with our proposed analytical model with regards to different performance measures (average queue length, throughput, average queueing delay and packet loss probability). The co...

Motivated by applications in computer and communication systems, we consider a processor sharing queue where the number of jobs served is not larger than K. We propose a measure-valued fluid model for this limited processor sharing queue and show that there exists a unique associated fluid model solution. In addition, we show that this fluid model arises as the limit of a sequence of appropriat...