7.2
CiteScore
3.7
Impact Factor
Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors
Search in posts
Search in pages
Filter by Categories
ABUNDANCE ESTIMATION IN AN ARID ENVIRONMENT
Case Study
Correspondence
Corrigendum
Editorial
Full Length Article
Invited review
Letter to the Editor
Original Article
Retraction notice
REVIEW
Review Article
SHORT COMMUNICATION
Short review
7.2
CiteScore
3.7
Impact Factor
Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors
Search in posts
Search in pages
Filter by Categories
ABUNDANCE ESTIMATION IN AN ARID ENVIRONMENT
Case Study
Correspondence
Corrigendum
Editorial
Full Length Article
Invited review
Letter to the Editor
Original Article
Retraction notice
REVIEW
Review Article
SHORT COMMUNICATION
Short review
View/Download PDF

Translate this page into:

01 2023
:36;
103007
doi:
10.1016/j.jksus.2023.103007

A single server Non-Markovian with non-compulsory re-service and balking under Modified Bernoulli Vacation

Department of Mathematics, School of Advanced Sciences, Vellore Institute of Technology, Vellore, Tamilnadu, India

⁎Corresponding author. nandhini.s@vit.ac.in (Nandhini S.)

Disclaimer:
This article was originally published by Elsevier and was migrated to Scientific Scholar after the change of Publisher.

Abstract

In this paper, a single-server queue with Modified Bernoulli Vacation(MBV) has been considered. The server provides two kinds of services, Compulsory Service (CR) and Non-Compulsory Re-service (NCR). Any new customer who arrives and finds the server engaged, on breakdown, or on vacation will be placed on an orbit; or else if he finds the server free, he enters the service immediately. The server takes a vacation as soon as the orbit is empty at the usual service completion moment. The dissatisfied customer may re-enter the orbit after usual service is complete to receive another service. We have used SVM (Supplementary Variable Method) to derive PGF (Probability Generating Function) for the system. In order to demonstrate the influence that the system parameters have, numerical examples are discussed.

Keywords

Retry queues
Non-compulsory re-service
Modified Bernoulli vacation
Breakdown
1

1 Introduction

Retrial queuing is a queueing paradigm in which a randomly arriving customer observes that the server is busy and starts to make repetitive client requests called as orbit. An impatient customer is one who enters the queue in a reneging or balking state, becomes impatient rapidly, and may depart the system before the service is completed. In this work, we have derived the steady state equations for the case of impatient customers in retrial queuing model and derived some significant performance metrics of the model.

The review of the literature on retry queue can be found in Falin and Templeton (1997). In Gomez-Corral (1999) a Non-Markovian queueing system with generic retrial times has been analyzed. A two phase service pattern with retrial queuing has been presented in Artalejo and Choudhury (2004). Phases 1 and 2 of the service are taken into consideration, and significant performance metrics are derived. Under the Bernoulli schedule, a single-server queue with phase1 and phase2 service and a MBV is discussed in Jain and Agarwal (2010). A hybrid queueing model with weighted fair queueing and differential packet dropping is used in congestion control in networks (Nandhini, 2013). In a recent study in Ke et al. (2010), a wide range of vacation rules were examined. Doshi (1986) has discussed significant concepts on single-server queues with vacations. An M / G / 1 retrial queue in which the customer chooses for second phase multi-optional service (SMOS) has been discussed in Wang and Li (2009). In Madheswari et al. (2019), the authors have investigated a single server retrial queue of two phases of service that operates under the Bernoulli vacation in which they consider the second phase as optional. Retrial queue with two phases of service, balking, vacations (Bernoulli and Modified Bernoulli), feedback has been investigated in Arivudainambi and Godhandaraman (2012), Choudhury and Madan (2005), Choudhury and Deka (2008).

The retrying client has a significant impact on the dynamics of coupled switching in ATM centers, which is an extremely important factor to consider. The intervals between subsequent retrials, however, rely less on the quantity of customers who have attempted it in a certain service settings. In these circumstances, it is assumed that only the customer who is at the head of the orbit is permitted for retrial service, as in Dimitriou (2018), or alternatively, after a service has been provided, the server may seek customers from the orbit. The authors of a recent study in Legros (2021, 2022) examined the admission control problem with state-dependent arrivals and proposed a system sizing algorithm and has shown that the wait time can be reduced by taking use of the latest recent event. There have also been other single-server queueing models proposed in Boxma and Vlasiou (2007), Kerner (2008) where the arrival or service rates depend on the customer’s wait time while getting service or standing in the queue.

Analysis has been carried out on an SSMQS (single server Markovian queueing system) (Bouchentouf et al., 2021), which included balking, Bernoulli feedback and its server states dependent on reneging, as well as retention of reneged consumers under a variation multiple policies (vacation). In Boussaha et al. (2022), study has been performed on a single server feedback retrial queueing system (SSFRQM) using orbital search customers. Balking consumers, UDRQ (Uncertain Discrete-time Retrial Queue) with PPP (Probabilistic Preemptive Priority)and RRT (Replacements of Repair Times) were recently examined in Lan and Tang (2020).

Retrial models appear naturally in HMS (Healthcare Management System), WSN (Wireless Sensor Network), CTN (Communication and Transportation Networks), IOT (Internet of Things), TS (Task Scheduling), TE (Traffic Engineering), TCC (Telecommunication and Call Centre) and ICS (Inventory Control System).

Retrial queueing model with Bernoulli vacation is our primary focus of interest. Past literatures were dealing with a Single-Server Retrial Queue Model (SSRQM), with two stages of service and Bernoulli vacation. This paper presents an advanced SSRQM which comprises of two phases of services (CR and NCR) under Modified Bernoulli Vacation (MBV) added with balking state also. The uniqueness of our approach also includes the consideration of repair and breakdown under MBV. Prominent performance measures has been derived for our model and numerical analysis and graphical representation of the model has also been presented.

The structure of this paper is structured as follows. In Section 2, we present the mathematical description of the system under consideration. In Section 3 steady state equations and PGF of system size, orbit size are presented. Several system performance measures are discussed in Section 4. The special cases of the proposed model is covered in Section 5. Numerical Illustrations are discussed in Section 6 and Section 7 conclusion and future work is presented.

