2016
DOI: 10.12732/ijpam.v109i2.18
|View full text |Cite
|
Sign up to set email alerts
|

The Concept of Higher Orders Queues in the Queuing Theory

Abstract: The paper considers various types of queues arising in queuing systems. The concept of an N-th order queue is introduced; the calculation algorithm of the first and second moments of main discrete and continuous random variables characterizing behavior of higher orders queues in queuing systems of the mixed type is presented. AMS Subject Classification: 60K25Key Words: physical queue, real queue, quality of service (QoS), queuing system (QS) Main DefinitionsAn N-th order queue will be called the queue calculat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
2
2
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 4 publications
0
3
0
Order By: Relevance
“…The analysis of waiting time in healthcare systems can be approached mathematically using queuing theory (Rotich, 2016). Queuing theory is a classical approach that has been employed to gain insight into hospital processes since the 1950s (Lee et al, 1997;Titovtsev, 2016). An ineffective and inefficient appointment system is one of the main issues for the long waiting time of patients in an outpatients department.…”
Section: Introductionmentioning
confidence: 99%
“…The analysis of waiting time in healthcare systems can be approached mathematically using queuing theory (Rotich, 2016). Queuing theory is a classical approach that has been employed to gain insight into hospital processes since the 1950s (Lee et al, 1997;Titovtsev, 2016). An ineffective and inefficient appointment system is one of the main issues for the long waiting time of patients in an outpatients department.…”
Section: Introductionmentioning
confidence: 99%
“…Let us remind that we have called the N-th order queue as the queue that is calculated as long as there is a minimum of m+N claims in the system; N of them is in the memory [4]. Such queue exists if a newly arrived claim finds a minimum claims N waiting for service before it.…”
Section: Introductionmentioning
confidence: 99%
“…It was found out in works [1], [2] and [4], that for systems of M/M/m and M/M/m/E classes (though, all numerical characteristics of the first ones can be obtained by a limit transference from numerical characteristics of the second ones) the following relation is performed…”
Section: Introductionmentioning
confidence: 99%