Rostislav Razumchik
Orcid: 0000-0002-4092-5396Affiliations:
- Russian Academy of Sciences, Federal Research Center Informatics and Management, Moscow, Russia
According to our database1,
Rostislav Razumchik
authored at least 41 papers
between 2010 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on scopus.com
-
on orcid.org
On csauthors.net:
Bibliography
2023
Finite capacity single-server queue with Poisson input, general service and delayed renovation.
Eur. J. Oper. Res., 2023
2022
Upper bound on the rate of convergence and truncation bound for non-homogeneous birth and death processes on Z.
Appl. Math. Comput., 2022
Some Ergodicity And Truncation Bounds For A Small Scale Markovian Supercomputer Model.
Proceedings of the 36th ECMS International Conference on Modelling and Simulation, 2022
2021
Ergodicity bounds for the Markovian queue with time-varying transition intensities, batch arrivals and one queue skipping policy.
Appl. Math. Comput., 2021
Minimizing Mean Response Time In Batch-Arrival Non-Observable Systems With Single-Server FIFO Queues Operating In Parallel.
Proceedings of the 35th International ECMS International Conference on Modelling and Simulation, 2021
2020
On three methods for bounding the rate of convergence for some continuous-time Markov chains.
Int. J. Appl. Math. Comput. Sci., 2020
Method For Bounding The Rate Of Convergence For One Class Of Finite-Capacity Markovian Time-Dependent Queues With Batch Arrivals When Empty.
Proceedings of the 34th International ECMS Conference on Modelling and Simulation, 2020
A Simple Dispatching Policy For Minimizing Mean Response Time In Non-Observable Queues With SRPT Policy Operating In Parallel.
Proceedings of the 34th International ECMS Conference on Modelling and Simulation, 2020
2019
The resampling M/G/1 non-preemptive LIFO queue and its application to systems with uncertain service time.
Perform. Evaluation, 2019
Bounding the Rate of Convergence for One Class of Finite Capacity Time Varying Markov Queues.
Proceedings of the Computer Performance Engineering - 16th European Workshop, 2019
Minimizing Mean Response Time In Non-Observable Distributed Systems With Processor Sharing Nodes.
Proceedings of the 33rd International ECMS Conference on Modelling and Simulation, 2019
Proceedings of the Distributed Computer and Communication Networks, 2019
2018
Bounds on the rate of convergence for one class of inhomogeneous Markovian queueing models with possible batch arrivals and services.
Int. J. Appl. Math. Comput. Sci., 2018
Discrete Product Inventory Control System with Positive Service Time and Two Operation Modes.
Autom. Remote. Control., 2018
Proceedings of the European Conference on Modelling and Simulation, 2018
2017
CoRR, 2017
Delay Analysis of Resequencing Buffer in Markov Environment with HOQ-FIFO-LIFO Policy.
Proceedings of the Computer Performance Engineering - 14th European Workshop, 2017
Proceedings of the European Conference on Modelling and Simulation, 2017
2016
Queueing Syst. Theory Appl., 2016
Autom. Remote. Control., 2016
Proceedings of the 8th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2016
Modeling and analyzing licensed shared access operation for 5G network as an inhomogeneous queue with catastrophes.
Proceedings of the 8th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2016
Proceedings of the 30th European Conference on Modelling and Simulation, 2016
New Scheduling Policy For Estimation Of Stationary Performance Characteristics In Single Server Queues With Inaccurate Job Size Information.
Proceedings of the 30th European Conference on Modelling and Simulation, 2016
Simulation And Selection Of Efficient Decision Rules In Bank's Manual Underwriting Process.
Proceedings of the 30th European Conference on Modelling and Simulation, 2016
2015
Ergodicity And Perturbation Bounds For Inhomogeneous Birth And Death Processes With Additional Transitions From And To The Origin.
Int. J. Appl. Math. Comput. Sci., 2015
Some results for inhomogeneous birth-and-death process with application to staffing problem in telecommunication service systems.
Proceedings of the 7th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2015
2014
Hysteretic Control Technique for Overload Problem Solution in Network of SIP Servers.
Comput. Informatics, 2014
Analysis of Finite Capacity Queue with Negative Customers and bunker for Ousted Customers using Chebyshev and Gegenbauer polynomials.
Asia Pac. J. Oper. Res., 2014
Analysis of an M|G|1|R queue with batch arrivals and two hysteretic overload control policies.
Int. J. Appl. Math. Comput. Sci., 2014
Proceedings of the 6th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2014
Time-related stationary characteristics in queueing system with constant service time under hysteretic policy.
Proceedings of the 6th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2014
Analytical Modelling And Simulation For Performance Evaluation Of SIP Server With Hysteretic Overload Control.
Proceedings of the 28th European Conference on Modelling and Simulation, 2014
Proceedings of the 28th European Conference on Modelling and Simulation, 2014
2013
Proceedings of the Internet of Things, Smart Spaces, and Next Generation Networking, 2013
Approach For Analysis Of Finite M2/M2/1/R With Hysteric Policy For Sip Server Hop-By-Hop Overload Control.
Proceedings of the 27th European Conference on Modelling and Simulation, 2013
Stationary Characteristics Of Homogenous Geo/Geo/2 Queue With Resequencing In Discrete Time.
Proceedings of the 27th European Conference on Modelling and Simulation, 2013
2012
Proceedings of the 4th International Congress on Ultra Modern Telecommunications and Control Systems, 2012
Proceedings of the 26th European Conference on Modelling and Simulation, 2012
2010
Waiting characteristics of queueing system Geo/Geo/1/∞ with negative claims and a bunker for superseded claims in discrete time.
Proceedings of the International Conference on Ultra Modern Telecommunications, 2010