# Mathematical Analysis of Queue with Phase Service: An Overview

Authors: Richa Sharma
Journal: Advances in Operations Research
 (2014)

---

## Abstract

We discuss various aspects of phase service queueing models. A large number of models have been developed in the area of queueing theory incorporating the concept of phase service. These phase service queueing models have been investigated for resolving the congestion problems of many day-to-day as well as industrial scenarios. In this survey paper, an attempt has been made to review the work done by the prominent researchers on the phase service queues and their applications in several realistic queueing situations. The methodology used by several researchers for solving various phase service queueing models has also been described. We have classified the related literature based on modeling and methodological concepts. The main objective of present paper is to provide relevant information to the system analysts, managers, and industry people who are interested in using queueing theory to model congestion problems wherein the phase type services are prevalent.


---

## Body

## 1. Introduction

In congestion situations of day-to-day as well as industrial problems, it has been realized that queueing models with phase service play vital role in depicting and analyzing queueing situations. Our aim in this paper is to provide an overview on the conceptual aspects for the phase service queueing models in different frameworks. In traditional queueing models, all arriving customers/jobs require main service which is to be completed in single phase. In many real time systems the service may be completed in many phases. The concept of optional phase services has been studied by many researchers for improving the grade of service. Sometimes only a few arriving customers require the optional services along with essential service for their satisfaction.Queueing models with phase service accommodate the real-world situations more closely. The purpose of present paper is to provide overview of queueing models with phase service and its applications in real life queueing problems. The motivation for studying the queueing systems with phase service comes from numerous versatile applications in the performance evaluation and dimensioning of production and manufacturing systems, computer and communication networks, inventory and distribution systems, and so forth. During the last few decades, attention has been paid increasingly by many researchers in studying the phase service queueing models. Many developments have taken place from time to time in this field and need further research in this regard. Various studies on phase service queueing models have appeared during literature 80’s and 90’s.The various applications ofphase service queueing models can be made in day-to-day and industrial scenarios which motivate us for studying phase service queue in in different frameworks. For this purpose, we cite an example of themanufacturing systems wherein units proceed through a series of work stations. A machine used to produce a variety of items can be modeled as a single server queue with phase service. Next, we consider the situationInternet and Voice-over-IP (VoIP) protocol. VoIP is an upcoming and demandable technology that enables people to make telephone calls via an IP network such as the internet at very low, or even no cost. In VoIP protocol, the service process consists mainly in transferring the information of caller to another end user. This service process of VoIP is done in three phases: (i) connection establishment, (ii) transferring information, and (iii) accessing differentiated services. The motivation for the phase service queue also comes from somecomputer and communication networks where single server processes the messages in phases with the help of message generation center, which acts as a server and a pacing box, which stores the arriving messages.Our main purpose in this survey paper is to provide an overview for phase service queueing models and to explore how these results may be helpful for practical problems. We shall report prominent works done on the queueing models with phase service for different scenario. The rest of the paper is structured as follows. Section2 describes basic definitions and classification of the phase service queueing models. Various methodologies/techniques used for solving phase service queueing models have been discussed in Section 3. Section 4 is devoted to various performance measures for queueing problems with phase service. In Section 5, we review the performance analysis of some notable phase service queueing models developed by researchers in different frameworks. Illustration has been given in Section 6. Finally, conclusion is drawn in Section 7.


## 2. Phase Service System

Queueing system with phase service has received a significant amount of attention of the researchers working in the area of queueing and reliability theory. Phase service queueing models have been studied extensively by many prominent researchers for improving the grade of service due to their wide applicability in many industrial queueing problems areas. Each type of service has its own significant impact on the real time system. In phase service queueing system, all arriving customers are served in phases; out of these some are essential phases of service provided by the server to all arriving customers whereas some are optional services provided by the server to the customers depending upon their choice.The most common distributions which are frequently used in the real time systems are the exponential and Poisson distributions. In-fact, the exponential distribution is widely accepted because the queueing models having exponential distribution are of practical utility and very easy to be handled. The main target of selecting a proper distribution and estimating their parameters is to provide a tractable analytical model giving a close approximation to the real life system under consideration. Some of shortcomings might be alleviated by creating mixtures of exponential distributions to define more complex distribution wherein the service is provided in phases. Commonly used distributions to depict phase type service are as follows.


### 2.1. Erlangian Distribution

In many complex queueing situations, Erlangian distribution provides a good starting point for the systems with phases or stages. The density function of Erlangian distribution is given by(1)ft=λkktk-1exp⁡⁡-kλtk-1!,t>0,λ>0,
where k is the positive integer. A process with sequential phases gives rise to an Erlangian distribution depending upon whether or not the phases have identical distribution. Erlang distribution has been considered by Adan et al. [1], Wang [2], Wang and Kuo [3], Jain and Agrawal [4], and many others in different frameworks. The design of Erlangian distribution is purely sequential as shown in Figure 1.Figure 1
Schematic representation of Erlangian service facility withk phases.To have a look on the performance analysis prediction of Erlangian distributed queueing system, we describeM/Ek/1 queueing model in brief (compare to [5]). The customers are assumed to arrive according to Poisson process with rate λ. The customers are served according to k-phase Erlang distribution with mean 1/kμ. Let P0 be the probability when there are no customers in the system. Further, we assume that Pn,i represents the probability that there are “n” customers in the system and the service of the customer is being rendered in i (i=1,2,…,k) phases. The steady-state equations governing the model are given as follows:
(2)λP0=kμP1,1,λ+kμP1,k=kμP2,1+λP0,λ+kμP1,i=kμP1,i+1,1≤i≤k-1,λ+kμPn,k=kμPn+1,1+λPn-1,k,n≥2,λ+kμPn,i=kμPn,i+1+λPn-1,i,n≥2,1≤i≤k-1.Using generating function method, we can solve (2) to obtain the steady state queue size distribution which can be further used to derive various performance indices.


### 2.2. Hyperexponential Distribution

A hyperexponential distribution withk stage is denoted by Hk. In hyperexponential distribution, the service facility follows a parallel arrangement as depicted in Figure 2. A mixture of k(≥2) independent exponential distributions having probability density function
(3)ft=∑i=1kαiλiexp⁡-λit,t>0,Wαi>0,λi>0,W∑i-1kαi=1
is called a k-stage hyperexponential distribution.Figure 2
Schematic representation of hyperexponential service facility withk phases.Wang et al. [6] suggested optimal control for an infinite and a finite M/H2/1 queueing system with removable and non-reliable server. This model was again extended by Wang et al. [7] for k-type hyperexponential service time distribution. The optimal control of an M/Hk/1 queueing system was considered by Wang and Yen [8]. Further, Sharma [9] considered a MX/H2/1 queueing system under N-policy with vacation and un-reliable server. Now, we proceed to describe the M/Hk/1 model of Wang and Yen [8]. It is assumed that the customers arrive with parameter λ and service times follow k-type hyperexponential distribution. Suppose that μi is the service rate of ith (i=1,2,…,k) phase service. Let the probability that the next customer to enter service is of type i be qi (i=1,2,…,k) and ∑i=1kqi=1.Let us denote the steady state probabilities as follows:P(0,n): Prob. that there are n (=0,1,2,…,N-1) customers in the system when the server is turned off.P(i,n): Prob. that there are n (=1,2,…) customers in the system and the customer in service is in phase i (=1,2,…,k) when the server is turned on and in operating state.The steady state equations for M/Hk/1 queueing system are constructed as follows:
(4)P0,0=P0,n,1≤n≤N-1,λP0,0=∑j=1kμjPj,1,λ+μiPi,1=qi∑j=1kμjPj,2,1≤i≤k,λ+μiPi,n=λPi,n-1+qi∑j=1kμjPj,n+1,1≤i≤k,2≤n≤N-1,λ+μiPi,N=qiλP0,N-1+λPi,N-1+qi∑j=1kμjPj,N+1,1≤i≤k,λ+μiPi,n=λPi,n-1+qi∑j=1kμjPj,n+1,1≤i≤k,n≥N+1.
Equations (4) can be solved easily using the generating function method to determine the distribution of the number of the customers.


### 2.3. Phase Type Distribution

The preceding distributions are all special cases of the phase-type distribution. More general arrangements of phase type distributions may be achieved by mixing sequential and parallel arrangements of single phase distributions. The notation “PH” is used for phase type distribution. This distribution is characterized by a Markov chain with states1,2,…,k (the so called phases) and a transition probability matrix P which is transient. The random variable “X” has a phase-type distribution if X is the total time elapsing from start in the Markov chain till departure from the Markov chain. Further, we can define the phase type distribution as the distribution of absorption times of a certain Markov jumps processes which constitute a class of distribution on the positive real axis which seems to strike a balance between generality and tractability. For more detail, we refer the work of Neuts [10–12] and Asmussen [13].


### 2.4. Two-Phase Essential Service

Queueing models wherein the server provide two phases of essential service to each customer are known as two-phase essential service queueing model. Such types of queueing situations naturally arise in many real time system namely inmanufacturing system wherein the machine producing certain items may require two phases of service in succession. For completing the processing of raw materials, the periodic checking (first phase of service) followed by usual processing (second phase of service) of raw material is required. Kumar and Arumuganathan [14] considered a single server retrial queue with batch arrivals under the assumption that the server provides preliminary first essential service (FES) and second essential service (SES) to all arriving calls.


### 2.5. Two-Phase Optional Service

In many realistic situations, all jobs demand the second optional service along withfirst essential service (FES). The concept of second optional service was studied by Madan [15]. He considered a model of M/G/1 type where the server provides first essential service to all arriving customers and then after, a few customers may demand for a second optional service (SOS). For example, in a cyber café, the customers arrive for utilizing Internet surfing (as FES) but some of them may require scanning of some files (as SOS) also.


### 2.6. Multiphase Essential Service

In such a queueing system, the server serves the customers in finite number of phases. All these phases are essential for each customer to complete the whole service process. To illustrate, this phenomenon we can cite a clinical physical examination procedure as a doctor’s clinic wherein the patient goes through a series of physical checkup such as ear, nose and throat examination, blood test, electrocardiogram, eye examination which all are considered as essential phases of service to reach the final decision by any medical doctor to declare a candidate to be fit. Recently, Jain and Agrawal [16, 17] examined a batch arrival queueing system with modified Bernoulli vacation under N-policy wherein the customer needs l-stage of service in succession that is, the first stage service (FSS) is followed by the second stage service (SSS), the second stage service followed by third stage service (TSS) and so on up to l-stages of service.


### 2.7. Multiphase Optional Service

