Name
Abstract | ||
|---|---|---|
In this paper1, a new single-server priority queueing system with a peaked arrival process and generally distributed service time is analysed by using the Polya distribution to describe the peaked traffic flows. The mean waiting time in the case of infinite number of waiting places is obtained using a generalized Pollaczek-Khinchin formula. It is shown that the performance of such delay systems varies vastly depending on the peakedness of the input flow. To the best of our knowledge, such a priority queueing system with a peaked arrival process is analysed for the first time.
|
Year | DOI | Venue |
|---|---|---|
2018 | 10.1145/3167132.3167407 | SAC 2018: Symposium on Applied Computing
Pau
France
April, 2018 |
Keywords | Field | DocType |
Polya arrival process, non-preemptive priority, generalized Pollaczek-Khinchin formula, Polya/G/1 queue, mean waiting time | Mathematical optimization,Arrival process,Computer science,Priority queue,Priority queueing,Distributed services | Conference |
ISBN | Citations | PageRank |
978-1-4503-5191-1 | 0 | 0.34 |
References | Authors | |
1 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Seferin Mirtchev | 1 | 8 | 2.94 |
| Rossitza Goleva | 2 | 23 | 5.26 |
| Dimitar Atamian | 3 | 6 | 1.87 |
| Ivan Ganchev | 4 | 189 | 37.61 |