2

2 Mathematical description

The service discipline for new arriving customers is FIFO. We assume a single Poisson arrival with λ as the mean rate. The retrial-service is generally distributed with its distribution function ϖ ( ħ l ) , df(density function) κ ( ħ l ) , and LST (Laplace–Stieltjes transform) ϖ ( ħ l ) . The service time distribution function U 1 ( ȷ q ) for compulsory service and U 2 ( ȷ q ) for non-compulsory (re-service), LST U 1 ( ħ l ) , U 2 ( ħ l ) , its first two moments are S i 1 ̇ ̄ ̄ and S i 2 ̇ ̄ ̄ respectively i = 1 , 2 . After completion of each service, the server takes MBV, with its distribution function B ( ȷ q ) and LST B ( ħ l ) its first two moments v ̄ ̄ ( 1 ) , v ̄ ̄ ( 2 ) .

An entering customer is served by a single server on a FIFO basis. When the service is finished, some of the approaching customers may opt to NCR with probability r 1 or depart with probability r 1 ̄ = 1 r 1 . Balking may occur whenever a customer enters the service area with a probability 1 b ̄ ̄ and the customer exits with probability b ̄ ̄ . The server waits with probability 1 c and goes on vacation with probability c if no customers are present at the end of each service.

Both the services, vacation, delay time and repair time follows general distribution.

Let I ( ȷ q ) = 0 server is inactive 1 server is engaged 2 server is on non-compulsory re-service 3 server is delaying repair on compulsory service 4 server is delaying repair on non-compulsory re-service 5 server is repair on compulsory service 6 server is repair on non-compulsory re-service 7 server is on vacation

We assume that breakdown of the server for both the services are according to Poisson stream with mean breakdown rates γ 1 and γ 2 . The delay time distribution function W i ( ȷ q ) and LST W i ( ħ m ) , respectively and its moments are g i 1 ̇ ̄ ̄ , g i 2 ̇ ̄ ̄ , i = 1 , 2 , and the repair time of distribution function are E i ( ȷ q ) and LST E i ( ħ m ) , respectively and its moments are f i 1 ̇ ̄ ̄ , f i 2 ̇ ̄ ̄ .

Let us assume ϖ ( 0 ) = 0 , ϖ ( ) = 1 , U 1 ( 0 ) = 0 , U 1 ( ) = 1 , U 2 ( 0 ) = 0 , U 2 ( ) = 1 , B ( 0 ) = 0 , B ( ) = 1 are continuous at ħ l = 0 and W i ( 0 ) = 0 , W i ( ) = 1 , E i ( 0 ) = 0 , E i ( ) = 1 are continuous at ħ m = 0 .

Hazard rates of the conditions(retrial, services,vacation, repairs) are κ ( ħ l ) d ħ l = d ϖ ( ħ l ) 1 ϖ ( ħ l ) (repeated attempts) η 1 ( ħ l ) d ħ l = d U 1 ( ħ l ) 1 U 1 ( ħ l ) (compulsory service) η 2 ( ħ l ) d ħ l = d U 2 ( ħ l ) 1 U 2 ( ħ l ) (non-compulsory re-service) ν ( ħ l ) d ħ l = d B ( ħ l ) 1 B ( ħ l ) (vacation) β i ( ħ m ) d ħ m = d W i ( ħ m ) 1 W j ( ħ m ) , i = 1 , 2 (delaying repair on both services) ω i ( ħ m ) d ħ m = d E i ( ħ m ) 1 E i ( ħ m ) , i = 1 , 2 (repair on both services)

3

3 Steady state formulation and solution

In this section, we have presented the steady-state through Eqs. (1) to (16), and the boundary conditions are given in Eqs. (17) through (25). Applying PGF we arrive Eqs. (27) to (42). Finally, we have presented the probability generating function of orbit size while the server is idle, busy on CR or NCR, on MBV, under postponing repair on CR or NCR, and repair on CR or NCR accordingly.

Notations used

T 0 ( ȷ q ) The prob(probability) that the system is idle at ȷ q .

T ı p ( ħ l , ȷ q ) The prob that at ȷ q there are precisely ı p customers in the orbit with elapsed time (retrial) ħ l ,of customers going-through retrial .

φ ( 1 , ı p ) ( ħ l , ȷ q ) The prob that at ȷ q there are precisely ı p customers in orbit with elapsed time (CR) of the customer ħ l going-through service .

φ ( 2 , ı p ) ( ħ l , ȷ q ) The prob that at ȷ q there are precisely ı p customers in the orbit with elapsed time (re-service) on NCR of the customer ħ l going-through service .

Q ( 1 , ı p ) ( ħ l , ħ m , ȷ q ) The prob that at ȷ q there are precisely ı p customers in orbit with the elapsed time (CR) of test customer ħ l going-through service and the elapsed (delaying repair) of server is ħ m .

Q ( 2 , ı p ) ( ħ l , ħ m , ȷ q ) The prob that at ȷ q there are precisely ı p customers in the orbit with elapsed time NCR of the customers going-through service is ħ l and the elapsed (delaying repair) of server is ħ m .

D ( 1 , ı p ) ( ħ l , ħ m , ȷ q ) The prob that at ȷ q there are precisely ı p customers in orbit with elapsed time (CR) time of the customers going-through service is ħ l and the elapsed (repair) time of server is ħ m .

D ( 2 , ı p ) ( ħ l , ħ m , ȷ q ) The prob that at ȷ q there are precisely ı p customers in the orbit with the elapsed time (NCR) of the test customer going-through service is ħ l and the elapsed (repair) time of server is ħ m .

S ı p ( ħ l , ȷ q ) The prob that at ȷ q there are precisely ı p customers in orbit with elapsed (vacation) time ħ l .

