Unreliable retrial queueing system with working vacation

: This paper investigates an unreliable M / G ( P 1 , P 2 ) / 1 retrial queueing system with a woking vacation. An arriving customer successfully starts the ﬁrst phase service with the probability α or the server fails with the probability ¯ α . Once failure happens, the serving customer is taken to the orbit. The failed server is taken for repair with some delay. Once the repair is comleted, the server is ready to provide service once again. In this background, we implemented the working vacation scenario. During working vacation, the service will be provided at a slower rate, rather than entirely stopping the service. The supplementary variable method was adopted to ﬁnd the orbit and system lengths. Additionally, some unique results and numerical evaluations have been presented.


Introduction
Retrial queues with unreliable servers are extensively researched in a variety of fields, such as telephone switching systems, call centers, computer communication and networks of telecommunication, automobile industries, and manufacturing systems. Here, the retrial queuing model is reflected in customer service requirements. For example, if arriving customers found the server to be unavailable, busy, under repair, and on working vacation, they would have joined a retrial group. This term is called an orbit and requests the service at a later time.
This model played in a wide range in the field of telecommunications and engineering literary works, as well as in mathematical queueing theory. Falin [1] surveyed and discussed the considerable aspects of retrial queues. Falin and Templeton [2] dealt with more information about retrial queues. Artalejo and Gomez-Corral [3], Gomez-Corral and Antonio [4], Artalejo and Jesus [5] have deeply delved into the historical background of retrial queues. Mohamed [6] investigated an unreliable retrial model and framed it with a single server, customer balking, and server undergoing breakdown and repairs. Gao and Zhang [7] focused on retrial queues linked with orbital search and applied them to call centers. Mohammadi et al. [8] considered an M/G/1 retrial model which is embedded with k consecutive heterogeneous service processes and vacations ran under the transient state. Sztrik et al. [9] looked at a unique retrial queues system that implied a two-way communication mechanism because the models suddenly gained a lot of attention.
The servicing pattern played an important role in the modelling of retry waits. There have been studies conducted on a variety of services such as including phase services, optional services, multioptional services, and single services. The service is provided to the customer as either a single phase or more than a single phase. In a network communication scenario, the data transmission process has two phases: In the first phase, the availability of the communication channels is checked, and in the second phase, the packets are transmitted to the destination. Varalakshmi et al. [10] took a look an M/G/1 retrial model where the server provided service in two phases: single vacation, Bernoulli feedback, and starting failure. JintingWang and FangWang [11] focused on retrial queues with finite sources along with two phases of services. Alem et al. [12] made a comparison of their model M/G/1 retrial queue and their M/M/1 retrial queue with two ways of communication together with n types of outgoing calls. Boualem et al. [13] conducted a thorough analysis of the single server classical retrial queue with repeated tries and customers receive service in two phases.
When the server is idle, the visiting (new or returning) customers face the starting failure. If the server launched with a predefined probability, the server would immediately be reported to the customer. If it is not, the server would be a failure. Ke [14] established a model which covered starting failure and disruption of service. Krishnakumar et al. [15] covered a retrial queue of a single server by including feedback and startup errors. Lan and Tang [16] made a study on a discrete-time Geo/G/1 retrial queueing system for the probabilistic preemptive priority, together with server startup errors and replacements in the repair with balking. Rajadurai et al. [17] carried out a wide discussion on server retrial queueing architecture with multiple working vacations. Arivudainambi et al. and Ammar et al. [18,19] discussed starting failure together with a working breakdown, displaying how the normal busy server becomes insufficient due to disasters occurring at any time and causing the major server to fail. When a server failed, the server was taken for repair and operated at a lower speed (known as the working breakdown period) during the repair period.
The server experiences failure at any time. If it happened, the repair work could not start immediately and the arbitrary amount of time is known as the delay time. After accomplishing the repair work the server instantly resumes serving the customer. Choudhury and Ke [20] invented a batch arrival retrial queue with a combination of Bernoulli vacation and delayed repair. Liu et al. [21] exhibited a multi-server retrial system that included a delayed reboot. Kumar et al., Saggou et al. and Wang et al. [22][23][24] revealed more aspects of the delay in the retrial queueing system.
Due to some of the reasons, such as the limited lifespan of the server, outside interference, server malfunctions and startup failures, the servers malfunctioned. Therefore, it required maintenance during a slow period or busy period since so much research is carried out on problematic servers and repairs are conducted in stages from the perspectives of queueing and dependability. Rajadurai et al. [25] released the queueing publications by using the retrial queueing system with repeated working vacations and vacation interruptions, where the server tends to fail and repair. Kulkarni and Choi, Abdolllahi and Salei Rad [26,27] provided a detailed background for failures and repairs of servers. Gao et al. [28] made a provocative investigation on the retrial queue, which included two different sorts of breakdowns and delays to repair in the M/G/1 retrial queue.
In the vacation queuing system, the server fully ceased to provide service while on vacation, whereas, in the working vacation scheme, the server continued to provide service at a reduced rate rather than ceasing altogether. Markovian queueing systems with working vacations have been researched to use in the area of computer systems, communication networks and production management. Bouchentouf et al. [29] made a study on the model of the multi-station unreliable machine by combining the policy of a working vacation and patient customers. Jeyakumar and Senthilnathen [30] also discussed bulk arrival and service with a multi-working vacation model. Manoharan and Majid [31] made a detailed study on multiple working vacations for the multi-server model. Murugan and Vijayalakshmi [32] worked on multiple working vacations for a single server with bulk arrival retrial queueing model, whereas Gupta and Kumar [33] denoted a wide investigation on working vacation together with servers vacation interruption for M/M/1retrial queueing model. Bouchentouf [34] made an interesting investigation on a machine model that had multi stations along with a working vacation. Zhang [35] considered the Markovian queues which contained unreliable servers undergoing working vacation.
An examination of these papers reveals that the retrial queueing model with a single server delivering two stages of important services, commencing starting failure, delayed repair, and working vacation have been studied. Our goal is to explore the performance of such a single-server queue with simultaneous two different phases of service, both the phases are mandatory. At the start, the customer's failure in the service area was taken to the orbit. When the server failed, it was taken for repair with some delay. Additionally, service will be delivered in a slower way during vacation, in light of the growing demands for flexible service in practice. It has uses in many different industries, including wired networks, email systems, local area networks, client-server networks, web servers, inventory and production, maintenance, and quality control, among others.
We have established our analysis by the following segments. The first segment 1 is supported by an introduction with a review of recent literature and Section 2 provides a pictorial and a mathematical representation of the model with a practical justification. Section 2.1 of the paper analyses a study on the system's steady state probability. Section 2.2 engages with the solution for the framed model under steady state. Certain measures of performance are given in Section 2.3. Additional evaluations are covered in Section 2.4. In Section 3, important numerical examples, along with a 2D and 3D representation, are created from the model's mathematical results. Section 4 deals with the conclusion.

