The analysis of MX/M/1 queue with two-stage vacations policy

Abstract

In this article, we consider a batch arrival M^X/M/1 queue with two-stage vacations policy that comprises of single working vacation and multiple vacations, denoted by M^X/M/1/SWV?+?MV. Using the matrix analytic method, we derive the probability generating function (PGF) of the stationary system size and investigate the stochastic decomposition structure of stationary system size. Further, we obtain the Laplace–Stieltjes transform (LST) of stationary sojourn time of a customer by the first passage time analysis. At last, we illustrate the effects of various parameters on the performance measures numerically and graphically by some numerical examples.     

An M/G/1 clearing queueing system with setup time and multiple vacations for an unreliable server

This paper studies an M/G/1 clearing queueing system with setup time and multiple vacations, in which all present customers in the system are served simultaneously and breakdowns may occur in busy or setup period. We investigate the stationary distribution of system size and the Laplace–Stieltjes transform of sojourn time. In addition, various performance measures are discussed, such as the mean system size at arbitrary time and the mean length of a vacation circle. Moreover, a cost analysis is carried out for this queueing system. Numerical results are presented to study the sensitivity of the system parameters on the expected cost function and system performances.     

Performance analysis of machine repair system with single working vacation

Abstract

This paper studies a machine repair problem with repairman’s single working vacation in which repairman works with a lower repair rate rather than completely terminating repair during vacation period. Employing Markov process theory and matrix analytical method, various system performance measures are obtained in transient and stationary regimes. Moreover, we deduce the system reliability, the mean time to failure, the repairman’s busy period and the waiting time of failed machine by using the probabilistic properties of phase type distribution. Further, some numerical examples are provided. Finally, a cost model is developed to determine the optimum value of operating machines.     

The variance constant for continuous-time level dependent quasi-birth-and-death processes

We derive the variance constant of continuous-time level dependent quasi-birth-and-death processes by investigating the expected integral functionals of the first return times. As an application, we consider the variance constant for the M/M/c retrial queue with non-persistent customers. For this model, analytical expressions and numerical results are obtained for the cases of single server and multiple servers, respectively. We also apply the obtained result to test the M/M/c vacation model for airport security pre-board screening checkpoint services by constructing a confidence interval for the mean queue length.     

Stationary analysis of a BMAP/R/1 queue with R-type multiple working vacations

We consider an infinite-buffer single server queue with batch Markovian arrival process (BMAP) and exhaustive service discipline under multiple working vacation policy. The service time during a working vacation is generally distributed random variable which is independent of the service times during a normal busy period as well as the arrival process. Duration of service times during a normal busy period and duration of working vacation times follow the class of distributions whose Laplace-Stieltjes transforms are rational functions (R-type distributions). The service time during a normal busy period, working vacation time, and the service time during a working vacation are independent of each other as well as of the arrival process. If a working vacation terminates while service is going on for a customer at head of the queue in vacation mode then, the server switches to normal mode and the customer at head of the queue is entitled to receive a full service time in the normal busy period irrespective of the amount of service received by the customer at head of the queue during the previous working vacation period. We obtain system-length distributions at various epoch, such as post-departure, pre-arrival, arbitrary, and pre-service. The proposed analysis is based on the use of matrix-analytic procedure to obtain system-length distribution at post-departure epoch. Later, we use supplementary variable technique and simple algebraic manipulations to obtain system-length distribution at arbitrary epoch using the system-length distribution at post-departure epoch. Some important performance measures, such as mean system lengths and mean waiting time have been obtained. Finally, some numerical results have been presented in the form of tables and graphs to show the applicability of the results obtained in this article. The model has potential application in areas of computer and communication networks, such as ethernet passive optical network (EPON).     

Analysis of MAP/M/1 queue with working breakdowns

In this paper, we analyze the MAP/M/1 queue with working breakdowns. The number of customers in the system in the steady state is obtained by the matrix geometric solution method. Then, several useful performance measures are provided. Furthermore, we show a recursive formula to obtain an approximation of stationary sojourn time. At last, we present several numerical examples.     

A two phases queueing system with Bernoulli vacation schedule under multiple vacation policy

This paper deals with a single server Poisson arrival queue with two phases of heterogeneous service along with a Bernoulli schedule vacation model, where after two successive phases service the server either goes for a vacation with probability p (0≤p≤1) or may continue to serve the next unit, if any, with probability q(=1−p). Further the concept of multiple vacation policy is also introduced here. We obtained the queue size distributions at a departure epoch and at a random epoch, Laplace Stieltjes Transform of the waiting time distribution and busy period distribution along with some mean performance measures. Finally we discuss some statistical inference related issues.     

