- Diffusion approximation of the network with limited number of same type customers and time dependent service parameters
Object's details: Diffusion approximation of the network with limited number of same type customers and time dependent service parameters
Structure
Prace Naukowe Instytutu Matematyki i Informatyki=Scientific Research of the Institute of Mathematics and Computer Science.
Description
- Title:
- Group title:
- Creator: ;
- Subject and Keywords: ; ;
- Publisher:
- Place of publishing:
- Date:
- Resource Type:
- Format:
- Resource Identifier: oai:reader.digitarium.pcss.pl:308655
- Language:
- Coverage:
- Oryginal in:
Object is located in the collections:
See also
Asymptotic analysis of the closed queueing structure with time-dependent service parameters and single-type messages
Creator:Matalytski Mikhail; Rusilko Tatiana; Pankov Andrey
Date:2013
Type:czasopismo
Investigation Of Queuening Network With Unreliable Systems And Large Number Of Messages
Creator:Matalytski Mikhail; Statkevich Sviataslau
Date:2012
Type:artykuł
Analysis of Markov HM-queueing networks with FIFO discipline at the transient regime and its application
Creator:Matalytski Mikhail
Date:2015
Type:artykuł
Finding the expected revenues in Markov networks with positive and negative customers at a stationary regime
Creator:Matalytski Mikhail; Kopats Dmitry
Date:2018
Type:czasopismo
Finding the probabilistically-temporal characteristics of Markov G-network with batch removal of positive customers
Creator:Matalytski Mikhail; Naumenko Victor; Kopats Dmitry
Date:2016
Type:artykuł
Analysis of the queueing network with a random waiting time of negative customers at a non-stationary regime
Creator:Naumenko Victor; Matalytski Mikhail; Kopats Dmitry
Date:2016
Type:artykuł
Application of HM-networks with positive and negative heterogeneous requests for finding memory volume in information systems
Creator:Matalytski Mikhail; Zajac Pawel; Kopats Dmitry
Date:2020
Type:czasopismo
Investigation of g-networks with restart at a non-stationary mode and their application
Creator:Matalytski Mikhail; Naumenko Victor; Kopats Dmitry
Date:2019
Type:artykuł