Next Article in Journal
Symmetric Reverse n-Derivations on Ideals of Semiprime Rings
Previous Article in Journal
The Orthogonal Riesz Fractional Derivative
Previous Article in Special Issue
Stability of the Stochastic Ginzburg–Landau–Newell Equations in Two Dimensions
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Transient and Steady-State Analysis of an M/PH2/1 Queue with Catastrophes

by
Youxin Liu
1,2,*,
Liwei Liu
1,*,
Tao Jiang
3 and
Xudong Chai
4
1
School of Mathematics and Statistics, Nanjing University of Science and Technology, Nanjing 210044, China
2
Department of Elementary Teaching, Wuhu Institute of Technology, Wuhu 241003, China
3
College of Economics and Management, Shandong University of Science and Technology, Qingdao 266590, China
4
School of Mathematics-Physics and Finance, Anhui Polytechnic University, Wuhu 241000, China
*
Authors to whom correspondence should be addressed.
Axioms 2024, 13(10), 716; https://doi.org/10.3390/axioms13100716
Submission received: 18 September 2024 / Revised: 11 October 2024 / Accepted: 13 October 2024 / Published: 16 October 2024
(This article belongs to the Special Issue Stochastic and Statistical Analysis in Natural Sciences)

Abstract

:
In the paper, we consider the P H 2 -distribution, which is a particular case of the P H -distribution. In other words, The first service phase is exponentially distributed, and the service rate is μ . After the first service phase, the customer can to go away with probability p or continue the service with probability ( 1 p ) and service rate μ . We study an analysis of an M / P H 2 / 1 queue model with catastrophes, which is regarded as a generalization of an M / M / 1 queue model with catastrophes. Whenever a catastrophe happens, all customers will be cleaned up immediately, and the queuing system is empty. The customers arrive at the queuing system based on a Poisson process, and the total service duration has two phases. Transient probabilities and steady-state probabilities of this queuing system are considered using practical applications of the modified Bessel function of the first kind, the Laplace transform, and probability-generating function techniques. Moreover, some important performance measures are obtained in the system. Finally, numerical illustrations are used to discuss the system’s behavior, and conclusions and future directions of the model are given.

1. Introduction

Historical accidents can determine the mode and the value of necessity. Accidental events fill every aspect of our life. Any accidental event that is caused by a sudden change in the normal functioning of a system may be considered as a catastrophe. There are many queuing problems in life, but there are many accidental factors (such as COVID-19, computer systems, telecommunications systems, biological mathematics, ecology, marketing, etc.) that cause our queuing system to crash. If a system suffers from a catastrophe, it will take some time to recover. Catastrophe models have wide applications in different fields, including queue systems, telecommunication, mathematical biology, population dynamics, ecology, artificial intelligence, marketing, etc. Melikov [1] discussed single-server models of queuing-inventory systems (QIS) with catastrophes in warehouses and negative customers (n-customers) in service facilities. Studies on queuing models for birth–death processes with the catastrophic queue assume that a customer should always appear in the system throughout the whole process of providing services (see, for instance, Dharmraja [2], Singh Bura [3], Mishra [4], Kumar [5], Arizono [6], Granville [7], Vishnevsky [8], and Tang [9]). Many achievements in different fields have been nade by Jain and Kumar [10], Dabrowski [11], and reference therein.
The main purpose of this manuscript is to extend the basic version of an M / M / 1 queue model with a catastrophe. To the best of our knowledge, the pioneering works analyzing queuing systems with catastrophes in the input flow were published by Krishna Kumar [12], where the authors= described transient probabilities, steady-state probabilities, and asymptotic behaviors of the server being idle and mean system size based on the diagram in Figure 1 (also see Jain and Kumar [10] and Krishna Kumar [13,14]). Dudin et al. [15] presented a thorough analysis of correlated input in queuing systems, and their work is unique in the sense that the entire manuscript is devoted to queues with correlated arrivals. For a special state-dependent queue model, they studied the reliability and availability, mean system size, and server failures of the version (see Di Crescenzo [16,17], Yashkov [18], Jain [19], Suranga Sampath [20], Kaliappan [21], and Paz [22], among others).
On the other hand, due to the excellent properties of the P H distribution, it can almost approximate all distributions. A large number of researchers have performed significant work using the P H distribution instead of an exponential distribution in recent years (see Sule Alfa [23] and Zhang [24]). Chakravarthy et al. [25] studied a queuing model of the type M A P / P H / 1 in the context of the server going on vacations, the server breaking down due to external shocks, the server requiriing repairs, and the server being helped by a backup server during vacations and repairs (also see Klimenok et al. [26] and Choi et al. [27]). Baba [28] analyzed an M / P H / 1 queue with phase-type working vacations and vacation interruptions, where the vacation time follows a phase-type distribution. Kim [29] gave expressions for the Laplace–Stieltjes transform of the waiting time. Liu [30] considered an M / P H / 1 queue model subject to different service speeds. Many references similar to the M / P H / 1 queue have already gained attention more recently (also see, e.g., Oliveira et al. [31], Sakuma, et al. [32], Jose, et al. [33], Liu, et al. [30], Dogan, et al. [34], Lakshmi et al. [35], and Sudhesh et al. [36]).
The M / P H 2 / 1 queue model study considers a public service system consisting of two service phases with different service capacities and qualities, such as medical or service transportation systems. Liu et al. studied the scenario where patients are divided into first-visit and referred patients, and the hospitals provide the patients with two service phases of “diagnosis” and “treatment” [37]. Chakravarthy et al. [25] studied a queuing model of the type M A P / P H / 1 in the context of the server going on vacations, the server breaking down due to external shocks, the server requiring repairs, and the server being helped by a backup server during vacations and repairs (also see Klimenok et al. [26] and Choi et al. [27]). Based on these results, our objective in this manuscript is a descendant of an M / M / 1 queue model according to catastrophes. As far as we know, there is no study of the transient probabilities in an M / P H 2 / 1 queue model according to catastrophes in the literature. The aim of our research is to present transient probabilities and steady-state probabilities when catastrophes occur. Moreover, we obtain performance indices such as mean and variance. Finally, numerical examples are discussed with respect to the effects of several parameters on the system performance indices. In the queue model, all customers based on a Poisson process with rate ξ will be cleared when a catastrophe takes place. In addition, for the sake of convenience of understanding and use, the diagram in Figure 2 based on an M / P H 2 / 1 queue model according to catastrophes is introduced.
The results of this paper are organized as follows. In Section 2, a description of the M / P H 2 / 1 queue model with catastrophes under study is outlined. In Section 3, the transient probabilities of the system’s size are obtained using the modified Bessel function, the Laplace transform, and matrix transformation. In Section 4, we obtain the solution for the steady-state probabilities. In Section 5, we obtain some performance measures of the system. In Section 6, numerical experiments are conducted to investigate the influence of catastrophes. Finally, we provide the conclusion and future research directions.

2. The Framework