The probabilities are described as: T 0 ( ȷ q ) = T { I ( ȷ q ) = 0 , X ̇ ̄ ̄ ( ȷ q ) = 0 } T ı p ( ħ l , ȷ q ) d ħ l = P { I ( ȷ q ) = 0 , X ̇ ̄ ̄ ( ȷ q ) = ı p , ħ l ϖ 0 ( ȷ q ) < ħ l + d ħ l } , ı p 1 φ ( 1 , ı p ) ( ħ l , ȷ q ) d ħ l = P { I ( ȷ q ) = 1 , X ̇ ̄ ̄ ( ȷ q ) = ı p , ħ l U 1 0 ( t ) < ħ l + d ħ l } for ȷ q , ħ l , ı p 0 φ ( 2 , ı p ) ( ħ l , ȷ q ) d ħ l = P { I ( ȷ q ) = 2 , X ̇ ̄ ̄ ( ȷ q ) = ı p , ħ l U 2 0 ( t ) < ħ l + d ħ l } Q ( 1 , ı p ) ( ħ l , ħ m , ȷ q ) d ħ m = P { I ( ȷ q ) = 3 , X ̇ ̄ ̄ ( ȷ q ) = ı p , ħ m W 1 0 ( ȷ q ) < ħ m + d ħ m / U 1 0 ( ȷ q ) = ȷ q } for ȷ q , ħ l , ı p 0 Q ( 2 , ı p ) ( ħ l , ħ m , ȷ q ) d ħ m = P { I ( ȷ q ) = 4 , X ̇ ̄ ̄ ( ȷ q ) = ı p , ħ m W 2 0 ( ȷ q ) < ħ m + d ħ m / U 2 0 ( ȷ q ) = ħ l } D ( 1 , ı p ) ( ħ l , ħ m , ȷ q ) d ħ m = P { I ( ȷ q ) = 5 , X ̇ ̄ ̄ ( ȷ q ) = ı p , ħ m E 1 0 ( ȷ q ) < ħ m + d ħ m / U 1 0 ( ȷ q ) = ħ l } for ȷ q , ħ l , ı p 0 D ( 2 , ı p ) ( ħ l , ħ m , ȷ q ) d ħ m = P { I ( ȷ q ) = 6 , X ̇ ̄ ̄ ( ȷ q ) = ı p , ħ m E 2 0 ( t 1 ̇ ̄ ̄ ) < ħ m + d ħ m / U 2 0 ( t 1 ̇ ̄ ̄ ) = ħ l } S ı p ( ħ l , ȷ q ) d ħ l = P { I ( ȷ q ) = 7 , X ̇ ̄ ̄ ( ȷ q ) = ı p , ħ l B 0 ( ȷ q ) < ħ l + d ħ l }

The set of governing equations (behavior of dynamic system) are given by

(1)
λ b ̄ ̄ T 0 = ( 1 c ) r 1 ̄ 0 φ ( 1 , 0 ) ( ħ l ) η 1 ( ħ l ) d ħ l + 0 φ ( 2 , 0 ) ( ħ l ) η 2 ( ħ l ) d ħ l + 0 S 0 ( ħ l ) ν ( ħ l ) d ħ l
(2)
d T ı p ( ħ l ) d ħ l + ( λ + κ ( ħ l ) ) T ı p ( ħ l ) = 0
(3)
d φ 1 , 0 ( ħ l ) d ħ l + [ b ̄ ̄ λ + γ 1 + η 1 ( ħ l ) ] φ 1 , 0 ( ħ l ) = 0 β 1 ( ħ m ) Q 1 , 0 ( ħ l , ħ m ) d ħ m
(4)
d φ 1 , ı p ( ħ l ) d ħ l + [ b ̄ ̄ λ + γ 1 + η 1 ( ħ l ) ] φ 1 , ı p ( ħ l ) = b ̄ ̄ λ φ 1 , ı p 1 ( ħ l ) + 0 β 1 ( ħ m ) Q 1 , ı p ( ħ l , ħ m ) d ħ m , ı p 1
(5)
d φ 2 , 0 ( ħ l ) d ħ l + [ b ̄ ̄ λ + γ 2 + η 2 ( ħ l ) ] φ 2 , 0 ( ħ l ) = 0 β 2 ( ħ m ) Q 2 , 0 ( ħ l , ħ m ) d ħ m
(6)
d φ 2 , ı p ( ħ l ) d ħ l + [ b ̄ ̄ λ + γ 2 + η 2 ( ħ l ) ] φ 2 , ı p ( ħ l ) = b ̄ ̄ λ φ 2 , ı p 1 ( ħ l ) + 0 β 2 ( ħ m ) Q 2 , ı p ( ħ l , ħ m ) d ħ m , ı p 1
(7)
d Q 1 , 0 ( ħ l , ħ m ) d ħ m + ( b ̄ ̄ λ + β 1 ( ħ m ) ) Q 1 , 0 ( ħ l , ȷ q ) = 0
(8)
d Q 1 , ı p ( ħ l , ħ m ) d ħ m + ( b ̄ ̄ λ + β 1 ( ħ m ) ) Q 1 , ı p ( ħ l , ħ m ) = b ̄ ̄ λ Q 1 , ı p 1 ( ħ l , ħ m ) , ı p 1
(9)
d Q 2 , 0 ( ħ l , ħ m ) d ħ m + ( b ̄ ̄ λ + β 2 ( ħ m ) ) Q 2 , 0 ( ħ l , ħ m ) = 0
(10)
d Q 2 , ı p ( ħ l , ħ m ) d ħ m + ( b ̄ ̄ λ + β 2 ( ħ m ) ) Q 2 , ı p ( ħ l , ħ m ) = b ̄ ̄ λ Q 2 , ı p 1 ( ħ l , ħ m ) , ı p 1
(11)
d D 1 , 0 ( ħ l , ħ m ) d ħ m + ( b ̄ ̄ λ + ω 1 ( ħ m ) ) D 1 , 0 ( ħ l , ħ m ) = 0
(12)
d D 1 , ı p ( ħ l , ħ m ) d ħ m + ( b ̄ ̄ λ + ω 1 ( ħ m ) ) D 1 , ı p ( ħ l , ħ m ) = b ̄ ̄ λ D 1 , ı p 1 ( ħ l , ħ m ) , ı p 1
(13)
d D 2 , 0 ( ħ l , ħ m ) d ħ m + ( b ̄ ̄ λ + ω 2 ( ħ m ) ) D 2 , 0 ( ħ l , ħ m ) = 0
(14)
d D 2 , ı p ( ħ l , ħ m ) d ħ m + ( b ̄ ̄ λ + ω 2 ( ħ m ) ) D 2 , ı p ( ħ l , ħ m ) = b ̄ ̄ λ D 2 , ı p 1 ( ħ l , ħ m ) , ı p 1
(15)
d S 0 ( ħ l ) d ħ l + ( b ̄ ̄ λ + ν ( ħ l ) ) S 0 ( ħ l ) = 0
(16)
d S ı p ( ħ l ) d ħ l + ( b ̄ ̄ λ + ν ( ħ l ) S ı p ( ħ l ) = b ̄ ̄ λ S ı p 1 ( ħ l ) ) , ı p 1
The following boundary conditions ( ħ l = 0 , ħ m = 0 ) are used to solve the set of Eqs. (1) to (16).
(17)
T ı p ( 0 ) = ( 1 c ) r 1 ̄ 0 φ ( 1 , ı p ) ( ħ l ) η 1 ( ħ l ) d ħ l + 0 φ ( 2 , ı p ) ( ħ l ) η 2 ( ħ l ) d ħ l + 0 S ı p ( ħ l ) ν ( ħ l ) d ħ l
(18)
φ 1 , ı p ( 0 ) = 0 T 1 ( ħ l ) κ ( ħ l ) d ħ l + b ̄ ̄ λ T 0
(19)
φ 1 , ı p ( ħ l , 0 ) = 0 T ı p + 1 ( ħ l ) κ ( ħ l ) d ħ l + λ 0 T ı p ( ħ l ) d ħ l
(20)
φ 2 , ı p ( ħ l , 0 ) = β 1 0 φ 1 , ı p ( ħ l ) η 1 ( ħ l ) d ħ l
(21)
Q 1 , ı p ( ħ l , 0 ) = γ 1 φ 1 , ı p ( ħ l )
(22)
Q 2 , ı p ( ħ l , 0 ) = γ 2 φ 2 , ı p ( ħ l )
(23)
D 1 , ı p ( ħ l , 0 ) = 0 Q 1 , ı p β 1 ( ħ m ) d ħ m
(24)
D 2 , ı p ( ħ l , 0 ) = 0 Q 2 , ı p β 2 ( ħ m ) d ħ m
(25)
S ı p ( 0 ) = c r 1 ̄ 0 φ 1 , ı p ( ħ l ) η 1 ( ħ l ) d ħ l + c 0 φ 2 , ı p ( ħ l ) η 2 ( ħ l ) d ħ l , ı p 1