Multioptional phase service queueing models are those in which the server provides the first essential service (FES) to all arriving customers. After the completion of FES, the server renders a second optional service (SOS) with probabilityp1 (0≤p1≤1) if someone demands for the same otherwise he leaves the system with complementary probability p-1 (=1-p1). After the completion of SOS, the customer may demand a third optional service with probability p2 (0≤p2≤1), or may leave the system with probability p-2 (=1-p2). In general, the customer may request for any of the ith (4≤i≤l) phase optional services with probability pi-1, or may leave the system with probability p-i-1 (=1-pi-1). For example, in “Malls,” generally the customers arrive for watching movie as the first essential service but few of them may demand for other optional services such as shopping, amusements for children, and food in restaurant. Jain and Upadhyaya [18] dealt with unreliable server batch arrival queueing system with essential and multioptional services under N-policy. Using probability generating function technique, they obtained the system size distribution and other performance indices.


## 2.1. Erlangian Distribution

In many complex queueing situations, Erlangian distribution provides a good starting point for the systems with phases or stages. The density function of Erlangian distribution is given by(1)ft=λkktk-1exp⁡⁡-kλtk-1!,t>0,λ>0,
where k is the positive integer. A process with sequential phases gives rise to an Erlangian distribution depending upon whether or not the phases have identical distribution. Erlang distribution has been considered by Adan et al. [1], Wang [2], Wang and Kuo [3], Jain and Agrawal [4], and many others in different frameworks. The design of Erlangian distribution is purely sequential as shown in Figure 1.Figure 1
Schematic representation of Erlangian service facility withk phases.To have a look on the performance analysis prediction of Erlangian distributed queueing system, we describeM/Ek/1 queueing model in brief (compare to [5]). The customers are assumed to arrive according to Poisson process with rate λ. The customers are served according to k-phase Erlang distribution with mean 1/kμ. Let P0 be the probability when there are no customers in the system. Further, we assume that Pn,i represents the probability that there are “n” customers in the system and the service of the customer is being rendered in i (i=1,2,…,k) phases. The steady-state equations governing the model are given as follows:
(2)λP0=kμP1,1,λ+kμP1,k=kμP2,1+λP0,λ+kμP1,i=kμP1,i+1,1≤i≤k-1,λ+kμPn,k=kμPn+1,1+λPn-1,k,n≥2,λ+kμPn,i=kμPn,i+1+λPn-1,i,n≥2,1≤i≤k-1.Using generating function method, we can solve (2) to obtain the steady state queue size distribution which can be further used to derive various performance indices.


## 2.2. Hyperexponential Distribution

A hyperexponential distribution withk stage is denoted by Hk. In hyperexponential distribution, the service facility follows a parallel arrangement as depicted in Figure 2. A mixture of k(≥2) independent exponential distributions having probability density function
(3)ft=∑i=1kαiλiexp⁡-λit,t>0,Wαi>0,λi>0,W∑i-1kαi=1
is called a k-stage hyperexponential distribution.Figure 2
Schematic representation of hyperexponential service facility withk phases.Wang et al. [6] suggested optimal control for an infinite and a finite M/H2/1 queueing system with removable and non-reliable server. This model was again extended by Wang et al. [7] for k-type hyperexponential service time distribution. The optimal control of an M/Hk/1 queueing system was considered by Wang and Yen [8]. Further, Sharma [9] considered a MX/H2/1 queueing system under N-policy with vacation and un-reliable server. Now, we proceed to describe the M/Hk/1 model of Wang and Yen [8]. It is assumed that the customers arrive with parameter λ and service times follow k-type hyperexponential distribution. Suppose that μi is the service rate of ith (i=1,2,…,k) phase service. Let the probability that the next customer to enter service is of type i be qi (i=1,2,…,k) and ∑i=1kqi=1.Let us denote the steady state probabilities as follows:P(0,n): Prob. that there are n (=0,1,2,…,N-1) customers in the system when the server is turned off.P(i,n): Prob. that there are n (=1,2,…) customers in the system and the customer in service is in phase i (=1,2,…,k) when the server is turned on and in operating state.The steady state equations for M/Hk/1 queueing system are constructed as follows:
(4)P0,0=P0,n,1≤n≤N-1,λP0,0=∑j=1kμjPj,1,λ+μiPi,1=qi∑j=1kμjPj,2,1≤i≤k,λ+μiPi,n=λPi,n-1+qi∑j=1kμjPj,n+1,1≤i≤k,2≤n≤N-1,λ+μiPi,N=qiλP0,N-1+λPi,N-1+qi∑j=1kμjPj,N+1,1≤i≤k,λ+μiPi,n=λPi,n-1+qi∑j=1kμjPj,n+1,1≤i≤k,n≥N+1.
Equations (4) can be solved easily using the generating function method to determine the distribution of the number of the customers.


## 2.3. Phase Type Distribution

The preceding distributions are all special cases of the phase-type distribution. More general arrangements of phase type distributions may be achieved by mixing sequential and parallel arrangements of single phase distributions. The notation “PH” is used for phase type distribution. This distribution is characterized by a Markov chain with states1,2,…,k (the so called phases) and a transition probability matrix P which is transient. The random variable “X” has a phase-type distribution if X is the total time elapsing from start in the Markov chain till departure from the Markov chain. Further, we can define the phase type distribution as the distribution of absorption times of a certain Markov jumps processes which constitute a class of distribution on the positive real axis which seems to strike a balance between generality and tractability. For more detail, we refer the work of Neuts [10–12] and Asmussen [13].


## 2.4. Two-Phase Essential Service

Queueing models wherein the server provide two phases of essential service to each customer are known as two-phase essential service queueing model. Such types of queueing situations naturally arise in many real time system namely inmanufacturing system wherein the machine producing certain items may require two phases of service in succession. For completing the processing of raw materials, the periodic checking (first phase of service) followed by usual processing (second phase of service) of raw material is required. Kumar and Arumuganathan [14] considered a single server retrial queue with batch arrivals under the assumption that the server provides preliminary first essential service (FES) and second essential service (SES) to all arriving calls.


## 2.5. Two-Phase Optional Service

In many realistic situations, all jobs demand the second optional service along withfirst essential service (FES). The concept of second optional service was studied by Madan [15]. He considered a model of M/G/1 type where the server provides first essential service to all arriving customers and then after, a few customers may demand for a second optional service (SOS). For example, in a cyber café, the customers arrive for utilizing Internet surfing (as FES) but some of them may require scanning of some files (as SOS) also.


## 2.6. Multiphase Essential Service

In such a queueing system, the server serves the customers in finite number of phases. All these phases are essential for each customer to complete the whole service process. To illustrate, this phenomenon we can cite a clinical physical examination procedure as a doctor’s clinic wherein the patient goes through a series of physical checkup such as ear, nose and throat examination, blood test, electrocardiogram, eye examination which all are considered as essential phases of service to reach the final decision by any medical doctor to declare a candidate to be fit. Recently, Jain and Agrawal [16, 17] examined a batch arrival queueing system with modified Bernoulli vacation under N-policy wherein the customer needs l-stage of service in succession that is, the first stage service (FSS) is followed by the second stage service (SSS), the second stage service followed by third stage service (TSS) and so on up to l-stages of service.


## 2.7. Multiphase Optional Service

Multioptional phase service queueing models are those in which the server provides the first essential service (FES) to all arriving customers. After the completion of FES, the server renders a second optional service (SOS) with probabilityp1 (0≤p1≤1) if someone demands for the same otherwise he leaves the system with complementary probability p-1 (=1-p1). After the completion of SOS, the customer may demand a third optional service with probability p2 (0≤p2≤1), or may leave the system with probability p-2 (=1-p2). In general, the customer may request for any of the ith (4≤i≤l) phase optional services with probability pi-1, or may leave the system with probability p-i-1 (=1-pi-1). For example, in “Malls,” generally the customers arrive for watching movie as the first essential service but few of them may demand for other optional services such as shopping, amusements for children, and food in restaurant. Jain and Upadhyaya [18] dealt with unreliable server batch arrival queueing system with essential and multioptional services under N-policy. Using probability generating function technique, they obtained the system size distribution and other performance indices.


## 3. Queueing Methodology for Phase Service System

In many congestion situations, it is very difficult to analyze the performance analysis of queueing system with phase service. Therefore, a wide variety of techniques are used for providing the solution of queueing problems in different frameworks. In Table1, we have summarized some important classical techniques used by prominent researchers for investigating the queueing models with phase service. Furthermore, we describe some methodological aspects of queueing models with phase service by discussing the wel-established techniques, namely, supplementary variable technique (SVT), probability generating function (PGF), embedded Markov chain (EMC), matrix geometric/matrix method, maximum entropy analysis (MEA) and many others as follows.Table 1
Contributions on phase service queueing models using different techniques.
Techniques
Authors
Probability generating function technique
Rana  [73], Murray and Kelton [74], Selvam and Sivasankaran [75], Madan  [76, 77], Choi and Kim  [78],  Madan et al. [79],  Griffiths et al. [80], Ke and Chu [81], Kumar and Arumuganathan [82], Salehirad and Badmchizadeh [59], Thangaraj and Vanitha [83], Maurya [84], Kumar et al. [85],  Jain et al. [86], Arivudainambi and Godhandaraman [87]
Supplementary variable technique
Medhi  [88], Madan and Swami [89], Al-Jararha and Madan  [90], Madan and Choudhury  [91], Madan et al. [79], Madan and Choudhury  [92], Jianghua and Jinting  [93], Zadeh  [94], Wang and Li  [95], Ke  and Chu.  [96], Wang and Li  [97], Ramanath and Kalidass [98], Choudhury and Deka [99]
Matrix geometric/matrix method
Ramaswami and Lucantoni  [100], Le Boudec  [101], Diamond and Alfa  [102], He and Alfa [103], Breuer et al. [104], Van Houdt et al. [105],  Dudin et al. [106], Luh and Xu [107], Lee and Luh [108], Ayyappan et al. [109], Jain et al.  [110], Yang et al. [111], Hanbali  [112], Jain et al. [113]
Embedded Markov Chain technique
Latouche and Ramaswami [114], Baburaj and Manoharan  [115], Bocharov et al.  [116, 117], Atencia et al.  [68, 69], Al-khedhairi and Tadj  [118],  Taramin and Klimenok [119], Jain and Upadhyaya  [120], Jain et al. [121]
Maximum entropy analysis
Jain [122], Wang et al. [123, 124], Singh et al. [125]
Stochastic decomposition property
Kim and Park [126], Katayama and Kobayashi [127], Dimitriou and Langaris [128], Park et al.  [129], Jain et al. [130, 131]


### 3.1. Supplementary Variable Technique (SVT)