A single server queuing system in which there are two service phases is considered on an FCFS basis; that is, the service time distribution in the queue model according to a Poisson arrival process has two different phases. The first service phase is exponentially distributed, and the service rate is μ . When it is finished, the work will be checked immediately. There is a probability p that the work is found to be satisfactory, and the customer goes away. There is a 1 p probability that the customer requires extra measures, where the service time is exponentially distributed with service rate μ . Once the second service operation is completed, the customer will automatically go away. Except for arrival processes and service processes, catastrophes may also take place at the service facilities as a Poisson process with parameter ξ ( ξ > 0 ). Whenever a catastrophe takes place in the system, the queuing system clears all the customers. In this paper, we assume that customers arrive according to a Poisson process with mean arrival rate λ during times that the server is run. In this way, we have a queuing system of M / P H 2 / 1 queue with the possibility of catastrophes. The M / P H 2 / 1 queue model with catastrophes is shown in Figure 2 for the sake of simplicity.
For the convenience of understanding the queuing system, we will comprehensively elaborate on Figure 2 shown below. At most, one customer can be in the queuing system at any given time. Once the customer’s service begins, the customer will enter node 1. The time spent in the queuing system follows an exponential distribution with parameters of μ . When the customer completes node 1, he leaves the queuing system with probability p and enters node 2 with probability q. The time spent at node 2 follows an exponential distribution of parameter μ , and he leaves the queuing system from node 2. At any service time, catastrophes may occur at the service facility as a Poisson process with parameter ξ in nodes 1 and 2.
We utilize the following notation. The queue model may be represented as a continuous time Markov chain in the following state-space:
S = { l ( 0 ) } { l ( 1 ) } { l ( 2 ) } ,
where the zero state l ( 0 ) (={0}) indicates that the queue is an empty system; l ( n ) = { ( n , 1 ) , ( n , 2 ) , n 1 }; the state ( n , j ) indicates that there are n customers in the queue system, n 1 of whom are in the waiting room; and the customer in the service phase is at node j.
Changes of state take place when a new customer arrives, when a service is finished, or when the new arrival in the service moves from node 1 to node 2. At any service time, catastrophes may take place.
Whenever a catastrophe occurs, all the customers in the system will be immediately cleared. For the sake of understanding, the transitions between each node are given in Table 1 below.
If ξ is equal to zero, Table 1 clearly represents a specific M / P H 2 / 1 queue. In the following study, we assume that ξ is greater than 0. We begin by letting { X ( t ) ; t R + } { 0 , 1 , 2 , } be the number of customers in the queuing system at moment t, and letting { Y ( t ) ; t R + } { 1 , 2 } be node 1 or 2 in the queuing system at moment t. If we order the states by level and, within a level, by the label of the service node, let P n , j ( t ) = P ( X ( t ) = n , Y ( t ) = j ) , n = 1 , 2 , , j = 1 , 2 , be the transient state probability that the time-dependent probability for the queuing system is in state j with customers n at moment t. Let P 0 ( t ) be the probability that there are zero customers in the system at moment t without the occurrence of catastrophes. Based on the above assumptions and the Chapman–Kolmogorov forward differential–difference equations, the transient state probabilities P n , j ( t ) , n = 1 , 2 , , j = 1 , 2 and the differential–difference equations for the queuing system under investigation can be written as follows:
d P 0 ( t ) d t = ( ξ + λ ) P 0 ( t ) + μ p P 1 , 1 ( t ) + μ P 1 , 2 ( t ) + ξ ,
d P 1 , 1 ( t ) d t = ( μ + λ + ξ ) P 1 , 1 ( t ) + λ P 0 ( t ) + μ p P 2 , 1 ( t ) + μ P 2 , 2 ( t ) ,
d P 1 , 2 ( t ) d t = ( μ + λ + ξ ) P 1 , 2 ( t ) + μ q P 1 , 1 ( t ) ,
d P n , 1 ( t ) d t = ( μ + λ + ξ ) P n , 1 ( t ) + λ P n 1 , 1 ( t ) + μ p P n + 1 , 1 ( t ) + μ P n + 1 , 2 ( t ) , n 2 ,
d P n , 2 ( t ) d t = ( μ + λ + ξ ) P n , 2 ( t ) + λ P n 1 , 2 ( t ) + μ q P n , 1 ( t ) , n 2 .
In general, we assume that initially, there are no customers in the queue system. In other words,
P 0 ( 0 ) = 1 .
For the purpose of calculation, we have listed the notations and their meanings in a table (Table 2).

3. Transient Probabilities

