Finding the expected revenues in Markov networks with positive and negative customers at a stationary regime
Treść / Zawartość
Finding the expected revenues in the queueing systems (QS) of open Markov G-networks of two types, with positive and negative customers and with positive customers and signals, has been described in the paper. A negative customer arriving to the system destroys one positive customer if at least one is available in the system, thus reducing the number of positive customers in the system by one. The signal, coming into an empty system (where there are no positive customers), does not have any impact on the network and immediately disappears from it. Otherwise, if the system is not empty, when it receives a signal, the following events can occur: the incoming signal instantly moves the positive customer from one QS into another with a certain probability, or with the other probability, the signal is triggered as a negative customer.
Bibliogr. 15 poz.
-  Crabill, T. (1972). Optimal control of a service facility with variable exponential service times and constant arrival rate. Management Science, 18, 560-566.
-  Foschini, G. (1977). On heavy traffic diffusion analysis and routing in packet switched networks. Computer Performance, 9, 499-514.
-  Stidham, S., & Weber, R. (1993). A survey of Markov decision models for control of networks of queue. Queueing Systems, 3, 291-314.
-  Matalytski, M., & Pankov, A. (2003). Analysis of stochastic model of the changing of incomes in the open banking network. Vestnik GrSU, 3, 5, 19-29.
-  Matalytski, M., & Pankov, A. (2003). Incomes probabilistic models of banking network. Scientific Research of the Institute of Mathematics and Computer Science of Czestochowa University of Technology, 11, 2, 99-104.
-  Matalytski, M. (2009). On some results in analysis and optimization of Markov networks with incomes and their application. Automation and Remote Control, 70, 10, 1683-1697.
-  Koluzaeva, E., & Matalytski, M. (2011). Analysis and Optimization of Queueing Networks. Saarbrucken: LAPLAMBERT Academic Publishing.
-  Howard, R. (1964). Dynamic Programming and Markov Processes. Moscow: Soviet Radio.
-  Matalytski, M. (2015). Analysis and forecasting of expected incomes in Markov network with bounded waiting time for the claims. Automation and Remote Control, 76, 6, 1005-1017.
-  Matalytski, M. (2015). Analysis and forecasting of expected incomes in Markov network with unreliable servicing systems. Automation and Remote Control, 15, 11, 2179-2189.
-  Matalytski, M., & Naumenko, V. (2016). Stochastic Networks with Non-Standard Customers Movement. Grodno: GrSU.
-  Gelenbe, E. (1991). Product form queuing networks with negative and positive customers. Journal of Applied Probability, 28, 656-663.
-  Gelenbe, E. (1993). G-networks with triggered customer movement. Journal of Applied Probability, 30, 742-748.
-  Prokhorov, Y.V., & Rozanov, U.A. (1973). The Theory of Probability. Moscow: Science.
-  Bocharov, P.P., & Vishnevsky, V.M. (2003). G-networks: the development of the theory of multiplicative network. Automation and Remote Control, 5, 46-74.
Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2018).