SVT is an elegant analytical technique which is frequently used for the solution of non-Markovian queueing problems. Using this technique, we can convert a non-Markovian queueing model in Markovian queueing model by introducing one or more supplementary variables. In this approach, the supplementary variables are introduced corresponding to either elapsed time or remaining time of the random variables. The supplementary variables are taken corresponding to service time for the model with general service time whereas for general input model, the supplementary variables are used corresponding to interarrival time. Firstly, SVT was used by Cox [19] to study the M/G/1 queueing system.In order to explain the use of the SVT, we describe an M/G/1 queue with additional second phase service model which was analyzed by Madan and Baklizi [20]. In such a model, we assume that the customers arrive in the system according to Poisson process with rate λ. Each arriving customer requires the first essential phase of service and the server also provides additional optional second phase service to the customers who demands for the same. Let Q be the probability when the server is in idle state. Let Pi,n(x) be the steady state probability that there are n (≥0) customers in the queue excluding one in ith (=1,2) phase of service and the elapsed service time of this customer is x. Further, we assume that Ri,n(x) denotes the steady state probability that there are n (≥0) customers in the queue excluding one customer who is repeating the ith (=1,2) phase of service and the elapsed time for this service is x. Let μi(x)dx be the conditional probability of completion of ith (=1,2) phase service, then we have
(5)μix=gix1-Gix,i=1,2,
where Gi(x) be the cumulative distribution function for ith (=1,2) phase service.Using the supplementary variable technique, we have the following steady state equations:(6)ddxPi,nx+λ+μixPi,nx=λPi,n-1x,n≥1,i=1,2,ddxPi,0x+λ+μixPi,0x=0,i=1,2,ddxRi,nx+λ+μixRi,nx=λRi,n-1x,n≥1,i=1,2,ddxRi,0x+λ+μixRi,0x=0,i=1,2,λQ=1-r2∫0∞P2,0xμ2xdxW+1-r11-p∫0∞P1,0xμ1xdxW+1-p∫0∞R1,0xμ1xdxW+∫0∞R2,0xμ2xdx.
The above set of (6) is to be solved under the following boundary conditions at x=0. Now
(7)P1,n0=1-r11-p∫0∞P1,n+1xμ1xdxW+1-p∫0∞R1,n+1xμ1xdxW+∫0∞R2,n+1xμ2xdxW+1-r2∫0∞P2,n+2xμ2xdx,n≥1,P1,00=1-r11-p∫0∞P1,1xμ1xdxW+1-p∫0∞R1,1xμ1xdxW+∫0∞R2,1xμ2xdxW+1-r2∫0∞P2,2xμ2xdx+λQ,P2,n0=1-r1p∫0∞P1,nxμ1xdxW+p∫0∞R1,nxμ1xdx,n≥0,Ri,n0=ri∫0∞Pi,nxμixdx,n≥0,i=1,2.
Using probability generating function technique, the set of (6)-(7) can be solved to obtain the queue size distribution and the expected number of customers in the system.


### 3.2. Probability Generating Function (PGF)

As the queueing systems have become complex over time, PGF is one of the most powerful tool for providing the solution of set of differential difference equations and tackle with probability problems. With the help of PGF, we can easily convert the discrete sequence of numbers that is, probabilities into a function of dummy variable. Furthermore, PGF is the special case of thez-transform. For describing PGF method, we continue the model discussed in Section 3.1. For solving (6)-(7), we define the generating functions as follows:
(8)Piz,x=∑n=0∞Pi,nxzn;Riz,x=∑n=0∞Ri,nxzn,WinWz≤1,i=1,2.
Multiplying (6)-(7) by appropriate powers of z and then summing over n, we have
(9)ddxPiz,x+λ-λz+μixPiz,x=0,i=1,2,ddxRiz,x+λ-λz+μixRiz,x=0,i=1,2,zP1z,0=λzQW+1-r11-p∫0∞P1z,xμ1xdxW+1-p∫0∞R1z,xμ1xdxW+∫0∞R2z,xμ2xdxW+1-r2∫0∞P2z,xμ2xdx-λQ,P2z,0=1-r1p∫0∞P1z,xμ1xdxW+p∫0∞R1z,xμ1xdx,Riz,0=ri∫0∞Piz,xμixdx,i=1,2.
On solving these equations, we obtain the probability generating functions of the number of the customers in the system as follows:
(10)Piz=Piz,01-gi*λ1-zλ1-z,i=1,2,Riz=Riz,01-gi*λ1-zλ1-z,i=1,2,
where gi*(λ(1-z))=∫0∞e-λ(1-z)dgi(x), i=1,2 is the Laplace-Steiltjes transform of the ith (i=1,2) stage service time.


### 3.3. Embedded Markov Chain (EMC)

A stochastic process is said to be embedded in the continuous time process only when the service of the customer is considered just after the departure or prior the arrival. EMC plays the important role in the performance analysis of continuous Markov chain in which the state parameter is discrete. EMC is an important classical method which is widely used by many researchers for solving the non-Morkovian models. Using EMC technique, we can be easily convert the two dimensional process[N(t),X(t)] into one dimensional process N(t). Further, we can apply this technique for those models where the distributions of interarrival time or service time do not possess the memory less property. Recently, this method was described by Choudhury and Deka [21]. They considered an M/G/1 queueing system with two phases of service wherein the customers arrive according to compound Poisson process with rate λ.On finding the server busy at the arrival epoch, all arriving customers join the orbit and try again for receiving service from the server under the linear retrial policy with rateν(1-δn,0)+nθ, where n is the orbit size, δi,j represents Kronecker’s delta function, θ is the retrial rate per customer and ν can be considered as the rate of the server providing service during the idle state. There is a single server that provides preliminary FES denoted by B1 to all arriving customers and provides SOS denoted by B2 with probability p to only those customers who opt for it otherwise leaves the system with the complementary probability p-=(1-p). During busy states, the server may break down with rate α1 during FES and α2 during SOS. After repairing, the server renders remaining service and such service times are cumulative and are known as generalized service times having the distribution function Hi(x), (i=1,2). The kth (k≥1) moments for busy states, repair states and generalized service time are given by bi(k), ri(k), gi(k),  (i=1,2), receptively. Let τn be the time instant at which nth service completion occurs. Let us consider the sequence Nn=N(τn+) which is embedded Morkov renewal process. Then, we have
(11)NnNn-1=j=j-1+Bnwith probabilityθjλ+θjj+Bnwith probabilityλλ+θj,
where Bn be the number of the customers arriving during the nth total service time.Now, we definemi,j and mj as the probabilities that j customers arrive during ith phase of generalized service time (∀i∈1,2) and time interval [B1+B2] then for j∈Z+, we have
(12)mi,j=∫0∞e-λxλxjcjndHixj!,mj=∑i=0jm1,im2,j-i.
Then, the one step transition matrix is P=(pij), where pij=Pr⁡(Nn+1=j/Nn=i) associated with Morkov chain Nnn=1∞ is obtained as
(13)pij=θjλ+θjW×qm1,0+pm0,Wifi≥1,j=i-1λλ+θjqm1,j-i+pmj-iW+θjλ+θjqm1,j-i+1+pmj-i+1,WWWWWWWiiWWif0≤i≤j.
Thus, using π=πP, the Kolmogorov equation associated with Morkov chain is given by
(14)πj=∑i=0jλπiλ+θiqm1,j-i+pmj-i+∑i=1j+1θiπiλ+θiqm1,j-i+1+pmj-i+1,j≥0.
Then, the probability generating function technique may be used to solve the above equation.


### 3.4. Matrix Geometric Method (MGM)

Whenever, it is very difficult to obtain neat and closed form analytical solution for queueing problems, then, these congestion situations can be analyzed by applying numerical techniques. MGM is one of the numerical techniques which is suited for this purpose. This approach can be applied whenever the blocks themselves become identical after some initial point. Further, the system can be decomposed into two parts: the initial part and the repetitive part. A significant contribution to this field was made by Neuts [10] for providing the solution of transition probability matrices. Many prominent researches have used this approach in their studies to solve the more complex queueing problems that can be realized in an industrial organization, transportation, and manufacturing environments.In order to explain MGM, we describe the queue with single working vacation (compare to [22]). Consider M/M/1 queue with arrival rate λ and service rate μb was considered. Whenever the queue becomes empty, the server begins a working vacation of random length “V” wherein “V” follows an exponential distribution with parameter θ. During a working vacation an arriving customer is served at a rate of μv. When a vacation ends and there are customers in the queue, the server changes service rate from μv to μb, and a regular busy period starts. Otherwise, the server enters idle period, and a new regular busy period starts when a customer arrival occurs. It is assumed that the interarrival times, service times, and working vacation times are mutually independent. The server provides service in first in first out (FIFO) order.LetQ(t) be the number of customers in the system at time t and let
(15)Nt=0,the server is in working vacation period at timet1,the server is in busy period at timet.
Then {Q(t),N(t)} is a Markov process with state space Ω=n,j;n≥0,j=0,1, where state (n,0), n≥1 denotes that the server is in working vacation state and there are n customers in the system; state (0,1) represents that the server is in idle state; states (n,1), n≥1 denote that there are n customers in the system and the server is in busy state.Using the lexicographical sequence for the states, the infinitesimal generator can be written as(16)Q^=A0C00⋯⋯B0AC0⋯⋯0BAC⋯⋯00BA⋯⋯⋯⋯⋯⋯⋯⋯,
where
(17)A0=-λ+θθ0-λ,C=λ00λ,B0=μv0μb0,A=-λ+θ+μvθ0-λ+μb,B=μv00μb.
The structure of Q^ indicates that {Q(t),N(t)} is a quasibirth and death process (see [10]). To analyze this QBD process, it is necessary to solve for the minimal nonnegative solution of the matrix quadratic equation
(18)R2B+RA+C=0.
Here, the square matrix R is the rate matrix which can be further used to determine the queue size distribution and other performance measures. Further, with the help of rate matrix R, the stationary probability vectors can be easily computed.


### 3.5. Maximum Entropy Analysis (MEA)

MEA is an inherent characteristic of a probabilistic system at equilibrium point. The main objective of the maximum entropy analysis is to provide an approximate approach to estimate an unknown probability distribution. This approach is based on the principle of measure of uncertainty suggested by Shannon [23]. Using this approach, one can obtain the unbiased distribution of the concerned queueing system by maximizing the entropy function defined in terms of known performance indices.Since 1970’s many attempts have been made for applying the method of maximum entropy in the area of queueing theory. Asars and Petersons [24] provided MEA for single server queueing system in which they considered a system that has a countable set S of possible states with probability p(Sj) of the occurrence of the state Si. Thus
(19)pSj>0,∑jpSj=1,j=1,2,3,….
For estimating the distribution p based on incomplete information, we assume that the information about p is available in the form of expected values of known function gk; k=1,2,3,…,M of the states given by
(20)∑Sn∈SgkSnpSn=Gk,1≤k≤m<∞.
Here, the number of constraints (19)-(20) is less than the number of possible states which cannot identify the distribution g. However, there are a number of distributions that satisfy all these constraints. Using the maximum entropy analysis, one may choose the right distribution “g.” The system entropy is given by
(21)Hg,p=-∑Sn∈SgSilog⁡gSipSi,
where p(Si) are known a priori about the distribution.Using Lagrange’s method of undetermined multipliers, we have(22)gSn=Zg-1pSnexp⁡-∑kgkSnψk,Zg=exp⁡ψ0=∑Sn∈SpSnexp⁡-∑kgkSnψk,
where [ψk] are the Lagrangian multipliers corresponding to the set of constraints (19)-(20).Using this principle, we can suggest a feasible method for approximately analyzing many complex queueing problems. For estimating the probabilistic information measures, maximum entropy analysis is used to obtain queue size distribution of various queueing systems in different frameworks when the moments of higher order attached to the interarrival time, service time and the number of the customers are known. Borzadaran [25] provided a note on maximum entropy for queueing problems. In queueing literature, there are a few papers on phase service queueing models using maximum entropy analysis.