In this section, we study the behavior of the transient probabilities of an M / P H 2 / 1 queue model with catastrophes.
Let
P n ( t ) = ( P n , 1 ( t ) , P n , 2 ( t ) ) T , n 1 .
By substituting Equations (2)–(5), we obtain the following:
d P 1 ( t ) d t = A P 1 ( t ) + λ P 0 ( t ) e 0 + C P 2 ( t ) ,
d P n ( t ) d t = A P n ( t ) + B P n 1 ( t ) + C P n + 1 ( t ) , n 2 .
where
A = ( μ + λ + ξ ) 0 μ q ( μ + λ + ξ ) , B = λ 0 0 λ , C = μ p μ 0 0 .
We next discuss solving these equations using the generating functions method, and we assume that the number of customers arriving at the queue system is random. We define the following:
Q ( t ) = ( Q 1 ( t ) , Q 2 ( t ) ) T = ( k = 0 P k + 1 , 1 ( t ) , k = 0 P k + 1 , 2 ( t ) ) T , H ( z , t ) = ( H 1 ( z , t ) , H 2 ( z , t ) ) T = ( k = 0 P k + 1 , 1 ( t ) z k , k = 0 P k + 1 , 2 ( t ) z k ) T = k = 0 P k + 1 ( t ) z k .
By substituting Equations (6) and (7), we obtain the following:
H ( z , t ) t = ( A + z B + 1 z C ) H ( z , t ) + λ P 0 ( t ) e 0 1 z C P 1 ( t ) .
Integrating Equation (8) with respect to time ‘ t ( t 0 ) ’, we have the following:
H ( z , t ) = 0 t λ P 0 ( y ) e ( A + z B + 1 z C ) ( t y ) e 0 d y 0 t 1 z e ( A + z B + 1 z C ) ( t y ) C P 1 ( y ) d y = 0 t λ P 0 ( y ) e [ λ ( z 1 ) μ ξ ] I ( t y ) e M ( t y ) e 0 d y 0 t 1 z e [ λ ( z 1 ) μ ξ ] I ( t y ) e M ( t y ) C P 1 ( y ) d y ,
where M = μ p z μ z μ q μ μ .
Here,
e [ λ ( z 1 ) μ ξ ] I t = e [ λ ( z 1 ) μ ξ ] t I .
By taking the Laplace transform on matrix M t , we obtain the following:
L [ e M t ] = 0 + e s t I e M t d t = ( s I M ) 1 = μ μ s 1 s 2 s 1 1 s s 1 + μ μ s 2 s 1 s 2 1 s s 2 μ z s 1 s 2 1 s s 1 μ z s 1 s 2 1 s s 2 μ q s 1 s 2 1 s s 1 μ q s 1 s 2 1 s s 2 μ p z s 1 s 2 s 1 1 s s 1 + μ p z s 2 s 1 s 2 1 s s 2 ,
where s 1 = μ p z + μ μ + ( μ μ μ p z ) 2 + 4 μ μ q z 2 = μ p z + μ μ + Δ 2 , s 2 = μ p z + μ μ ( μ μ μ p z ) 2 + 4 μ μ q z 2 = μ p z + μ μ Δ 2 ,   Δ = ( μ μ μ p z ) 2 + 4 μ μ q z .
By taking the Laplace inverse transform on matrix (11), we have the following:
e M t = L 1 ( s I M ) 1 = μ μ s 1 s 2 s 1 e s 1 t + μ μ s 2 s 1 s 2 e s 2 t μ z s 1 s 2 e s 1 t μ z s 1 s 2 e s 2 t μ q s 1 s 2 e s 1 t μ q s 1 s 2 e s 2 t μ p z s 1 s 2 s 1 e s 1 t + μ p z s 2 s 1 s 2 e s 2 t .
For the convenience of calculation, using Equations (9)–(12), we can obtain the following:
e [ λ ( z 1 ) μ ξ ] I t e M t e 0 = e ( λ z + μ p 2 z ) t e 1 2 ( μ + μ + 2 λ + 2 ξ ) t k = 0 ( t 2 ) 2 k ( 2 k ) ! Δ k ( μ μ μ p z ) k = 0 ( t 2 ) 2 k + 1 ( 2 k + 1 ) ! Δ k 2 μ q k = 0 ( t 2 ) 2 k + 1 ( 2 k + 1 ) ! Δ k = e ( λ z + μ p 2 z ) t e 1 2 ( μ + μ + 2 λ + 2 ξ ) t k = 0 ( t 2 ) 2 k ( 2 k ) ! ( μ μ μ p z ) ( t 2 ) 2 k + 1 ( 2 k + 1 ) ! 2 μ q ( t 2 ) 2 k + 1 ( 2 k + 1 ) ! Δ k .
By using Equations (11) and (12) in Equation (9), we have the following:
H ( z , t ) = 0 t [ λ P 0 ( y ) 1 z F T P 1 ( y ) ] e ( λ z + μ p 2 z ) ( t y ) e 1 2 ( μ + μ + 2 λ + 2 ξ ) ( t y ) · k = 0 ( t y 2 ) 2 k ( 2 k ) ! ( μ μ μ p z ) ( t y 2 ) 2 k + 1 ( 2 k + 1 ) ! 2 μ q ( t y 2 ) 2 k + 1 ( 2 k + 1 ) ! Δ k d y ,
where F = ( μ p , μ ) T .
Using the Bessel Function identity (see Watson [38]) with α = 2 λ μ p , β = 2 λ / μ p gives the following:
e ( λ z + μ p 2 z ) ( t y ) = k = ( β z ) k I k [ α ( t y ) ] , I n ( x ) = k = 0 1 k ! Γ ( k + n + 1 ) ( x 2 ) n + 2 k , ( | x | < , | arg ( x ) | < π ) ,
where I n ( · ) is the modified Bessel Function of first kind order n.
By using Equation (15) in Equation (14), we obtain the following:
H ( z , t ) = 0 t [ λ P 0 ( y ) 1 z F T P 1 ( y ) ] k = ( β z ) k I k [ α ( t y ) ] e 1 2 ( μ + μ + 2 λ + 2 ξ ) ( t y ) · k = 0 ( t y 2 ) 2 k ( 2 k ) ! ( μ μ μ p z ) ( t y 2 ) 2 k + 1 ( 2 k + 1 ) ! 2 μ q ( t y 2 ) 2 k + 1 ( 2 k + 1 ) ! Δ k d y .
Equating the coefficient of z n ( n 0 ) in Equation (16) gives the following:
P n + 1 ( t ) = i = 0 0 t { λ P 0 ( y ) β n + i I n + i [ α ( t y ) ] e 1 2 ( μ + μ + 2 λ + 2 ξ ) ( t y ) · k = 0 i 1 + i 2 + i 3 = k 2 i 1 + i 2 = i ( t y 2 ) 2 k ( 2 k ) ! ( μ μ ) ( t y 2 ) 2 k + 1 ( 2 k + 1 ) ! 2 μ q ( t y 2 ) 2 k + 1 ( 2 k + 1 ) ! · k ! i 1 ! i 2 ! i 3 ! ( μ p ) 2 i 1 ( 2 μ μ + 2 μ μ q 2 μ 2 p ) i 2 ( μ μ ) 2 i 3 } d y i = 0 0 t { λ P 0 ( y ) β n + i + 1 I n + i + 1 [ α ( t y ) ] e 1 2 ( μ + μ + 2 λ + 2 ξ ) ( t y ) · k = 0 i 1 + i 2 + i 3 = k 2 i 1 + i 2 = i μ p ( t y 2 ) 2 k + 1 ( 2 k + 1 ) ! 0 k ! i 1 ! i 2 ! i 3 ! ( μ p ) 2 i 1 ( 2 μ μ + 2 μ μ q 2 μ 2 p ) i 2 ( μ μ ) 2 i 3 } d y i = 0 0 t { F T P 1 ( y ) β n + i + 1 I n + i + 1 [ α ( t y ) ] e 1 2 ( μ + μ + 2 λ + 2 ξ ) ( t y ) · k = 0 i 1 + i 2 + i 3 = k 2 i 1 + i 2 = i ( t y 2 ) 2 k ( 2 k ) ! ( μ μ ) ( t y 2 ) 2 k + 1 ( 2 k + 1 ) ! 2 μ q ( t y 2 ) 2 k + 1 ( 2 k + 1 ) ! · k ! i 1 ! i 2 ! i 3 ! ( μ p ) 2 i 1 ( 2 μ μ + 2 μ μ q 2 μ 2 p ) i 2 ( μ μ ) 2 i 3 } d y + i = 0 0 t { F T P 1 ( y ) β n + i + 2 I n + i + 2 [ α ( t y ) ] e 1 2 ( μ + μ + 2 λ + 2 ξ ) ( t y ) · k = 0 i 1 + i 2 + i 3 = k 2 i 1 + i 2 = i μ p ( t y 2 ) 2 k + 1 ( 2 k + 1 ) ! 0 k ! i 1 ! i 2 ! i 3 ! ( μ p ) 2 i 1 ( 2 μ μ + 2 μ μ q 2 μ 2 p ) i 2 ( μ μ ) 2 i 3 } d y .
Evaluation of P 0 ( t )
Substituting z = 1 in Equation (8) and taking the Laplace transform, we derive the following:
Q ^ ( s ) = s + μ + ξ c 2 ( s ) μ q c 2 ( s ) P ^ 0 ( s ) + s + μ + ξ s c 2 ( s ) μ q s c 2 ( s ) ,
where c 2 ( s ) = s + μ + λ + ξ , and Q ^ ( s ) = ( Q 1 ( s ) , Q 2 ( s ) ) T is the Laplace transform expression of Q ( t ) = ( Q 1 ( t ) , Q 2 ( t ) ) T .
We derive the following equation:
e 4 T Q ^ ( s ) + P ^ 0 ( s ) = 1 s ,
and its the Laplace inverse transform is of the form
e 4 T Q ( t ) + P 0 ( t ) = 1 , for any t 0 ,
where P ^ 0 ( s ) is the Laplace transform expression of P 0 ( t ) . That is to say, in order to derive the expression of P ^ 0 ( s ) , we need to find another method.
From the second equation in matrix equation system (8), we determine the following:
H 2 ( z , t ) t = μ q H 1 ( z , t ) + [ ( μ + λ + ξ ) + λ z ] H 2 ( z , t ) .
Integrating Equation (21) with respect to time ‘ t ( t 0 ) ’, we have the following:
H 2 ( z , t ) = 0 t μ q H 1 ( z , y ) e [ ( μ + λ + ξ ) + λ z ] ( t y ) d y = 0 t μ q H 1 ( z , y ) e ( μ + λ + ξ ) ( t y ) n = 0 λ n z n ( t y ) n n ! d y .
Equating the coefficient of z k ( k 0 ) in Equation (22) gives the following:
P k + 1 , 2 ( t ) = i = 0 k 0 t μ q P i + 1 , 1 ( y ) e ( μ + λ + ξ ) ( t y ) λ k i ( t y ) k i ( k i ) ! d y .
By taking the Laplace transform of Equation (23), we obtain the following:
P ^ k + 1 , 2 ( s ) = i = 0 k μ q λ k i c 2 k i + 1 ( s ) P ^ i + 1 , 1 ( s ) ,
where P ^ k + 1 , 2 ( s ) is the Laplace transform expression of P k + 1 , 2 ( t ) .
By taking the Laplace transform of Equations (4) and (5), we have the following:
μ ( p c 2 ( s ) + μ q ) P ^ n + 1 , 2 ( s ) [ λ μ p + c 1 ( s ) c 2 ( s ) ] P ^ n , 2 ( s ) + [ λ ( c 1 ( s ) + c 2 ( s ) ) ] P ^ n 1 , 2 ( s ) λ 2 P ^ n 2 , 2 ( s ) = 0 , n 3 ,
where c 1 ( s ) = s + μ + λ + ξ .
By adding n = 3 to on both sides of Equation (25), we find the following:
a 2 ( s ) Q 2 ( s ) = μ ( p c 2 ( s ) + μ q ) [ P ^ 1 , 2 ( s ) + P ^ 2 , 2 ( s ) + P ^ 3 , 2 ( s ) ] [ λ μ p + c 1 ( s ) c 2 ( s ) ] [ P ^ 1 , 2 ( s ) + P ^ 2 , 2 ( s ) ] + λ [ c 1 ( s ) + c 2 ( s ) ] P ^ 1 , 2 ( s ) ,
where a 2 ( s ) = c 1 ( s ) c 2 ( s ) + λ [ c 1 ( s ) + c 2 ( s ) ] + μ p c 2 ( s ) + μ μ q λ μ p λ 2 is a quadratic polynomial of s.
Using Equations (2), (3), and (5) in Equation (26), we can obtain the following:
a 2 ( s ) Q 2 ( s ) = ( s + λ + ξ ) { b 4 ( s ) + λ μ q [ c 1 ( s ) + c 2 ( s ) ] c 2 ( s ) c 3 ( s ) } + μ b 2 ( s ) c 3 ( s ) c 2 ( s ) d 5 ( s ) μ c 2 ( s ) c 3 2 ( s ) P ^ 0 ( s ) + c 2 ( s ) f 5 ( s ) ( s + ξ ) { b 4 ( s ) + μ 2 q c 3 2 ( s ) c 2 ( s ) + λ μ q [ c 1 ( s ) + c 2 ( s ) ] c 2 ( s ) c 3 ( s ) } μ s c 2 ( s ) c 3 2 ( s ) .
where b 2 ( s ) = q μ ( s + ξ ) [ μ q + p c 2 ( s ) ] λ q [ c 1 ( s ) c 2 ( s ) + λ μ p ] is a quadratic polynomial of s, b 4 ( s ) = q [ c 1 2 ( s ) c 2 2 ( s ) + μ p c 1 ( s ) c 2 2 ( s ) + μ q μ c 1 ( s ) c 2 ( s ) + λ μ 2 p c 2 ( s ) + λ μ 2 p 2 c 2 ( s ) λ μ μ c 2 ( s ) λ μ q μ c 1 ( s ) + λ 2 μ 2 p 2 + λ μ 2 μ p q ] is a 4th degree polynomial of s, and both d 5 ( s ) = [ λ μ p + c 1 ( s ) c 2 ( s ) ] q [ c 1 ( s ) c 2 ( s ) ( s + λ + ξ ) + μ p ( s + λ + ξ ) 2 + μ μ ( s + ξ ) ] and f 5 ( s ) = [ λ μ p + c 1 ( s ) c 2 ( s ) ] q ( s + ξ ) [ c 1 ( s ) c 2 ( s ) + μ p ( s + 2 λ + ξ ) + μ μ ] are univariate fifth-degree polynomials of s , c 3 ( s ) = p c 2 ( s ) + μ q .
The simultaneous equations of Equations (18) and (27) can be obtained:
P ^ 0 ( s ) = μ 2 q c 2 ( s ) c 3 2 ( s ) a 2 ( s ) f 6 ( s ) c 4 ( s ) d 6 ( s ) s c 4 ( s ) + μ 2 q c 3 2 ( s ) s a 2 ( s ) c 2 ( s ) ,
where c 4 ( s ) = s + μ + μ q + ξ , and both d 6 ( s ) = d 5 ( s ) c 2 ( s ) ( s + λ + ξ ) { b 4 ( s ) + λ μ q [ c 1 ( s ) + c 2 ( s ) ] [ p c 2 ( s ) + μ q ] c 2 ( s ) } + μ b 2 ( s ) [ p c 2 ( s ) + μ q ] , f 6 ( s ) = c 2 ( s ) f 5 ( s ) ( s + ξ ) { b 4 ( s ) + μ 2 q [ p c 2 ( s ) + μ q ] 2 c 2 ( s ) + λ μ q [ c 1 ( s ) + c 2 ( s ) ] [ p c 2 ( s ) + μ q ] c 2 ( s ) } are univariate sixth-degree polynomials of s.
Through careful observation, we found that the numerator of the fraction in expression (28) is a seventh-degree polynomial of s, and its denominator is a eighth-degree polynomial of s. Therefore, we determine that Equation (28) can be decomposed into the sum of several simplest fractions using number theory. Furthermore, using MATLAB R2016a, we can obtain P 0 ( t ) through the Laplace inverse transform of Equation (28).
Through the Laplace inverse transformation, we obtain the following expression for P 0 ( t ) :
P 0 ( t ) = 1 2 π i σ i σ + i μ 2 q c 2 ( s ) c 2 ( s ) a 2 ( s ) f 6 ( s ) c 4 ( s ) d 6 ( s ) s c 4 ( s ) + μ 2 q c 3 2 ( s ) s a 2 ( s ) c 2 ( s ) e s t d s .
Evaluation of P 1 , 1 ( t ) , P 1 , 2 ( t )
By taking the Laplace transform of Equation (1), we have the following:
F T P ^ 1 ( s ) = ( s + λ + ξ ) P ^ 0 ( s ) s + ξ s .
The remaining transient probabilities P 0 ( t ) , P 11 ( t ) and P 12 ( t ) can be obtained by solving the system of Equations (1)–(3). To do this, we rewrite the system of Equations (1)–(3) in the following matrix form:
d P ( t ) d t = D P ( t ) + ξ e 1 + F T P 2 ( t ) e 2 ,
where
P ( t ) = ( P 0 ( t ) , P 11 ( t ) , P 12 ( t ) ) T , D = ( λ + ξ ) μ p μ λ ( μ + λ + ξ ) 0 0 μ q ( μ + λ + ξ ) .
By taking the Laplace transform, the solution of (31) is obtained as follows:
P ^ ( s ) = ( s I D ) 1 { 1 s ξ e 1 + F T P ^ 2 ( s ) e 2 + P ( 0 ) } ,
where P ( 0 ) = ( 1 , 0 , 0 ) T .
We observe that
e 3 T P ^ ( s ) = P ^ 0 ( s ) + e 4 T P 1 ^ ( s ) .
Taking Equation (33) in Equation (32) and transforming, we have the following:
e 4 T P ^ 1 ( s ) = e 3 T ( s I D ) 1 [ ξ e s + P ( 0 ) ] P ^ 0 ( s ) + e 3 T ( s I D ) 1 e 2 F T P ^ 2 ( s ) .
Taking the Laplace transform of Equation (2) and substituting k = 1 in Equation (24) gives the following:
P ^ 2 ( s ) = c 1 ( s ) c 2 2 ( s ) μ μ λ q μ [ p c 2 ( s ) + μ q ] c 2 ( s ) 0 [ c 1 ( s ) c 2 ( s ) + λ μ p ] q [ p c 2 ( s ) + μ q ] c 2 ( s ) 0 P ^ 1 ( s ) + λ c 2 ( s ) μ [ p c 2 ( s ) + μ q ] λ q p c 2 ( s ) + μ q P ^ 0 ( s ) = Φ ^ 1 ( s ) P ^ 1 ( s ) + Φ ^ 0 ( s ) P ^ 0 ( s ) ,
where Φ ^ 1 ( s ) = c 1 ( s ) c 2 2 ( s ) μ μ λ q μ [ p c 2 ( s ) + μ q ] c 2 ( s ) 0 [ c 1 ( s ) c 2 ( s ) + λ μ p ] q [ p c 2 ( s ) + μ q ] c 2 ( s ) 0 , Φ ^ 0 ( s ) = λ c 2 ( s ) μ [ p c 2 ( s ) + μ q ] λ q p c 2 ( s ) + μ q .
Let
d e t ( s ) = ( s I D ) 1 = ( d ^ i j ( s ) ) 3 × 3 .
We use algebraic methods to obtain ( s I D ) 1 as 1 | s I D ( s ) | multiplied by the following:
c 1 ( s ) c 2 ( s ) μ p c 2 ( s ) + μ μ q μ c 1 ( s ) λ c 2 ( s ) ( s + λ + ξ ) c 2 ( s ) ) λ μ λ μ q μ q ( s + λ + ξ ) ( s + λ + ξ ) c 1 ( s ) λ μ p ,
where | s I D ( s ) | = ( s + λ + ξ ) 3 + ( μ + μ ) ( s + λ + ξ ) 2 + μ ( μ λ + q ) ( s + λ + ξ ) μ μ λ .
Substituting Equation (35) into (34), we obtain the following:
e 3 T ( s I D ) 1 1 s ξ e 1 + e 3 T ( s I D ) 1 P ( 0 ) = ξ + s s ( d ^ 11 ( s ) + d ^ 21 ( s ) + d ^ 31 ( s ) ) , e 3 T ( s I D ) 1 e 2 E T Q ^ 2 ( s ) = ( d ^ 12 ( s ) + d ^ 22 ( s ) + d ^ 32 ( s ) ) F T P ^ 2 ( s ) .
Taking Equation (37) in Equation (34) and transforming it, we have the following:
e 4 T P ^ 1 ( s ) = ξ + s s ( d ^ 11 ( s ) + d ^ 21 ( s ) + d ^ 31 ( s ) ) P ^ 0 ( s ) + ( d ^ 12 ( s ) + d ^ 22 ( s ) + d ^ 32 ( s ) ) F T [ Φ ^ 1 ( s ) P ^ 1 ( s ) + Φ ^ 0 ( s ) P ^ 0 ( s ) ] .
From Equations (30) and (38), we also have the following:
P ^ 11 ( s ) = d e t ( s ) [ s + λ + ξ + λ μ ] ( μ μ p ) d e t ( s ) μ c 1 2 ( s ) c 2 ( s ) P ^ 0 ( s ) + d e t ( s ) [ μ s + ξ s ( d ^ 12 ( s ) + d ^ 22 ( s ) + d ^ 32 ( s ) ) + s + ξ s ] ( μ μ p ) d e t ( s ) μ c 1 2 ( s ) c 2 ( s ) ,
P ^ 12 ( s ) = [ d e t ( s ) c 1 2 ( s ) c 2 ( s ) ] ( s + λ + ξ ) + μ p λ d e t ( s ) ] ( μ μ p ) d e t ( s ) μ c 1 2 ( s ) c 2 ( s ) P ^ 0 ( s ) + [ d e t ( s ) c 1 2 ( s ) c 2 ( s ) ] ( s + ξ s ) μ p d e t ( s ) s + ξ s ( d ^ 11 ( s ) + d ^ 21 ( s ) + d ^ 31 ( s ) ) ( μ μ p ) d e t ( s ) μ c 1 2 ( s ) c 2 ( s ) .
Inverting Equations (39) and (40) yields the explicit expression for P 1 , 1 ( t ) and P 1 , 2 ( t ) as follows:
P 1 , 1 ( t ) = 1 μ [ 1 p · 1 ( t ) + ( λ + ξ ) ( μ + λ + ξ ) μ + p λ + p ξ δ ( t ) q ( μ 2 + q λ μ + p μ ξ + q ξ 2 + p λ 2 + 2 p λ ξ ) p 2 ( μ + p λ + p ξ ) e μ + p λ + p ξ p t ] P 0 ( t ) + 1 μ 1 p · 1 ( t ) + ( μ + λ + ξ ) ξ μ + p λ + p ξ δ ( t ) q μ p 2 e μ + p λ + p ξ p t , P 1 , 2 ( t ) = q ( λ + ξ ) μ + p λ + p ξ δ ( t ) + μ q p ( μ + p λ + p ξ ) e μ + p λ + p ξ p t P 0 ( t ) + q ξ μ + p λ + p ξ δ ( t ) + q ( μ + p λ ) p ( μ + p λ + p ξ ) e μ + p λ + p ξ p t .
where δ ( t ) is a Dirichlet Function and * denotes convolution.
Evaluation of P n , 1 ( t ) , P n , 2 ( t ) , n 1
Taking the Laplace transform of Equation (30) gives the following:
F T P 1 ( t ) = 1 · 1 ( t ) + ( λ + ξ ) δ ( t ) P 0 ( t ) 1 · 1 ( t ) + ξ δ ( t ) .
From Equations (17), (29), and (42), we have the following:
P n + 1 ( t ) = i = 0 0 t { λ P 0 ( y ) β n + i I n + i [ α ( t y ) ] e 1 2 ( μ + μ + 2 λ + 2 ξ ) ( t y ) · k = 0 i 1 + i 2 + i 3 = k 2 i 1 + i 2 = i ( t y 2 ) 2 k ( 2 k ) ! ( μ μ ) ( t y 2 ) 2 k + 1 ( 2 k + 1 ) ! 2 μ q ( t y 2 ) 2 k + 1 ( 2 k + 1 ) ! · k ! i 1 ! i 2 ! i 3 ! ( μ p ) 2 i 1 ( 2 μ μ + 2 μ μ q 2 μ 2 p ) i 2 ( μ μ ) 2 i 3 } d y i = 0 0 t { λ P 0 ( y ) β n + i + 1 I n + i + 1 [ α ( t y ) ] e 1 2 ( μ + μ + 2 λ + 2 ξ ) ( t y ) · k = 0 i 1 + i 2 + i 3 = k 2 i 1 + i 2 = i μ p ( t y 2 ) 2 k + 1 ( 2 k + 1 ) ! 0 k ! i 1 ! i 2 ! i 3 ! ( μ p ) 2 i 1 ( 2 μ μ + 2 μ μ q 2 μ 2 p ) i 2 ( μ μ ) 2 i 3 } d y i = 0 0 t { F T P 1 ( y ) β n + i + 1 I n + i + 1 [ α ( t y ) ] e 1 2 ( μ + μ + 2 λ + 2 ξ ) ( t y ) · k = 0 i 1 + i 2 + i 3 = k 2 i 1 + i 2 = i ( t y 2 ) 2 k ( 2 k ) ! ( μ μ ) ( t y 2 ) 2 k + 1 ( 2 k + 1 ) ! 2 μ q ( t y 2 ) 2 k + 1 ( 2 k + 1 ) ! · k ! i 1 ! i 2 ! i 3 ! ( μ p ) 2 i 1 ( 2 μ μ + 2 μ μ q 2 μ 2 p ) i 2 ( μ μ ) 2 i 3 } d y + i = 0 0 t { F T P 1 ( y ) β n + i + 2 I n + i + 2 [ α ( t y ) ] e 1 2 ( μ + μ + 2 λ + 2 ξ ) ( t y ) · k = 0 i 1 + i 2 + i 3 = k 2 i 1 + i 2 = i μ p ( t y 2 ) 2 k + 1 ( 2 k + 1 ) ! 0 k ! i 1 ! i 2 ! i 3 ! ( μ p ) 2 i 1 ( 2 μ μ + 2 μ μ q 2 μ 2 p ) i 2 ( μ μ ) 2 i 3 } d y ,
where P 0 ( y ) and F T P 1 ( y ) are given in Equations (29) and (42), respectively.
Thus, Equations (29), (41), and (43) completely determine all the system size probabilities.