The analysis of unreliable M[X]/G/1 queuing system with loss,vacation and two delays of verification

This paper considers an M^[X]/G/1 queue with breakdowns, repair, Bernoulli vacation, two delays and geometric loss. In this paper, a special attention is given to the limiting distribution of system states. We obtain simplified expressions for the Probability Generating Functions (PGFs) of the joint distribution of server state and system size. Some performance measures were derived from the analysis of the steady state probabilities. PGF of a departure point system size distribution is developed. Particular cases of the studied system were investigated. The effect of system parameters on the main performance measures are illustrated and discussed.     

Analysis of a batch arrival queue with vacation policy and exceptional service

ABSTRACT

We consider the distributions of operating characteristics of an M^[x]/G/1 queue under vacation policies, where the first customer of each busy period receives an exceptional service. When all the customers are served in the system exhaustively, the server deactivates and operates one of two vacation policies: (1) multiple vacation policy and (2) single vacation policy. We develop the performance measures for both systems. Finally, some numerical illustrations are also given. These two vacation models have potential applications in day-to-day life, such as post offices, banks, hospitals, etc.     

A cold standby repairable system with the repairman having multiple vacations and operational,repair, and vacation times following phase-type distributions

ABSTRACT

This paper studies a cold standby repairable system with two identical components and one repairman having multiple vacations applying matrix-analytic methods. The lifetime of the component follows a phase-type distribution. The repair times and the vacation times of the repairman are governed by different phase-type distributions, respectively. For this system, the Markov process governing the system is constructed. The system is studied in a transient and stationary regime, the availability, the reliability, the rates of occurrence of the different types of failures, and the working probability of the repairman are calculated, respectively. A numerical application is performed to illustrate the calculations.     

Analysis of an unreliable MX/G1G2/1/repeated service queue with delayed repair under randomized vacation policy

Abstract

In this article we consider an unreliable M^X/G/1 queue with two types of general heterogeneous service and optional repeated service subject to server’s break down and delayed repair under randomized vacation policy. We assume that customer arrive to the system according to a compound Poisson process. The server provides two types of general heterogeneous service and a customer can choose either type of service before its service start. After the completion of either type of service, the customer has the further option to repeat the same type of service once again. While the server is working with any types of service or repeated service, it may breakdown at any instant. Further the concept of randomized vacation is also introduced. For this model, we first derive the joint distribution of state of the server and queue size by considering both elapsed and remaining time, which is one of the objective of this article. Next, we derive Laplace Stieltjes transform of busy period distribution. Finally, we obtain some important performance measure and reliability indices of this model.     

Computing the conditional stationary distribution in Markov chains of level-dependent M/G/1-type

This paper considers the computation of the conditional stationary distribution in Markov chains of level-dependent M/G/1-type, given that the level is not greater than a predefined threshold. This problem has been studied recently and a computational algorithm is proposed under the assumption that matrices representing downward jumps are nonsingular. We first show that this assumption can be eliminated in a general setting of Markov chains of level-dependent G/G/1-type. Next we develop a computational algorithm for the conditional stationary distribution in Markov chains of level-dependent M/G/1-type, by modifying the above-mentioned algorithm slightly. In principle, our algorithm is applicable to any Markov chain of level-dependent M/G/1-type, if the Markov chain is irreducible and positive-recurrent. Furthermore, as an input to the algorithm, we can set an error bound for the computed conditional distribution, which is a notable feature of our algorithm. Some numerical examples are also provided.     

A multiple warm standby δ-shock system with a repairman having multiple vacations

In this article, a warm standby n-unit system is studied. The system is operational as long as there is one unit normal. The unit online, which has a lifetime distribution governed by a phase-type distribution, is also attacked by a shock from some external causes. Assume that shocks arrive according to a Poisson process. Whenever an interarrival time of shock is less than a threshold, the unit online fails. The lifetimes of the units in warm standby is exponentially distributed. A repairman who can take multiple vacations repairs the failed units based on the “first-in-first-out” rule. The repair times and the vacation times of repairman are governed by different phase-type distributions. For this system, the Markov process governing the system is constructed. The system is studied in a transient and stationary regime; the availability, the reliability, the rates of occurrence of the different types of failures, and the working probability of the repairman are calculated. A numerical application is performed to illustrate the calculations.     