### 3.6. Stochastic Decomposition Property (SDP)

Using this property, we can decompose the random variable of the interest in sum of two or more independent random variables. Stochastic Decomposition Property (SDP) was first established by Fuhrmann and Cooper [26] for M/G/1 type queues in which they decomposed the probability generating function (PGF) of the queue size into two or more independent random variables. We now proceed to provide stochastic decomposition results for M/G/1 queueing model with two phases of service discussed in Section 3.3. The existence of stochastic decomposition result can be demonstrated easily by showing
(23)πz=Ωzξz,
where
(24)ΩzW=1-ρ1-zq+pb2*A2zb1*A1zq+pb2*A2zb1*A1z-z,ξz=λψz1-ρ.
Also ρ=ρ1(1+α1r1(1))+pρ2(1+α2r2(1));  ρi=λbi(1), for all i=1,2.Here,Ω(z) is the probability generating function of the system size distribution at departure epoch. Further, ξ(z) is the probability generating function of the conditional distribution of the number of customers present in the orbit.


## 3.1. Supplementary Variable Technique (SVT)

SVT is an elegant analytical technique which is frequently used for the solution of non-Markovian queueing problems. Using this technique, we can convert a non-Markovian queueing model in Markovian queueing model by introducing one or more supplementary variables. In this approach, the supplementary variables are introduced corresponding to either elapsed time or remaining time of the random variables. The supplementary variables are taken corresponding to service time for the model with general service time whereas for general input model, the supplementary variables are used corresponding to interarrival time. Firstly, SVT was used by Cox [19] to study the M/G/1 queueing system.In order to explain the use of the SVT, we describe an M/G/1 queue with additional second phase service model which was analyzed by Madan and Baklizi [20]. In such a model, we assume that the customers arrive in the system according to Poisson process with rate λ. Each arriving customer requires the first essential phase of service and the server also provides additional optional second phase service to the customers who demands for the same. Let Q be the probability when the server is in idle state. Let Pi,n(x) be the steady state probability that there are n (≥0) customers in the queue excluding one in ith (=1,2) phase of service and the elapsed service time of this customer is x. Further, we assume that Ri,n(x) denotes the steady state probability that there are n (≥0) customers in the queue excluding one customer who is repeating the ith (=1,2) phase of service and the elapsed time for this service is x. Let μi(x)dx be the conditional probability of completion of ith (=1,2) phase service, then we have
(5)μix=gix1-Gix,i=1,2,
where Gi(x) be the cumulative distribution function for ith (=1,2) phase service.Using the supplementary variable technique, we have the following steady state equations:(6)ddxPi,nx+λ+μixPi,nx=λPi,n-1x,n≥1,i=1,2,ddxPi,0x+λ+μixPi,0x=0,i=1,2,ddxRi,nx+λ+μixRi,nx=λRi,n-1x,n≥1,i=1,2,ddxRi,0x+λ+μixRi,0x=0,i=1,2,λQ=1-r2∫0∞P2,0xμ2xdxW+1-r11-p∫0∞P1,0xμ1xdxW+1-p∫0∞R1,0xμ1xdxW+∫0∞R2,0xμ2xdx.
The above set of (6) is to be solved under the following boundary conditions at x=0. Now
(7)P1,n0=1-r11-p∫0∞P1,n+1xμ1xdxW+1-p∫0∞R1,n+1xμ1xdxW+∫0∞R2,n+1xμ2xdxW+1-r2∫0∞P2,n+2xμ2xdx,n≥1,P1,00=1-r11-p∫0∞P1,1xμ1xdxW+1-p∫0∞R1,1xμ1xdxW+∫0∞R2,1xμ2xdxW+1-r2∫0∞P2,2xμ2xdx+λQ,P2,n0=1-r1p∫0∞P1,nxμ1xdxW+p∫0∞R1,nxμ1xdx,n≥0,Ri,n0=ri∫0∞Pi,nxμixdx,n≥0,i=1,2.
Using probability generating function technique, the set of (6)-(7) can be solved to obtain the queue size distribution and the expected number of customers in the system.


## 3.2. Probability Generating Function (PGF)

As the queueing systems have become complex over time, PGF is one of the most powerful tool for providing the solution of set of differential difference equations and tackle with probability problems. With the help of PGF, we can easily convert the discrete sequence of numbers that is, probabilities into a function of dummy variable. Furthermore, PGF is the special case of thez-transform. For describing PGF method, we continue the model discussed in Section 3.1. For solving (6)-(7), we define the generating functions as follows:
(8)Piz,x=∑n=0∞Pi,nxzn;Riz,x=∑n=0∞Ri,nxzn,WinWz≤1,i=1,2.
Multiplying (6)-(7) by appropriate powers of z and then summing over n, we have
(9)ddxPiz,x+λ-λz+μixPiz,x=0,i=1,2,ddxRiz,x+λ-λz+μixRiz,x=0,i=1,2,zP1z,0=λzQW+1-r11-p∫0∞P1z,xμ1xdxW+1-p∫0∞R1z,xμ1xdxW+∫0∞R2z,xμ2xdxW+1-r2∫0∞P2z,xμ2xdx-λQ,P2z,0=1-r1p∫0∞P1z,xμ1xdxW+p∫0∞R1z,xμ1xdx,Riz,0=ri∫0∞Piz,xμixdx,i=1,2.
On solving these equations, we obtain the probability generating functions of the number of the customers in the system as follows:
(10)Piz=Piz,01-gi*λ1-zλ1-z,i=1,2,Riz=Riz,01-gi*λ1-zλ1-z,i=1,2,
where gi*(λ(1-z))=∫0∞e-λ(1-z)dgi(x), i=1,2 is the Laplace-Steiltjes transform of the ith (i=1,2) stage service time.


## 3.3. Embedded Markov Chain (EMC)

A stochastic process is said to be embedded in the continuous time process only when the service of the customer is considered just after the departure or prior the arrival. EMC plays the important role in the performance analysis of continuous Markov chain in which the state parameter is discrete. EMC is an important classical method which is widely used by many researchers for solving the non-Morkovian models. Using EMC technique, we can be easily convert the two dimensional process[N(t),X(t)] into one dimensional process N(t). Further, we can apply this technique for those models where the distributions of interarrival time or service time do not possess the memory less property. Recently, this method was described by Choudhury and Deka [21]. They considered an M/G/1 queueing system with two phases of service wherein the customers arrive according to compound Poisson process with rate λ.On finding the server busy at the arrival epoch, all arriving customers join the orbit and try again for receiving service from the server under the linear retrial policy with rateν(1-δn,0)+nθ, where n is the orbit size, δi,j represents Kronecker’s delta function, θ is the retrial rate per customer and ν can be considered as the rate of the server providing service during the idle state. There is a single server that provides preliminary FES denoted by B1 to all arriving customers and provides SOS denoted by B2 with probability p to only those customers who opt for it otherwise leaves the system with the complementary probability p-=(1-p). During busy states, the server may break down with rate α1 during FES and α2 during SOS. After repairing, the server renders remaining service and such service times are cumulative and are known as generalized service times having the distribution function Hi(x), (i=1,2). The kth (k≥1) moments for busy states, repair states and generalized service time are given by bi(k), ri(k), gi(k),  (i=1,2), receptively. Let τn be the time instant at which nth service completion occurs. Let us consider the sequence Nn=N(τn+) which is embedded Morkov renewal process. Then, we have
(11)NnNn-1=j=j-1+Bnwith probabilityθjλ+θjj+Bnwith probabilityλλ+θj,
where Bn be the number of the customers arriving during the nth total service time.Now, we definemi,j and mj as the probabilities that j customers arrive during ith phase of generalized service time (∀i∈1,2) and time interval [B1+B2] then for j∈Z+, we have
(12)mi,j=∫0∞e-λxλxjcjndHixj!,mj=∑i=0jm1,im2,j-i.
Then, the one step transition matrix is P=(pij), where pij=Pr⁡(Nn+1=j/Nn=i) associated with Morkov chain Nnn=1∞ is obtained as
(13)pij=θjλ+θjW×qm1,0+pm0,Wifi≥1,j=i-1λλ+θjqm1,j-i+pmj-iW+θjλ+θjqm1,j-i+1+pmj-i+1,WWWWWWWiiWWif0≤i≤j.
Thus, using π=πP, the Kolmogorov equation associated with Morkov chain is given by
(14)πj=∑i=0jλπiλ+θiqm1,j-i+pmj-i+∑i=1j+1θiπiλ+θiqm1,j-i+1+pmj-i+1,j≥0.
Then, the probability generating function technique may be used to solve the above equation.


## 3.4. Matrix Geometric Method (MGM)

Whenever, it is very difficult to obtain neat and closed form analytical solution for queueing problems, then, these congestion situations can be analyzed by applying numerical techniques. MGM is one of the numerical techniques which is suited for this purpose. This approach can be applied whenever the blocks themselves become identical after some initial point. Further, the system can be decomposed into two parts: the initial part and the repetitive part. A significant contribution to this field was made by Neuts [10] for providing the solution of transition probability matrices. Many prominent researches have used this approach in their studies to solve the more complex queueing problems that can be realized in an industrial organization, transportation, and manufacturing environments.In order to explain MGM, we describe the queue with single working vacation (compare to [22]). Consider M/M/1 queue with arrival rate λ and service rate μb was considered. Whenever the queue becomes empty, the server begins a working vacation of random length “V” wherein “V” follows an exponential distribution with parameter θ. During a working vacation an arriving customer is served at a rate of μv. When a vacation ends and there are customers in the queue, the server changes service rate from μv to μb, and a regular busy period starts. Otherwise, the server enters idle period, and a new regular busy period starts when a customer arrival occurs. It is assumed that the interarrival times, service times, and working vacation times are mutually independent. The server provides service in first in first out (FIFO) order.LetQ(t) be the number of customers in the system at time t and let
(15)Nt=0,the server is in working vacation period at timet1,the server is in busy period at timet.
Then {Q(t),N(t)} is a Markov process with state space Ω=n,j;n≥0,j=0,1, where state (n,0), n≥1 denotes that the server is in working vacation state and there are n customers in the system; state (0,1) represents that the server is in idle state; states (n,1), n≥1 denote that there are n customers in the system and the server is in busy state.Using the lexicographical sequence for the states, the infinitesimal generator can be written as(16)Q^=A0C00⋯⋯B0AC0⋯⋯0BAC⋯⋯00BA⋯⋯⋯⋯⋯⋯⋯⋯,
where
(17)A0=-λ+θθ0-λ,C=λ00λ,B0=μv0μb0,A=-λ+θ+μvθ0-λ+μb,B=μv00μb.
The structure of Q^ indicates that {Q(t),N(t)} is a quasibirth and death process (see [10]). To analyze this QBD process, it is necessary to solve for the minimal nonnegative solution of the matrix quadratic equation
(18)R2B+RA+C=0.
Here, the square matrix R is the rate matrix which can be further used to determine the queue size distribution and other performance measures. Further, with the help of rate matrix R, the stationary probability vectors can be easily computed.