4. Steady-State Probabilities

In this section, we seek analytical expressions for the steady-state probabilities of an M / P H 2 / 1 queue model with catastrophes. Let
P 0 = lim t P 0 ( t ) , P n , 1 = lim t P n , 1 ( t ) , n = 1 , 2 , , P n , 2 = lim t P n , 2 ( t ) , n = 1 , 2 , .
From Equation (28), we have the following:
P ^ 0 ( s ) = μ 2 q c 2 ( s ) c 3 2 ( s ) a 2 ( s ) f 6 ( s ) c 4 ( s ) d 6 ( s ) s c 4 ( s ) + μ 2 q c 3 2 ( s ) s a 2 ( s ) c 2 ( s ) .
By using Tauberian theorem, we obtain the following:
P 0 = μ 2 q ( μ + λ + ξ ) ( μ + p λ + p ξ ) 2 + f 6 d 6 + μ 2 q ( μ + μ p + p ξ ) ( μ + λ + ξ ) .
where d 6 = d 5 ( μ + λ + ξ ) ( λ + ξ ) [ b 4 + λ μ q ( μ + μ + 2 λ + 2 ξ ) ( μ + p λ + p ξ ) ( μ + λ + ξ ) ] + μ b 2 ( μ + λ + ξ ) , f 6 = ( μ + λ + ξ ) f 5 ξ [ b 4 + μ 2 q ( μ + p λ + p ξ ) 2 ( μ + λ + ξ ) + λ μ q ( μ + μ + 2 λ + 2 ξ ) ( μ + p λ + p ξ ) ( μ + λ + ξ ) ] ,   d 5 = q [ λ μ p + ( μ + λ + ξ ) ( μ + λ + ξ ) ] [ ( μ + λ + ξ ) ( μ + λ + ξ ) ( λ + ξ ) + μ p ( λ + ξ ) 2 + μ μ ξ ] , f 5 = q ( s + ξ ) [ λ μ p + ( μ + λ + ξ ) ( μ + λ + ξ ) ] [ ( μ + λ + ξ ) ( μ + λ + ξ ) + μ p ( 2 λ + ξ ) + μ μ ] ,   b 4 = q [ ( μ + λ + ξ ) 2 ( μ + λ + ξ ) 2 + μ p ( μ + λ + ξ ) ( μ + λ + ξ ) 2 + μ q μ ( μ + λ + ξ ) ( μ + λ + ξ ) + λ μ 2 p ( μ + λ + ξ ) + λ μ 2 p 2 ( μ + λ + ξ ) λ μ μ ( μ + λ + ξ ) λ μ q μ ( μ + λ + ξ ) + λ 2 μ 2 p 2 + λ μ 2 μ p q ] ,   b 2 = q μ ξ ( μ + p λ + p ξ ) λ q [ ( μ + λ + ξ ) ( μ + λ + ξ ) + λ μ p ] .
From Equations (28), (39), and (40), again using Tauberian theorem, we have the following:
P 1 , 1 = ( μ + λ + ξ ) ( λ + ξ ) μ ( μ + p λ + p ξ ) P 0 ( μ + λ + ξ ) ξ μ ( μ + p λ + p ξ ) ,
P 1 , 2 = q ( λ + ξ ) μ + p λ + p ξ P 0 q ξ μ + p λ + p ξ .
From Equations (4), (24), and (28), and again using Tauberian theorem, we have the following:
P 2 , 1 = λ ( μ + λ + ξ ) μ ( μ + p λ + p ξ ) P 0 + ( μ + λ + ξ ) ( λ + μ + ξ ) 2 μ μ λ q μ ( μ + p λ + p ξ ) ( μ + λ + ξ ) P 1 , 1 ,
P 2 , 2 = λ q μ + p λ + p ξ P 0 + [ ( μ + λ + ξ ) ( μ + λ + ξ ) + λ μ p ] q ( μ + p λ + p ξ ) ( μ + λ + ξ ) P 1 , 1 ,
P 3 , 1 = λ ( μ + λ + ξ ) 3 + μ μ q λ 2 μ ( μ + p λ + p ξ ) ( μ + λ + ξ ) 2 P 1 , 1 + ( μ + λ + ξ ) ( μ + λ + ξ ) 2 μ μ q λ μ ( μ + λ + ξ ) ( μ + p λ + p ξ ) P 2 , 1 ,
P 3 , 2 = q λ [ λ μ p ( μ + λ + ξ ) 2 ] ( μ + p λ + p ξ ) ( μ + λ + ξ ) 2 P 1 , 1 q [ ( μ + λ + ξ ) ( μ + λ + ξ ) + λ μ p ] ( μ + λ + ξ ) ( μ + p λ + p ξ ) P 2 , 1 .
Using a similar method for Equations (4), (24), and (45)–(50), using Tauberian theorem, we will calculate P 4 , 1 , P 4 , 2 , P 5 , 1 , P 5 , 2 , ⋯.
Once the steady-state distribution is in hand, other performance measures of the system are subsequently obtained.

