2013
DOI: 10.1016/j.cor.2013.01.014
|View full text |Cite
|
Sign up to set email alerts
|

Solving general multi-class closed queuing networks using parametric decomposition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(7 citation statements)
references
References 17 publications
0
7
0
Order By: Relevance
“…In that case, a viable option is to rely on relations between open and closed queueing systems, as in e.g. [30,36].…”
Section: Remarkmentioning
confidence: 99%
“…In that case, a viable option is to rely on relations between open and closed queueing systems, as in e.g. [30,36].…”
Section: Remarkmentioning
confidence: 99%
“…When the stationary distribution does not have a product-form, the exact analysis may not be computationally tractable, and we may turn to approximations [2,16,4,18], bounds [20,8], or simulation [1].…”
Section: Introductionmentioning
confidence: 99%
“…Fortin et al (2005) mentioned the scarcity of research in the area of multi-comorbidity patients in comparison to specific diseases, even though the behavior of these patients can significantly affect the efficiencies of healthcare systems. The queuing method that can be used to show the differences between multi-comorbidities is multi-class closed queuing networks, which provides a convenient framework with which to evaluate the impact of population constraints on the stochastic interactions between different classes at various nodes of the network (Satyam et al, 2013 Satyam et al (2013) mentioned that "this approach is based on parametric characterization of the traffic processes in the network, which uses two-moment approximations to estimate performance measures at individual nodes" (Satyam et al, 2013).…”
Section: Optimizing Panel Size Using Queuing Theorymentioning
confidence: 99%
“…The service time distribution of a class r at a node j is characterized by two parameters: the mean, rj  , and squared coefficient of variation, 2 .As a result, the service rate, is equal to  −1 (Satyam et al, 2013). The arrival process is described by the mean and SCV parameters ( , −1 2 ) (Satyam et al, 2013), and the arrival time distribution and service time distribution for a multi-class queuing network can be estimated.…”
Section: Optimizing Panel Size Using Queuing Theorymentioning
confidence: 99%
See 1 more Smart Citation