## 3.5. Maximum Entropy Analysis (MEA)

MEA is an inherent characteristic of a probabilistic system at equilibrium point. The main objective of the maximum entropy analysis is to provide an approximate approach to estimate an unknown probability distribution. This approach is based on the principle of measure of uncertainty suggested by Shannon [23]. Using this approach, one can obtain the unbiased distribution of the concerned queueing system by maximizing the entropy function defined in terms of known performance indices.Since 1970’s many attempts have been made for applying the method of maximum entropy in the area of queueing theory. Asars and Petersons [24] provided MEA for single server queueing system in which they considered a system that has a countable set S of possible states with probability p(Sj) of the occurrence of the state Si. Thus
(19)pSj>0,∑jpSj=1,j=1,2,3,….
For estimating the distribution p based on incomplete information, we assume that the information about p is available in the form of expected values of known function gk; k=1,2,3,…,M of the states given by
(20)∑Sn∈SgkSnpSn=Gk,1≤k≤m<∞.
Here, the number of constraints (19)-(20) is less than the number of possible states which cannot identify the distribution g. However, there are a number of distributions that satisfy all these constraints. Using the maximum entropy analysis, one may choose the right distribution “g.” The system entropy is given by
(21)Hg,p=-∑Sn∈SgSilog⁡gSipSi,
where p(Si) are known a priori about the distribution.Using Lagrange’s method of undetermined multipliers, we have(22)gSn=Zg-1pSnexp⁡-∑kgkSnψk,Zg=exp⁡ψ0=∑Sn∈SpSnexp⁡-∑kgkSnψk,
where [ψk] are the Lagrangian multipliers corresponding to the set of constraints (19)-(20).Using this principle, we can suggest a feasible method for approximately analyzing many complex queueing problems. For estimating the probabilistic information measures, maximum entropy analysis is used to obtain queue size distribution of various queueing systems in different frameworks when the moments of higher order attached to the interarrival time, service time and the number of the customers are known. Borzadaran [25] provided a note on maximum entropy for queueing problems. In queueing literature, there are a few papers on phase service queueing models using maximum entropy analysis.


## 3.6. Stochastic Decomposition Property (SDP)

Using this property, we can decompose the random variable of the interest in sum of two or more independent random variables. Stochastic Decomposition Property (SDP) was first established by Fuhrmann and Cooper [26] for M/G/1 type queues in which they decomposed the probability generating function (PGF) of the queue size into two or more independent random variables. We now proceed to provide stochastic decomposition results for M/G/1 queueing model with two phases of service discussed in Section 3.3. The existence of stochastic decomposition result can be demonstrated easily by showing
(23)πz=Ωzξz,
where
(24)ΩzW=1-ρ1-zq+pb2*A2zb1*A1zq+pb2*A2zb1*A1z-z,ξz=λψz1-ρ.
Also ρ=ρ1(1+α1r1(1))+pρ2(1+α2r2(1));  ρi=λbi(1), for all i=1,2.Here,Ω(z) is the probability generating function of the system size distribution at departure epoch. Further, ξ(z) is the probability generating function of the conditional distribution of the number of customers present in the orbit.


## 4. Performance Measures

The mathematical analysis of queueing system is done to derive various generic measures using which we can describe the performance of the concerned queueing system. These performance measures are often used by the system designers and analysts for analyzing the real world situations. Performance measures can be further used to give direction to ensure whether the proper level of service is provided by the system facility in terms of response time while avoiding excessive cost. Some queueing performance measures such as queue length, waiting time, idle period, and busy period, are used to analyze in phase service model. For describing these performance measures, we consider the same model which was discussed in the previous Section2.1. The queue length (Lq), waiting time (Wq), idle period P(I), busy period P(B), respectively, for the model M/Ek/1 queue are given as follows.


### 4.1. Queue Length

Queue length can be defined as the number of the customers waiting in the queue for receiving service from the server. While in some situations, the total number of the customers present in the system including those customers who are being served at that moment are referred as “queue length.”Using the generating function method for (2), we can easily obtain the probability generating function which is given by
(25)Pz=P01-rz,
where P0=1-ρ, and ρ=λ/μ, r=λ/kμ.UsingLq=P′(z)z=1, we have
(26)Lq=k+1λρ2kμ1-ρ.
Equation (26) provides the result for average queue length.


### 4.2. Waiting Time

The total time duration spent by a customer in waiting for his turn before service is considered as “waiting time.” In wider sense, the total time spent in the system by a customer means the waiting time before service plus service time is called waiting time. It is very important performance characteristic from the customers’ point of view. Using Little’s formula, we have
(27)Wq=Lqλ=k+1ρ2kμ1-ρ.


### 4.3. Idle and Busy Period

The fraction of time during which the server remains idle (dormant) in the service facility is termed as “idle period.” The busy period is initiated when the server provides service for the waiting customers in phases as required by the customers that is, a busy period starts with the arrival of a customer at an empty service station and ends only when all waiting customers get their service from the server.(i)
Probability for the busy state is given as(28)PB=ρ.(ii)
Probability for the idle state is given as(29)PI=1-PB=P0.


### 4.4. Reliability Indices

Reliability of a system is defined as the probability that the system will perform efficiently throughout the interval(0,t) under operating conditions. Availability is defined as the probability that the system is operating properly when it is requested for use. Reliability and availability are the most desirable properties of most products in the modern world due to their interdisciplinary character.LetT be the random variable which denotes the failure time of the system. Then, reliability is
(30)Rt=1-Ft,
where, F(T) is the cumulative distribution function of T.The probability that the system is properly functioning at timet(≥0) is defined as the availability of the system. In the case of nonrepairable system, reliability and availability must be identical.


## 4.1. Queue Length

Queue length can be defined as the number of the customers waiting in the queue for receiving service from the server. While in some situations, the total number of the customers present in the system including those customers who are being served at that moment are referred as “queue length.”Using the generating function method for (2), we can easily obtain the probability generating function which is given by
(25)Pz=P01-rz,
where P0=1-ρ, and ρ=λ/μ, r=λ/kμ.UsingLq=P′(z)z=1, we have
(26)Lq=k+1λρ2kμ1-ρ.
Equation (26) provides the result for average queue length.


## 4.2. Waiting Time

The total time duration spent by a customer in waiting for his turn before service is considered as “waiting time.” In wider sense, the total time spent in the system by a customer means the waiting time before service plus service time is called waiting time. It is very important performance characteristic from the customers’ point of view. Using Little’s formula, we have
(27)Wq=Lqλ=k+1ρ2kμ1-ρ.


## 4.3. Idle and Busy Period

The fraction of time during which the server remains idle (dormant) in the service facility is termed as “idle period.” The busy period is initiated when the server provides service for the waiting customers in phases as required by the customers that is, a busy period starts with the arrival of a customer at an empty service station and ends only when all waiting customers get their service from the server.(i)
Probability for the busy state is given as(28)PB=ρ.(ii)
Probability for the idle state is given as(29)PI=1-PB=P0.


## 4.4. Reliability Indices

Reliability of a system is defined as the probability that the system will perform efficiently throughout the interval(0,t) under operating conditions. Availability is defined as the probability that the system is operating properly when it is requested for use. Reliability and availability are the most desirable properties of most products in the modern world due to their interdisciplinary character.LetT be the random variable which denotes the failure time of the system. Then, reliability is
(30)Rt=1-Ft,
where, F(T) is the cumulative distribution function of T.The probability that the system is properly functioning at timet(≥0) is defined as the availability of the system. In the case of nonrepairable system, reliability and availability must be identical.


## 5. Performance Analysis of Some Queueing Models with Phase Service

Performance analysis is one of the key issues which should be explored during the design and development of any phase service queueing model. Performance analysis of queueing models with phase service gives an idea to ensure whether the proper level of service is being provided. It is worthwhile to discuss some modelling aspects of queueing characterization. In this section, we describe the performance analysis of some queueing models with phase service. Here, we first discuss some important works related to the phase service queueing models which incorporate other key concepts such as retrial, priority, vacation, unreliable server, optimal control policy, bulk input/service, and discrete time. Furthermore, we review the notable recent works on phase service queueing model.


### 5.1. Retrial Queueing Model

Retrial queue can be characterized by the fact that whenever arriving customers find the server busy, they are compelled to leave the service area and join some virtual place referred as an “orbit” (see Figure 3). These customers are called “blocked customers” and try their luck again after a random amount of time for service from the orbit. Retrial queueing models are widely used in the stochastic modelling of many real-life congestion situations encountered in computer and telecommunication networks including local and wide area networks with the random multiple access protocols, distribution services, manufacturing plants, and call centers.Figure 3
Retrial queueing system.For early past prominent contributions on retrial queue, we refer the book by Falin and Templeton [27]. Further, the considerable attention has been paid in studying retrial queues with phase service. Artalejo and Choudhury [28] investigated an M/G/1 retrial queue with two-phase service. Choudhury [29] examined the two-phase batch arrival retrial queueing system with Bernoulli vacation. The phase service queueing models with repeated attempts in different frame works by prominent researchers are summarized in Table 2.Table 2
Literature on retrial queue with phase service.
Models
Special features
Authors
Methodology
M/M/1
Vacation interruptions, Erlang-K type service
Ayyappan et al.  [132]
Matrix geometric technique
M/Ek/1
Second optional service
Sekar et al.  [133]
Probability generating function
M/G/1
Bernoulli vacation, stochastic decomposition, and two-phase service
Choudhury  [134]
Embedded Markov chain, probability generating function
Server breakdown, SOS
Choudhury and Deka  [135]
Probability generating function
Generalized retrial time, SOS
Choudhury  [136]
(n-1) types of retrial customers, n-phases of service
Langaris and Dimitriou  [137]
M
X/G/1
Bulk arrival, vacation, unreliable server, and two-phase service
Ke and Chang  [138]
Probability generating function, supplementary variable
M
X/(G1, G2)/1
Bulk arrival, Bernoulli feedback,K optional vacations, and two phases of heterogeneous service
Arivudainambi and Godhandaraman  [87]
Probability generating function, supplementary variable technique
BMAP/PH/N
Batch Arrival, server breakdown,N-policy, and phase type service
Kim et al.  [139]
Probability generating function