5. Performance Measures

Based on the transient probabilities, in this section, we demonstrate how to calculate relevant system performance measures.

5.1. Mean

Let N ( t ) be the number of customers in the system at time t. The average number of customers in the system at time t is given as follows:
E ( N ( t ) ) = e 4 T P 1 ( t ) + n = 1 ( n + 1 ) e 4 T P n + 1 ( t )
and
d E ( N ( t ) ) d t = e 4 T n = 1 n d P n ( t ) d t .
From Equations (6) and (7), after considerable mathematical manipulations, the above equation will lead to the following differential equation:
d E ( N ( t ) ) d t = ξ E ( N ( t ) ) + λ P 0 ( t ) e 4 T C 2 P 2 ( t ) + n = 1 e 4 T B P n ( t ) n = 1 e 4 T C P n + 2 ( t ) .
Therefore:
E ( N ( t ) ) = λ 0 t P 0 ( y ) e ξ ( t y ) d y e 4 T C 2 0 t P 2 ( y ) e ξ ( t y ) d y + n = 1 e 4 T B 0 t P n ( y ) e ξ ( t y ) d y n = 1 e 4 T C 0 t P n + 2 ( y ) e ξ ( t y ) d y ,
where P 0 ( t ) , P 1 ( t ) , and P n ( t ) , n = 2 , 3 , are given in Equations (29), (41), and (43), respectively.

