2014
DOI: 10.1016/j.ejor.2013.12.005
|View full text |Cite
|
Sign up to set email alerts
|

Class clustering destroys delay differentiation in priority queues

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 49 publications
0
2
0
Order By: Relevance
“…For instance, we have observed that class clustering may also have substantial effects on the performance of multi-class queues with multiple class-dedicated servers and a global FCFS service discipline [13,15]. Also, in priority queues interclass correlation has been shown to have a possibly major impact on the delay-differentiating capabilities of the priority rule [31,10,11].…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…For instance, we have observed that class clustering may also have substantial effects on the performance of multi-class queues with multiple class-dedicated servers and a global FCFS service discipline [13,15]. Also, in priority queues interclass correlation has been shown to have a possibly major impact on the delay-differentiating capabilities of the priority rule [31,10,11].…”
Section: Discussionmentioning
confidence: 99%
“…In the above expression, t A and t B are given in equation 2, γ is the interclass correlation defined in (3), C (1) and C (1) are derivatives of the pgf C(z) of the service time of an arbitrary customer, ρ is the load of the system calculated from (11), and p A and p B are the probabilities given by the formulas (18). The first term (ρ) in equation 22corresponds to the mean number of customers in service, the other three terms account for the mean queue content, i.e., the mean number of customers that are actually waiting to be served.…”
Section: System Content At Random Slot Boundariesmentioning
confidence: 99%