Model's pictorial and mathematical representations
In addition to commencing failure, delayed repair, and two crucial phase services with a working vacation, the framed M/G(P1, P2)/1 retrial queueing model was also taken into consideration. The following are extensive instructions for using the framed model. Figure 1 shows the diagram of M/G(P 1 , P 2 )/1 model. • The arrival process: Customers enter the system in a Poisson stream with an arrival rate ofλ, (λ > 0). The arriving customer receives service right away after discovering the server to be open and then exits the system. • The retrial process: If a customer arrives and discovers the server is with another customer or has left to provide low-cost service while on vacation, they are whisked away to a crowd of backed-up customers known as the orbit from that service region. The request for service is then repeated later. The primary customer enters the orbit by discovering the server to be busy and then tries for repeated requests of service later on at a random time, on the basis of the "First Come, First Out" discipline. It is also assumed that the waiting area is not vacant. It was assumed that the inter-retrial periods follow a general random variableÂ along with the distribution functionÂ(t), and its related density function θ(x) with an equivalent Laplace-Stieltijes transform (LST)Â * (Φ) govern the time between trials. • Regular two phase services: If a new customer or a customer from an orbit who is taking a trial sees the server to be free at a typically busy period, they must engage the server to become busy. Once the service has started successfully, the customer will be served right away with the requested service with a specific probability of α; on the other hand, failure will start right away with a probability ofᾱ. The customer who is in the service area is taken to orbit after the beginning failure occurs. After an arbitrary amount of time, the orbited customer accepts their request. During the period of the regular service time, both the phase of the essential service was provided by only one server having a general distribution with rate µ b , µ sb for the first phase P 1 and second phase P 2 , which follows a random variableL b andR b , respectively, with probability distribution functionL b (t), andR sb (t) with Laplace-Stieltjes transformsL * b (Φ) andR * b (Φ), provided that the first and second moments are E(L b ), E(R b ) and E(L 2 b ), E(R 2 b ), respectively. • The process of working vacation (WV): When the server discovers that the orbit is empty, they promptly take a working holiday. The server's rate of service is low during the working vacation period, which is indicated by µ v ; accomplishments made on the spot during the vacation period, followed by a random variable through W v with a probability distribution function W v (t) and Laplace-Stieltjes transforms W * v (Φ), provided that the first and second moments are E( W v ), E( W 2 v ) respectively. Instead of entirely ceasing service throughout this process, a low rate of service µ v is provided to the arriving customer. When the low-cost service finishes, the switch from µ v to µ b occurs.
• Delayed repair: The service will be stopped for a newly arriving customer at the event of a breakdown, that customer will be moved to the orbit from the service station and retrial their request after a certain period of time, while that server is not immediately scheduled for repair but is issued a delay in repair. This process is followed by a random variableÊ f , together with the probability distribution provided byÊ f (t) and the Laplace-Stieltjes transformsÊ * f (Φ), provided that the first and second moments are E(Ê f ), E(Ê 2 f ) respectively. • Repair process: The service will be stopped for newly arriving customers at the moment of a breakdown, and that customer will be moved to the orbit from the service station before starting their requests after a random period of time, while that server is immediately scheduled for repair.
Then the random variableŜ f is then used and the probability distribution is provided byŜ f (t) and the Laplace-Stieltjes transformŜ * f (Φ), provided that the first and second moments are E(Ŝ f ), E(Ŝ 2 f ), respectively. Inter-arrival time, first and second-phase service during the typical busy season, low service rate, and delays in repair time are all regarded as independent of one another. Numerous stochastic methods are intertwined with this system .
Practical justification Customer support ticketing system: The customer service ticketing system is one of the most significant pieces of software used by top service providers and customer support operations. Teams may manage and keep track of customer concerns with these tools, all in a very coordinated and cooperative way. The ticket system centralises all client communications via email, web forms, phone, video, social media, SMS, and chat. The banking, insurance, automobile, utility, e-commerce, software, telecommunications, and other industries all use ticketing systems. When customers submitted support tickets, their arrival can be modelled as a Poisson process. The system may experience starting failures due to technical issues or overloaded servers. The support tickets went through a two-phase service: In the first phase (P1), the tickets are assigned to a support representative, and in the second phase (P2), the representative addressed the issue and provided a resolution. If the representative is busy, the tickets are stored in a buffer(orbit) and retried later. The system may also experience delays in repairing any technical problems that arise, and a repair process is initiated to restore the system to an operational status. We have established that this work encompasses two crucial service phases, commencing with starting failure, and including a working vacation.

