Next Article in Journal
A New Aggregated Multi-Criteria Approach for Evaluation of the Autonomous Metro Systems’ Performance in the European Countries
Next Article in Special Issue
Empirical Bayes Decision for a Generalized Exponential Distribution with Contaminated Data
Previous Article in Journal
A Machine Learning Strategy for the Quantitative Analysis of the Global Warming Impact on Marine Ecosystems
Previous Article in Special Issue
Threshold of Stochastic SIRS Epidemic Model from Infectious to Susceptible Class with Saturated Incidence Rate Using Spectral Method
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Analysis of an M/G/1 Retrial Queue with Delayed Repair and Feedback under Working Vacation policy with Impatient Customers

by
Micheal Mathavavisakan Nicholas GnanaSekar
and
Indhira Kandaiyan
*
Department of Mathematics, School of Advanced Sciences, Vellore Institute of Technology, Vellore-632 014, Tamil Nadu, India
*
Author to whom correspondence should be addressed.
Symmetry 2022, 14(10), 2024; https://doi.org/10.3390/sym14102024
Submission received: 19 August 2022 / Revised: 10 September 2022 / Accepted: 19 September 2022 / Published: 27 September 2022
(This article belongs to the Special Issue Mathematical Models: Methods and Applications)

Abstract

:
The concept of a single server retrial queueing system with delayed repair and feedback under a working vacation policy, along with the asymmetric transition representation, is discussed in this article. In addition, consumers are entitled to balk and renege in some situations. The steady-state probability generating function for system size and orbit size is derived by using the approach of supplementary variables. Discussions include key metrics of the system and a few significant special conditions. Moreover, the impact of system parameters is examined through the analysis of some numerical examples.

1. Introduction

In queueing theory, research on vacation queues and retrial queues has been ongoing for a while. An arriving consumer is instructed to leave the service area and join a retrial queue called “orbit” when they find the server is busy. This is known as a retrial queue with repeated tries in a retrial queueing system. After some time, the consumers in the orbit may retry their service request. Moreover, the consumers in the orbit are free to make repeated requests for the same service without having an impact on the other consumers. Generalized models can be found in retrial queues from Artalejo and Gomez-Corral [1] and in vacation queues from Ke et al. [2]. These queues have a unique function in computer and communication systems.
In the case of a vacation queueing model, the system offers its service to the consumers at a slower pace during the working vacation (WV) time, whereas the system ceases its service to the consumers altogether during the usual vacation period. Such models may be used to provide internet service, data transfer service, and mail delivery, among other things. Finn and Servi [3] presented an M / M / 1 queueing model in 2002, which included WVs. The M / M / 1 / W V queue was expanded by Wu and Takagi [4] to an M / G / 1 / W V queue. Wang [5] probed an M / G / 1 RQ with a F I F S , board retrial time, 2-stage service and system collapse. Arivudainambi et al. [6] discovered a single server retrial queueing system (SSRQ) with WV, where the server continues to provide service at varying rates rather than ceasing altogether when on vacation.
In recent years, Chandrasekaran et al. [7] provided a brief description of WV queueing systems. Varalakshmi et al. [8] studied the steady-state of an M / G / 1 RQ model with 2 stages of services and instantaneous feedback under a WV policy, in which the usual busy system has been impacted by the entry of negative consumers. Revathi [9] investigated a single server retrial queueing system, with optional re-service, consumer search, and delayed repair. Rajadurai [10] introduced a novel form, the RQ model that included WV and breaks. The monotonicity features and stochastic controllability of various behaviour metrics of an M / G / 1 queue with repeated tries and 2-stages of service were investigated by Boualem et al. [11].
The phenomenon of feedback is one of the crucial components of communication systems. When a consumer’s service is not satisfactory, the service might be attempted once more until it is successful. For instance, retrial queues with feedback can be used to represent multiple access telecommunication networks, where messages that proved to be mistakes are transmitted again. Choudhury and Paul [12] used two stages of heterogeneous service and Bernoulli feedback to inspect an M / G / 1 system. A consumer who has been identified in this system may receive poor service before trying again until they receive good service. Under a different vacation strategy, Rajadurai et al. [13,14,15] discovered a single server feedback retrial queueing system. Ismailkhan and Rajendran Paramasivam [16] discussed the encouraged arrival line with feedback, balking, and maintaining reneged clients.
The goal behind this inquiry is therefore to determine the queue length and orbit length distributions that will be used to determine the system’s remaining behaviour metrics. Our article is outlined as follows: With the necessary conditions in place, we present a precise explanation of the queueing model in Section 2. The system’s steady-state behaviour and the queue size’s probability generating function (PGF) at a random epoch have been determined explicitly in Section 3. Section 4 provides several key system behaviour indicators. A few specific instances are described in Section 5. Section 6 contains numerical results as well as some graphical representations. Finally, Section 7 presents the work’s conclusion and summary.

2. Model Description and Analysis

Under the working vacations policy, we propose an SSRQ with delayed repair and feedback. The following is a proper explanation of our model:
  • The arrival process: The consumers arrive via a Poisson process with rate ω .
  • The retrial process: We presume there is no waiting space; therefore if a consumer arrives and finds the server empty, the consumer immediately begins his service. However, if a consumer arrives and the server busy, on vacation, or broken, then the consumer has two options: they can either depart the service area with prob., α ¯ = ( 1 α ) and enroll in a group of blocked consumers who have been blocked, known as an “orbit” or balk the system with prob., α . Starting from the moment the server becomes idle, the consumer at the head of the RQ competes with potential main consumers to choose who will join the service next. If the main consumer comes first, the retrial consumer has the option of cancelling their request for service and either return to their place in the retrial queue with prob., β or quit the system with prob. β ¯ = ( 1 β ) . Inter-retrial times have an arbitrary distribution F ( x ) with a corresponding “Laplace-Stieltijes transform” (LST) F * ( ϑ ) .
  • The regular service process: The server instantly starts the regular service for the new or retrial consumers when they arrive at the server in its idle state. The service time follows a general distribution and it is denoted by the random variable A with the distribution function A ( x ) having LST A * ( ϑ ) .
  • The working vacation process: When the orbit goes empty, the server automatically commences working vacations, which has an exponential dist., with the rate η . If any consumers show up during a break, the server keeps working, but at a slower pace. The server will halt the vacation and return to the usual busy period if any orbiting consumers reach a service completion moment during the vacation time. This results in a vacation interruption. The vacation persists elsewhere. If there are still consumers in the orbit after a vacation expires, the server resumes normal operation. If not, the server starts a new vacation. During the working vacation period, the service time follows a general random variable A w with a distribution function A w ( x ) and LST A w * ( ϑ ) .
  • Feedback rule: Unsatisfied consumers have two options after obtaining their normal services: they may either quit the system with prob., γ ¯ = ( 1 γ ) ., or rejoin the orbit as a feedback consumer and receive another service with prob., γ   ( 0 γ 1 ) .
  • Delayed repair policy: Exogenous Poisson stream with mean breakdown rates as stated by ξ for regular service when the work fails. For regular service, the delay time is determined by an arbitrary distribution Q ( t ) and LST Q * ( φ ) . The moments of delaying repair on normal service are denoted by q 1 .
  • Repair policy: When a server breaks down, it is immediately dispatched for repair. During this time, the server stops serving consumers who are arriving and waits for the repair to be completed. The repair period is determined by a probability distribution H ( t ) , LST H * ( φ ) and first moments denoted by h 1 .
The system’s many stochastic processes are considered to be independent of one another. In our model, the transition between all the state spaces is possible and hence the transition representation is asymmetric.

Practical Application of the Model