5.2. Variance

The variance number of customers in the system at time t is given as follows:
Var ( N ( t ) ) = E ( N 2 ( t ) ) [ E ( N ( t ) ) ] 2 , Var ( N ( t ) ) = r ( t ) [ E ( N ( t ) ) ] 2 ,
where
r ( t ) = E ( N 2 ( t ) ) = e 4 T P 1 ( t ) + n = 1 ( n + 1 ) 2 e 4 T P n + 1 ( t ) .
Then,
d r ( t ) d t = e 4 T d P 1 ( t ) d t + n = 1 ( n + 1 ) 2 e 4 T d P n + 1 ( t ) d t .
From Equations (6), (7), and (56), after considerable mathematical manipulations, the above equation will lead to the following differential equation:
d r ( t ) d t = ξ r ( t ) + ( 2 λ μ p μ ) E ( N ( t ) ) + λ P 0 ( t ) + n = 1 e 4 T B P n ( t ) n = 1 e 4 T C P n ( t ) .
Therefore,
r ( t ) = ( 2 λ μ p μ ) 0 t E ( N ( y ) ) e ξ ( t y ) d y + λ 0 t P 0 ( y ) e ξ ( t y ) d y + n = 1 0 t e 4 T B P n ( y ) e ξ ( t y ) d y n = 1 0 t e 4 T C P n ( y ) e ξ ( t y ) d y .
Using Equation (55), we obtain the following:
Var ( N ( t ) ) = ( 2 λ μ p μ ) 0 t E ( N ( y ) ) e ξ ( t y ) d y + λ 0 t P 0 ( y ) e ξ ( t y ) d y + n = 1 0 t e 4 T B P n ( y ) e ξ ( t y ) d y n = 1 0 t e 4 T C P n ( y ) e ξ ( t y ) d y [ E ( N ( t ) ) ] 2 ,
where P 0 ( t ) , P 1 ( t ) , P n ( t ) , n = 2 , 3 , and E ( N ( t ) ) are given in Equations (29), (41), (43) and (54), respectively.