2.
1. An investigation on steady state probability of the system Equations of differential difference under steady state for the framed structure were thought through by including additional variables such as elapsed time for retrial, service, working vacation, and delayed repair. Now, the system's and orbit's customer numbers, along with the server's current condition probability generating function (PGF) are acquired. Stability conditions: By the time of steady state, it was assumed that whenx = 0,Â(0) = 0,Â(∞) = andŜ f (∞) = 1 are continuous, by which, the conditional rate of completion for retrial, first phase service, second phase service, working vacation, delayed repair and for repair are given by the following: were taken to be elapsed retrial times, elapsed first phase service, elapsed second phase service, elapsed lower rate service, elapsed delay and repairs respectively. Furthermore, introducing the random variables, The server seems to be in idle. 1 The server seems to be busy with the first phase service. 2 The server seems to be busy with second phase service. 3 The server seems to be in working vacation period and server is busy. 4 The server seems to be on delay. 5 The server seems to be on regular repair period.
Moreover, we see that the system's state at time t can be characterised by the bivariate Markov process ∆ (t),Ṅ(t); t ≥ 0 ; here,∆(t) represents the state of the server as (0, 1, 2, 3, 4, 5) based on the server's idle, P 1 , P 2 , WV, delay to repair and repair at the time t, andṄ(t) denotes the available customer's number in the orbit.
To work with a Markov process where∆(t) > 0, we introduce five more variables: if∆(t) = 0 anḋ N(t) > 0, thenÂ 0 (t) represents the elapsed retrial time; if∆(t) = 1 andṄ(t) > 0, thenL 0 b (t) represents the elapsed first phase service time during normal busy period at time t; if∆(t) = 2 andṄ(t) > 0, thenR 0 b (t) represents the elapsed second phase service time during normal busy period at time t; if ∆(t) = 3 andṄ(t) > 0, then W 0 v (t) represents the elapsed working vacation time at time t; if∆(t) = 4 andṄ(t) > 0, thenÊ 0 f (t) represents the elapsed delayed time to repair during normal busy period at time t; and if∆(t) = 5 andṄ(t) > 0, thenŜ 0 f (t) reflects the amount of time spent making repair during a typical busy time t. Ergodicity of the designed dynamic model Let {t n ; n ∈ 1, 2, ...} represent a sequence of time for either the end of a service or the completion of a vacation. The random vector's sequence Z n = ∆ (t n , +),Ṅ(t n , +) was shown as the embedded Markov chain for the suggested retrial queueing paradigm. Additionally S = {0, 1, 2, 3, 4, 5} ×Ṅ is its state space.