### 5.2. Priority Queueing Model

Priority queueing models are those in which one or more types of customers have priority over other types of customers. Priority queueing models are an invaluable scheduling method that allows the customers of different classes to receive service in priority to other customers. It is often desirable or even essential to provide different grades of service for different classes of customers. Priority models have two broad categories of priority rules namely, preemptive priority and nonpreemptive priority.(i) Preemptive Priority Model. In this case, the service of a lower priority customer is interrupted due to arrival of higher priority customer. After the interruption, the customer gets his service again at that point where the service was interrupted however in some other cases he may start the service from some another point or repeat from initial point.(ii) Non-Preemptive Priority Model. The higher priority customers may not interrupt the service of a lower priority customer; and higher priority customers have to wait till the service of the lower priority customer has been completed.The schematic diagram of queue with two classes of customers and two-phase service is shown in Figure4. Some researchers have focused their attention on the priority queueing models with phase type of services which are enumerated as follows. Chakravarthy [30] considered a priority polling system consisting of two queues attended by a single server who served those customers according to the phase type distribution. Krishna Kumar et al. [31] examined an M/G/1 retrial queue with preemptive resume wherein the service of the customers is provided in two phases. Further, Wierman et al. [32] focused their attention on M/PH/k system with two priority classes of customers, high priority and low priority. They demonstrated exactly how many servers are preferable as a function of the load and service time distribution. Zhao et al. [33] focused on the computation of DBMAP/PH/1 queueing system with priorities. The MAP/PH/1 queue with self-generation of priorities was studied by Krishnamoorthy et al. [34]. Moreover, a priority queue was studied by Sharma and Kumar [35].Figure 4
Priority queueing system.


### 5.3. Vacation Queueing Model

Queueing system in which the server is unavailable for a random interval of time is referred as “vacation queueing model.” Generally, a vacation period starts whenever the system becomes empty that is, the server is idle. Vacation queueing models are frequently seen in the congestion situations in many areas of industrial problems including computer and communication systems, production and manufacturing systems, transportation and planning. A detailed account on early vacation models can be found in the work of Doshi [36]. Vacation queueing models are further classified into single vacation, multiple vacation and working vacation models, which are explained as given below.(i) Single Vacation Model (SVM). In such type of vacation model, the server takes a single vacation between two successive busy periods. After returning from vacation, if he finds no customers in the system then he waits in the system for the new arrival.(ii) Multiple Vacation Model (MVM). After taking the first vacation, the server may take other vacations subsequently till he finds the number of the customers waiting in the system.(iii) Working Vacation Model (WVM). During the vacation, the server does not stop the service completely but serves the customers with a lower rate or performs some ancillary task. This type of vacation is known as “working vacation.” Working vacation queueing model is useful for the system wherein the server may utilize his idle time for different tasks.Vacation queueing models have been studied by Alfa [37] in different frame works. A two-phase queueing system under Bernoulli vacation schedule has been investigated by Choudhury and Madan [38], Choudhury and Paul [39] in different frameworks. Choudhury et al. [40] examined the steady state behaviour of a batch arrival queue with two phases of heterogeneous service under multiple vacation policy along with Bernoulli vacation schedule. They have obtained the expected number of the customers in the system using the probability generating function technique. Some notable works on vacation queueing models with phase service are reported in Table 3.Table 3
Literature on vacation queue with phase service.
Models
Special features
Authors
Methodology
M/M/1
Second optional service  in batches
Jain et al.  [86]
Probability generating function
Retrial queue, Bernoulli vacation, and two-phase service
Choudhury  [134]
Embedded Markov chain, probability generating function
Choudhury and Kalita  [140]
Probability generating function
M/G/1
Bernoulli vacation, server breakdown, and two-phase service
Ke and Chang  [141]
Bulk arrival, multiple vacation
Jeyakumar and Arumuganathan  [142]
Retrial queue, server breakdown, batch arrival, and two-phase service
Kumar and Arumuganathan  [143]
Multioptional services, multi-optional vacations, and unreliable server
Jain et al.  [72]
Probability generating function, supplementary variable technique
M
X/(G1, G2)/1
Bulk arrival, setup, bilevel threshold policy, single vacation, and two phases of essential service
Mary et al.  [144]
Probability generating function, supplementary variable technique, and stochastic decomposition
BMAP/G/1
Bulk arrival, multiple vacations, and second optional service
Wu et al.  [145]
Probability generating function


### 5.4. Unreliable Queueing Model

Unreliable server models can be explained as a special case of service interruption models. Unreliable queueing model makes negative impact on the performance of any queueing system. In many practical situations, the server may fail during busy state or idle state and requires repair for restoring the server again. Whenever the breakdown of the server occurs during busy state it is termed as “active break down” while in inactive state that is, idle state it is said to be “passive break down” as shown in Figure5. In our routine life, we may encounter various congestion situations wherein the servers are subject to unpredictable breakdowns. The phase service queueing models with service interruptions have received considerable attention of the researchers working in the area of queueing and reliability theory.Figure 5
Queueing system with unreliable server.Several authors have studied a variety of models with phase service in different contexts that also include the unpredictable failure of a server and repairs. The repairable queueing system have been studied by Li [41], Li et al. [42], Li and Cao [43] using phase service in different frame works. Wang [44] analyzed an M/G/1 queue with second optional service and unreliable server. Other related recent works done by researchers in the area of unreliable server queue with phase service are given in Table 4.Table 4
Literature on unreliable server queue with phase service.
Models
Special features
Authors
Methodology
M
X/M/1
N-policy, Vacation, startup, bulk arrival, gated service, and two-phase service
Kumar et al.  [85]
Probability generating function
M/Ek/1
Erlangian phase service
Yu et al.  [146]
M/G/1
Retrial queue, Bernoulli vacation, two-phase service
Wang and Li  [147]
Second optional service
Wang and Xu  [148], Choudhury and Tadj  [149]
Startup, second optional service
Wang et al.  [150]
Retrial queue, startup, and two-phase service
Dimitriou and Langaris  [151]
Probability generating function, supplementary variable
Vacation, two-phase essential service
Thangaraj and Vanitha  [152], Jain et al.  [130, 131]
Two phase service, Bernoulli vacation
Choudhury and Deka  [99]
M
X/G/1
Retrial queue, Bulk arrival, Two phase service
Kumar and Arumuganathan  [143], Choudhury et al.   [153]
Bulk arrival, Bernoulli vacation,N-policy, and two-phase service
Choudhury and Tadj  [154]


### 5.5. Control Policies for Queueing Models

The optimal control of queueing model is necessary to ensure the smooth functioning of the queueing system from the management view; such models are applicable to many real life situations such as in manufacturing and production control, transportation control, telecommunication process control, and computer science. The optimal control policies may be helpful for controlling the queue levels at different epochs wherein the service should start or stop. There are different policies which have been introduced in the previous studies by many prominent researchers. The concept of theN-policy and F-policy was first introduced by Yadin and Naor [45], and Gupta [46], respectively.A batch arrival queue with an additional phase of service underN-policy was studied, Choudhury and Paul [47]. Further, Pearn and Chang [48] analyzed optimal management of N-policy for M/Ek/1 queueing system with removable server. Choudhury and Madan [49] considered a batch arrival queueing system with modified Bernoulli schedule under N-policy. The server remains idle till the queue size becomes N(≥1). As the queue size reaches at least N, the server instantly starts working and provides two stages of service in succession to each customer. Jain et al. [50] studied the N-policy for two-phase service system with mixed standbys and unreliable server. An MX/G/1 queue with an additional phase of second optional service under N-policy consisting of a breakdown period and a delay period was examined by Choudhury et al. [51]. A MX/H2/1 queueing system under N-policy with vacation and un-reliable server was investigated by Sharma [9]. Recently, Wu et al. [52] analyzed the MAP/PH/N retrial queue under N-policy with finite number of sources wherein arrivals of negative customers operating in a finite state.


### 5.6. Feedback Queueing Model

In many congestion situations, if the service of the customer becomes unsuccessful, he is served again and again till his service becomes successful. For this sake, he joins the queue with probabilityp; the customer may leave the system with complementary probability q(=1-p). This phenomenon is known as “Bernoulli feedback” as shown in Figure 6.Figure 6
Bernoulli feedback queueing system.During last few years, the literature on Bernoulli feedback queue with phase service has grown up tremendously. Choudhury and Paul [53] dealt with an M/G/1 queue with two phases of heterogeneous services and Bernoulli feedback system, where the server provides first phase of regular service to all the customers. They have derived the queue size distribution at random epoch and at a service completion epoch. Krieger et al. [54] considered a feedback queue with batch Markovian arrivals and phase type services. Moreover, an M/G/1 retrial queue with second multioptional service, feedback, and unreliable server was studied by Li and Wang [55]. Kim et al. [56] analyzed the BMAP/G/1 queue with feedback and losses. Zadeh and Shahkar [57] considered an M/G/1 queue with two phases of heterogeneous services, Bernoulli feedback and Bernoulli vacation. They have assumed that the customer feedback with probability p to the tail of original queue for repeating of the service until the service is successful; otherwise with probability 1-p=q the customer departs from the system forever. Liu et al. [58] worked on an M/G/1 retrial queue with two-phase service and feedback under N-policy vacation subject to the server breakdowns and repairs. Salehirad and Badamchizadeh [59] analyzed an M/G/1 queue with k phases of heterogeneous services and random feedback. An M/G/1 feedback queue with two types of service and optional server vacations based on Bernoulli schedule was discussed by Thangaraj and Vanitha [60]. Recently, Kaushik et al. [61] worked on N-version system.


### 5.7. Bulk Queueing Model