ANALYSIS OF A GI/G Y /1 SYSTEM IN DISCRETE-TIME

ABSTRACT

We consider a class of single server queueing systems in which customers arrive singly and service is provided in batches, depending on the number of customers waiting when the server becomes free. Service is independent of the batch size. This system could also be considered as a batch service queue in which a server visits the queue at arbitrary times and collects a batch of waiting customers for service, or waits for a customer to arrive if there are no waiting customers. A waiting server immediately collects and processes the first arriving customer. The system is considered in discrete time. The interarrival times of customers and the inter-visit times of the server, which we call the service time, have general distributions and are represented as remaining time Markov chains. We analyze this system using the matrix-geometric method and show that the resulting R matrix can be determined explicitly in some special cases and the stationary distributions are known semi-explicitly in some other special cases.     

A note on the queue with a random set-up time under a restricted admissibility policy with a Bernoulli vacation schedule

This paper deals with the queue size distribution of an M^x/G/1 queue with a random set-up time and with a Bernoulli vacation schedule under a restricted admissibility policy. This generalizes the model studied by Madan and Choudhury [Sankhyá 66 (2004) 175–193].     

Comparison of non-parametric and semi-parametric tests in detecting long memory

The first two stages in modelling times series are hypothesis testing and estimation. For long memory time series, the second stage was studied in the paper published in [M. Boutahar et al., Estimation methods of the long memory parameter: monte Carlo analysis and application, J. Appl. Statist. 34(3), pp. 261–301.] in which we have presented some estimation methods of the long memory parameter. The present paper is intended for the first stage, and hence completes the former, by exploring some tests for detecting long memory in time series. We consider two kinds of tests: the non-parametric class and the semi-parametric one. We precise the limiting distribution of the non-parametric tests under the null of short memory and we show that they are consistent against the alternative of long memory. We perform also some Monte Carlo simulations to analyse the size distortion and the power of all proposed tests. We conclude that for large sample size, the two classes are equivalent but for small sample size the non-parametric class is better than the semi-parametric one.     

AN INFINITE-PHASE QUASI-BIRTH-AND-DEATH MODEL FOR THE NON-PREEMPTIVE PRIORITY M/PH/1 QUEUE

This paper considers a single server queue that handles arrivals from N classes of customers on a non-preemptive priority basis. Each of the N classes of customers features arrivals from a Poisson process at rate λ _i and class-dependent phase type service. To analyze the queue length and waiting time processes of this queue, we derive a matrix geometric solution for the stationary distribution of the underlying Markov chain. A defining characteristic of the paper is the fact that the number of distinct states represented within the sub-level is countably infinite, rather than finite as is usually assumed. Among the results we obtain in the two-priority case are tractable algorithms for the computation of both the joint distribution for the number of customers present and the marginal distribution of low-priority customers, and an explicit solution for the marginal distribution of the number of high-priority customers. This explicit solution can be expressed completely in terms of the arrival rates and parameters of the two service time distributions. These results are followed by algorithms for the stationary waiting time distributions for high- and low-priority customers. We then address the case of an arbitrary number of priority classes, which we solve by relating it to an equivalent three-priority queue. Numerical examples are also presented.     

Computational analysis of the queue with working breakdowns and delaying repair under a Bernoulli-schedule-controlled policy

This paper considers a single server queueing system with working breakdowns and delaying repair under a Bernoulli-schedule-controlled policy. At a breakdown instant, the system either goes to repair period immediately with probability p, or continues to provide auxiliary service for the current customers with probability q = 1 ? p. While the system resides in the auxiliary service period, it may go to repair period if there is no customer at the epoch of service completion or the occurrence of breakdown. By using the matrix analytic method and the spectral expansion method, we respectively obtain the steady state distribution to make the straightforward computation of performance measures and the Laplace-Stieltjes transform of the stationary sojourn time of an arbitrary customer. In addition, some numerical examples are presented to show the impact of parameters on the performance measures.     

Matrix–geometric analysis of the discrete time Gi/G/1 system

In this paper, we show that the discrete GI/G/1 system can be analysed as a QBD process with infinite blocks. Most importantly, we show that Matrix–geometric method can be used for analyzing this general queue system including establishing its stability criterion and for obtaining the explicit stationary probability and the waiting time distributions. This also settles the unwritten myth that Matrix–geometric method is limited to cases with at least one Markov based characterizing parameter, i.e. either interarrival or service times, in the case of queueing systems.