Theorem 1. The embedded Markov chain Z n ; n ∈Ṅ is ergodic if and only if ρ <Â
Proof. It is strong where the chain Z n ; n ∈Ṅ seems to be not only irreducible, but also an aperiodic Markov chain.
Here, Foster's criterion, according to which an irreducible and an aperiodic Markov chain are only ergodic when a non-negative function exists, was used to demonstrate the necessary condition for ergodicity. Let it be f (ú),ú ∈Ṅ and ∈> 0 were the mean drift, which is given to be χú = E ( f (z n+1 ) + f (z n ) |z n =ú)) appears to be a finite measure for all values ofú ∈Ṅ and χú ≤ − ∈; the same is true for all values ofú ∈Ṅ, omitting theoretically for a certain finite numberú. Under this circumstance, let us deliberate the function f (ú) =ú. Then we have It is clear that the necessary condition and the sufficient condition for ergodicity were given by an inequalityᾱ For proving the necessary condition, as professed in Sennott et al. [40], the Markov chain {Z n ; n ∈ N} gratifies Kaplan's form, specifically χú < ∞ for all the values ofú ≥ 0 and for the existenceú 0 ∈ N such that χú ≥ 0 for all the datas ofú >ú 0 . In this case, Kaplan's condition appears to be satisfied because of the existence ofȃ such that ϕȗ ,ú = 0 forȗ > 0 andú <ȗ −ȃ, where R = (ϕȗ ,ú ) was taken as a one step transition matrix of {Z n ; n ≥ 1}. Then, it was taken that the inequalityᾱ + αλ( indicates the non-ergodicity of the Markov chain. For the Markov process {Z n ; n ∈ N}, the probability was defined by Υ 0 (t) = P ∆ (t) = 0, X(t) = 0 also the probability densities are given by x ≥ 0 and n ≥ 1 In the parts that follow, the probabilities listed were used.   We can establish t ≥ 0,x ≥ 0 and n ≥ 1 because of the assumption of the satisfaction of the stability condition. Additionally, we present the random variable as follows: The system's governing equations Depending on the assumptions made above, the differential difference equations for the model was designed with the help of the following supplementary variable technique: The stationary probability solutions for this model occur as non negative iffᾱ [possible under the ergodicity condition only].
The system's steady state boundary conditions whenx = 0, The normalising condition is given by

