Open AccessGeneralised Pollaczek–Khinchin formula for the Polya/G/1 queue
Author(s) -
Mirtchev S.T.,
Ganchev I.
Publication year - 2017
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2016.2876
Subject(s) - queue , burke's theorem , mathematics , combinatorics , discrete mathematics , computer science , statistics , computer network , queue management system , fork–join queue
A generalised Pollaczek–Khinchin formula for the Polya/G/1 queue, with a Polya peaked arrival process, general distributed service times, and infinite number of waiting positions, is obtained. It is shown that the peakedness of the number of arrivals and the variance of the service time lead to a significant increase in the service delay and queue length.