The normalizing condition is given by

(26)
T 0 + ı p = 1 0 T ħ l ( ħ l ) d ħ l + ı p = 0 [ 0 φ 1 , ı p ( ħ l ) d ħ l + 0 φ 2 , ı p ( ħ l ) d ħ l + 0 S ı p ( ħ l ) d ħ l + 0 0 Q 1 , ı p ( ħ l , ħ m ) d ħ l d ħ m + 0 0 Q 2 , ı p ( ħ l , ħ m ) d ħ l d ħ m + 0 0 D 1 , ı p ( ħ l , ħ m ) d ħ l d ħ m + 0 0 D 2 , ı p ( ħ l , ħ m ) d ħ l d ħ m ] = 1 The probability generating functions would be defined as follows: T ( ħ l , ħ n ) = ı p = 0 T ı p ( ħ l ) ħ n ı p for ħ l > 0 , T ( 0 , ħ n ) = ı p = 0 T ı p ( 0 ) ħ n ı p φ i ( ħ l , ħ n ) = ı p = 0 φ i , ı p ( ħ l ) ħ n ı p , φ i ( 0 , ħ n ) = ı p = 0 φ i ı p ( 0 ) ħ n ı p Q i ( ħ l , ħ m , ħ n ) = ı p = 0 Q i , ı p ( ħ l , ħ m ) ħ n ı p , Q i ( ħ l , 0 , ħ n ) = ı p = 0 Q i ı p ( ħ l , 0 ) ħ n ı p D i ( ħ l , ħ m , ħ n ) = ı p = 0 D i , ı p ( ħ l , ħ m ) ħ n ı p , D i ( ħ l , 0 , ħ n ) = ı p = 0 D i ı p ( ħ l , 0 ) ħ n ı p S ı p ( ħ l ) ħ n ı p for ħ l > 0 , S ( 0 , ħ n ) = ı p = 0 S ı p ( 0 ) ħ n ı p

Now multiply Eq. (2) to (25) by ħ n and adding up all the values of ı p (summing), we obtain