The Solution for the model under steady state
Here, the technique used for the retrial queueing model to reach its steady state solution is probability generating function (PGF). The generating functions used for solving the overhead equations are defined as follows: |z|≤ 1, Theorem 2. For the number of customers present in an orbit during the state of server, 0, 1, 2, 3, 4 and 5 denotes the server to be idle, engaged in normal first phase and second phase service, working vacation, delay and repair, respectively. The generating functions are given by , Ω(z), where Υ 0 was determined by the normalizing condition .
Proof. Multiply the Eqs (2.2)-(2.11) with the appropriate powers forz; then, by summing over for n, the succeeding set of partially differential equations were obtained: (2.28) Above partial differential Eqs (2.23)-(2.28) were solved as follows Similarly solving for (2.12)-(2.21), we obtain the following: (2.46) Similarly, substitute Eq (2.29) and then (2.46) in (2.36), we get the following equation: (2.47) Similarly, substitute Eq (2.46) in (2.42), we get the following equation: Taking Eq (2.46) to the Eq (2.44), we move to the following equation: Similarly, substitute Eq (2.49) in (2.45), we get the following equation: The limiting probability generating functions are established by utilizing the aforementioned equations from (2.47) to (2.49) in (2.29) to (2.34): (2.56) Focusing on the server states and orbit size marginal generating functions, the required probability generating functions are turned with the help of the following: Now, for the above Eqs (2.51) to (2.56) on integrating w.r.tx and limiting with 0-∞, the essential results are (2.57) to (2.62).
(2.62) By using the above equation, the only unknown Υ 0 was eliminated as follows, which involves normalising condition and by adjustingz = 1: .

(2.64)
Theorem 3. In order for the model to satisfy the stability criteria,ᾱ + αλ(E(L b ) + E(R b )) +ᾱλ(E(Ê f ) + λE(Ŝ f )) <Â * (λ), If the server was idle, regularly busy on both the phase, lower rate service, delay and on repair, then the probability of the stationary distribution customers number in the designed system and in the orbit was determined by K(z) Proof. Now, by substituting the equations from (2.57) to (2.62) we find the PGF of the number of customers in the orbit and system finally the results are given by the following: where Υ 0 is given by Eq (2.64).
The mean system size and the mean orbit size: Under the steady state condition of the system, the mean and orbit size was given as follows: (1) The mean number of customers in the orbit (L q ) was obtained by differentiating Eq (2.65) with respect toz, along by evaluating atz = 1, we getL q : .
(2) The mean number of customers in the systemL s is given by differentiating Eq (2.66) with respect toz, and then by evaluatingz = 1, we getL s : .

Performance measures
Some of the most important performance measures of this M/G/1 retrial queueing system are derived in this section, which was subjected to the two-phase essential service with starting failure along with working vacation under steady state; additionally, we derived the reliability analysis, mean busy period and mean cycle and also orbit size distribution during the departure epoch of this proposed model. System state probabilities: (1) The probability that the server is idle under steady state at the time of retrial was given by the following: (2.67) (2) The probability of the server to be busy on normal first phase service under the steady state was given by the following: (2.68) (3) The probability of the server to be busy on normal second phase service under the steady state was given by the following: (2.69) (4) The probability under steady state of the server to be busy during working vacation period was given by the following: .
(2.70) (5) The probability under steady state of the server is delayed to repair at the time of normal busy period was given by the following: (2.71) (6) The probability under steady state of the server is under repair at the time of normal busy period was given by the following: (2.72) (7) The expected time the customer spends in system ( W s ) and in orbit ( W q ) under the condition of steady state, taken for the Little's formula is as follows: (2.74)

Reliability measure
When a server in the trial queueing system is unreliable, reliability measures will give the data required for the system's improvement. The following availability indicators are gathered in order to validate and corroborate the model's analytical findings. Unreliable servers in queuing systems require measures of dependability to offer adequate data, which are necessary for system improvement. The failure frequency and availability measures are obtained to explain the validity of the logical findings of the framed model.
(1) The probability of the availability of the server under the steady state was occupied by either a positive customer or by an idle period in which the steady state accessibility of the server was considered as The failure frequency during the steady state is gained as F Γ =ᾱΨ (1),

Mean busy period and the mean busy cycle
Let's assume that, under steady state conditions, E(T b ) and E(T C ) represent the anticipated lengths of the busy period and busy cycle, respectively. The following conclusions are directly obtained by using the argument of an alternating renewal process, which results in the following: where T 0 is the amount of time the system has spent in an empty state. Due to the fact that the interval between two customers' arrival times is exponentially distributed along the parameterλ, then E(T 0 ) = 1 λ . Using the aforementioned necessary outcomes, we obtain the following anticipated steady state probability:

