Simulation of Finite-Source Retrial Queueing Systems with Collisions and Non-reliable Server

Tóth, Ádám; Bérczes, Tamás; Sztrik, János; Kvach, Anna

doi:10.1007/978-3-319-66836-9_13

Cited by 9 publications

(6 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…On souligne qu'à chaque fois les valeurs limites donnent de très bonnes approximations montrant l'efficacité de la méthode asymptotique. Dans (Tóth et al 2017), le temps de service requis est supposé être distribué en Gamma et les paramètres d'entrée du système sont recueillis dans le tableau 8.8.…”

Section: Dans Ce But Dénotons Par ( = )unclassified

See 1 more Smart Citation

Résultats récents en files d’attente avec rappels à sources finies avec collisions

Nazarov¹,

Sztrik²,

Kvach³

2021

Théorie Des Files D’attente 1

Self Cite

View full text Add to dashboard Cite

L’objectif de ce chapitre est de donner un aperçu des résultats récents sur les systèmes de files d’attente avec rappel à source finie à serveur unique avec collision de clients. Il s’agit notamment de déterminer lorsque le serveur est fiable et de modéliser les pannes et les réparations aléatoires du serveur selon qu’il est inactif ou occupé. Les méthodes numériques, de simulation et asymptotiques, assistées par des outils, sont considérées sous la condition d’un nombre croissant et illimité de sources.

show abstract

Section: Dans Ce But Dénotons Par ( = )unclassified

“…Dans (Tóth et al 2017), on a étudié des systèmes ayant non seulement des temps de service distribués selon une loi Gamma, mais aussi des temps d'interarrivées et de rappels distribués selon une loi Gamma.…”

Section: Simulation Stochastique De Systèmes Spéciauxunclassified

Résultats récents en files d’attente avec rappels à sources finies avec collisions

Nazarov¹,

Sztrik²,

Kvach³

2021

Théorie Des Files D’attente 1

Self Cite

View full text Add to dashboard Cite

show abstract

“…Different Figures help to understand the special features of the system. The model is a generalization of [21] and a continuation of the works [12,22].…”

Section: Introductionmentioning

confidence: 99%

Some Special Features of Finite-Source Retrial Queues with Collisions, an Unreliable Server and Impatient Customers in the Orbit

Sztrik

Tóth

2021

Information Technologies and Mathematical Modelling. Queueing Theory and Applications

Self Cite

View full text Add to dashboard Cite

The goal of the paper is to study a finite-source retrial queuing system with collisions and customers' impatience behavior in the orbit. The situation when an incoming customer from the orbit or from the source finds the server busy causes a collision and both requests are directed toward the orbit. It is assumed that every request in the source is eligible to generate customers whenever the server is failed but these requests immediately go into orbit. A customer after some waiting in the orbit can depart without fulfilling its service requirement these are the socalled impatient/reneging/abandoned customers. In that case it returns to the source. A customer who is under service when the server fails is also sent to the orbit. The source, service, retrial, impatience, operation and repair times are supposed to be independent of each other. The novelty of the investigation is to carry out a sensitivity analysis comparing various distributions of impatience time of customers on the performance measures such as mean number of customers in the orbit, mean waiting time of an arbitrary, successfully served and reneging customers, probability of abandonment, server utilization, etc.

show abstract

“…Queuing systems with retrial queues are widely used tools modelling emerging problems in major telecommunication systems, such as telephone switching systems or call centres. Many papers dealt with these types of systems which can be viewed in the following works like in [4,9,19].…”

Section: Introductionmentioning

confidence: 99%

“…In real-life systems typical problems arise like a power outage, human errors, or in wireless communication packets can suffer transmission failure, interruptions throughout their transfer and unfortunately it can happen at any time. These systems with an unreliable server were analyzed in several papers, for example in [3,6,10,18,20].…”

Section: Introductionmentioning

confidence: 99%

Analysis of Retrial Queueing System M/G/1 with Impatient Customers, Collisions and Unreliable Server Using Simulation

Sztrik

Tóth

Danilyuk

et al. 2021

Information Technologies and Mathematical Modelling. Queueing Theory and Applications

Self Cite

View full text Add to dashboard Cite

In this paper, we consider a retrial queueing system of M/G/1 type with an unreliable server, collisions, and impatient customers. The novelty of our work is to carry out a sensitivity analysis applying different distributions of service time of customers on significant performance measures for example on the probability of abandonment, the mean waiting time of an arbitrary, successfully served, impatient customer, etc. A customer is able to depart from the system in the orbit if it does not get its appropriate service after a definite random waiting time so these will be the so-called impatient customers. In the case of server failure, requests are allowed to enter the system but these will be forwarded immediately towards the orbit. The service, retrial, impatience, operation, and repair times are supposed to be independent of each other. Several graphical illustrations demonstrate the comparisons of the investigated distributions and the interesting phenomena which are obtained by our self-developed simulation program. The achieved results are compared to the results of the [2] to check how the system characteristics changes if we use other distributions of service time and to present the advantages of performing simulations in certain scenarios.

show abstract

Simulation of Finite-Source Retrial Queueing Systems with Collisions and Non-reliable Server

Cited by 9 publications

References 14 publications

Résultats récents en files d’attente avec rappels à sources finies avec collisions

Résultats récents en files d’attente avec rappels à sources finies avec collisions

Some Special Features of Finite-Source Retrial Queues with Collisions, an Unreliable Server and Impatient Customers in the Orbit

Analysis of Retrial Queueing System M/G/1 with Impatient Customers, Collisions and Unreliable Server Using Simulation

Contact Info

Product

Resources

About