(27)
d T ( ħ l , ħ n ) d ħ l + ( λ + κ ( ħ l ) ) T ( ħ l , ħ n ) = 0
(28)
d φ 1 ( ħ l , ħ n ) ħ l + [ b ̄ ̄ λ ( 1 ħ n ) + γ 1 + η 1 ( ħ l ) ] φ 1 ( ħ l , ħ n ) = 0 β 1 ( ħ m ) Q 1 ( ħ l , ħ m , ħ n ) d ħ m
(29)
d φ 2 ( ħ l , ħ n ) d ħ l + [ b ̄ ̄ λ ( 1 ħ n ) + γ 2 + η 2 ( ħ l ) ] φ 2 ( ħ l , ħ n ) = 0 β 2 ( ħ m ) Q 2 ( ħ l , ħ m , ħ n ) d ħ m
(30)
d Q 1 ( ħ l , ħ m , ħ n ) ħ m + ( b ̄ ̄ λ ( 1 ħ n ) + β 1 ( ħ m ) ) Q 1 ( ħ l , ħ m , ħ n ) = 0
(31)
d Q 2 ( ħ l , ħ m , ħ n ) ħ m + ( b ̄ ̄ λ ( 1 ħ n ) + β 2 ( ħ m ) ) Q 2 ( ħ l , ħ m , ħ n ) = 0
(32)
d D 1 ( ħ l , ħ m , ħ n ) d ħ m + ( b ̄ ̄ λ ( 1 ħ n ) + ω 1 ( ħ m ) ) Q 1 ( ħ l , ħ m , ħ n ) = 0
(33)
d D 2 ( ħ l , ħ m , ħ n ) d ħ m + ( b ̄ ̄ λ ( 1 ħ n ) + ω 2 ( ħ m ) ) Q 2 ( ħ l , ħ m , ħ n ) = 0
(34)
d S ( ħ l , ħ n ) d ħ l + ( b ̄ ̄ λ ( 1 ħ n ) + ν ( ħ l ) ) S ( ħ l , ħ n ) = 0
(35)
T ( 0 , ħ n ) = ( 1 c ) [ r 1 ̄ 0 φ 1 ( ħ l , ħ n ) η 1 ( ħ l ) d ħ l + 0 φ 2 ( ħ l , ħ n ) η 2 ( ħ l ) d ħ l ] + 0 S ( ħ l , ħ n ) ν ( ħ l ) d ħ l b ̄ ̄ λ T 0
(36)
φ 1 ( 0 , ħ n ) = 1 ħ n 0 T ( ħ l , ħ n ) κ ( ħ l ) d ħ l + λ 0 T ( ħ l , ħ n ) d ħ l + b ̄ ̄ λ T 0
(37)
φ 2 ( 0 , ħ n ) = r 1 0 φ 1 ( ħ l , ħ n ) η 1 ( ħ l ) d ħ l
(38)
Q 1 ( ħ l , 0 , ħ n ) = γ 1 φ 1 ( ħ l , ħ n )
(39)
Q 2 ( ħ l , 0 , ħ n ) = γ 2 φ 2 ( ħ l , ħ n )
(40)
D 1 ( ħ l , 0 , ħ n ) = 0 Q 1 ( ħ l , ħ m , ħ n ) β 1 ( ħ m ) d ħ m
(41)
D 2 ( ħ l , 0 , ħ n ) = 0 Q 2 ( ħ l , ħ m , ħ n ) β 2 ( ħ m ) d ħ m
(42)
S ( 0 , ħ n ) = c r 1 ̄ 0 φ 1 ( ħ l , ħ n ) η 1 ( ħ l ) d ħ l + c 0 φ 2 ( ħ l , ħ n ) η 2 ( ħ l ) d ħ l

Solving Eq. (27) to (34), we get

(43)
T ( ħ l , ħ n ) = T ( 0 , ħ n ) [ 1 ϖ ( ħ l ) ] e λ ħ l
(44)
φ 1 ( ħ l , ħ n ) = φ 1 ( 0 , ħ n ) [ 1 U 1 ( ħ l ) ] e Λ ̄ ̄ a ( ħ n ) ħ l
(45)
φ 2 ( ħ l , ħ n ) = φ 2 ( 0 , ħ n ) [ 1 U 2 ( ħ l ) ] e Λ ̄ ̄ b ( ħ n ) ħ l
(46)
Q 1 ( ħ l , ħ m , ħ n ) = Q 1 ( ħ l , 0 , ħ n ) [ 1 W 1 ( ħ m ) ] e h 11 ( ħ n ) ħ m
(47)
Q 2 ( ħ l , ħ m , ħ n ) = Q 2 ( ħ l , 0 , ħ n ) [ 1 W 2 ( ħ m ) ] e h 11 ( ħ n ) ħ m
(48)
D 1 ( ħ l , ħ m , ħ n ) = D 1 ( ħ l , 0 , ħ n ) [ 1 E 1 ( ħ m ) ] e h 11 ( ħ n ) ħ m
(49)
D 2 ( ħ l , ħ m , ħ n ) = D 2 ( ħ l , 0 , ħ n ) [ 1 E 2 ( ħ m ) ] e h 11 ( ħ n ) ħ m
(50)
S ( ħ l , ħ n ) = S ( 0 , ħ n ) [ 1 B ( ħ l ) ] e h 11 ( ħ n ) ħ l
where Λ ̄ ̄ a ( ħ n ) = h 11 ( ħ n ) + γ 1 [ 1 ( W 1 ( h 11 ( ħ n ) ) ) ( E 1 ( h 11 ( ħ n ) ) ) ] , Λ ̄ ̄ b ( ħ n ) = h 11 ( ħ n ) + γ 2 [ 1 ( W 2 ( h 11 ( ħ n ) ) ) ( E 2 ( h 11 ( ħ n ) ) ) ] and h 11 ( ħ n ) = b ̄ ̄ λ ( 1 ħ n )

Integrating Eq. (43)(50) from 0 to with respect to ħ l , we get

(51)
(52)
(53)
(54)
(55)
(56)
(57)
(58)
T 0 probability of server inactive. Using the normalizing condition, we obtain T 0 + T ( 1 ) + φ 1 ( 1 ) + φ 2 ( 1 ) + Q 1 ( 1 ) + Q 2 ( 1 ) + D 1 ( 1 ) + D 2 ( 1 ) + S ( 1 ) = 1
K d ̇ ̄ ̄ ( ħ n ) number of customers in the system, where K d ̇ ̄ ̄ ( ħ n ) = T 0 + T 1 ( ħ n ) + S ( ħ n ) + ħ n { φ 1 ( ħ n ) + φ 2 ( ħ n ) + Q 1 ( ħ n ) + Q 2 ( ħ n ) + D 1 ( ħ n ) + D 2 ( ħ n ) } substitute Eq. (51)(58) we get,
(59)
H d ̇ ̄ ̄ ( ħ n ) number of customers in the orbit, where H d ̇ ̄ ̄ ( ħ n ) = T 0 + T 1 ( ħ n ) + φ 1 ( ħ n ) + φ 2 ( ħ n ) + Q 1 ( ħ n ) + Q 2 ( ħ n ) + D 1 ( ħ n ) + D 2 ( ħ n ) + S ( ħ n ) substitute Eq. (51)(58) we get,
(60)

4

4 Performance measures

Some important measures of effectiveness are derived below.

(i) Let T ( 1 ) represents steady-state prob that the server will be inactive during the period.

(ii) Let φ 1 ( 1 ) represents the steady-state prob that the server is active.

