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
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
distribution, it can almost approximate all distributions. A large number of researchers have performed significant work using the
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
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
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
queue model subject to different service speeds. Many references similar to the
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
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
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
queue model according to catastrophes. As far as we know, there is no study of the transient probabilities in an
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
queue model according to catastrophes is introduced.
The results of this paper are organized as follows. In
Section 2, a description of the
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
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
). 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
queue with the possibility of catastrophes. The
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:
where the zero state
(={0}) indicates that the queue is an empty system;
}; the state
indicates that there are
n customers in the queue system,
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
queue. In the following study, we assume that
is greater than 0. We begin by letting
be the number of customers in the queuing system at moment
t, and letting
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
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
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
and the differential–difference equations for the queuing system under investigation can be written as follows:
In general, we assume that initially, there are no customers in the queue system. In other words,
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 queue model with catastrophes.
By substituting Equations (2)–(5), we obtain the following:
where
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:
By substituting Equations (
6) and (7), we obtain the following:
Integrating Equation (
8) with respect to time ‘
’, we have the following:
where
By taking the Laplace transform on matrix
, we obtain the following:
where
By taking the Laplace inverse transform on matrix (
11), we have the following:
For the convenience of calculation, using Equations (
9)–(
12), we can obtain the following:
By using Equations (
11) and (
12) in Equation (
9), we have the following:
where
Using the Bessel Function identity (see Watson [
38]) with
gives the following:
where
is the modified Bessel Function of first kind order
n.
By using Equation (
15) in Equation (
14), we obtain the following:
Equating the coefficient of
in Equation (
16) gives the following:
Evaluation of
Substituting
in Equation (
8) and taking the Laplace transform, we derive the following:
where
, and
is the Laplace transform expression of
.
We derive the following equation:
and its the Laplace inverse transform is of the form
where
is the Laplace transform expression of
. That is to say, in order to derive the expression of
, we need to find another method.
From the second equation in matrix equation system (
8), we determine the following:
Integrating Equation (
21) with respect to time ‘
’, we have the following:
Equating the coefficient of
in Equation (
22) gives the following:
By taking the Laplace transform of Equation (
23), we obtain the following:
where
is the Laplace transform expression of
.
By taking the Laplace transform of Equations (4) and (5), we have the following:
where
By adding
to
∞ on both sides of Equation (
25), we find the following:
where
is a quadratic polynomial of
s.
Using Equations (2), (3), and (5) in Equation (
26), we can obtain the following:
where
is a quadratic polynomial of
s,
is a 4th degree polynomial of
s, and both
and
are univariate fifth-degree polynomials of
.
The simultaneous equations of Equations (
18) and (
27) can be obtained:
where
, and both
,
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
through the Laplace inverse transform of Equation (
28).
Through the Laplace inverse transformation, we obtain the following expression for
:
Evaluation of
By taking the Laplace transform of Equation (
1), we have the following:
The remaining transient probabilities
and
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:
where
By taking the Laplace transform, the solution of (
31) is obtained as follows:
where
Taking Equation (
33) in Equation (
32) and transforming, we have the following:
Taking the Laplace transform of Equation (2) and substituting
in Equation (
24) gives the following:
where
,
We use algebraic methods to obtain
as
multiplied by the following:
where
Substituting Equation (
35) into (
34), we obtain the following:
Taking Equation (
37) in Equation (
34) and transforming it, we have the following:
From Equations (
30) and (
38), we also have the following:
Inverting Equations (
39) and (40) yields the explicit expression for
and
as follows:
where
is a Dirichlet Function and * denotes convolution.
Evaluation of
Taking the Laplace transform of Equation (
30) gives the following:
From Equations (
17), (
29), and (
42), we have the following:
where
and
are given in Equations (
29) and (
42), respectively.
Thus, Equations (
29), (
41), and (
43) completely determine all the system size probabilities.
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 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 queue according to catastrophes. We will also consider whether it is feasible to use the duality between the queue according to catastrophes and the fractional queue according to catastrophes to solve problems of transient probabilities.