Performance analysis and stability of multiclass orbit queue with constant retrial rates and balking

Morozov, Evsey; Rumyantsev, Alexander; Dey, Sweta; Deepak, T. G.

doi:10.1016/j.peva.2019.102005

Cited by 20 publications

(9 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An approach based on dominating systems and monotonicity [26,28] seems natural for this model. The dominating systems constructed in [8,23] lead to sufficient conditions, which are not necessary. Of course, this does not exclude the construction of a more suitable dominating system.…”

Section: Discussionmentioning

confidence: 99%

“…It is also quite natural to consider retrial queueing models with several classes of customers, where each class has its own orbit [9,22]. Such multi-class retrial systems are useful to model call centers [23] as well as wireless and access control systems [9,14]. An important feature of multi-class retrial systems with a constant retrial rate was observed in [9]: even if one class is very aggressive, the other classes are protected by the nature of the constant retrial rate.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Stability and partial instability of multi-class retrial queues

Avrachenkov

2022

Queueing Syst

View full text Add to dashboard Cite

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Stability and partial instability of multi-class retrial queues

Avrachenkov

2022

Queueing Syst

View full text Add to dashboard Cite

“…Jain et al (2019) presents an overview of a retrial queueing miniature contains a single server with departures occurs in batches. Also, Morozov et al (2019) presented retrial queueing system with a single-server and different classes of customers. Sanga and Jain (2019a) investigates the callers balking behavior in a double orbit retrial queueing having different types of callers according to their priority.…”

Section: Introductionmentioning

confidence: 99%

Genetic algorithm in retrial queueing system with server breakdown and caller intolerance with voluntary service

Jain

2021

Int J Syst Assur Eng Manag

View full text Add to dashboard Cite

The paper investigates the M/M/s retrial queueing system with servers prone to breakdown and with voluntary service. During a phone call, if the caller finds a free call line, then it connects immediately to the call agent, considered as server. Those who finds the call busy either join the orbit for retrial or disconnect the call. After receiving the essential service either caller leaves the system or requests for voluntary service. The miniature used in the queueing system employs a quasi-birth-and-death process. The stationary probabilities are derived using matrix-analytic approach and then performance measures are calculated using these stationary probabilities. The impact of system parameters on performance measures is illustrated using graphs and tables. Total system cost is calculated as a function of orbit capacity, repair rate of breakdown and two different service rates. The optimization methodology is demonstrated using various cases. Further the Genetic algorithm is used to find the optimum value of both essential and optional service rates, rate of breakdown and orbit capacity to minimize the overall cost. The study of consistency of retrial queue with server prone to breakdowns and repairs is of great significance because of inadequate capability of repairs and strong impact of the breakdowns on the performance measures.

show abstract

“…The exploration of customers' strategic behavior in retrial queue are found in Wang and Zhang [34], [35]. Recently, Morozov and Phung-Duc [31] and Morozov et al [32] did stability and performance analysis on retrial queues with multiclass server.…”

mentioning

confidence: 99%

Strategic joining in a single-server retrial queue with batch service

Sun¹,

Wang²,

Zhang³

2021

JIMO

View full text Add to dashboard Cite

We consider a single-server retrial queue with batch service where potential customers arrive according to a Poisson process. The service process has two stages: busy period and admission period, which are corresponding to whether the server is in service or not, respectively. In such an alternate renewal process, if arrivals find busy period, they make join-or-balk decisions. Those joining ones will stay in the orbit and attempt to get into server at a constant rate. While, if arrivals find the server is in an admission period, they get into the server directly. At the end of each admission period, all customers in the server will be served together regardless of the size of the batch. The reward of each arrival after completion of service depends on the service size. Furthermore, customers in the orbit fail to get into the server before the end of each service cycle will be forced to leave the system. We study an observable scenario that customers are informed about the service period upon arrivals and an unobservable case without this information. The Nash equilibrium joining strategies are identified and the social-and profitmaximization problems are obtained, respectively. Finally, the optimal joining strategies in the observable queue and the comparison of social welfare between the two queues are illustrated by numerical examples.

show abstract

Performance analysis and stability of multiclass orbit queue with constant retrial rates and balking

Cited by 20 publications

References 23 publications

Stability and partial instability of multi-class retrial queues

Stability and partial instability of multi-class retrial queues

Genetic algorithm in retrial queueing system with server breakdown and caller intolerance with voluntary service

Strategic joining in a single-server retrial queue with batch service

Contact Info

Product

Resources

About