(iii) Let φ 2 ( 1 ) represents the steady-state prob that the server is on NCR.

(iv) Let Q 1 ( 1 ) represents steady-state prob that the server is delaying repair on CR.

(v) Let Q 2 ( 1 ) represents steady-state prob that the server is delaying repair on NCR.

(vi) Let D 1 ( 1 ) represents steady-state prob that the server is repair on CR.

(vii)Let D 2 ( 1 ) represents steady-state prob that the server is delaying repair on NCR.

(viii)Let S ( 1 ) be the steady-state probability that the server is on MBV.

L s 1 ̄ ̄ average number of customers in the system, is obtained by differentiating Eq. (59) with respect to ħ n and evaluating at ħ n = 1 we get, L s 1 ̄ ̄ = K d ̇ ̄ ̄ ( 1 ) and L q 1 ̄ ̄ = H d ̇ ̄ ̄ ( 1 ) L s 1 ̄ ̄ = T 0 D r N r a D r N r a 2 ( D r ) 2 N r a = [ ( 1 b ̄ ̄ ) + ( b ̄ ̄ 1 ) ϖ ( λ ) ] + ( b ̄ ̄ 1 ) ( 1 ϖ ( λ ) ) [ 1 + ϖ ( λ ) + λ b ̄ ̄ ( S 1 1 ̇ ̄ ̄ [ 1 + γ 1 ( g 1 1 ̇ ̄ ̄ + f 1 1 ̇ ̄ ̄ ) ] + r 1 S 2 1 ̇ ̄ ̄ [ 1 + γ 2 ( g 2 1 ̇ ̄ ̄ + f 2 1 ̇ ̄ ̄ ) ] + c v ̄ ̄ ( 1 ) )] N r a = ( b ̄ ̄ 1 ) ( 1 ϖ ( λ ) ) × ( λ b ̄ ̄ ) 2 [( c v ̄ ̄ ( 2 ) + S 1 2 ̇ ̄ ̄ [ 1 + γ 1 ( g 1 1 ̇ ̄ ̄ + f 1 1 ̇ ̄ ̄ ) ] 2 + γ 1 ( [ g 1 2 ̇ ̄ ̄ + f 1 2 ̇ ̄ ̄ + 2 g 1 1 ̇ ̄ ̄ f 1 1 ̇ ̄ ̄ ] ) S 1 1 ̇ ̄ ̄ + r 1 (( S 2 2 ̇ ̄ ̄ [ 1 + γ 2 ( g 2 1 ̇ ̄ ̄ + f 2 1 ̇ ̄ ̄ ) ] 2 + γ 2 [ g 2 2 ̇ ̄ ̄ + f 2 2 ̇ ̄ ̄ + 2 g 2 1 ̇ ̄ ̄ f 2 1 ̇ ̄ ̄ ] )) S 2 1 ̇ ̄ ̄ + 2 ( λ b ̄ ̄ ( S 1 1 ̇ ̄ ̄ [ 1 + γ 1 ( g 1 1 ̇ ̄ ̄ + f 1 1 ̇ ̄ ̄ ) ] + r 1 S 2 1 ̇ ̄ ̄ [ 1 + γ 2 ( g 2 1 ̇ ̄ ̄ + f 2 1 ̇ ̄ ̄ ) ] + c v ̄ ̄ ( 1 ) ) ) + ( λ b ̄ ̄ ) 2 { r 1 S 1 1 ̇ ̄ ̄ S 2 1 ̇ ̄ ̄ [ 1 + γ 1 ( g 1 1 ̇ ̄ ̄ + f 1 1 ̇ ̄ ̄ ) ] [ 1 + γ 2 ( g 2 1 ̇ ̄ ̄ + f 2 1 ̇ ̄ ̄ ) ] + c v ̄ ( 1 ) S 1 1 ̇ ̄ ̄ [ 1 + γ 1 ( f 1 1 ̇ ̄ ̄ + g 1 1 ̇ ̄ ̄ ) ] + c r 1 v ̄ ( 1 ) S 2 1 ̇ ̄ ̄ [ 1 + γ 2 ( g 2 1 ̇ ̄ ̄ + f 2 1 ̇ ̄ ̄ ) ] } + M ( λ ) λ b ̄ ̄ ( S 1 1 ̇ ̄ ̄ [ 1 + γ 1 ( g 1 1 ̇ ̄ ̄ + f 1 1 ̇ ̄ ̄ ) ] + r 1 S 2 1 ̇ ̄ ̄ [ 1 + γ 2 ( g 2 1 ̇ ̄ ̄ + f 2 1 ̇ ̄ ̄ ) ] ) )] L q 1 ̄ ̄ average number of customers in the orbit, is obtained by differentiating Eq. (60) with respect to ħ n and evaluating at ħ n = 1 we get, L q 1 ̄ ̄ = T 0 D r N r b D r N r b 2 ( D r ) 2 N r b = ( 1 b ̄ ̄ ) + b ̄ ̄ ϖ ( λ ) + ( b ̄ ̄ 1 ) ( 1 ϖ ( λ ) [ 1 + λ b ̄ ̄ ( S 1 1 ̇ ̄ ̄ ] ) [ 1 + γ 1 ( g 1 1 ̇ ̄ ̄ + f 1 1 ̇ ̄ ̄ ) [ 1 + γ 2 ( g 2 1 ̇ ̄ ̄ + f 2 1 ̇ ̄ ̄ ) ] + c v ̄ ̄ ( 1 ) )] N r b = ( b ̄ ̄ 1 ) ( 1 ϖ ( λ ) ) × ( λ b ̄ ̄ ) 2 [( c v ̄ ̄ ( 2 ) + S 1 2 ̇ ̄ ̄ [ 1 + γ 1 ( g 1 1 ̇ ̄ ̄ + f 1 1 ̇ ̄ ̄ ) ] 2 + γ 1 ( [ g 1 2 ̇ ̄ ̄ + f 1 2 ̇ ̄ ̄ + 2 g 1 1 ̇ ̄ ̄ f 1 1 ̇ ̄ ̄ ] ) S 1 1 ̇ ̄ ̄ + r 1 ( S 2 2 ̇ ̄ ̄ [ 1 + γ 2 ( g 2 1 ̇ ̄ ̄ + f 2 1 ̇ ̄ ̄ ) ] 2 + γ 2 [ g 2 2 ̇ ̄ ̄ + f 2 2 ̇ ̄ ̄ + 2 g 2 1 ̇ ̄ ̄ f 2 1 ̇ ̄ ̄ ] ) S 2 1 ̇ ̄ ̄ )] + 2 ( λ b ̄ ̄ ( S 1 1 ̇ ̄ ̄ [ 1 + γ 1 ( g 1 ̄ ( 1 ) + f 1 ̄ ( 1 ) ) ] + r 1 S 2 1 ̇ ̄ ̄ [ 1 + γ 2 ( g 2 ̄ ( 1 ) + f 2 ̄ ( 1 ) ) ] + c v ̄ ̄ ( 1 ) ) + ( λ b ̄ ̄ ) 2 { r 1 S 1 1 ̇ ̄ ̄ S 2 1 ̇ ̄ ̄ [ 1 + γ 1 ( g 1 1 ̇ ̄ ̄ + f 1 1 ̇ ̄ ̄ ) ] [ 1 + γ 2 ( g 2 1 ̇ ̄ ̄ + f 2 1 ̇ ̄ ̄ ) ] + c v ̄ ̄ ( 1 ) S 1 1 ̇ ̄ ̄ [ 1 + γ 1 ( g 1 1 ̇ ̄ ̄ + f 1 1 ̇ ̄ ̄ ) ] + c r 1 v ̄ ̄ ( 1 ) S 2 1 ̇ ̄ ̄ [ 1 + γ 2 ( g 2 1 ̇ ̄ ̄ + f 2 1 ̇ ̄ ̄ ) ] } ) D r = ϖ ( λ ) λ b ̄ ̄ [ ( S 1 1 ̇ ̄ ̄ [ 1 + γ 1 ( g 1 1 ̇ ̄ ̄ + f 1 1 ̄ ̄ ) ] + r 1 S 2 1 ̇ ̄ ̄ [ 1 + γ 2 ( g 2 1 ̇ ̄ ̄ + f 2 1 ̇ ̄ ̄ ) ] + c v ̄ ̄ ( 1 ) ) ] D r = ( λ b ̄ ̄ ) 2 ( c v ̄ ̄ ( 2 ) + S 1 2 ̇ ̄ ̄ [ 1 + γ 1 ( g 1 1 ̇ ̄ ̄ + f 1 1 ̇ ̄ ̄ ) ] 2 + γ 1 [ g 1 2 ̇ ̄ ̄ + f 1 2 ̇ ̄ ̄ + 2 g 1 1 ̇ ̄ ̄ f 1 1 ̇ ̄ ̄ ] S 1 1 ̇ ̄ ̄ ) + r { S 2 2 ̇ ̄ ̄ [ 1 + γ 2 ( g 2 1 ̇ ̄ ̄ + f 2 1 ̇ ̄ ̄ ) ] 2 + γ 2 [ g 2 2 ̇ ̄ ̄ + f 2 2 ̇ ̄ ̄ + 2 g 2 1 ̇ ̄ ̄ f 2 1 ̇ ̄ ̄ ] S 2 1 ̇ ̄ ̄ } + 2 { ( 1 M ( λ ) ) [ ( λ b ̄ ̄ ) S 1 1 ̇ ̄ ̄ [ 1 + γ 1 ( g 1 1 ̇ ̄ ̄ + f 1 1 ̇ ̄ ̄ ) ] + r 1 λ b ̄ ̄ S 2 1 ̇ ̄ ̄ [ 1 + γ 2 ( g 2 1 ̇ ̄ ̄ + f 2 1 ̇ ̄ ̄ )] + c v ̄ ̄ ( 1 ) ] + r 1 λ b ̄ ̄ 2 S 1 1 ̇ ̄ ̄ S 2 1 ̇ ̄ ̄ [ 1 + γ 1 ( g 1 1 ̇ ̄ ̄ + f 1 1 ̇ ̄ ̄ ) ] [ 1 + γ 2 ( g 2 1 ̇ ̄ ̄ + f 2 1 ̇ ̄ ̄ ) ] + c v ̄ ̄ ( 1 ) ( λ b ̄ ̄ ) 2 ( [ 1 + γ 1 ( g 1 1 ̇ ̄ ̄ + f 1 1 ̇ ̄ ̄ ) ] + r 1 [ 1 + γ 2 ( g 2 1 ̇ ̄ ̄ + f 2 1 ̇ ̄ ̄ ) ] ) } Applying Little’s formula we get W s 1 ̄ ̄ = L s 1 ̄ ̄ λ , W q 1 ̄ ̄ = L q 1 ̄ ̄ λ