In queueing literature when arrivals of the customers/units occur in batches is called “bulk arrival queueing model.” On the other hand, queueing situations in which the service of the customers/units is provided in batches by the server is known as “batch service queueing model.” In this section, we shall mention some notable investigations which are devoted to bulk queues with the combination of phase service. Yu and Nie [62] studied the MAP/PH/1 queueing system with repairable sever and arrivals in batches. Katayama and Kobayashi [63] considered an M/G/1 queueing system wherein a single server provides a batch service in the first phase and an individual service in the second phase. Choudhury and Paul [53] dealt with an MX/G/1 queueing system with two phases of heterogeneous service under N-policy. They have derived the queue size distribution at random epoch as well as at departure epoch. An M/G/1 queueing system with two-phase batch arrival under Bernoulli schedule has been examined by Choudhury and Madan [38]. J. Kim and B. Kim [64] considered a bulk arrival queue with phase type which required service times in which a single processor serves according to the processor-sharing discipline. In Table 5, we refer some important contributions batch arrival/service queueing model with phase service.Table 5
Literature on bulk queues with phase service.
Models
Special features
Authors
Methodology
M/M/1
Bach service, vacation, and additional phase of optional service
Kalyanaraman and Murugan  [155]
Probability generating function
Murugan and Kalyanaraman  [156], Sharma  [157]
M/G/1
Quorum, bulk arrival, optional reservice
Tadj and Ke  [158]
Probability generating function, supplementary variable
Threshold policy, bulk service, and second optional service
Haridass and Arumuganathan  [159]
Probability generating function
M
X/G/1
Bulk arrival, startup,j additional optional service
Ke  [160]
Probability generating function, Supplementary variable
server breakdown, retrial, batch arrival, Bernoulli admission mechanism, and two-phase of service
Choudhury and Deka  [161]
Retrial queue, bulk arrival, second optional service, Bernoulli vacation, and unreliable server
Jain et al.  [121]
Probability generating function, Supplementary variable, Embedded Markov chain
BMAP/G/1
Batch arrival, retrial, and phase of service
Kim et al.  [162]
Matrix method
MAP/PH/1
Batch arrival,N-policy, phase service
Kim et al.  [163]
Batch arrival, batch service,N-policy, and phase service
Lenin et al.  [164]
Newton approximation technique


### 5.8. Discrete Queueing Model

Discrete-time queueing models have received considerable attention of queue theoristsdue to their applications in many real time systems including computer and communication networks, flexible manufacturing system (FMS), broadband integrated services digital network (B-ISDN), and asynchronous transfer mode (ATM). In discrete-time system, the time is treated as a discrete variable (slot), and arrivals and departures can only occur at boundary epochs of time slots. In past literature, the discrete time models are classified into two categories given as below.(i) Early Arrival Model (EAM). A departure of a customer/unit occurs in precedence over an arrival; that is, the customers/units are assumed to arrive early during a slot.(ii) Late Arrival Model (LAM). An arrival of a customer/unit occurs in precedence over a departure; that is, the customers/units are assumed to arrive late during a slot.The merit of the discrete-time queueing model with phase service is continuously recognized by the researchers due to its significant role in performance prediction of various congestion problems. A discrete time queueing model in which jobs require primary and possibly secondary services was analyzed by Alfa and Chakravarthy [65]. Alfa [37] considered a single server discrete queue with vacations and obtained the results for the probability densities of the number of the customers in the system. Li and Yang [66] analyzed discrete-time PH/Geo/retrial queue. He [67] studied a discrete time SM/PH/1 queueing system with multiple types of customers. Further, Atencia et al. [68, 69] considered Geo/PH/1 queueing system with repeated attempts. A discrete-time Geo/G/1 retrial queue was considered by Atencia and Moreno [70], Wang and Zhao [71] in which all the arriving customers require a first essential service while only some of them ask for a second optional service. They have obtained the explicit formulae for the stationary distribution and various performance measures. Some significant works on discrete queueing model with phase service are presented in Table 6.Table 6
Recent literature on discrete queueing model with phase service.
Models
Special features
Authors
Methodology
Geo
X/G/1
Retrial queue, bulk arrival, starting failure, stochastic decomposition, andl-stage service
Jain and Agrawal  [16, 17]
Probability generating function
Retrial queue, feedback, and phase service
Liu and Gao  [165]
Geo/Geo/1
Second optional service
Lin et al.  [166]
Matrix analytic approach, quasi-Newton method
MAP/PH/1
Discrete time, multiple working vacations, and two-phase service
Goswami and Selvaraju  [167]
Matrix analytic method
GI/D-MSP/1
Discrete time, multiple vacations,
Samanta and Zhang  [168]
Matrix geometric method


## 5.1. Retrial Queueing Model

Retrial queue can be characterized by the fact that whenever arriving customers find the server busy, they are compelled to leave the service area and join some virtual place referred as an “orbit” (see Figure 3). These customers are called “blocked customers” and try their luck again after a random amount of time for service from the orbit. Retrial queueing models are widely used in the stochastic modelling of many real-life congestion situations encountered in computer and telecommunication networks including local and wide area networks with the random multiple access protocols, distribution services, manufacturing plants, and call centers.Figure 3
Retrial queueing system.For early past prominent contributions on retrial queue, we refer the book by Falin and Templeton [27]. Further, the considerable attention has been paid in studying retrial queues with phase service. Artalejo and Choudhury [28] investigated an M/G/1 retrial queue with two-phase service. Choudhury [29] examined the two-phase batch arrival retrial queueing system with Bernoulli vacation. The phase service queueing models with repeated attempts in different frame works by prominent researchers are summarized in Table 2.Table 2
Literature on retrial queue with phase service.
Models
Special features
Authors
Methodology
M/M/1
Vacation interruptions, Erlang-K type service
Ayyappan et al.  [132]
Matrix geometric technique
M/Ek/1
Second optional service
Sekar et al.  [133]
Probability generating function
M/G/1
Bernoulli vacation, stochastic decomposition, and two-phase service
Choudhury  [134]
Embedded Markov chain, probability generating function
Server breakdown, SOS
Choudhury and Deka  [135]
Probability generating function
Generalized retrial time, SOS
Choudhury  [136]
(n-1) types of retrial customers, n-phases of service
Langaris and Dimitriou  [137]
M
X/G/1
Bulk arrival, vacation, unreliable server, and two-phase service
Ke and Chang  [138]
Probability generating function, supplementary variable
M
X/(G1, G2)/1
Bulk arrival, Bernoulli feedback,K optional vacations, and two phases of heterogeneous service
Arivudainambi and Godhandaraman  [87]
Probability generating function, supplementary variable technique
BMAP/PH/N
Batch Arrival, server breakdown,N-policy, and phase type service
Kim et al.  [139]
Probability generating function


## 5.2. Priority Queueing Model

Priority queueing models are those in which one or more types of customers have priority over other types of customers. Priority queueing models are an invaluable scheduling method that allows the customers of different classes to receive service in priority to other customers. It is often desirable or even essential to provide different grades of service for different classes of customers. Priority models have two broad categories of priority rules namely, preemptive priority and nonpreemptive priority.(i) Preemptive Priority Model. In this case, the service of a lower priority customer is interrupted due to arrival of higher priority customer. After the interruption, the customer gets his service again at that point where the service was interrupted however in some other cases he may start the service from some another point or repeat from initial point.(ii) Non-Preemptive Priority Model. The higher priority customers may not interrupt the service of a lower priority customer; and higher priority customers have to wait till the service of the lower priority customer has been completed.The schematic diagram of queue with two classes of customers and two-phase service is shown in Figure4. Some researchers have focused their attention on the priority queueing models with phase type of services which are enumerated as follows. Chakravarthy [30] considered a priority polling system consisting of two queues attended by a single server who served those customers according to the phase type distribution. Krishna Kumar et al. [31] examined an M/G/1 retrial queue with preemptive resume wherein the service of the customers is provided in two phases. Further, Wierman et al. [32] focused their attention on M/PH/k system with two priority classes of customers, high priority and low priority. They demonstrated exactly how many servers are preferable as a function of the load and service time distribution. Zhao et al. [33] focused on the computation of DBMAP/PH/1 queueing system with priorities. The MAP/PH/1 queue with self-generation of priorities was studied by Krishnamoorthy et al. [34]. Moreover, a priority queue was studied by Sharma and Kumar [35].Figure 4
Priority queueing system.


## 5.3. Vacation Queueing Model

Queueing system in which the server is unavailable for a random interval of time is referred as “vacation queueing model.” Generally, a vacation period starts whenever the system becomes empty that is, the server is idle. Vacation queueing models are frequently seen in the congestion situations in many areas of industrial problems including computer and communication systems, production and manufacturing systems, transportation and planning. A detailed account on early vacation models can be found in the work of Doshi [36]. Vacation queueing models are further classified into single vacation, multiple vacation and working vacation models, which are explained as given below.(i) Single Vacation Model (SVM). In such type of vacation model, the server takes a single vacation between two successive busy periods. After returning from vacation, if he finds no customers in the system then he waits in the system for the new arrival.(ii) Multiple Vacation Model (MVM). After taking the first vacation, the server may take other vacations subsequently till he finds the number of the customers waiting in the system.(iii) Working Vacation Model (WVM). During the vacation, the server does not stop the service completely but serves the customers with a lower rate or performs some ancillary task. This type of vacation is known as “working vacation.” Working vacation queueing model is useful for the system wherein the server may utilize his idle time for different tasks.Vacation queueing models have been studied by Alfa [37] in different frame works. A two-phase queueing system under Bernoulli vacation schedule has been investigated by Choudhury and Madan [38], Choudhury and Paul [39] in different frameworks. Choudhury et al. [40] examined the steady state behaviour of a batch arrival queue with two phases of heterogeneous service under multiple vacation policy along with Bernoulli vacation schedule. They have obtained the expected number of the customers in the system using the probability generating function technique. Some notable works on vacation queueing models with phase service are reported in Table 3.Table 3
Literature on vacation queue with phase service.
Models
Special features
Authors
Methodology
M/M/1
Second optional service  in batches
Jain et al.  [86]
Probability generating function
Retrial queue, Bernoulli vacation, and two-phase service
Choudhury  [134]
Embedded Markov chain, probability generating function
Choudhury and Kalita  [140]
Probability generating function
M/G/1
Bernoulli vacation, server breakdown, and two-phase service
Ke and Chang  [141]
Bulk arrival, multiple vacation
Jeyakumar and Arumuganathan  [142]
Retrial queue, server breakdown, batch arrival, and two-phase service
Kumar and Arumuganathan  [143]
Multioptional services, multi-optional vacations, and unreliable server
Jain et al.  [72]
Probability generating function, supplementary variable technique
M
X/(G1, G2)/1
Bulk arrival, setup, bilevel threshold policy, single vacation, and two phases of essential service
Mary et al.  [144]
Probability generating function, supplementary variable technique, and stochastic decomposition
BMAP/G/1
Bulk arrival, multiple vacations, and second optional service
Wu et al.  [145]
Probability generating function


## 5.4. Unreliable Queueing Model

