Oleg Tikhonenko

Prof. Dr. Oleg Tikhonenko

Institute of Computer Science, Cardinal Stefan Wyszyński University in Warsaw, Ul. Wóycickiego 1/3, 01-938 Warsaw, Poland
orcid

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2005 in Problems of Information Transmission
Verified
Journal Article
Closed access
PDF file
OTOleg Tikhonenko
Oleg Tikhonenko


1 December 2016 in International Journal of Applied Mathematics and Computer Science
Verified
Journal Article
Open access
OTOleg Tikhonenko
Oleg Tikhonenko
WKWojciech Kempa
Wojciech Kempa
A queueing system of the M/G/n-type, n ≥ 1, with a bounded total volume is considered. It is assumed that the volumes of the arriving packets are generally distributed random variables. Moreover, the AQM-type mechanism is used to control the actual buffer state: each of the arriving packets is dropped with a probability depending on its volume and the occupied volume of the system at the pre-arrival epoch. The explicit formulae for the stationary queue-size distribution and the loss probability are found. Numerical examples illustrating theoretical formulae are given as well

20 May 2010 in Automation and Remote Control
Verified
Journal Article
Closed access
PDF file
OTOleg Tikhonenko
Oleg Tikhonenko
Consideration was given to a processor-sharing system with heterogeneous customers serviced by system resources of two types: the first, discrete, type necessarily consists of an integer number N of units (servers), and the second type (memory) may be discrete or continuous. The customer type is defined by the number of units of the first-type resources required to service it. In addition to the need for the first-type resource, each customer is characterized by a certain volume, that is, the amount of the second-type resource required to service it. The total amount of customers (total busy resource of the second type) in the system is limited by a certain positive value (memory space) V. The customer volume and its length (amount of work required to service it) are generally dependent. Their joint distribution also depends on the customer type. For this system, the stationary distribution of the number of customers sojourning in the system and the probabilities of losing customers of each type were determined.


1 January 2014 in Communications in Computer and Information Science
Verified
Book Chapter
Closed access
PDF file
EMEvsey Morozov
Evsey Morozov
RNRuslana Nekrasova
Ruslana Nekrasova
LPLyubov Potakhina
Lyubov Potakhina
OTOleg Tikhonenko
Oleg Tikhonenko