Autors: Mirtchev, S. T., Ganchev I.
Title: A Generalized Pollaczek-Khinchin formula for the Polya/G/1 queue
Keywords: generalised PollaczekKhinchin; Polya/G/1 queue; queue length; service delay; general distributed service times; Polya peaked arrival process

Abstract: 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. DOI: 10.1049/el.2016.2876

References

    Issue

    Journal Electronics Letters, vol. 53, issue 1, pp. 27-29, 2017, United Kingdom, The Institution of Engineering and Technology, ISSN 00135194

    Цитирания (Citation/s):
    1. Ivan Nedyalkov. Studying of a Modeled IP – Based Network Using Different Dynamic Routing Protocols, Publisher: IEEE, X National Conference with International Participation (ELECTRONICA), 2019, DOI: 10.1109/ELECTRONICA.2019.8825622 (Indexed in Scopus) - 2019 - в издания, индексирани в Scopus или Web of Science
    2. Huang X., X. Tang, F. Hu, "Dynamic Spectrum Access for Multimedia Transmission Over Multi-User, Multi-Channel Cognitive Radio Networks", IEEE Transactions on Multimedia, Vol. 22, No. 1, 2020, pp. 201-214, doi: 10.1109/TMM.2019.2925960. IF 6.051 - 2020 - в издания, индексирани в Scopus или Web of Science
    3. Fendick, K., & Whitt, W. Queues with path-dependent arrival processes. Journal of Applied Probability, 2021, 58(2), pp. 484-504. doi:10.1017/jpr.2020.103 - 2021 - в издания, индексирани в Scopus или Web of Science

    Вид: статия в списание, публикация в издание с импакт фактор