5

5 Special cases

Here we consider all the three special cases without balking.

Case(i): No NCR, and r 1 = 0 K d ̇ ̄ ̄ ( ħ n ) = T 0 U 1 ( Λ ̄ ̄ a ( ħ n ) ) ( ħ n 1 ) ħ n [ ϖ ( λ ) + ħ n ( 1 ϖ ( λ ) ) ] U 1 ( Λ ̄ ̄ a ( ħ n ) ) [ ( 1 c ) + c B h 11 ( ħ n ) ] Where T 0 = ϖ ( λ ) λ ( S 1 1 ̇ ̄ ̄ ( 1 + γ 1 ( g 1 1 ̇ ̄ ̄ + f 1 1 ̇ ̄ ̄ ) ) + c v ̄ ̄ ( 1 ) ) ϖ ( λ )

Case(ii): Let c = 1, γ 1 = γ 2 = 0 and ϖ ( λ ) 1 K d ̇ ̄ ̄ ( ħ n ) = T 0 U 1 ( h 11 ( ħ n ) ) ( ħ n 1 ) [ ( r 1 ̄ + r 1 U 2 ( h 11 ( ħ n ) ) ) ] ħ n U 1 ( h 11 ( ħ n ) ) [ ( r 1 ̄ + r 1 U 2 ( h 11 ( ħ n ) ) B ( h 11 ( ħ n ) ) ) ]

