doi: 10.17586/2226-1494-2017-17-2-294-300


EVALUATION OF MEMORY CAPACITY FOR HEAVILY LOADED SYSTEMS WITH PRIORITIES

T. I. Aliev, E. Maharevs


Read the full article  ';
Article in Russian

For citation: Aliev T.I., Maharevs E. Evaluation of memory capacity for heavily loaded systems with priorities. Scientific and Technical Journal of Information Technologies, Mechanics and Optics, 2017, vol. 17, no. 2, pp. 294–300 (in Russian). doi: 10.17586/2226-1494-2017-17-2-294-300

Abstract

Subject of Research. The paper deals with the models of computer networks represented by queuing systems with heterogeneous flow of requests. The models show processing and transmission of packets of different classes. Requirements for the quality indicators of packet transmission for each class are implemented by the use of the priority service disciplines. Operation in high load conditions is a distinctive feature of modern telecommunication systems, leading to probability increase of packets (requests) loss. This necessitates the use of models with limited memory capacity. Analytic study of such models is accompanied by complex and bulky mathematical calculations with explicit results only in special cases under certain assumptions. For example, with regard to the probability laws, describing the processes of receiving and serving of requests that limits the usage of such models. Method. The study of such systems with simulation methods is also problematic in view of statistical instability of operation characteristics for high load conditions. We propose an approach to the study of heavily loaded systems with priorities based on the models with unlimited memory capacity. Main Results. Analytical results for service characteristics with two moments of distribution were obtained. The distribution laws approximation of the number of requests in system is based on these results. Practical Relevance. We have  shown the possibility of approximation of continuous multi-exponential distributions that enable to assess memory capacity for given probability of losses for different classes of requests.             


Keywords: priority system, high-loaded system, service discipline, memory capacity, load, residence time

References
 1.     Vishnevskii V.M., Semenova O.V. Polling Systems: Theory and Applications in Broadband Wireless Networks. Moscow, Tekhnosfera Publ., 2007, 312 p. (In Russian)
2.     Olifer V.G., Olifer N.A. Computer Networks. Principles, Technologies, Protocols. 5th ed. St. Petersburg, Piter Publ., 2016, 992 p. (In Russian)
3.     Bogatyrev V.A. Protocols for dynamic distribution of requests through a bus with variable logic ring for reception authority transfer. Automatic Control and Computer Sciences, 1999, vol. 33, no. 1, pp. 57–63.
4.     Golubev I.Yu., Bogatyrev V.A. Service model of inhomogeneous flow at priority processing duplicate criticality queries. Herald of Computer and Information Technologies, 2014, no. 4, pp. 27–32. (In Russian) doi: 10.14489/vkit.2014.04.pp.027-032
5.     Bogatyrev V.A. Protocols for dynamic distribution of demands and for mapping the conditions of functional resources in fault-tolerant computer systems. Engineering Simulation, 2000, vol. 17, no. 6, pp. 885–895.
6.     ITU-T Recommendation Y.1541:2006. Network performance objectives for IP-based services. Geneva, 2012, 66 p.
7.     Gautam N. Analysis of Queues: Methods and Application. CRC Press, 2014, 802 p.
8.     Pustovoitov P. Computer network with inhomogeneous input stream applications with relative priority. Eastern-European Journal of Enterprise Technologies, 2011, vol. 3, no. 2, pp. 43–46. (In Russian)
9.     Aliev T.I. Fundamentals of Simulation of Discrete Systems. St. Petersburg, SPbSU ITMO Publ., 2009, 363 p. (In Russian)
10.  Aliev T.I. The synthesis of service discipline in systems with limits. Communications in Computer and Information Science, 2016, vol. 601, pp. 151–156. doi: 10.1007/978-3-319-30843-2_16
11.  Aliev T.I. Characteristics of service disciplines with multiple priority classes. Izvestiya Akademii Nauk SSSR. Tekhnicheskaya Kibernetika, 1987, no. 6, pp. 188–191. (In Russian)
12.  Aliev T.I., Maharevs E. Queueing disciplines based on priority matrix. Scientific and Technical Journal of Information Technologies, Mechanics and Optics, 2014, no. 6, pp. 91–97. (In Russian)
13.  DeGroot M.H. Optimal Statistical Decisions. McGraw-Hill, 1970.
14.  Aliev T.I. Approximation of probability distributions in queueing models. Scientific and Technical Journal of Information Technologies, Mechanics and Optics, 2013, no. 2, pp. 88–93. (In Russian)
15.  Venttsel' E.S. Probability Theory. Moscow, Nauka Publ., 1969, 576 p. (In Russian)


Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
Copyright 2001-2022 ©
Scientific and Technical Journal
of Information Technologies, Mechanics and Optics.
All rights reserved.

Яндекс.Метрика