Unreliable server models can be explained as a special case of service interruption models. Unreliable queueing model makes negative impact on the performance of any queueing system. In many practical situations, the server may fail during busy state or idle state and requires repair for restoring the server again. Whenever the breakdown of the server occurs during busy state it is termed as “active break down” while in inactive state that is, idle state it is said to be “passive break down” as shown in Figure5. In our routine life, we may encounter various congestion situations wherein the servers are subject to unpredictable breakdowns. The phase service queueing models with service interruptions have received considerable attention of the researchers working in the area of queueing and reliability theory.Figure 5
Queueing system with unreliable server.Several authors have studied a variety of models with phase service in different contexts that also include the unpredictable failure of a server and repairs. The repairable queueing system have been studied by Li [41], Li et al. [42], Li and Cao [43] using phase service in different frame works. Wang [44] analyzed an M/G/1 queue with second optional service and unreliable server. Other related recent works done by researchers in the area of unreliable server queue with phase service are given in Table 4.Table 4
Literature on unreliable server queue with phase service.
Models
Special features
Authors
Methodology
M
X/M/1
N-policy, Vacation, startup, bulk arrival, gated service, and two-phase service
Kumar et al.  [85]
Probability generating function
M/Ek/1
Erlangian phase service
Yu et al.  [146]
M/G/1
Retrial queue, Bernoulli vacation, two-phase service
Wang and Li  [147]
Second optional service
Wang and Xu  [148], Choudhury and Tadj  [149]
Startup, second optional service
Wang et al.  [150]
Retrial queue, startup, and two-phase service
Dimitriou and Langaris  [151]
Probability generating function, supplementary variable
Vacation, two-phase essential service
Thangaraj and Vanitha  [152], Jain et al.  [130, 131]
Two phase service, Bernoulli vacation
Choudhury and Deka  [99]
M
X/G/1
Retrial queue, Bulk arrival, Two phase service
Kumar and Arumuganathan  [143], Choudhury et al.   [153]
Bulk arrival, Bernoulli vacation,N-policy, and two-phase service
Choudhury and Tadj  [154]


## 5.5. Control Policies for Queueing Models

The optimal control of queueing model is necessary to ensure the smooth functioning of the queueing system from the management view; such models are applicable to many real life situations such as in manufacturing and production control, transportation control, telecommunication process control, and computer science. The optimal control policies may be helpful for controlling the queue levels at different epochs wherein the service should start or stop. There are different policies which have been introduced in the previous studies by many prominent researchers. The concept of theN-policy and F-policy was first introduced by Yadin and Naor [45], and Gupta [46], respectively.A batch arrival queue with an additional phase of service underN-policy was studied, Choudhury and Paul [47]. Further, Pearn and Chang [48] analyzed optimal management of N-policy for M/Ek/1 queueing system with removable server. Choudhury and Madan [49] considered a batch arrival queueing system with modified Bernoulli schedule under N-policy. The server remains idle till the queue size becomes N(≥1). As the queue size reaches at least N, the server instantly starts working and provides two stages of service in succession to each customer. Jain et al. [50] studied the N-policy for two-phase service system with mixed standbys and unreliable server. An MX/G/1 queue with an additional phase of second optional service under N-policy consisting of a breakdown period and a delay period was examined by Choudhury et al. [51]. A MX/H2/1 queueing system under N-policy with vacation and un-reliable server was investigated by Sharma [9]. Recently, Wu et al. [52] analyzed the MAP/PH/N retrial queue under N-policy with finite number of sources wherein arrivals of negative customers operating in a finite state.


## 5.6. Feedback Queueing Model

In many congestion situations, if the service of the customer becomes unsuccessful, he is served again and again till his service becomes successful. For this sake, he joins the queue with probabilityp; the customer may leave the system with complementary probability q(=1-p). This phenomenon is known as “Bernoulli feedback” as shown in Figure 6.Figure 6
Bernoulli feedback queueing system.During last few years, the literature on Bernoulli feedback queue with phase service has grown up tremendously. Choudhury and Paul [53] dealt with an M/G/1 queue with two phases of heterogeneous services and Bernoulli feedback system, where the server provides first phase of regular service to all the customers. They have derived the queue size distribution at random epoch and at a service completion epoch. Krieger et al. [54] considered a feedback queue with batch Markovian arrivals and phase type services. Moreover, an M/G/1 retrial queue with second multioptional service, feedback, and unreliable server was studied by Li and Wang [55]. Kim et al. [56] analyzed the BMAP/G/1 queue with feedback and losses. Zadeh and Shahkar [57] considered an M/G/1 queue with two phases of heterogeneous services, Bernoulli feedback and Bernoulli vacation. They have assumed that the customer feedback with probability p to the tail of original queue for repeating of the service until the service is successful; otherwise with probability 1-p=q the customer departs from the system forever. Liu et al. [58] worked on an M/G/1 retrial queue with two-phase service and feedback under N-policy vacation subject to the server breakdowns and repairs. Salehirad and Badamchizadeh [59] analyzed an M/G/1 queue with k phases of heterogeneous services and random feedback. An M/G/1 feedback queue with two types of service and optional server vacations based on Bernoulli schedule was discussed by Thangaraj and Vanitha [60]. Recently, Kaushik et al. [61] worked on N-version system.


## 5.7. Bulk Queueing Model

In queueing literature when arrivals of the customers/units occur in batches is called “bulk arrival queueing model.” On the other hand, queueing situations in which the service of the customers/units is provided in batches by the server is known as “batch service queueing model.” In this section, we shall mention some notable investigations which are devoted to bulk queues with the combination of phase service. Yu and Nie [62] studied the MAP/PH/1 queueing system with repairable sever and arrivals in batches. Katayama and Kobayashi [63] considered an M/G/1 queueing system wherein a single server provides a batch service in the first phase and an individual service in the second phase. Choudhury and Paul [53] dealt with an MX/G/1 queueing system with two phases of heterogeneous service under N-policy. They have derived the queue size distribution at random epoch as well as at departure epoch. An M/G/1 queueing system with two-phase batch arrival under Bernoulli schedule has been examined by Choudhury and Madan [38]. J. Kim and B. Kim [64] considered a bulk arrival queue with phase type which required service times in which a single processor serves according to the processor-sharing discipline. In Table 5, we refer some important contributions batch arrival/service queueing model with phase service.Table 5
Literature on bulk queues with phase service.
Models
Special features
Authors
Methodology
M/M/1
Bach service, vacation, and additional phase of optional service
Kalyanaraman and Murugan  [155]
Probability generating function
Murugan and Kalyanaraman  [156], Sharma  [157]
M/G/1
Quorum, bulk arrival, optional reservice
Tadj and Ke  [158]
Probability generating function, supplementary variable
Threshold policy, bulk service, and second optional service
Haridass and Arumuganathan  [159]
Probability generating function
M
X/G/1
Bulk arrival, startup,j additional optional service
Ke  [160]
Probability generating function, Supplementary variable
server breakdown, retrial, batch arrival, Bernoulli admission mechanism, and two-phase of service
Choudhury and Deka  [161]
Retrial queue, bulk arrival, second optional service, Bernoulli vacation, and unreliable server
Jain et al.  [121]
Probability generating function, Supplementary variable, Embedded Markov chain
BMAP/G/1
Batch arrival, retrial, and phase of service
Kim et al.  [162]
Matrix method
MAP/PH/1
Batch arrival,N-policy, phase service
Kim et al.  [163]
Batch arrival, batch service,N-policy, and phase service
Lenin et al.  [164]
Newton approximation technique


## 5.8. Discrete Queueing Model

Discrete-time queueing models have received considerable attention of queue theoristsdue to their applications in many real time systems including computer and communication networks, flexible manufacturing system (FMS), broadband integrated services digital network (B-ISDN), and asynchronous transfer mode (ATM). In discrete-time system, the time is treated as a discrete variable (slot), and arrivals and departures can only occur at boundary epochs of time slots. In past literature, the discrete time models are classified into two categories given as below.(i) Early Arrival Model (EAM). A departure of a customer/unit occurs in precedence over an arrival; that is, the customers/units are assumed to arrive early during a slot.(ii) Late Arrival Model (LAM). An arrival of a customer/unit occurs in precedence over a departure; that is, the customers/units are assumed to arrive late during a slot.The merit of the discrete-time queueing model with phase service is continuously recognized by the researchers due to its significant role in performance prediction of various congestion problems. A discrete time queueing model in which jobs require primary and possibly secondary services was analyzed by Alfa and Chakravarthy [65]. Alfa [37] considered a single server discrete queue with vacations and obtained the results for the probability densities of the number of the customers in the system. Li and Yang [66] analyzed discrete-time PH/Geo/retrial queue. He [67] studied a discrete time SM/PH/1 queueing system with multiple types of customers. Further, Atencia et al. [68, 69] considered Geo/PH/1 queueing system with repeated attempts. A discrete-time Geo/G/1 retrial queue was considered by Atencia and Moreno [70], Wang and Zhao [71] in which all the arriving customers require a first essential service while only some of them ask for a second optional service. They have obtained the explicit formulae for the stationary distribution and various performance measures. Some significant works on discrete queueing model with phase service are presented in Table 6.Table 6
Recent literature on discrete queueing model with phase service.
Models
Special features
Authors
Methodology
Geo
X/G/1
Retrial queue, bulk arrival, starting failure, stochastic decomposition, andl-stage service
Jain and Agrawal  [16, 17]
Probability generating function
Retrial queue, feedback, and phase service
Liu and Gao  [165]
Geo/Geo/1
Second optional service
Lin et al.  [166]
Matrix analytic approach, quasi-Newton method
MAP/PH/1
Discrete time, multiple working vacations, and two-phase service
Goswami and Selvaraju  [167]
Matrix analytic method
GI/D-MSP/1
Discrete time, multiple vacations,
Samanta and Zhang  [168]
Matrix geometric method


## 6. Illustration

Consider the situation ofclient server communication (CSC) in which any client makes a request to the packet processing system. The file server serves the client in two phases; in first phase of service, the packet processing system accepts the packet from the client and processes it whereas in the second phase of service it gives the response to the client after processing of the packets. For illustration purpose, we assume that the client makes a request for packet processing wherein the requests arrive in batches of fixed batch size k=2 with parameter λ=1 (arrival rate). The service times of these requests during first phase of service and second phase of service are μ1=2 and μ2=3, respectively. If one of the requests is under process then other requests should be kept in buffer for processing later on with rate η=8 (retrial rate). The processing of the packet may be interrupted during both phases with rates α1=0.8, α2=0.9 (failure rates) and starts processing again with rate β1=1, β2=2 (repair rates), respectively. The client may give feedback again with probability p=0.3 in case of unsuccessful service. The server may go for vacations with rate ω=0.01. The expected number of packet processing is calculated using MATLAB software E(LS)=53.80. The expressions available for the expected number of packet which are used for this purpose (compare to [72]).


## 7. Conclusions

In this paper, we have reviewed the work done in the area of queueing systems with phase service. The phase service queueing models have found wide applications in the modeling and analysis of day-to-day as well as several industrial systems. The main aim of the present survey is to suggest a unified framework for analyzing the phase service models via queue theoretic approach. The phase service queueing models with the combination of different concepts have been reviewed. Queueing models with phase service are helpful for resolving the problem of congestion and can be treated as an effective tool, for reducing the blocking and delay of the concerned system and are preferred by the system analysts, engineers, and managers for depicting the more realistic scenario of congestion problems. Simulation of the given phenomenon has been done with the help of a real life situation.



---

*Source: 240926-2014-12-10.xml*