Malinkovskii Yurii Vladimirovich

Publications in Math-Net.Ru

1. Insensitivity of the stationary distribution of an open queuing network with an exponential restriction on the time of stay
   
   Avtomat. i Telemekh., 2024, no. 9,  93–100
2. Open one-line Jackson networks with exponential constrains on waiting times modification by product form of the stationary distribution
   
   PFMT, 2024, no. 4(61),  53–56
3. Exponential queueing networks with countable set of flows of negative customers and limited sojourn time
   
   PFMT, 2023, no. 2(55),  39–43
4. Quasireversibility of queuing systems with nonstandard batch customer motion
   
   PFMT, 2022, no. 4(53),  80–83
5. Quasi-reversibility of Jackson's networks with exponential constraint on the sojourn time of claims
   
   PFMT, 2021, no. 1(46),  62–64
6. Stationary distribution of Jackson networks with an exponential constraint on the sojourn time of claims
   
   PFMT, 2020, no. 3(44),  73–77
7. Queueing networks with finite number of flows of negative customers and with limited sojourn time
   
   PFMT, 2018, no. 1(34),  64–68
8. Stationary probability distribution for states of $G$-networks with constrained sojourn time
   
   Avtomat. i Telemekh., 2017, no. 10,  155–167
9. Jackson networks with single-line nodes and limited sojourn or waiting times
   
   Avtomat. i Telemekh., 2015, no. 4,  67–79
10. Steady-state exponential networks with bypassing of communications and with generation of arriving and servicing random size customer batches
    
    PFMT, 2013, no. 3(16),  71–78
11. Characterization of the stationary distribution of the batch-transfer networks as a product of biased geometric distributions
    
    Avtomat. i Telemekh., 2010, no. 12,  43–56
12. Characterization of network stationary distribution with batch moving in geometric product form
    
    PFMT, 2009, no. 1(1),  51–59
13. Queueing Networks with Dynamic Routing and Dynamic Stochastic Bypass of Nodes
    
    Probl. Peredachi Inf., 37:3 (2001),  55–66
14. Stationary distribution of the states of networks with bypasses and “negative” customers
    
    Avtomat. i Telemekh., 2000, no. 8,  79–85
15. Multiplicativity of a Stationary Distribution of an Open Queueing Network with Standard Nodes and Single-Type Calls
    
    Probl. Peredachi Inf., 35:1 (1999),  75–89
16. Invariance of the stationary distribution of the states of modified Jackson and Gordon–Newell networks
    
    Avtomat. i Telemekh., 1998, no. 9,  29–36
17. Queueing systems with instantaneously served customers. II. Models with customers of several types
    
    Avtomat. i Telemekh., 1998, no. 2,  62–71
18. Queueing systems with instantaneously served customers. I. Model with customers of one type
    
    Avtomat. i Telemekh., 1998, no. 1,  92–106
19. Output flows in modified Jackson networks
    
    Avtomat. i Telemekh., 1992, no. 9,  134–138
20. A criterion for the representability of the stationary distribution of the states of an open Markov queueing network with different customer classes in the form of a product
    
    Avtomat. i Telemekh., 1991, no. 4,  75–83
21. Queueing networks with bypasses of order nodes
    
    Avtomat. i Telemekh., 1991, no. 2,  102–110
22. Criterion for pointwise independence of states of units in an open stationary Markov queueing network with one class of customers
    
    Teor. Veroyatnost. i Primenen., 35:4 (1990),  779–784
23. Multiplicity of a stationary state distribution for one kind of bulk service networks
    
    Avtomat. i Telemekh., 1988, no. 2,  108–118