Abstract
An approach to evaluating the efficiency of the process of identifying contamination content in streams of multimedia objects is proposed. The possibility of separating multimedia objects into components (text, video, audio) and their parallel processing (analysis) with subsequent aggregation of the results is considered. The task was formalized on the basis of the M/G/n multichannel queuing system (QS) model taking into account the Split-Join processes and the calculation of its probability-time characteristics. The key stage of the calculation is the representation of random processing times for components of multimedia objects by the distribution of their maximum, the initial moments of which are found by numerical integration along the half-axis with the weight of Chebyshev-Laguerre. The resulting estimate of efficiency is presented in the form of a set of initial moments of the distribution of the duration of the request in the system.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alomari, F., Menasce, D.A.: Efficient response time approximation for multiclass fork and join queues in open and closed queueing networks. IEEE Trans. Parallel Distrib. Syst. 25, 1437–1446 (2014)
Fiorini, P., Lipsky, L.: Exact analysis of some split-merge queues. Perform. Eval. Rev. 43(2), 51–53 (2015)
Harrison, P.G., Zertal, S.: Queueing models with maxima of service times. In: Computer Performance Evaluation. Modelling Techiniques and Tools, pp. 152–168 (2003)
Khabarov, R.S., Lokhvitckii, V.A.: Model’ otsenivaniya operativnosti mnogopotochnoi obrabotki zadach v raspredelennoi vychislitel’noi srede s uchetom protsessov Split-Join. Vestnik Rossiyskogo novogo universiteta. Seriya “Slozhnye sistemy: modeli, analiz i upravlenie”, vol. 1, pp. 26–35. [Efficiency evaluating model of tasks multy-threading processing in a distributed computing environment with Split-Join processes. Vestnik of Russian New University. Series “Complex systems: models, analisys, management”, vol. 1, pp. 26–35] (2019). (in Russian)
Krylov, V.I., Shul’gina L.T.: Spravochnaya kniga po chislennomu integrirovaniyu, 372 p. Nauka, M (1966). (in Russian)
Qiu, Z., Perez, J.G., Harrison, P.G.: Beyond the mean in fork-join queues: efficient approximation for response-time tails. Perform. Eval. 91, 99–106 (2015)
Roskomnadzor. http://eais.rkn.gov.ru. Accessed 08 Apr 2019
Ryzhikov, Yu.I.: Algoritmicheskiy podkhod k zadacham massovogo obsluzhivaniya: monografiya. SPb. VKA im. A.F. Mozhayskogo, 496 p. (2013). (in Russian)
Wang, P., Li, J., Shen, Z., Zhou, Y.: Approximations and bounds for (n, k) fork-join queues: a linear transformation approach. Computer Network Information Center, Chinese Academy of Sciences, China (2017)
Acknowledgements
The study was carried out with the financial support of the Russian Foundation for Basic Research, project No. 18-29-22064\18.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Lokhvickii, V., Ryzhikov, Y., Dudkin, A. (2020). Applying the Split-Join Queuing System Model to Estimating the Efficiency of Detecting Contamination Content Process in Multimedia Objects Streams. In: Kotenko, I., Badica, C., Desnitsky, V., El Baz, D., Ivanovic, M. (eds) Intelligent Distributed Computing XIII. IDC 2019. Studies in Computational Intelligence, vol 868. Springer, Cham. https://doi.org/10.1007/978-3-030-32258-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-030-32258-8_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-32257-1
Online ISBN: 978-3-030-32258-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)