The suggested paradigm has real-world applications in telephone consultation medical care systems. We take into account a system for telephone consultations with a head doctor (primary server) and a doctor assistant (working breakdown server). Only when the lead doctor is on working vacation, the doctor assistant offer service, and even then, the doctor assistant’s service pace is often slower than that of the head doctor. After each patient’s usual service is completed, the dissatisfied patient may re-enter the orbit (feedback). Normally, there is a phone operator who either records the sequence of the calls or is in charge of establishing connections between patients and doctors. When a patient calls, if the line is busy, he cannot wait in line and must try again later (retrial); if not, the head doctor or the medical assistant will attend to him right away.
The patient’s call will be disconnected if there is no network coverage during the consultation time. They might have to wait longer for the service if they want to prevent phone malfunctions (delayed repair). The system is once more regarded as good as new for service after the signal strength is fully restored (repaired). The consumer who is in orbit under FCFS, on the other hand, will be called (or searched for) by the phone operator as soon as the service is finished, and the search time is considered to be generally distributed, which is compatible with the general retry time policy. This is conducted to reduce the chief doctor’s idle time.

3. Analysis of the Steady State Probabilities

The steady-state equations for the retrial system are initially developed in this division by treating the elapsed retrial times, the elapsed times of normal service, the elapsed lower-speed service times, elapsed delay times and the elapsed repair times as supplementary variables. The orbit size generating functions (GFs) for various server states, as well as the PGF of the no. of consumers in the system and orbit, are then calculated.

3.1. The Steady State Equations

In steady state, we presume that F ( 0 ) = 0 , F ( ) = 1 , A ( 0 ) = 0 , A ( ) = 1 and A w ( 0 ) = 0 , A w ( ) = 1 are continuous at x = 0 and Q ( 0 ) = 0 , Q ( ) = 1 , and H ( 0 ) = 0 , H ( ) = 1 , are continuous at y = 0 . Therefore, we define the hazard rate functions f ( x ) , χ ( x ) , χ w ( x ) , χ D ( y ) and ζ ( y ) , for retrial, normal service, lower rate service, delayed repair and repair, respectively.
f ( x ) d x = d F ( x ) 1 F ( x ) χ ( x ) d x = d A ( x ) 1 A ( x ) χ w ( x ) d x = d A w ( x ) 1 A w ( x ) χ D ( y ) d y = d Q ( y ) 1 Q ( y ) ζ ( y ) d y = d H ( y ) 1 H ( y )
Let F 0 ( t ) , A 0 ( t ) , A w 0 ( t ) , Q 0 ( t ) and H 0 ( t ) be the elapsed retrial times, the elapsed times of normal service, the elapsed lower-speed service times, elapsed delay times and the elapsed repair times, respectively, at time t. Furthermore, generate the random variable,
Δ ( t ) = 0 , if the server is free and in working vacation period 1 , if the server is free and in regular service period 2 , if the server is busy and in regular service period at time t 3 , if the server is busy and in slower pace service period at time t 4 , if the server is under delayed repair period at time t . 5 , if the server is under regular repair period at time t .
Thus, the SV F 0 ( t ) , A 0 ( t ) , A w 0 ( t ) , Q 0 ( t ) and H 0 ( t ) are compelled to create a bivariate Markov procedure { Δ (t), S ( t ) ; t ≥ 0 }, where Δ ( t ) signifies the server state ( 0 , 1 , 2 , 3 , 4 , 5 ) depending on whether the server is free or busy on both normal service and working vacation periods, delayed repair and repair periods. S ( t ) denotes the number of consumers in the orbit. If Δ ( t ) = 1 and F ( t ) > 0 , then F 0 ( t ) is equivalent to the elapsed retrial time. If Δ ( t ) = 2 and S ( t ) 0 , then A 0 ( t ) is equivalent to the elapsed time of the consumer served in normal busy period. If Δ ( t ) = 3 and S ( t ) 0 , then A w 0 ( t ) is equivalent to the elapsed time of the consumer being served in lower rate service period. If Δ ( t ) = 4 and S ( t ) 0 , then Q 0 ( t ) is equivalent to the elapsed time of the server being delayed or repaired. If Δ ( t ) = 5 and S ( t ) 0 , then H 0 ( t ) is equivalent to the elapsed time of the server being repaired.
Theorem 1.
The embedded Markov chain { V n ; n ϵ N } is ergodic if Γ < 1 for our system to be stable, where Γ = β ( 1 F * ( ω ) ) α ω [ 1 + ξ ( q 1 + h 1 ) ] E ( A ) + γ ¯ .
Proof. 
It is quite straightforward to utilise Foster’s criteria [17] to verify the necessary condition of ergodicity, which asserts that the chain { V n ; n N } is an irreducible and aperiodic chain. If there is a non-negative function e ( l ) ,   l N and ϵ > 0 , the Markov chain is ergodic, and average drift η l = E [ e ( v n + 1 ) e ( v n ) / v n = l ] except for a finite no. of l s, l N and η l for all l N . In this example, we are thinking about the function e ( l ) = l . Then, we have
η l = α ω [ 1 + ξ ( q 1 + h 1 ) ] E ( A ) + γ ¯ 1 , if l = 0 β ( 1 F * ( ω ) ) α ω [ 1 + ξ ( q 1 + h 1 ) ] E ( A ) + γ ¯ 1 , if l = 1 , 2 ,
Here β ( 1 F * ( ω ) ) α ω [ 1 + ξ ( q 1 + h 1 ) ] E ( A ) + γ ¯ < 1 is clearly a necessary requirement for ergodicity.
According to Humblett et al. [18], if the Markov chain { V n ; n ϵ N } meets Kaplan’s status, notably η l < for all l 0 and ∃ l 0 N s.t η l 0 for l l 0 , the required condition is met. M = ( m k l ) is the the one-step transition matrix of { V n ; n N } for l < k i and k > 0 . The non-ergodicity of the Markov chain is implied by Γ 1 . □
Let { t n ; n = 1 , 2 , } be the series of epochs, where either a service period completion or a shorter service period happens. V n = { Δ ( t n + ) , S ( t n + ) } is the sequence of random vectors which forms a Markov chain, embedded in the RQ system. As a result of Theorem ( 3.1 )   V n ; n N is ergodic if Γ < 1 , in order for our system to remain stable, where Γ = β ( 1 F * ( ω ) ) α ω [ 1 + ξ ( q 1 + h 1 ) ] E ( A ) + γ ¯ .
For the procedure { S ( t ) , t 0 } , , we define the probabilities Ω 0 ( t ) = P { Δ ( t ) = 0 , S ( t ) = 0 } , and the prob. densities are
Ω n ( x , t ) d x = P { Δ ( t ) = 1 , S ( t ) = n , x F 0 ( t ) < x + d x } ,
for t 0 , x 0 and n 1 .
Υ n ( x , t ) d x = P { Δ ( t ) = 2 , S ( t ) = n , x A 0 ( t ) < x + d x } ,
for t 0 , x 0 and n 0 .
Ψ n ( x , t ) d x = P { Δ ( t ) = 3 , S ( t ) = n , x A w 0 ( t ) < x + d x } ,
for t 0 , x 0 and n 0 .
Φ n ( x , y , t ) d y = P { Δ ( t ) = 4 , S ( t ) = n , y Q 0 ( t ) < y + d y / A 0 ( t ) = x } ,
for t 0 , x 0 and n 0 .
Π n ( x , y , t ) d y = P { Δ ( t ) = 5 , S ( t ) = n , y H 0 ( t ) < y + d y / A 0 ( t ) = x } ,
for t 0 , x 0 and n 0 .
We presume that the stability requirement is satisfied in the sequel, so we may assign Ω 0 = l i m t Ω 0 ( t ) , and the limiting densities are
Ω n ( x ) = l i m t Ω n ( x , t ) ; Υ n ( x ) = l i m t Υ n ( x , t ) ; Ψ w , n ( x ) = l i m t Ψ w , n ( x , t ) ; Φ n ( x , y ) = l i m t Φ n ( x , y , t ) Π n ( x , y ) = l i m t Π n ( x , y , t )
We construct the following system of equations using the supplementary variable approach.
ω Ω 0 = γ ¯ 0 Υ 0 ( x ) χ ( x ) d x + γ ¯ 0 Ψ w , 0 ( x ) χ ( x ) d x + 0 Π 0 ( x ) η b ( y ) d y
d d x Ω n ( x ) + ( ω + f ( x ) ) Ω n ( x ) = 0 , n 1
d d x Υ 0 ( x ) + ( ω + ξ + χ ( x ) ) Υ 0 ( x ) = ω α ¯ Υ 0 ( x ) + 0 Π ( x , y ) ζ ( y ) d y , n = 0
d d x Υ n ( x ) + ( ω + ξ + χ ( x ) ) Υ n ( x ) = ω α Υ n 1 ( x ) + ω α ¯ Υ n ( x ) + 0 Π ( x , y ) ζ ( y ) d y , n 1
d d x Ψ w , 0 ( x ) + ( ω + η + χ w ( x ) ) Ψ w , 0 ( x ) = ω α ¯ Ψ w , 0 ( x ) , n = 0
d d x Ψ w , n ( x ) + ( ω + η + χ w ( x ) ) Ψ w , n ( x ) = ω α Ψ w , n 1 ( x ) + ω α ¯ Ψ w , n ( x ) , n 0
d d y Φ 0 ( x , y ) + ( ω + χ D ( y ) ) Φ 0 ( x , y ) = ω α ¯ Φ 0 ( x , y ) , n = 0
d d y Φ n ( x , y ) + ( ω + χ D ( y ) ) Φ n ( x , y ) = ω α Φ n 1 ( x , y ) + ω α ¯ Φ n ( x , y ) , n 1
d d y Π 0 ( x , y ) + ( ω + ζ ( y ) ) Π 0 ( x , y ) = ω α ¯ Π 0 ( x , y ) , n = 0
d d y Π n ( x , y ) + ( ω + ζ ( y ) ) Π n ( x , y ) = ω α Π n 1 ( x , y ) + ω α ¯ Π n ( x , y ) , n 1
At x = 0 , y = 0 the steady-state boundary conditions are as follows:
Ω n ( 0 ) = γ 0 Υ n ( x ) χ ( x ) d x + γ ¯ 0 Υ n 1 ( x ) χ ( x ) d x + γ 0 Ψ w , n ( x ) χ w ( x ) d x + γ ¯ 0 Ψ w , n 1 ( x ) χ w ( x ) d x , n 1
Υ n ( 0 ) = 0 Ω n + 1 ( x ) f ( x ) d x + ω β 0 Ω n ( x ) d x + ω ( 1 β ) 0 Ω n + 1 ( x ) d x + η 0 Ψ w , n ( x ) d x , n 1
Υ 0 ( 0 ) = 0 Ω 1 ( x ) f ( x ) d x + ω ( 1 β ) 0 Ω 1 ( x ) d x + η 0 Ψ w , 0 ( x ) d x + ω β Ω 0 , n = 0
Ψ w , n ( 0 ) = ω Ω 0 , n = 0 0 , n 1
Φ n ( x , 0 ) = ξ Υ n ( x ) , n 0
Π n ( x , 0 ) = 0 Φ n ( x , y ) χ D ( y ) d y , n 0
The normalizing condition is
Ω 0 + n = 1 0 Ω n ( x ) d x + n = 0 0 Υ n ( x ) d x + 0 Ψ w , n ( x ) d x + 0 0 Φ n ( x , y ) d x d y + 0 0 Π n ( x , y ) d x d y = 1