Size of an orbit distribution during departure epoch
PASTA's (Poisson arrival see time average) argument states that the orbit must have n customers immediately following a disappearance if and only if the system contained n + 1 customers prior to the disappearance. Assume that if you specify the likelihood that there are n customers in the orbit at the time of departureL + n ; n ≥ 0, n, then there will be n customers, with the normalizing constant K 0 : Corollary 1. The quantity of customers in orbit during the departure epoch whose probability generating function was estimated by the following: (2.77) Proof. Eq (2.75) was multiplied with appropriate powers forz; taking summation as n = 0, 1, 2, 3, ..., the following equation was obtained: Using Eqs (2.54) to (2.57) and (2.60) to (2.63) during the departure epoch number of customer in the orbit whose generating function was generated. By letting limitz → 1 in (2.76), the unknown constant K 0 was determined as follows: .

Decomposition of the system stochastically and some special cases
Server vacations are included in the stochastic decomposition of unreliable retrial queueing types, which have been widely recognized. An important finding from these analyses is that, in this system, the number of customers at any one time is distributed among the sum of two independent random variables, one is the number of customers in a comparable regular queueing system at a random point in time. The second random variable is consumed by several probabilistic explanations, and the particular situations depend on the intended vacation. It has been found that several of the unreliable retrial queues exhibit stochastic decomposition. Let χ(z) denote the generating function for the number of customers in both two phases or on vacation in the queueing model at random intervals of time under steady state, φ(z) denote the generating function for the number of customers in the orbit during the idle, or under repair of the server at a random point of time and Z s (z) be the generating function for the number of customers of the given system, which is to be decomposed. The stochastic decomposition law was then expressed as Z s (z) = φ(z) × χ(z). Now, the law of decomposition had been established, it was applied to the retrial model and analyses were performed. The decomposition for a two-phase queueing system was provided by the following: Substituting the Eqs (2.58),(2.59), (2.60) also (2.68), (2.69), (2.70) in (2.80), we obtain the following:

Special cases
Some of the exceptional instances of our concept are examined in this section. Case 1: If E(R b ) = 0 and E(Ê f ) = 0, our model is reduced to a single server retrial queue with a single phase service along with a working vacation and starting failure. In this case, the results are in good agreement with Gowsalya and Arivudainambi [36]. When the probability generating function of the number of jobs in the system is K(z), the idle probability P 0 , the probability generating function of the number of jobs in the orbit is H(z), and the mean system size is L s , and the mean orbit size is L q : ) .

Case 2:
If E(R b ) = 0, E(Ê f ) = 0, α = 1 the framed model was shrunk to a single server retrial queueing system through a single phase service along with low working rate vacation. Here, K(z) denotes the generating function for the customer's number in the framed system, Υ 0 , represents the probability of idleness, whereas Θ(z) represents generating function for customer's number in the orbit, average size of the system was denoted byL s , and the average size of the orbit was denoted byL q . As a result, the final results coincide with the results of Arivudainambi et al. [37]: . Case 3: If E(R b ) = 0, E(Ê f ) = 0, α = 1,Â * (λ) → 1, the framed model was shrunk to a single server retrial queueing system with only one phase service along with low working rate vacation. Here, K(z) denotes the generating function for the customer's number in the framed system, Υ 0 represents the probability of idleness, average size of the system was denoted byL s . As a result, the final results coincide with the results of Zang and Hou [38]: .
,Â * (λ) → 1 and W * v (λ) = 1 the framed model was condensed to M/G/1 queueing system through single phase service. Here, the generating function of system's size K(z), together with idle probability Υ 0 , and average number in the systemL s are simplified as follows, which holds with Gross and Harris's [39] P − K formula: .