Where T 0 = 1 λ ( S 1 1 ̇ ̄ ̄ + S 2 1 ̇ ̄ ̄ + v ̄ ̄ ( 1 ) )

Case(iii): No vacation, no NCR, and γ 1 = γ 2 = 0

The below obtained expression concedes with Gomez-Corral (1999) K d ̇ ̄ ̄ ( ħ n ) = T 0 U 1 ( h 11 ( ħ n ) ) ( ħ n 1 ) ħ n U 1 ( h 11 ( ħ n ) ) [ ϖ ( λ ) + ħ n ( 1 ϖ ( λ ) ) ]

Where T 0 = ϖ ( λ ) λ S 1 1 ̇ ̄ ̄ ϖ ( λ )

6

6 Numerical interpretations

The goal of this section is to analyze the influence of several variables on various system performance measures. The arbitrary values that are considered for the parameters are selected in such a way that they may meet the criterion that the system is stable. This condition is fulfilled when the parameters have consistent values. The retrial, service, MBV, and repair time are all considered as exponential distribution, f ( ħ l ) = Θ e Θ ħ l , ħ l > 0 . This confirms that these times are realistic and consistent.

Fig. 1 and Fig. 2 shows that as retry rate ( κ ) escalates, the T 0 also escalate. In Fig. 3 if retry and vacation escalates, L q 1 ̄ ̄ decreases. In Fig. 4 also if retry and service (compulsory) escalates, L q 1 ̄ ̄ decreases.

T 0 versus κ and ν .
Fig. 1
T 0 versus κ and ν .
T 0 versus κ and b ̄ ̄ .
Fig. 2
T 0 versus κ and b ̄ ̄ .
L q 1 ̄ ̄ versus κ and ν .
Fig. 3
L q 1 ̄ ̄ versus κ and ν .
L q 1 ̄ ̄ versus κ and η 1 .
Fig. 4
L q 1 ̄ ̄ versus κ and η 1 .

7

7 Conclusion

In this work, we have presented a single server retrial queueing system with balking under MBV (Modified Bernoulli vacation policy), where the busy server is prone to both failure and repair. Using the supplementary variable method (SVM), the probability generating functions for the number of users in the system when it is idle, occupied, MBV, and repair are presented. Various significant system performance metrics such as expected number of customers in an orbit and the system and server utilization have also been analyzed. Numerical illustrations are presented to demonstrate the analytical findings of the model. Future research of this paper could focus on expanding this queueing model to include modified working vacation policies, randomized policies, setup time and cost estimation. CCM (Cloud Computing Model), PSN (Packet Switched Network) for the transfer of packets in a network, and WSN (Wireless Sensor Network) for choosing and maintaining routes are some of the practical and real-world applications of this model.

Declaration of competing interest

The authors declare that there is no conflict of interest.

References

  1. , , . A batch arrival retrial queue with two phases of service, feedback and K optional vacations. Appl. Math Sci.. 2012;6(22):1071-1087.
    [Google Scholar]
  2. , , . Steady state analysis of an M / G / 1 queue with repeated attempts and two-phase service. Qual. Technol. Quant. Manag.. 2004;1(2):189-199.
    [Google Scholar]
  3. , , , , . Variant vacation queueing system with bernoulli feedback, balking and server’s states-dependent reneging. Yugoslav J. Oper. Res.. 2021;31(4):557-575.
    [Google Scholar]
  4. Boussaha, Z., Oukid, N., Zeghdoudi, H., Soualhi, S., Djellab, N., 2022. On the m / g / 1 feedback retrial queueing with orbital search of customers.
  5. , , . On queues with service and interarrival times depending on waiting times. Queueing Syst.. 2007;56(3):121-132.
    [Google Scholar]
  6. , , . An M / G / 1 retrial queueing system with two phases of service subject to the server breakdown and repair. Perform. Eval.. 2008;65(10):714-724.
    [Google Scholar]
  7. , , . A two-stage batch arrival queueing system with a modified Bernoulli schedule vacation under N-policy. Math. Comput. Model.. 2005;42(1):71-85.
    [Google Scholar]
  8. , . A two-class queueing system with constant retrial policy and general class dependent service times. Eur. J. Oper. Res.. 2018;270(3):1063-1073.
    [Google Scholar]
  9. , . Queueing systems with vacations-a survey. Queueing Syst.. 1986;1(1):29-66.
    [Google Scholar]
  10. , , . Retrial Queues. London: Chapman and Hall; .
  11. , . Stochastic analysis of single server retrial queue with the general retrial times. Nav. Res. Logist.. 1999;46(5):561-581.
    [Google Scholar]
  12. , , . N-policy for state-dependent batch arrival queueing system with l-stage service and modified Bernoulli vacation. Qual. Technol. Qual. Manag.. 2010;7(3):215-230.
    [Google Scholar]
  13. , , , . Recent developments in vacation models: a short survey. Int. J. Oper. Res.. 2010;7(4):3-8.
    [Google Scholar]
  14. , . The conditional distribution of the residual service time in the M / G / 1 queue. Stoch. Models. 2008;24(3):364-375.
    [Google Scholar]
  15. , , . An unreliable discrete-time retrial queue with probabilistic preemptive priority, balking customers and replacements of repair times. AIMS Math.. 2020;5(5):4322-4344.
    [Google Scholar]
  16. , . Dimensioning a queue with state-dependent arrival rates. Comput. Oper. Res.. 2021;128(10):51-79.
    [Google Scholar]
  17. , . The principal–agent problem for service rate event-dependency. European J. Oper. Res.. 2022;297(3):949-963.
    [Google Scholar]
  18. , , , . Analysis of M / G / 1 retrial queues with second optional service and customer balking under two types of Bernoulli vacation schedules. Operations research. 2019;53(2):415-443.
    [Google Scholar]
  19. , . Low Latency Weighted Fair Queuing for Real time flows with Differential Packet Dropping. Vol. 8. No. 22. . p. :1-5.
  20. , , . A single server retrial queue with general retrial times and two phase service. Jrl. Syst. Sci. Complex.. 2009;22(2):291-302.
    [Google Scholar]
Show Sections