3.2. The Steady State Solution

The steady-state solution of the RQ model is obtained using the generating function strategy. To calculate the above equations, the GFs for | z ˇ | < 1 are defined as follows:
Ω ( x , z ˇ ) = n = 1 Ω n ( x ) z ˇ n ; Ω ( 0 , z ˇ ) = n = 1 Ω n ( 0 ) z ˇ n ;
Υ ( x , z ˇ ) = n = 0 Υ n ( x ) z ˇ n ; Υ ( 0 , z ˇ ) = n = 0 Υ n ( 0 ) z ˇ n ;
Ψ w ( x , z ˇ ) = n = 0 Ψ w , n ( x ) z ˇ n ; Ψ w ( 0 , z ˇ ) = n = 0 Ψ w , n ( 0 ) z ˇ n ;
Φ ( x , y , z ˇ ) = n = 0 Φ n ( x , y ) z ˇ n ; Φ ( x , 0 , z ˇ ) = n = 0 Φ n ( x , 0 ) z ˇ n ;
Π ( x , y , z ˇ ) = n = 0 Π n ( x , y ) z ˇ n ; Π ( x , 0 , z ˇ ) = n = 0 Π n ( x , 0 ) z ˇ n ;
Multiplying Equations ( 2 ) ( 16 ) by z n and summing over n, we obtain the following partial differential equations
x Ω ( x , z ˇ ) + ( ω + f ( x ) ) Ω ( x , z ˇ ) = 0
x Υ ( x , z ˇ ) + ( ω α ( 1 z ˇ ) + ξ + χ ( x ) ) Υ ( x , z ˇ ) 0 Π ( x , y , z ˇ ) ζ ( y ) d y = 0
x Ψ w ( x , z ˇ ) + ( ω α ( 1 z ˇ ) + η + χ w ( x ) ) Φ w ( x , z ˇ ) = 0
x Φ ( x , y , z ˇ ) + ( ω α ( 1 z ˇ ) + χ D ( y ) ) Φ ( x , y , z ˇ ) = 0
x Π ( x , y , z ˇ ) + ( ω α ( 1 z ˇ ) + ζ ( y ) ) Π ( x , y , z ˇ ) = 0
Ω ( 0 , z ˇ ) = ( γ + γ ¯ z ˇ ) 0 Υ ( x , z ˇ ) χ ( x ) d x + ( γ + γ ¯ z ˇ ) 0 Ψ w ( x , z ˇ ) χ w ( x ) d x ω Ω 0
Υ ( 0 , z ˇ ) = 1 z ˇ 0 Ω ( x , z ˇ ) f ( x ) d x + ω β 0 Ω ( x , z ˇ ) d x + ω ( 1 β ) z 0 Ω ( x , z ˇ ) d x + η 0 Ψ w ( x , z ˇ ) d x
Ψ w ( 0 , z ˇ ) = ω Ω 0
Φ ( x , 0 , z ˇ ) = ξ Υ ( x , z )
Π ( x , 0 , z ˇ ) = 0 Φ n ( x , y , z ˇ ) χ D ( y ) d y
By solving the partial differential Equations ( 18 ) ( 22 ) , we obtain
Ω ( x , z ˇ ) = Ω ( 0 , z ˇ ) [ 1 F ( x ) ] e ω x
Υ ( x , z ˇ ) = Υ ( 0 , z ˇ ) [ 1 A ( x ) ] e D 1 ( z ˇ ) x
Ψ w ( x , z ˇ ) = Ψ w ( 0 , z ˇ ) [ 1 A w ( x ) ] e D 2 ( z ˇ ) x
Φ ( x , y , z ˇ ) = Φ ( x , 0 , z ˇ ) [ 1 Q ( y ) ] e D ( z ˇ ) y
Π ( x , y , z ˇ ) = Π ( x , 0 , z ˇ ) [ 1 H ( y ) ] e D ( z ˇ ) y
where D ( z ˇ ) = ω α ( 1 z ˇ ) , D 1 ( z ˇ ) = D ( z ˇ ) + ξ ξ Q * ( D ( z ˇ ) ) H * ( D ( z ˇ ) ) and D 2 ( z ˇ ) = η + D ( z )
Inserting the Equations ( 28 ) to ( 32 ) and ( 23 ) to ( 26 ) in ( 24 ) and making some calculation, finally, we obtain
Υ ( 0 , z ˇ ) = Ω ( 0 , z ˇ ) z ˇ { F * ( ω ) + ( 1 β + β z ˇ ) [ 1 F * ( ω ) ] } + ω Ω 0 B ( z ˇ )
where B ( z ˇ ) = η η + α ω ( 1 z ˇ )   ( 1 A w * ( D 2 ( z ˇ ) ) ) ,
Ω ( 0 , z ˇ ) = ( γ + γ ¯ z ˇ ) Υ ( 0 , z ˇ ) A * ( D 1 ( z ˇ ) ) + ( γ + γ ¯ z ˇ ) A w * ( D 2 ( z ˇ ) ) Ψ w ( 0 , z ˇ ) ω Ω 0
Combining ( 26 ) and ( 33 ) in ( 34 ) , we obtain
Ω ( 0 , z ˇ ) { z ˇ ( γ + γ ¯ z ˇ ) { F * ( ω ) + ( 1 β + β z ˇ ) [ 1 F * ( ω ) ] } A * ( D 1 ( z ˇ ) ) } = z ˇ ω Ω 0 { ( γ + γ ¯ z ˇ ) [ B ( z ˇ ) A * ( D 1 ( z ˇ ) ) + A w * ( D 2 ( z ˇ ) ) ] 1 }
From the above equation, we all know that the most important factor in gaining Ω ( 0 , z ˇ ) is to find the zeros of p ( z ˇ ) = z ˇ ( γ + γ ¯ z ˇ ) { F * ( ω ) + ( 1 β + β z ˇ ) [ 1 F * ( ω ) ] } A * ( D 1 ( z ˇ ) ) = 0 within the scope 0 < z ˇ < 1 for the equation p ( z ˇ ) = 0 (from [19]). To this end, the next lemma is given.
Lemma 1.
If Γ < 1 , the eqn. z ˇ ( γ + γ ¯ z ˇ ) { F * ( ω ) + ( 1 β + β z ˇ ) [ 1 F * ( ω ) ] } A * ( D 1 ( z ˇ ) ) has no roots in the scope of 0 < z ˇ < 1 and has the minimal non-negative root z ˇ = 1 .
Proof. 
We merely need to prove that
v ( z ˇ ) ( γ + γ ¯ z ˇ ) { F * ( ω ) + ( 1 β + β z ˇ ) [ 1 F * ( ω ) ] } A * ( D 1 ( z ˇ ) )
is a PGF of the no. of consumers that enter in the system. Indicate V as the time interval between the epoch when a service completion happens, departing from the orbit non-empty, and N V as the no. of main consumers that enters during V and define
V j ( t ) d t = P ( t < V < t + d t , M ( V ) = j ) .
Then,
v j ( t ) d t = e ω t x ( t ) * d j ( t ) + ( 1 σ j , 0 ) ω e ω t ( 1 F ( t ) ) * d j 1 ( t ) , j = 0 , 1 , 2 . . .
where * denotes convolution, γ(t) represents the PDF of inter-retrial times, c ( t ) represent the PDF of regular service durations and d j ( t ) d t = e ω t ( ω t ) j j ! c ( t ) . Denoted by M V ( z ˇ ) the PGF of M V , We have that
M V ( z ˇ ) = j = 0 z ˇ j 0 v j ( t ) d t = j = 0 z ˇ j 0 e ω t x ( t ) * d j ( t ) + ( 1 σ j , 0 ) ω e ω t ( 1 F ( t ) ) d j 1 ( t ) = ( γ + γ ¯ z ˇ ) { F * ( ω ) + ( 1 β + β z ˇ ) [ 1 F * ( ω ) ] } A * ( D 1 ( z ˇ ) ) = v ( z ˇ ) ,
which demonstrates the desired outcome that v ( z ˇ ) ( γ + γ ¯ z ˇ ) { F * ( ω ) + ( 1 β + β z ˇ ) [ 1 F * ( ω ) ] } A * ( D 1 ( z ˇ ) ) is specifically a PGF. From premise Γ < 1 , we have E M v = d d z ˇ v ( z ˇ ) | z ˇ = 1 = 1 { β ( 1 F * ( ω ) ) α ω [ 1 + ξ ( q 1 + h 1 ) ] E ( A ) + γ ¯ } < 1 and the convex function v ( z ˇ ) is a monotonically increasing function of z ˇ for 0 z ˇ 1 , and v ( 0 ) = P ( M V = 0 ) < 1 ,   v ( 1 ) = 1 . Thus, we can simply verify Lemma 1’s predicted conclusion.
Then, for Γ < 1 ,   z ˇ ( γ + γ ¯ z ˇ ) { F * ( ω ) + ( 1 β + β z ˇ ) [ 1 F * ( ω ) ] } A * ( D 1 ( z ˇ ) ) never fades in the range 0 < z ˇ < 1 .
From ( 35 ) , we obtain
Ω ( 0 , z ˇ ) = N e ( z ˇ ) D e ( z ˇ )
N e ( z ˇ ) = z ˇ ω Ω 0 { ( γ + γ ¯ z ˇ ) [ B ( z ˇ ) A * ( D 1 ( z ˇ ) ) + A w * ( D 2 ( z ˇ ) ) ] 1 } D e ( z ˇ ) = z ˇ ( γ + γ ¯ z ˇ ) { F * ( ω ) + ( 1 β + β z ˇ ) [ 1 F * ( ω ) ] } A * ( D 1 ( z ˇ ) )
Utilising an Equations (36) in (33), we obtain
Υ ( 0 , z ˇ ) = ω Ω 0 D e ( z ˇ ) { z ˇ B ( z ˇ ) + [ ( γ + γ ¯ z ˇ ) A w * ( D 2 ( z ˇ ) ) 1 ] [ F * ( ω ) + ( 1 β + β z ˇ ) [ 1 F * ( ω ) ] ] }
Thus, by substituting ( 36 ) & ( 37 ) in ( 28 ) & ( 29 ) we obtain the limiting PGFs Ω ( x , z ˇ ) ,   Υ ( x , z ˇ ) , and also by using ( 25 ) ( 27 ) & ( 37 ) in ( 30 ) ( 31 ) we obtain the limiting PGFs Ψ w ( x , z ˇ ) , Φ ( x , z ˇ ) and Π ( x , z ˇ ) . Following that, we want to look at the marginal orbit size discrepancy caused by the server’s current system state, which is investigated in the following theorem. □
Theorem 2.
Under the stability condition Γ < 1 , the stationary dist., of the no. of consumers in the orbit when the server is empty, regular busy, low speed service is given by
Ω ( z ˇ ) = N e ( z ˇ ) D e ( z ˇ )
N e ( z ˇ ) = z ˇ Ω 0 ( 1 F * ( ω ) ) { ( γ + γ ¯ z ˇ ) [ B ( z ˇ ) A * ( D 1 ( z ˇ ) ) + A w * ( D 2 ( z ˇ ) ) ] 1 } D e ( z ˇ ) = z ˇ ( γ + γ ¯ z ˇ ) { F * ( ω ) + ( 1 β + β z ˇ ) [ 1 F * ( ω ) ] } A * ( D 1 ( z ˇ ) )
Υ ( z ˇ ) = ω Ω 0 ( 1 A * ( D 1 ( z ˇ ) ) ) D 1 ( z ˇ ) D r ( z ˇ ) z ˇ B ( z ˇ ) + [ ( γ + γ ¯ z ˇ ) A w * ( D 2 ( z ˇ ) ) 1 ] [ F * ( ω ) + ( 1 β + β z ˇ ) [ 1 F * ( ω ) ] ]
Ψ w ( z ˇ ) = ω Ω 0 D 2 ( z ˇ ) ( 1 A w * ( D 2 ( z ˇ ) ) )
Φ ( z ˇ ) = ω ξ Ω 0 ( 1 A * ( D 1 ( z ˇ ) ) ) ( 1 Q * ( D ( z ˇ ) ) ) ) D ( z ˇ ) D 1 ( z ˇ ) D r ( z ˇ ) z ˇ B ( z ˇ ) + [ ( γ + γ ¯ z ˇ ) A w * ( D 2 ( z ˇ ) ) 1 ] [ F * ( ω ) + ( 1 β + β z ˇ ) [ 1 F * ( ω ) ] ]
Π ( z ˇ ) = ω ξ Ω 0 ( 1 A * ( D 1 ( z ˇ ) ) ) ( 1 H * ( D ( z ˇ ) ) ) ( Q * ( D z ( z ˇ ) ) ) D ( z ˇ ) D 1 ( z ˇ ) D r ( z ˇ ) z ˇ B ( z ˇ ) + [ ( γ + γ ¯ z ˇ ) A w * ( D 2 ( z ˇ ) ) 1 ] [ F * ( ω ) + ( 1 β + β z ˇ ) [ 1 F * ( ω ) ] ]
where
Ω 0 = 1 β ( 1 F * ( ω ) ) + α ω [ 1 + ξ ( q 1 + h 1 ) ] E ( A ) γ ¯ 1 β ( 1 F * ( ω ) ) [ 1 + ω η ( 1 A w * ( η ) ] + ω η ( 1 A w * ( η ) ) { α ( 1 F * ( ω ) ) + α ω ( 1 + ξ ( q 1 + h 1 ) E ( A ) γ ¯ + 1 ) } F * ( ω ) [ γ ¯ α ω ( 1 + ξ ( q 1 + h 1 ) E ( A ) ) ] + A w * ( η ) ( 1 F * ( ω ) ( 1 + ξ ( q 1 + h 1 ) E ( A ) ) ω E ( A ) ( 1 + ξ E ( Q ) ( 1 α ω E ( H ) ) ) { γ ¯ + ( A w * ( η ) ) [ β ( 1 F * ( ω ) ) α ω η ] A w * ( η ) + 1 }
Proof. 
Taking the Eqations (28)–(32) and integrating them with regard to x and determine the partial PGFs as Ω ( z ˇ ) = 0 Ω ( x , z ˇ ) d x ,   Υ ( z ˇ ) = 0 Υ ( x , z ˇ ) d x ,   Ψ w ( z ˇ ) = 0 Ψ w ( x , z ˇ ) d x ,   Φ ( z ˇ ) = 0 Φ ( x , z ˇ ) d x ,   Π ( z ˇ ) = 0 Π ( x , z ˇ ) d x . Therefore, we can finally determine the prob.that the server is free when there is no consumer in the orbit using the normalisation condition ( Φ 0 ) by setting, z ˇ = 1 in (38)–(42) and by utilizing the rule of l’Hospital’s whenever needed, we obtain Ω 0 + Ω ( 1 ) + Υ ( 1 ) + Ψ w ( 1 ) + Φ ( 1 ) + Π ( 1 ) = 1 .
Theorem 3.
Under the stability constraint Γ < 1 , the PGF of the no. of consumers in the system and the orbit size dist., are given by
K s ( z ˇ ) = N e s ( z ˇ ) D e s ( z ˇ )
N e s ( z ˇ ) = Ω 0 { D ( z ˇ ) { { z ˇ ( γ + γ ¯ z ˇ ) { F * ( ω ) + ( 1 β + β z ˇ ) [ 1 F * ( ω ) ] } A * ( D 1 ( z ˇ ) ) [ 1 + ω D 2 ( z ˇ ) ( 1 A w * ( D z ( z ˇ ) ) ) ] } + z ˇ ( 1 F * ( ω ) ) { ( γ + γ ¯ z ˇ ) [ B ( z ˇ ) A * ( D 1 ( z ˇ ) ) + A w * ( D 2 ( z ˇ ) ) ] 1 } } + z ˇ ω ( 1 A * ( D 1 ( z ˇ ) ) ) { z ˇ B ( z ˇ ) + [ ( γ + γ ¯ z ˇ ) A w * ( D 2 ( z ˇ ) ) 1 ] [ F * ( ω ) + ( 1 β + β z ˇ ) [ 1 F * ( ω ) ] ] } } D e s ( z ˇ ) = D ( z ˇ ) { z ˇ ( γ + γ ¯ z ˇ ) { F * ( ω ) + ( 1 β + β z ˇ ) [ 1 F * ( ω ) ] } A * ( D 1 ( z ˇ ) ) }
K 0 ( z ˇ ) = N e 0 ( z ˇ ) D e s ( z ˇ )
N e 0 ( z ˇ ) = Ω 0 { D ( z ˇ ) { { z ˇ ( γ + γ ¯ z ˇ ) { F * ( ω ) + ( 1 β + β z ˇ ) [ 1 F * ( ω ) ] } A * ( D 1 ( z ˇ ) ) [ 1 + ω D 2 ( z ˇ ) ( 1 A w * ( D z ( z ˇ ) ) ) ] } + z ˇ ( 1 F * ( ω ) ) { ( γ + γ ¯ z ˇ ) [ B ( z ˇ ) A * ( D 1 ( z ˇ ) ) + A w * ( D 2 ( z ˇ ) ) ] 1 } } + ω ( 1 A * ( D 1 ( z ˇ ) ) ) { z ˇ B ( z ˇ ) + [ ( γ + γ ¯ z ˇ ) A w * ( D 2 ( z ˇ ) ) 1 ] [ F * ( ω ) + ( 1 β + β z ˇ ) [ 1 F * ( ω ) ] ] } }
where Ω 0 is denoted by Equation (43).
Proof. 
The PGF of the no.of consumer in the system ( K s ( z ˇ ) ) and in the orbit ( K 0 ( z ˇ ) ) is determined by using K s ( z ) = Ω 0 + Ω ( z ˇ ) + Υ ( z ˇ ) + Ψ w ( z ˇ ) + Φ ( z ˇ ) + Π ( z ˇ ) . When the Equations (38)–(43) are substituted in the previous findings, the Equations ( 44 ) and ( 45 ) may be calculated directly. □

4. System Performance Measures

In this section, different system states are used to derive a variety of pertinent system probabilities, system efficiency metrics, and the model’s mean busy time and mean busy cycle.

4.1. System State Probabilities

We obtain the following results using Equations (38)–(42) giving z ˇ 1 and utilising l’Hospital’s rule unless possible.
(i) Let Ψ be the steady-state prob. of the server being free for the duration of the retrial,
Ω = Ω ( 1 ) = Ω 0 ( 1 F * ( ω ) ) γ ¯ + ( 1 A w * ( η ) ) [ α ω η α ω ( 1 + ξ ( q 1 + h 1 ) ) E ( A ) ] 1 β ( 1 F * ( ω ) ) + α ω [ 1 + ξ ( q 1 + h 1 ) ] E ( A ) γ ¯
(ii) Let Υ be the steady-state prob. that the server is busy,
Υ = Υ ( 1 ) = ω Ω 0 E ( A ) A w * ( η ) γ ¯ ( A w * ( η ) 1 ) [ β ( 1 F * ( ω ) ) α ω η ] 1 1 β ( 1 F * ( ω ) ) + α ω [ 1 + ξ ( q 1 + h 1 ) ] E ( A ) γ ¯
(iii) Let Ψ w be the steady-state prob. that the server is on working vacation,
Ψ w = Ψ w ( 1 ) = ω Ω 0 η [ 1 A w * ( η ) ]
(iv) Let Φ be the steady-state prob. that the server is under delaying repair,
Φ = Φ ( 1 ) = ω Ω 0 ξ E ( A ) E ( Q ) γ ¯ A w * ( η ) + ( A w * ( η ) 1 ) [ β ( 1 F * ( ω ) ) α ω η ] + 1 1 β ( 1 F * ( ω ) ) + α ω [ 1 + ξ ( q 1 + h 1 ) ] E ( A ) γ ¯
(v) Let Π be the steady-state prob. that the server is under repair,
Π = Π ( 1 ) = α ( ω ) 2 Ω 0 E ( A ) E ( H ) E ( Q ) A w * ( η ) γ ¯ ( A w * ( η ) 1 ) [ β ( 1 F * ( ω ) ) α ω η ] 1 1 β ( 1 F * ( ω ) ) + α ω [ 1 + ξ ( q 1 + h 1 ) ] E ( A ) γ ¯

4.2. Average Size of A System and the Size of Its Orbit

When the system is in a steady state,
(i) With regard to z ˇ , by differentiating ( 45 ) and giving z ˇ = 1 yields the expected no. of consumers in the orbit ( L q )
L q = K 0 ( 1 ) = lim z ˇ 1 d d z ˇ K 0 ( z ˇ ) = Ω 0 N e q ( 1 ) D e q ( 1 ) D e q ( 1 ) N e q ( 1 ) 3 ( D e q ( 1 ) ) 2
N e q ( 1 ) = 2 α ω { [ 1 + ω η ( 1 A w * ( η ) ) ] [ 1 β ( 1 F * ( ω ) ) + α ω [ 1 + ξ ( q 1 + h 1 ) ] E ( A ) γ ¯ ] + ( 1 F * ( ω ) ) [ γ ¯ + ( 1 A w * ( η ) ) [ α ω η α ω ( 1 + ξ ( q 1 + h 1 ) ) E ( A ) ] ] ω ( 1 + ξ ( q 1 + h 1 ) ) E ( A ) [ γ ¯ A w * ( η ) + ( A w * ( η ) 1 ) [ β ( 1 F * ( ω ) ) α ω η ] + 1 ] } D e q ( 1 ) = 2 α ω { 1 β ( 1 F * ( ω ) ) + α ω [ 1 + ξ ( q 1 + h 1 ) ] E ( A ) γ ¯ }
N e q ( 1 ) = 6 α ω [ ω η 2 ( η E ( A w ) ) A w * ( η ) + 1 ] { 1 β ( 1 F * ( ω ) ) + α ω [ 1 + ξ ( q 1 + h 1 ) ] E ( A ) γ ¯ } + D r ( 1 ) [ 1 + ω η ( 1 A w * ( η ) ) ] 3 α ω β ( 1 F * ( ω ) ) { 2 [ γ ¯ + ( 1 A w * ( η ) ) [ α ω η α ω ( 1 + ξ ( q 1 + h 1 ) ) E ( A ) ] ] + 2 γ ¯ [ α ω η α ω ( 1 + ξ ( q 1 + h 1 ) ) E ( A ) ] + [ α ω η ( η E ( A w ) ) A w * ( η ) + 1 ] ( γ ¯ 2 α ω [ 1 + ξ ( q 1 + h 1 ) ] E ( A ) ) + ( 1 A w * ( η ) ) [ τ + ( α ω [ 1 + ξ ( q 1 + h 1 ) ] E ( A ) ) ] 2 + ( α ω ) 2 E ( A w 2 ) 2 α ω γ ¯ E ( A w ) + B ( 1 ) + 3 ω { { ( α ω [ 1 + ξ ( q 1 + h 1 ) ] E ( A ) ) ( [ 2 α ω η [ η E ( A w ) A w * ( η ) + 1 ] ] + B ( 1 ) + 2 β ( 1 F * ( ω ) ) [ γ ¯ α ω E ( A w ) ] 2 γ ¯ α ω E ( A w ) + ( α ω ) 2 E ( A w ) 2 ) } + τ { [ γ ¯ A w * ( η ) + ( A w * ( η ) 1 ) [ β ( 1 F * ( ω ) ) α ω η ] + 1 ] } } D e q ( 1 ) = 3 α ω { 2 γ ¯ α ω ( 1 + ξ ( q 1 + h 1 ) ) E ( A ) 2 γ ¯ β ( 1 F * ( ω ) ) + 2 α ω β ( 1 F * ( ω ) ) ( 1 + ξ ( q 1 + h 1 ) ) E ( A ) + τ }
where τ = α ω { α ω ( 1 + ξ ( q 1 + h 1 ) ) 2 E ( A 2 ) + α ω ξ ( q 1 2 + h 1 2 + 2 q 1 h 1 ) E ( A ) +   ( 1 + ξ ( q 1 + h 1 ) ) 2 E ( A 2 ) }
B ( 1 ) = ( α ω ) 2 η 3 { ( 1 + η α ω η 2 ) E ( A w ) η E w * ( η ) + α ω ( 1 A w * ( η ) ) }
(ii) With regard to z ˇ , by differentiating ( 44 ) and giving z ˇ = 1 yields the expected no.of consumers in the system ( L s )
L s = K s ( 1 ) = lim z ˇ 1 d d z ˇ K s ( z ˇ ) = Ω 0 N e s ( 1 ) D e q ( 1 ) D e q ( 1 ) N e q ( 1 ) 3 ( D e q ( 1 ) ) 2
N e s ( 1 ) = N r q ( 1 ) + 6 α ω [ 1 + ξ ( q 1 + h 1 ) ] E ( A ) { γ ¯ A w * ( η ) + ( A w * ( η ) 1 ) [ β ( 1 F * ( ω ) ) α ω η ] + 1 }

4.3. Average Busy Period And The Busy Cycle

Under steady-state circumstances, let A ( T y ) and A ( T z ) be the predicted lengths of the busy period and busy cycle, respectively. The conclusions are drawn directly from the reasoning of an alternate renewal process [19], which results to
Ω 0 = A ( T 0 ) A ( T y ) + A ( T 0 ) ; A ( T y ) = 1 ω 1 Ω 0 1 ; A ( T z ) = 1 ϑ Ω 0 = A ( T 0 ) + A ( T y ) .
where T 0 is the time spent in the empty state of the system. Because there is an exponential difference in time between two consumers’ arrivals, with parameter ω , we have A ( T 0 ) = ( 1 / ω ) . We can retrieve ( 43 ) by inserting it into ( 48 ) , and, using the above findings, we obtain
A ( T y ) = 1 ω × 1 β ( 1 F * ( ω ) ) [ 1 + ω η ( 1 A w * ( η ) ] + ω η ( 1 A w * ( η ) ) { α ( 1 F * ( ω ) ) + α ω ( 1 + ξ ( q 1 + h 1 ) E ( A ) γ ¯ + 1 ) } F * ( ω ) [ γ ¯ α ω ( 1 + ξ ( q 1 + h 1 ) E ( A ) ) ] + A w * ( η ) ( 1 F * ( ω ) ( 1 + ξ ( q 1 + h 1 ) E ( A ) ) ω E ( A ) ( 1 + ξ E ( Q ) ( 1 α ω E ( H ) ) ) { γ ¯ + ( A w * ( η ) ) [ β ( 1 F * ( ω ) ) α ω η ] A w * ( η ) + 1 } 1 β ( 1 F * ( ω ) ) + α ω [ 1 + ξ ( q 1 + h 1 ) ] E ( A ) γ ¯ 1
A ( T z ˇ ) = 1 ω × 1 β ( 1 F * ( ω ) ) [ 1 + ω η ( 1 A w * ( η ) ] + ω η ( 1 A w * ( η ) ) { α ( 1 F * ( ω ) ) + α ω ( 1 + ξ ( q 1 + h 1 ) E ( A ) γ ¯ + 1 ) } F * ( ω ) [ γ ¯ α ω ( 1 + ξ ( q 1 + h 1 ) E ( A ) ) ] + A w * ( η ) ( 1 F * ( ω ) ( 1 + ξ ( q 1 + h 1 ) E ( A ) ) ω E ( A ) ( 1 + ξ E ( Q ) ( 1 α ω E ( H ) ) ) { γ ¯ + ( A w * ( η ) ) [ β ( 1 F * ( ω ) ) α ω η ] A w * ( η ) + 1 } 1 β ( 1 F * ( ω ) ) + α ω [ 1 + ξ ( q 1 + h 1 ) ] E ( A ) γ ¯

5. Special Cases

We look at some concrete applications of our approach that are in accord with the present literature in this segment.
Case (i): No balking, No reneging and No feedback
Let α = β = 1 and γ ¯ = 0 . Our model reduces to an M / G / 1 RQ with WVs. Here, the results coincides with Gao et al. [19].
K s ( z ˇ ) = Ω 0 N e s ( z ˇ ) D e s ( z ˇ ) N e s ( z ˇ ) = ω ( 1 z ˇ ) { { { z ˇ [ A * ( ω ( 1 z ˇ ) + + ξ + ξ Q * ( ω ( 1 z ˇ ) ) H * ( ω ( 1 z ˇ ) ) ) ) ( F * ( ω ) + z ˇ ( 1 F * ( ω ) ) ) ] } [ 1 + ω ( 1 A w * ( η + ω ( 1 z ˇ ) ) ) η + ω ( 1 z ˇ ) ] } + z ˇ ( 1 F * ( ω ) ) { [ η ( 1 A w * ( η + ω ( 1 z ˇ ) ) ) η + ω ( 1 z ˇ ) ] [ A * ( ω ( 1 z ˇ ) + ξ + ξ Q * ( ω ( 1 z ˇ ) ) H * ( ω ( 1 z ˇ ) ) ) + A w * ( η + ω ( 1 z ˇ ) ) 1 ] } } + z ˇ ω ( 1 A * ( ω ( 1 z ˇ ) + ξ + ξ Q * ( ω ( 1 z ˇ ) ) H * ( ω ( 1 z ˇ ) ) ) ) { [ A w * ( η + ω ( 1 z ˇ ) ) 1 ] [ F * ( ω ) + z ˇ ( 1 F * ( ω ) ) ] } D e s ( z ˇ ) = ω ( 1 z ˇ ) { z ˇ [ A * ( ω ( 1 z ˇ ) + ξ + ξ Q * ( ω ( 1 z ˇ ) ) H * ( ω ( 1 z ˇ ) ) ) ( F * ( ω ) + z ˇ ( 1 F * ( ω ) ) ) ] }
Case (ii): No balking, No reneging, No vacation and No delaying repair
Let α = β = 1 ; and η = ξ = 0 . Our model reduces to an M / G / 1 RQ with general retrial times. Here, the results coincides with Gomez-Corral [20].
K s ( z ˇ ) = Ω 0 N e s ( z ˇ ) D e s ( z ˇ ) N e s ( z ˇ ) = ω ( 1 z ˇ ) { { { z ˇ [ ( γ + γ ¯ z ˇ ) A * ( ω ( 1 z ˇ ) ) ( F * ( ω ) + z ˇ ( 1 F * ( ω ) ) ) ] } [ 1 + ( 1 A w * ( ω ( 1 z ˇ ) ) ) ( 1 z ˇ ) ] } + z ˇ ( 1 F * ( ω ) ) [ ( γ + γ ¯ z ˇ ) A w * ( ω ( 1 z ˇ ) ) 1 ] } + z ˇ ω ( 1 A * ( ω ( 1 z ˇ ) ) ) { [ ( γ + γ ¯ z ˇ ) A w * ( ω ( 1 z ˇ ) ) 1 ] [ F * ( ω ) + z ˇ ( 1 F * ( ω ) ) ] } D e s ( z ˇ ) = ω ( 1 z ˇ ) { z ˇ [ ( γ + γ ¯ z ˇ ) A * ( ω ( 1 z ˇ ) ) ( F * ( ω ) + z ˇ ( 1 F * ( ω ) ) ) ] } where , Ω 0 = F * ( ω ) + ω E ( A ) γ ¯ 1 F * ( ω ) ( γ ¯ ω E ( A ) ) γ ¯ ω E ( A )
Case (iii): No balking, No reneging, No retrial, No feedback and No delaying repair
Let α = β = 1 , F * ( ω ) 1 and γ = ξ = 0 . Our model reduces to an M / G / 1 queue with WVs. Here, the results coincides with Zhang and Hou [21].
K s ( z ˇ ) = Ω 0 N e s ( z ˇ ) D e s ( z ˇ ) N e s ( z ˇ ) = ω ( 1 z ˇ ) { [ z ˇ A * ( ω ( 1 z ˇ ) ) ] [ 1 + ω ( 1 A w * ( η + ω ( 1 z ˇ ) ) ) η + ω ( 1 z ˇ ) ] } + z ˇ ω ( 1 A * ( ω ( 1 z ˇ ) ) ) { z ˇ η ( 1 A w * ( η + ω ( 1 z ˇ ) ) ) η + ω ( 1 z ˇ ) + [ A w * ( η + ω ( 1 z ) ) ) 1 ] } D e s ( z ˇ ) = ω ( 1 z ˇ ) { z ˇ A * ( ω ( 1 z ˇ ) ) } where , Ω 0 = 1 + α ω E ( A ) 1 ω η ( 1 A w * ( η ) ) ( α ω E ( A ) γ ¯ + 1 ) ω E ( A ) { γ ¯ α ω η ( A w * ( η ) 1 ) A w * ( η ) + 1 } γ ¯ + α ω E ( A )

6. Numerical Results

In this section, we use MATLAB to demonstrate the numerous settings on system behaviour measurements. We look into retrial times, service times, slower pace service times, vacation periods, delayed repair and repair times, which are exponentially distributed. The numerical measurements are picked at randomly to fulfil the stability criterion. The estimated values of our model’s many characteristics, such as the probability that the server is idle ( Ω 0 ) , the average queue size ( L q ) , the probability that the server is idle during retrial time ( Ω ( 1 ) ) and average waiting time in the queue ( W q ) , are presented in the tables below.
Table 1 clearly displays that as the retrial rate f escalates, L q , Ω ( 1 ) ,   W q decline.
Table 2 displays that as the feedback rate γ ¯ escalates, L q , W q , Ω 0 decline.
With the effect of the parameters α ,   β ,   ω ,   ξ ,   γ ¯ ,   η , Figure 1, Figure 2, Figure 3 and Figure 4 represents a three-dimensional graph that depict the system’s performance measures. In Figure 1, the surface displays the escalation of the retrial rate ( f ) , as ( L q ) and ( W q ) decline. In Figure 2, we found that ( L q ) and ( W q ) diminishes, while the feedback rate γ ¯ increases. Figure 3, shows that as Ω 0 and retrial rate f mounts, ( L q ) subsides. Figure 4, shows that as feedback rate γ ¯ mounts, Ω 0 and ( L q ) subsides.
We can identify the effect of characteristics on the system’s evaluation criteria using the numerical results above, and we can be certain that the results are comparable to real-world circumstances.

7. Conclusions

We examined a single-server retrial queue with delayed repair and feedback under working vacations and breakdowns in this article. The system can be stabilised if the necessary and adequate criteria is viable. The PGF of the no. of consumers in the system and its orbit are determined using the PGF approach and supplementary variable approach, whenever it is ideal, normal busy, and on slower pace service. Some numerical results are provided to investigate the impact of system parameters.The novelty of this investigation is the introduction of delaying repair, impatient consumers in the presence of retrial queues with working vacation policy. Moreover, the analytical conclusions that are proved with the aid of numerical examples may be beneficial in various real-world scenarios to construct the outcomes. Furthermore, our model can be observed as a generalised version of numerous queueing models already in existence, each of which has a variety of features and applications.

Author Contributions

Conceptualization and methodology, M.M.N.G. and I.K.; software, M.M.N.G.; validation, I.K.; formal analysis, I.K.; writing—original draft preparation, M.M.N.G.; writing—review and editing, I.K.; visualization, I.K.; supervision, I.K. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors would like to thank Vellore Institute of Technology (VIT), for financial support.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Artalejo, J.R.; Gómez-Corral, A. Limiting Distribution of the System State. In Retrial Queueing Systems: A Computational Approach; Springer: Berlin/Heidelberg, Germany, 2008; pp. 39–93. [Google Scholar]
  2. Ke, J.C.; Wu, C.H.; Zhang, Z.G. Recent developments in vacation queueing models: A short survey. Int. J. Oper. Res. 2010, 7, 3–8. [Google Scholar]
  3. Servi, L.D.; Finn, S.G. M/M/1 queues with working vacations (m/m/1/wv). Perform. Eval. 2002, 50, 41–52. [Google Scholar] [CrossRef]
  4. Wu, D.A.; Takagi, H. M/G/1 queue with multiple working vacations. Perform. Eval. 2006, 63, 654–681. [Google Scholar] [CrossRef]
  5. Wang, J.; Li, J. A single server retrial queue with general retrial times and two-phase service. J. Syst. Sci. Complex. 2009, 22, 291–302. [Google Scholar] [CrossRef]
  6. Arivudainambi, D.; Godhandaraman, P.; Rajadurai, P. Performance analysis of a single server retrial queue with working vacation. Opsearch 2014, 51, 434–462. [Google Scholar] [CrossRef]
  7. Chandrasekaran, V.; Indhira, K.; Saravanarajan, M.; Rajadurai, P. A survey on working vacation queueing models. Int. J. Pure Appl. Math 2016, 106, 33–41. [Google Scholar]
  8. Varalakshmi, M.; Chandrasekaran, V.; Saravanarajan, M. A study on M/G/1 retrial G-queue with two phases of service, immediate feedback and working vacations. In Proceedings of the IOP Conference Series: Materials Science and Engineering, Birmingham, UK, 13–15 October 2017; IOP Publishing, 2017; Volume 263, p. 042156. [Google Scholar]
  9. Revathi, C. Search of arrivals of an M/G/1 retrial queueing system with delayed repair and optional re-service using modified bernoulli vacation. J. Comput. Math. 2022, 6, 200–209. [Google Scholar]
  10. Rajadurai, P. Sensitivity analysis of an M/G/1 retrial queueing system with disaster under working vacations and working breakdowns. RAIRO-Oper. Res. 2018, 52, 35–54. [Google Scholar] [CrossRef]
  11. Boualem, M.; Bareche, A.; Cherfaoui, M. Approximate controllability of stochastic bounds of stationary distribution of an M/G/1 queue with repeated attempts and two-phase service. Int. J. Manag. Sci. Eng. Manag. 2019, 14, 79–85. [Google Scholar] [CrossRef]
  12. Choudhury, G.; Paul, M. A two phase queueing system with Bernoulli feedback. Int. J. Inf. Manag. Sci. 2005, 16, 35. [Google Scholar]
  13. Rajadurai, P.; Saravanarajan, M.; Chandrasekaran, V.; Indhira, K. An M/(G1, G2)/1 Feedback Retrial Queue with Two Phase Service, Variant Vacation Policy Under Delaying Repair for Impatient Customer. Int. J. Fuzzy Math. Arch. 2015, 6, 45–55. [Google Scholar]
  14. Rajadurai, P.; Saravanarajan, M.; Chandrasekaran, V. A study on M/G/1 feedback retrial queue with subject to server breakdown and repair under multiple working vacation policy. Alex. Eng. J. 2018, 57, 947–962. [Google Scholar] [CrossRef]
  15. Ammar, S.I.; Rajadurai, P. Performance analysis of preemptive priority retrial queueing system with disaster under working breakdown services. Symmetry 2019, 11, 419. [Google Scholar] [CrossRef]
  16. Khan, I.E.; Paramasivam, R. Reduction in Waiting Time in an M/M/1/N Encouraged Arrival Queue with Feedback, Balking and Maintaining of Reneged Customers. Symmetry 2022, 14, 1743. [Google Scholar] [CrossRef]
  17. Pakes, A.G. Some conditions for ergodicity and recurrence of Markov chains. Oper. Res. 1969, 17, 1058–1061. [Google Scholar] [CrossRef]
  18. Sennott, L.I.; Humblet, P.A.; Tweedie, R.L. Mean drifts and the non-ergodicity of Markov chains. Oper. Res. 1983, 31, 783–789. [Google Scholar] [CrossRef]
  19. Gao, S.; Wang, J.; Li, W.W. An M/G/1 retrial queue with general retrial times, working vacations and vacation interruption. Asia-Pac. J. Oper. Res. 2014, 31, 1440006. [Google Scholar] [CrossRef]
  20. Gómez-Corral, A. Stochastic analysis of a single server retrial queue with general retrial times. Nav. Res. Logist. 1999, 46, 561–581. [Google Scholar] [CrossRef]
  21. Zhang, M.; Hou, Z. M/G/1 queue with single working vacation. J. Appl. Math. Comput. 2012, 39, 221–234. [Google Scholar] [CrossRef]
Figure 1. L q , W q verses retrial rate f.
Figure 1. L q , W q verses retrial rate f.
Symmetry 14 02024 g001
Figure 2. L q ,   W q verses feedback rate γ ¯ .
Figure 2. L q ,   W q verses feedback rate γ ¯ .
Symmetry 14 02024 g002
Figure 3. L q ,   Ω 0 verses retrial rate f.
Figure 3. L q ,   Ω 0 verses retrial rate f.
Symmetry 14 02024 g003
Figure 4. L q ,   Ω 0 verses feedback rate γ ¯ .
Figure 4. L q ,   Ω 0 verses feedback rate γ ¯ .
Symmetry 14 02024 g004
Table 1. Ω 0 and L q for different Retrial rate ( f ) for the values of α = 0.3 ,   β = 0.8 ,   ω = 0.4 ,   ξ = 0.5 ,   γ ¯ = 0.5 ,   η = 0.5 .
Table 1. Ω 0 and L q for different Retrial rate ( f ) for the values of α = 0.3 ,   β = 0.8 ,   ω = 0.4 ,   ξ = 0.5 ,   γ ¯ = 0.5 ,   η = 0.5 .
Retrial Rate ( f ) Ω 0 L q Ω ( 1 ) W q
51.03730.02280.02810.0760
5.051.04420.02080.02800.0693
5.11.05100.01850.02790.0617
5.151.05790.01600.02780.5319
5.21.06470.01310.02770.0436
5.251.07160.00990.02760.0329
5.31.07840.00630.02710.0210
Table 2. Ω 0 and L q for different feedback probabilities ( γ ¯ ) for the values of α = 0.3 ,   β = 0.8 ,   ω = 0.4 ,   ξ = 0.5 ,   f = 3 ,   η = 0.5 .
Table 2. Ω 0 and L q for different feedback probabilities ( γ ¯ ) for the values of α = 0.3 ,   β = 0.8 ,   ω = 0.4 ,   ξ = 0.5 ,   f = 3 ,   η = 0.5 .
Feedback ( γ ¯ ) Ω 0 L q Ω ( 1 ) W q
0.012.84000.12720.03280.4240
0.022.79760.12080.03380.4028
0.032.75520.11470.03500.3825
0.042.71290.10900.03610.3631
0.052.67050.10340.03710.3446
0.062.62810.09810.03810.3269
0.072.58570.09300.03910.3100
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

GnanaSekar, M.M.N.; Kandaiyan, I. Analysis of an M/G/1 Retrial Queue with Delayed Repair and Feedback under Working Vacation policy with Impatient Customers. Symmetry 2022, 14, 2024. https://doi.org/10.3390/sym14102024

AMA Style

GnanaSekar MMN, Kandaiyan I. Analysis of an M/G/1 Retrial Queue with Delayed Repair and Feedback under Working Vacation policy with Impatient Customers. Symmetry. 2022; 14(10):2024. https://doi.org/10.3390/sym14102024

Chicago/Turabian Style

GnanaSekar, Micheal Mathavavisakan Nicholas, and Indhira Kandaiyan. 2022. "Analysis of an M/G/1 Retrial Queue with Delayed Repair and Feedback under Working Vacation policy with Impatient Customers" Symmetry 14, no. 10: 2024. https://doi.org/10.3390/sym14102024

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