Abstract
We propose an approach for generalization of formulas previously obtained by the authors for the first and second queue length moments in a queueing system with a nonordinary Poissonian arrival flow, single server, and constant service time to the case of a variable service time. The service time is assumed to be a random variable with a finite set of values. This model is adequate for a vast class of batch transmission systems, since the batch transmission time in real-world systems can take only finitely many values.
This is a preview of subscription content, log in via an institution to check access.
References
Lichtzinder, B.Ya., Privalov, A.Yu., and Moiseev, V.I., Batch Poissonian Arrival Models of Multiservice Network Traffic, Probl. Peredachi Inf., 2023, vol. 59, no. 1, pp. 71–79. [Probl. Inf. Transm. (Engl. Transl.), 2023, vol. 59, no. 1, pp. 63–70]. https://doi.org/10.1134/S0032946023010064
Lichtzinder, B.Ya., Trafik mul'tiservisnykh setei dostupa (interval'nyi analiz i proektirovanie) (Traffic of Multiservice Access Networks: Interval Analysis and Design), Moscow: Hot Line – Telecom, 2019.
Yunhua, R., Evaluation and Estimation of Second-Order Self-similar Network Traffic, Comput. Commun., 2004, vol. 27, no. 9, pp. 898–904. https://doi.org/10.1016/j.comcom.2004.02.003
Privalov, A.Yu. and Tsarev, A., Analysis and Simulation of WAN Traffic by Self-similar Traffic Model with OMNET, in Proc. 10th Int. Wireless Communications and Mobile Computing Conf. (IWCMC'2014), Nicosia, Cyprus, Aug. 4–8, 2014, pp. 629–634. https://doi.org/10.1109/IWCMC.2014.6906429
Millán Naveas, G., San Juan Urrutia, E., and Vargas Guzmán, M., A Simple Multifractal Model for Self-similar Traffic Flows in High-Speed Computer Networks, Comp. y Sist., 2019, vol. 23, no. 4, pp. 1517–1521. https://doi.org/10.13053/cys-23-4-2831
Vishnevskii, V.M. and Dudin, A.N., Queueing Systems with Correlated Arrival Flows and Their Applications to Modeling Telecommunication Networks, Avtomat. Telemekh., 2017, no. 8, pp. 3–59 [Automat. Remote Control (Engl. Transl.), 2017, vol. 78, no. 8, pp. 1361–1403]. https://doi.org/10.1134/S000511791708001X
Funding
This work was supported by ongoing institutional funding. No additional grants to carry out or direct this particular research were obtained.
Author information
Authors and Affiliations
Ethics declarations
The authors of this work declare that they have no conflicts of interest.
Additional information
Publisher’s Note. Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Lichtzinder, B.Y., Privalov, A.Y. Generalization of Formulas for Queue Length Moments under Nonordinary Poissonian Arrivals for Batch Queues in Telecommunication Systems. Probl Inf Transm 59, 243–248 (2023). https://doi.org/10.1134/S003294602304004X
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S003294602304004X