Numerical illustrations
The results of the model were investigated with the help of the software MATLAB, for learning the outcome of performance appearances by fluctuating the values of parametersλ, µ b , µ sb , µ v , ϑ, θ, α andᾱ on the system. Without loss of generality, it has been assumed that the exponential distribution whose density function f (x) = ve −vx ,x > 0, were imposed over the times on retrial, the first phase, second phase service, working vacation and on a repair. The parameters' arbitrary values are selected in a way that they satisfy the stability requirement. Probability's attributes were deliberated through tables and through figures. Table 1 displays the raises of retrial rate (θ), probability that the server is idle P 0 rises as well as the ρ and the average orbital and system sizes, L q and L s , decline along with the corresponding waiting times W q and W s for the values of µ b = 5, µ sb = 10, µ v = 2, η = 3, ϑ = 10,λ = 0.3, α = 0.5. According to Table 2, as the rate for lower speed services (µ v ) increases, the server's idle time P 0 increases along with the ρ, the average orbital size L q and its waiting time W q drop, whereas system sizes L s , and its associated waiting times W s , increase for the values of θ = 0.5, µ b = 5, µ sb = 10, η = 3, ϑ = 10,λ = 0.3, α = 0.5.
As seen in Table 3, by increasing the normal service rate (µ b ), it reflects an increase of ρ and probability of the server idle P 0 , whereas there is a drop in the average orbital size L q , system sizes L s and its respective waiting time W q and W s owing to the values of θ = 0.5, µ v = 2, µ sb = 10, η = 3, ϑ = 10,λ = 0.3, α = 0.5. From Table 4, it is clear that when the repair rate (ϑ) continues to increase, ρ and probability of the server' idle P 0 also increases. By the time the average orbital size L q , system sizes L s and its respective waiting time W q and W s are significantly reduced according to the values of θ = 0.5, µ v = 2, µ sb = 10, η = 3,λ = 0.3, µ b = 5, α = 0.5.  Table 3. Impact of normal service rates (µ b ) on ρ, P 0 , L q , W q , L s , W s .  Table 4. Effects of repair rates (ϑ) on ρ, P 0 , L q , W q , L s , W s .  Figure 2 indicates that an increase in the first phase service (µ b ) and retrial rate (θ) mirrors an increase in the system's idle state (Υ 0 ). Figure 3 illustrates how the rate of P1 (µ b ) and repair rate (ϑ) rise along with the system's idle state (Υ 0 ). Figure 4 reveals that when the system's idle state (Υ 0 ) increases, so too do the retrial rate (θ) and repair rate (ϑ). Figure 5 shows that on increase the arrivalŝ λ together with the rate of repairs (ϑ) increases and this duplicates the lengthening of the queue (L s ). Figure 6 indicates that when the rate of arrivals (λ) increases together with the rate of repairs, (ϑ) increases and this duplicates the lengthening of the queue (L q ). Figure 7 indicates that when the rate of trials (θ) increases, the rate of repairs (ϑ) increases and this duplicates the lengthening of the system (L s ). Figure 8 clearly shows that while the repair rate (ϑ) increases, the system's idle state (Υ 0 ) also increases gradually and the system's length (L s ), queue length (L q ) and waiting time (W q ) continue to decrease. Figure 9 demonstrates that when the retrial rate (θ) increases, the length of the system and queue (L q , L s ) as a whole and the waiting time W q for the model continue to decrease. This replication of the increase in the idle state (Υ 0 ) is done by the system's idle state.       . Effects of repair rate (ϑ) and the system's idle state (Υ 0 ) on system's length L s , queue length (L q ) and waiting time (W q ). Figure 9. Effects of retrial rate (θ) on the length of the system and queue (L q , L s ), the waiting time W q , and on idle state (Υ 0 ).

Conclusions
Through this evaluation, we looked at a single server retrial queueing system with two phases of essential service, delayed repair under a working vacation policy, and a busy server that was vulnerable to starting failure and delayed for repair. The conditions that are required and sufficient for the system to be stable are attained. The numerical illustrations used to validate the analytical conclusions may be used to create the outputs in a variety of real-life scenarios such as customer support ticketing system, wired networks, email systems, LAN and client-server communication, inventory and production, maintenance and quality control, etc,. The supplementary variable technique was adopted to find the probability generating functions for the numbers of customers in the system when it is free, busy, working on vacation, delayed, and under repair. We acquired some significant system performance metrics. The explicit formulae for the typical orbital and system queue lengths have been procured. To explore the effects of the system characteristics, some numerical examples and a stochastic decomposition were analyzed towards the end. The investigation's innovation lies in the addition of a server's starting failure, and being delayed for repair when retrial queues are present with varied working vacation policies. The inspiration for this approach came from a variety of realtime systems, such as computer and communication networks where messages are handled by a single server while adhering to a vacation interruption and working vacation policy.

Use of AI tools declaration
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.