6. Special Case and Numerical Examples

6.1. Special Case

  • Case 1: For p = 1 , μ = 0 , and q = 1 p = 0 , we observe that our model is reduced to the one studied by Oliveira Souza [31]. Equation (1) in Oliveira Souza [31] coincides with Equations (1)–(5), respectively.

6.2. Numerical Examples

In the subsection, we present a few numerical examples to investigate the steady-state probabilities. In all of the examples we take the service rate μ = 1 , μ = 1.2 , and p = 0.9 , q = 0.1 .
In Figure 3, the steady-state probability P 0 is plotted against the rate ξ with the assumption that initially, the system is empty. All the probability curves increase with increasing rate ξ .
Figure 4 displays the steady-state probabilities Q 1 ( = ( P 11 , P 12 ) T ) in the system from three different values of the rate λ and catastrophe rate. The steady-state probabilities Q 1 increase with increasing rate ξ when rate ξ is relatively small, then they gradually decrease and stabilize.
Figure 5 displays the steady-state probabilities Q n ( = 2 , 3 , 4 ) in the system for different values of the catastrophe rate. The steady-state probabilities Q n increase with increasing rate ξ . However, the probability Q n decreases with increasing n values.
In Figure 6, the transient probability P 0 ( t ) is plotted against time t with the assumption that initially, the system is empty. We observe that all the probability curves decrease with increasing time t. Moreover, with the passage of time, the transient probability P 0 ( t ) decreases from 1 and later tends towards a constant value.

7. Conclusions and Future Research

In this study, we have investigated a queue model according to catastrophes in which the service time has two phases. Customers enter the service system based on the Poisson process, and the service time for each customer in the system corresponds to the P H distribution. To formulate the system and solve the transient probabilities, we combined the modified Bessel function and the Laplace transform. The steady-state probabilities of the system are presented. Some performance measures of the system, such as mean and variance, are studied. Finally, special cases and numerical examples are given.
In the future, due to the complexity of the real world, this study may be extended from one service to more than one unit service. We will consider comparing the waiting time in the following states between two queuing systems. Case 1: If μ and μ in two queuing systems have different values, but the sum of μ and μ is equal. Case 2: If μ , μ , and ξ in two queueing systems have different values, but μ + μ ξ is a constant. Fractional queues, retrial queues, and vacation policy can also be interpreted in the system. We will demonstrate some applications of an M / P H 2 / 1 queue according to catastrophes. We will also consider whether it is feasible to use the duality between the M / P H 2 / 1 queue according to catastrophes and the fractional M / P H 2 / 1 queue according to catastrophes to solve problems of transient probabilities.

Author Contributions

Conceptualization, Y.L. and L.L.; methodology, Y.L.; software, T.J. and Y.L.; validation, Y.L., X.C. and L.L.; formal analysis, Y.L.; investigation, T.J.; resources, Y.L.; data curation, X.C.; writing—original draft preparation, Y.L.; writing—review and editing, Y.L.; visualization, L.L.; supervision, T.J.; project administration, L.L.; funding acquisition, Y.L. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the National Natural Science Foundation of China (grant no. 61773014, grant no. 11901307) and Natural Science Foundation of Jiangsu Province, China (grants BK20180783 and 18KJB110021), Anhui University Natural Science Research Project of China (grant no. 2022AH052207, grant no. 2022AH052209), and the Scientific Research Foundation of Anhui Polytechnic University (grant no. 2022YQQ026).

Data Availability Statement

All of the data generated or analyzed during this study are included in the published article.

Acknowledgments

The authors would like to thank the reviewers for their valuable comments and suggestions, which helped improve the paper’s presentation overall.

Conflicts of Interest

The authors declare no competing interests.

