Oleg Tikhonenko
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Oleg Tikhonenko has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Marcin Ziółkowski
Warsaw University of Life Sciences
7 shared publications - Wojciech M. Kempa
Department of Mathematical Methods in Technics and Informatics, Silesian University of Technology, 44-100 Gliwice, Poland
6 shared publications - Evsey Morozov
Department of Applied Mathematics and Cybernetics, Petrozavodsk State University, Lenin str. 33, 185910 Petrozavodsk, Russia
2 shared publications Magdalena Kawecka
Częstochowa University of Technology
2 shared publicationsLyubov Potakhina
Petrozavodsk State University
1 shared publication- Lyubov Potakhina
Institute of Applied Mathematical Research, Karelian Research Centre
1 shared publication
Latest Publications
- Open Access
- 18 June 2024
- Published by Polish Academy of Sciences Chancellery in Bulletin Of The Polish Academy Of Sciences-Technical Sciences
- p. 150813
MX/G/1/∞ single-server queueing system with random volume customers and multiple vacations
In the present paper, we investigate the model of a single-server queueing system with unlimited queue (of MX/G/1/∞-type), random volume customers, unlimited memory buffer and multiple vacations. In analyzed system, arriving customers (that form Poisson entrance flow of groups of customers) transport some information measured in bytes so they are assumed to be additionally characterized by some non-negative random volume. Customer service time generally depends on his volume. Information delivered by a customer is written out into dedicated unlimited memory buffer until customer ends his service. In addition, in considered system the mechanism of multiple vacations is implemented which means that server can have some breaks (rests) for a random period of time but breaks begin only in the moments when there is no customer present in the system. The above-mentioned mechanism has obvious influence on customer waiting time and, in consequence, on customers total volume. For the introduced model, we obtain general formula for the steady-state customers total volume distribution in the terms of Laplace–Stieltjes transforms as well as formulae defining its first two moments. Analysis of some interesting, practical special cases of the model and numerical computations are attached as well together with examples of possible applications of the model regarding real telecommunication or computer systems.
- 18 June 2024
- Published by Polish Academy of Sciences Chancellery in Bulletin Of The Polish Academy Of Sciences-Technical Sciences
- p. 150813
Open AccessMX/G/1/∞ single-server queueing system with random volume customers and multiple vacations
In the present paper, we investigate the model of a single-server queueing system with unlimited queue (of MX/G/1/∞-type), random volume customers, unlimited memory buffer and multiple vacations. In analyzed system, arriving customers (that form Poisson entrance flow of groups of customers) transport some information measured in bytes so they are assumed to be additionally characterized by some non-negative random volume. Customer service time generally depends on his volume. Information delivered by a customer is written out into dedicated unlimited memory buffer until customer ends his service. In addition, in considered system the mechanism of multiple vacations is implemented which means that server can have some breaks (rests) for a random period of time but breaks begin only in the moments when there is no customer present in the system. The above-mentioned mechanism has obvious influence on customer waiting time and, in consequence, on customers total volume. For the introduced model, we obtain general formula for the steady-state customers total volume distribution in the terms of Laplace–Stieltjes transforms as well as formulae defining its first two moments. Analysis of some interesting, practical special cases of the model and numerical computations are attached as well together with examples of possible applications of the model regarding real telecommunication or computer systems.
- Open Access
- 29 December 2022
- Published by Polish Academy of Sciences Chancellery in Bulletin Of The Polish Academy Of Sciences-Technical Sciences
- Vol. 70 (6) , 143647
Single–server queueing system with limited queue, random volume customers and unlimited sectorized memory buffer
In the present paper, we analyze the model of a single–server queueing system with limited number of waiting positions, random volume customers and unlimited sectorized memory buffer. In such a system, the arriving customer is additionally characterized by a non– negative random volume vector whose indications usually represent the portions of unchanged information of a different type that are located in sectors of unlimited memory space dedicated for them during customer presence in the system. When the server ends the service of a customer, information immediately leaves the buffer, releasing resources of the proper sectors. We assume that in the investigated model, the service time of a customer is dependent on his volume vector characteristics. For such defined model, we obtain a general formula for steady–state joint distribution function of the total volume vector in terms of Laplace-Stieltjes transforms. We also present practical results for some special cases of the model together with formulae for steady–state initial moments of the analyzed random vector, in cases where the memory buffer is composed of at most two sectors. Some numerical computations illustrating obtained theoretical results are attached as well.
- 29 December 2022
- Published by Polish Academy of Sciences Chancellery in Bulletin Of The Polish Academy Of Sciences-Technical Sciences
- Vol. 70 (6) , 143647
Open AccessSingle–server queueing system with limited queue, random volume customers and unlimited sectorized memory buffer
In the present paper, we analyze the model of a single–server queueing system with limited number of waiting positions, random volume customers and unlimited sectorized memory buffer. In such a system, the arriving customer is additionally characterized by a non– negative random volume vector whose indications usually represent the portions of unchanged information of a different type that are located in sectors of unlimited memory space dedicated for them during customer presence in the system. When the server ends the service of a customer, information immediately leaves the buffer, releasing resources of the proper sectors. We assume that in the investigated model, the service time of a customer is dependent on his volume vector characteristics. For such defined model, we obtain a general formula for steady–state joint distribution function of the total volume vector in terms of Laplace-Stieltjes transforms. We also present practical results for some special cases of the model together with formulae for steady–state initial moments of the analyzed random vector, in cases where the memory buffer is composed of at most two sectors. Some numerical computations illustrating obtained theoretical results are attached as well.
- Open Access
- 15 June 2021
- Published by Faculty of Organisation and Informatics in Journal of information and organizational sciences
- Vol. 45 (1) , 21-38
Queueing Systems with Random Volume Customers and their Performance Characteristics
In the paper, we consider non-classical queueing systems with non-homogeneous customers. The non-homogeneity we treat in the following sense: in systems under consideration, we characterize each customer by random capacity (volume) that can have an influence on his service time. We analyze a stochastic process having the sense of the total volume of all customers present in the system at given time instant. Such analysis for different queueing systems with unlimited or limited total volume can be used in designing of nodes of computer and communication networks while determining their buffer space capacity. We discuss basic problems of the theory of these systems and their performance characteristics. We also present some examples and results for systems with random volume customers
- 15 June 2021
- Published by Faculty of Organisation and Informatics in Journal of information and organizational sciences
- Vol. 45 (1) , 21-38
Open AccessQueueing Systems with Random Volume Customers and their Performance Characteristics
In the paper, we consider non-classical queueing systems with non-homogeneous customers. The non-homogeneity we treat in the following sense: in systems under consideration, we characterize each customer by random capacity (volume) that can have an influence on his service time. We analyze a stochastic process having the sense of the total volume of all customers present in the system at given time instant. Such analysis for different queueing systems with unlimited or limited total volume can be used in designing of nodes of computer and communication networks while determining their buffer space capacity. We discuss basic problems of the theory of these systems and their performance characteristics. We also present some examples and results for systems with random volume customers
- Open Access
- 1 January 2021
- Published by University of Zielona Góra, Poland in International Journal of Applied Mathematics and Computer Science
- Vol. 31 (3) , 471-486
Queueing systems with random volume customers and a sectorized unlimited memory buffer
In the present paper, we concentrate on basic concepts connected with the theory of queueing systems with random volume customers and a sectorized unlimited...
- 1 January 2021
- Published by University of Zielona Góra, Poland in International Journal of Applied Mathematics and Computer Science
- Vol. 31 (3) , 471-486
Open AccessQueueing systems with random volume customers and a sectorized unlimited memory buffer
In the present paper, we concentrate on basic concepts connected with the theory of queueing systems with random volume customers and a sectorized unlimited...
- Open Access
- 30 April 2020
- Published by Polish Academy of Sciences Chancellery in Bulletin Of The Polish Academy Of Sciences-Technical Sciences
- Vol. 68 (2) , 289-297
Performance evaluation of unreliable system with infinite number of servers
In the paper, we investigate queueing system M/G/∞ with non–homogeneous customers. As non–homogenity, we mean that each customer is characterized by some arbitrarily distributed random volume. The arriving customers appear according to a stationary Poisson process. Service time of a customer is proportional to his volume. The system is unreliable what means that all its servers can break simultaneously and then the repair period goes on for random time having an arbitrary distribution. During this period, customers present in the system and arriving to it are not served. Their service continues immediately after repair period termination. Time intervals of the system in good repair mode have an exponential distribution. For such system, we determine steady–state sojourn time and total volume of customers present in it distributions. We also estimate the loss probability for the similar system with limited total volume. An analysis of some special cases and some numerical examples are attached as well.
- 30 April 2020
- Published by Polish Academy of Sciences Chancellery in Bulletin Of The Polish Academy Of Sciences-Technical Sciences
- Vol. 68 (2) , 289-297
Open AccessPerformance evaluation of unreliable system with infinite number of servers
In the paper, we investigate queueing system M/G/∞ with non–homogeneous customers. As non–homogenity, we mean that each customer is characterized by some arbitrarily distributed random volume. The arriving customers appear according to a stationary Poisson process. Service time of a customer is proportional to his volume. The system is unreliable what means that all its servers can break simultaneously and then the repair period goes on for random time having an arbitrary distribution. During this period, customers present in the system and arriving to it are not served. Their service continues immediately after repair period termination. Time intervals of the system in good repair mode have an exponential distribution. For such system, we determine steady–state sojourn time and total volume of customers present in it distributions. We also estimate the loss probability for the similar system with limited total volume. An analysis of some special cases and some numerical examples are attached as well.
- Open Access
- 30 June 2019
- Published by Polish Academy of Sciences Chancellery in Bulletin Of The Polish Academy Of Sciences-Technical Sciences
- Vol. 67 (3) , 489-500
M/G/n/(0, V) Erlang queueing system with non-homogeneous customers, non-identical servers and limited memory space
In the present paper, we investigate a multi-server Erlang queueing system with heterogeneous servers, non-homogeneous customers and limited memory space. The arriving customers appear according to a stationary Poisson process and are additionally characterized by some random volume. The service time of the customer depends on his volume and the joint distribution function of the customer volume and his service time can be different for different servers. The total customers volume is limited by some constant value. For the analyzed model, steady-state distribution of number of customers present in the system and loss probability are calculated. An analysis of some special cases and some numerical examples are attached as well.
- 30 June 2019
- Published by Polish Academy of Sciences Chancellery in Bulletin Of The Polish Academy Of Sciences-Technical Sciences
- Vol. 67 (3) , 489-500
Open AccessM/G/n/(0, V) Erlang queueing system with non-homogeneous customers, non-identical servers and limited memory space
In the present paper, we investigate a multi-server Erlang queueing system with heterogeneous servers, non-homogeneous customers and limited memory space. The arriving customers appear according to a stationary Poisson process and are additionally characterized by some random volume. The service time of the customer depends on his volume and the joint distribution function of the customer volume and his service time can be different for different servers. The total customers volume is limited by some constant value. For the analyzed model, steady-state distribution of number of customers present in the system and loss probability are calculated. An analysis of some special cases and some numerical examples are attached as well.
- 29 May 2018
- Published by Springer Nature
- p. 272-285
Multiserver Queueing System with Non-homogeneous Customers and Sectorized Memory Space
- 29 May 2018
- Published by Springer Nature
- p. 272-285
Multiserver Queueing System with Non-homogeneous Customers and Sectorized Memory Space
- 27 September 2017
- Published by Springer Nature
- p. 158-167
Combination of Queueing Systems of Different Types with Common Buffer: A Theoretical Treatment
- 27 September 2017
- Published by Springer Nature
- p. 158-167
Combination of Queueing Systems of Different Types with Common Buffer: A Theoretical Treatment
- 30 May 2017
- Published by Springer Nature
- p. 366-379
Erlang Service System with Limited Memory Space Under Control of AQM Mechanizm
- 30 May 2017
- Published by Springer Nature
- p. 366-379
Erlang Service System with Limited Memory Space Under Control of AQM Mechanizm