TY - GEN
T1 - Investigation of priority queue with peaked traffic flows
AU - Mirtchev, Seferin
AU - Goleva, Rossitza
AU - Atamian, Dimitar
AU - Ganchev, Ivan
N1 - Publisher Copyright:
© 2018 Authors.
PY - 2018/4/9
Y1 - 2018/4/9
N2 - 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.
AB - 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.
KW - Generalized pollaczek-khinchin formula
KW - Mean waiting time
KW - Non-preemptive priority
KW - Polya arrival process
KW - Polya/G/1 queue
UR - https://www.scopus.com/pages/publications/85050528844
U2 - 10.1145/3167132.3167407
DO - 10.1145/3167132.3167407
M3 - Conference contribution
AN - SCOPUS:85050528844
T3 - Proceedings of the ACM Symposium on Applied Computing
SP - 1017
EP - 1019
BT - Proceedings of the 33rd Annual ACM Symposium on Applied Computing, SAC 2018
PB - Association for Computing Machinery
T2 - 33rd Annual ACM Symposium on Applied Computing, SAC 2018
Y2 - 9 April 2018 through 13 April 2018
ER -