References

  1. Melikov, A.; Poladova, L.; Edayapurath, S.; Sztrik, J. Single-Server Queuing-Inventory Systems with Negative Customers and Catastrophes in the Warehouse. Mathematics 2023, 11, 2380. [Google Scholar] [CrossRef]
  2. Dharmraja, S.; Kumar, R. Transient solution of a Markovian queueing model with heterogeneous servers and catastrophes. Opsearch 2015, 52, 810–826. [Google Scholar] [CrossRef]
  3. Singh Bura, G. Transient solution of an M/M/ queue with catastrophes. Commun.-Stat.-Theory Methods 2019, 48, 3439–3450. [Google Scholar] [CrossRef]
  4. Mishra, R.; Banerjea, A.C. Neurological damage by coronaviruses: A catastrophe in the queue. Front. Immunol. 2020, 11, 565521. [Google Scholar] [CrossRef]
  5. Kumar, N.; Gupta, U.C. Analysis of batch bernoulli process subject to discrete-time renewal generated binomial catastrophes. Ann. Oper. Res. 2020, 287, 257–283. [Google Scholar] [CrossRef]
  6. Arizono, I.; Takemoto, Y. An Analysis of steady-state distribution in M/M/1 queueing system with balking based on concept of statistical mechanics. RAIRO Oper. Res. 2021, 55, S327–S341. [Google Scholar] [CrossRef]
  7. Granville, K.; Drekic, S. The unobserved waiting customer approximation. Queueing Syst. 2021, 99, 345–396. [Google Scholar] [CrossRef]
  8. Vishnevsky, V.; Vytovtov, K.; Barabanova, E.; Semenova, O. Analysis of a MAP/M/1/N Queue with Periodic and Non-Periodic Piecewise Constant Input Rate. Mathematics 2022, 10, 1684. [Google Scholar] [CrossRef]
  9. Tang, S. Transient Analysis of a Finite Queueing System with Bulk Arrivals in IoT-Based Edge Computing Systems. IoT 2022, 3, 435–449. [Google Scholar] [CrossRef]
  10. Jain, N.K.; Kumar, R. Transient solution of a correlated queueing problem with variable capacity and catastrophes. Int. J. Inform. Manag. Sci. Taiwan 2005, 16, 461–465. [Google Scholar]
  11. Dabrowski, C. Catastrophic event phenomena in communication networks: A survey. Comp. Sci. Rev. 2015, 18, 10–45. [Google Scholar] [CrossRef]
  12. Krishna Kumar, B.; Pavai Madheswari, S. Transient analysis of an M/M/1 queue subject to catastrophes and server failures. Stoch. Anal. Appl. 2005, 23, 329–340. [Google Scholar] [CrossRef]
  13. Krishna Kumar, B.; Krishnamoorthy, A.; Pavai Madheswari, S.; Sadiq Basha, S. Transient analysis of a single server queue with catastrophes, failures and repairs. Queueing Syst. 2007, 56, 133–141. [Google Scholar] [CrossRef]
  14. Krishna Kumar, B.; Vijayakumar, A.; Sophia, S. Transient analysis for state-dependent queues with catastrophes. Stoch. Anal. Appl. 2008, 26, 1201–1217. [Google Scholar] [CrossRef]
  15. Dudin, A.N.; Klimenok, V.I.; Vishnevsky, V.M. The Theory of Queuing Systems with Correlated Flows; Springer: Berlin/Heidelberg, Germany, 2020; pp. 63–392. ISBN 978-3-030-32071-3. [Google Scholar]
  16. Di Crescenzo, A.; Giorno, V.; Nobile, A.G.; Ricciardi, L.M. A note on birth-death processes with catastrophes. Stat. Probab. Lett. 2009, 78, 2248. [Google Scholar] [CrossRef]
  17. Di Crescenzo, A.; Giiorno, V.; Nobile, A.G. On the M/M/1 queue with catastrophes and its continuous approximation. Queueing Syst. 2013, 43, 329–347. [Google Scholar] [CrossRef]
  18. Yashkov, S.F.; Yashkova, A.S. On busy period and sojourn time distributions in the M/G/1-EPS queue with catastrophes. Autom. Remote Control 2009, 70, 2061–2072. [Google Scholar] [CrossRef]
  19. Jain, N.K.; Singh Bura, G. Transient solution of an M/M/1/N queue subject to uniformly distributed catastrophic intensity with restoration. Int. J. Comput. Sci. Math. 2010, 2, 277–283. [Google Scholar]
  20. Suranga Sampath, M.I.G.; Liu, J. Transient analysis of an M/M/1 queue with reneging, catastrophes, server Failures and repairs. Bull. Iran. Math. Soc. 2018, 44, 585–603. [Google Scholar] [CrossRef]
  21. Kaliappan, K.; Gopinath, S.; Gnanaraj, J.; Ramnath, K. Time dependent analysis of an M/M/1/N queue with catastrophes and a repairable server. Opsearch 2012, 49, 39–61. [Google Scholar]
  22. Paz, N.; Yechiali, U. An M/M/1 queue in random environment with disasters. Asia-Pac. J. Oper. Res. 2014, 31, 1450016. [Google Scholar] [CrossRef]
  23. Sule Alfa, A.; He, Q. Point of queue size change analysis of the PH/PH/k system with heterogeneous servers. Oper. Res. Lett. 2017, 45, 581–584. [Google Scholar] [CrossRef]
  24. Zhang, J. An approximate mean queue length formula for queueing systems with varying service rate. J. Ind. Manag. Optim. 2021, 17, 185–204. [Google Scholar] [CrossRef]
  25. Chakravarthy, S.R.; Shruti; Kulshrestha, R. A queueing model with server breakdowns, repairs, vacations, and backup server. Oper. Res. Perspect. 2020, 7, 100131. [Google Scholar] [CrossRef]
  26. Klimenok, V.; Dudin, A.N.; Samouylov, K. Computation of the moments of queue length in the BMAP/SM/1 queue. Oper. Res. Lett. 2017, 45, 467–470. [Google Scholar] [CrossRef]
  27. Choi, K.H.; Yoon, B.K. A roots method in GI/PH/1 queueing model and its application. Ind. Eng. Manag. Syst. 2013, 12, 281–287. [Google Scholar] [CrossRef]
  28. Baba, Y. The M/PH/1 queue with working vacations and vacation interruption. J. Syst. Sci. Syst. Eng. 2010, 19, 496–503. [Google Scholar] [CrossRef]
  29. Kim, J.; Kim, B. Waiting time distribution in an M/PH/1 retrial queue. Perform. Eval. 2013, 70, 286–299. [Google Scholar] [CrossRef]
  30. Liu, Z.; Luo, X.; Wu, J. Analysis of an M/PH/1 retrial queueing-inventory system with level dependent retrial rate. Math. Probl. Eng. 2020, 1–10. [Google Scholar] [CrossRef]
  31. Oliveira Souza, M.; Rodriguez, P.M. On a fractional queueing model with catastrophes. Appl. Math. Comput. 2021, 410, 126468. [Google Scholar]
  32. Sakuma, Y.; Boxma, O.; Phung-Duc, T. An M/PH/1 queue with workload-dependent processing speed and vacations. Queueing Syst. 2021, 98, 373–405. [Google Scholar] [CrossRef] [PubMed]
  33. Jose, J.K.; Deepthi, V. M/PH/1 queueing model with re-servicing. Commun. Stat.-Simul. Comput. 2021, 52, 2865–2885. [Google Scholar] [CrossRef]
  34. Dogan, O.; Akar, N. The multi-source preemptive M/PH/1/1 queue with packet errors: Exact distribution of the age of information and its peak. IEEE Trans. Commun. 2021, 7, 1–16. [Google Scholar]
  35. Lakshmi Priya, M.; Janani, B. Transient analysis of a single server queue with disasters and repairs under Bernoulli working vacation schedule. J. Math. Comput. Sci. 2021, 11, 312–329. [Google Scholar]
  36. Sudhesh, R.; Savitha, P.; Dharmaraja, S. Transient analysis of a two-heterogeneous servers queue with system disaster, server repair and customers’ impatience. TOP 2017, 25, 179–205. [Google Scholar] [CrossRef]
  37. Liu, Y.; Liu, L.; Jiang, T.; Chai, X. Strategic queueing behavior of two groups of patients in a healthcare system. Mathematics 2024, 12, 1579. [Google Scholar] [CrossRef]
  38. Watson, G.N. A Treaties on the Theory of Bessel Functions; Cambridge University Press: Cambridge, UK, 1962. [Google Scholar]
Figure 1. Transitions and rates for the M / M / 1 queue with catastrophes.
Figure 1. Transitions and rates for the M / M / 1 queue with catastrophes.
Axioms 13 00716 g001
Figure 2. Transitions and rates for a particular M / P H 2 / 1 queue with catastrophes.
Figure 2. Transitions and rates for a particular M / P H 2 / 1 queue with catastrophes.
Axioms 13 00716 g002
Figure 3. Effects of the catastrophe and arrival rates on the system.
Figure 3. Effects of the catastrophe and arrival rates on the system.
Axioms 13 00716 g003
Figure 4. The steady-state probabilities Q 1 ( = ( P 11 , P 12 ) T ) .
Figure 4. The steady-state probabilities Q 1 ( = ( P 11 , P 12 ) T ) .
Axioms 13 00716 g004
Figure 5. The steady-state probabilities Q n ( = 2 , 3 , 4 ) .
Figure 5. The steady-state probabilities Q n ( = 2 , 3 , 4 ) .
Axioms 13 00716 g005
Figure 6. Effects of the catastrophe and the arrival rates on the system.
Figure 6. Effects of the catastrophe and the arrival rates on the system.
Axioms 13 00716 g006
Table 1. The transitions.
Table 1. The transitions.
No.FromToRateRange
10(1, 1) λ
2(1, 1)0 μ p + ξ
3 ( n , 1 ) ( n , 2 ) μ q for n 1
4 ( n , 1 ) ( n 1 , 1 ) μ p for n 2
5(1, 2)0 μ + ξ
6 ( n , 2 ) ( n 1 , 1 ) μ for n 2
7 ( n , j ) ( n + 1 , j ) λ for n 1 , j = 1 , 2
8 ( n , j ) 0 ξ for n 2 , j = 1 , 2
Table 2. The notations and their meanings.
Table 2. The notations and their meanings.
NotationsRange
e 0 ( 1 , 0 ) T
e 1 ( 1 , 0 , 0 ) T
e 2 ( 0 , 1 , 0 ) T
e 3 ( 1 , 1 , 1 ) T
e 4 ( 1 , 1 ) T
*Denotes convolution
L ( e A ) Laplace transform of matrix e A
L 1 ( e A ) Laplace inverse transform of matrix e A
I2nd order identity matrix
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Liu, Y.; Liu, L.; Jiang, T.; Chai, X. Transient and Steady-State Analysis of an M/PH2/1 Queue with Catastrophes. Axioms 2024, 13, 716. https://doi.org/10.3390/axioms13100716

AMA Style

Liu Y, Liu L, Jiang T, Chai X. Transient and Steady-State Analysis of an M/PH2/1 Queue with Catastrophes. Axioms. 2024; 13(10):716. https://doi.org/10.3390/axioms13100716

Chicago/Turabian Style

Liu, Youxin, Liwei Liu, Tao Jiang, and Xudong Chai. 2024. "Transient and Steady-State Analysis of an M/PH2/1 Queue with Catastrophes" Axioms 13, no. 10: 716. https://doi.org/10.3390/axioms13100716

APA Style

Liu, Y., Liu, L., Jiang, T., & Chai, X. (2024). Transient and Steady-State Analysis of an M/PH2/1 Queue with Catastrophes. Axioms, 13(10), 716. https://doi.org/10.3390/axioms13100716

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop