Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-26T07:51:34.692Z Has data issue: false hasContentIssue false
  • English
  • Français

FINDING EXPECTED REVENUES IN G-NETWORK WITH SIGNALS AND CUSTOMERS BATCH REMOVAL

Published online by Cambridge University Press:  25 September 2017

Mikhail Matalytski  and
Dmitry Kopats
Mikhail Matalytski
Affiliation:
Faculty of Mathematics and Computer Science, Grodno State University, Grodno, Belarus E-mail: m.matalytski@gmail.com
Dmitry Kopats
Affiliation:
Faculty of Mathematics and Computer Science, Grodno State University, Grodno, Belarus E-mail: m.matalytski@gmail.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The paper provides an analysis of G-network with positive customers and signals when signals arriving to the system move customer to another system or destroy in it a group of customers, reducing their number to a random value that is given by a probability distribution. The signal arriving to the system, in which there are no positive customers, does not exert any influence on the queueing network and immediately disappears from it. Streams of positive customers and signals arriving to each of the network systems are independent. Customer in the transition from one system to another brings the latest some revenue, and the revenue of the first system is reduced by this amount. A method of finding the expected revenues of the systems of such a network has been proposed. The case when the revenues from transitions between network states are deterministic functions depending on its states has been considered. A description of the network is given, all possible transitions between network states, transition probabilities, and revenues from state transitions are indicated. A system of difference-differential equations for the expected revenues of network systems has been obtained. To solve it, we propose a method of successive approximations, combined with the method of series. It is proved that successive approximations converge to the stationary solution of such a system of equations, and the sequence of approximations converges to a unique solution of the system. Each approximation can be represented as a convergent power series with an infinite radius of convergence, the coefficients of which are related by recurrence relations. Therefore, it is convenient to use them for calculations on a PC. The obtained results can be applied in forecasting losses in information and telecommunication systems and networks from the penetration of computer viruses into it and conducting computer attacks.

Keywords

applied probabilityqueueing theory
Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 31 , Special Issue 4: G-Networks and their Applications , October 2017 , pp. 561 - 575
Copyright
Copyright © Cambridge University Press 2017 

References

1.Stidham, S. & Weber, R. (1993). A survey of Markov decision models for control of networks of queues. Queueing Systems 13(1–3): 291–314.Google Scholar
2.Matalytski, M. (2009). On some results in analysis and optimization in the Markov networks with incomes and their application. Automation and Remote Control 70(2): 1689–1697.Google Scholar
3.Matalytski, M. (2015). Analysis and forecasting of expected incomes in Markov networks with bounded waiting time for the claims. Automation and Remote Control 76(6): 1005–1017.Google Scholar
4.Matalytski, M. (2015). Analysis and forecasting of expected incomes in Markov networks with unreliable servicing systems. Automation and Remote Control 76(3): 2179–2189.Google Scholar
5.Matalytski, M. (2017). Forecasting anticipated income in the Markov networks with positive and negative customers. Automation and Remote Control 78(5): 815–825.Google Scholar
6.Gelenbe, E., Gellman, M., Lent, R., Liu, P., & Su, P. (2004). Autonomous smart routing for network QoS. 1st International Conference on Autonomic Computing, Proceedings. International Conference, pp. 232–239.Google Scholar
7.Gelenbe, E. & Iasnogorodsky, R. (1980). A queue with server of walking type. Annales de l'Institut Henri Poincaré, Section B: Calcul de Probabilités et Statistiques. 16(1): 63–73.Google Scholar
8.Gelenbe, E. & Fourneau, J.-M. (2002). G-Networks with resets. Performance Evaluation 49(1–4): 179–191.Google Scholar
9.Gelenbe, E. (1991). Product form Queueing networks with negative and positive customers. Journal of Applied Probability 28: 656–663.Google Scholar
10.Gelenbe, E. (1993). G-networks with triggered customer movement. Journal of Applied Probability 30: 742–748.Google Scholar
11.Gelenbe, E. (1993). G-networks with signals and batch removal. Probability in the Engineering and Informational Sciences 7: 335–342.Google Scholar
12.Matalytski, M. & Naumenko, V. (2016). Stochastic networks with nonstandard moving customers. Monograph. Grodno: GrSU, 348 p.Google Scholar
13.Matalytski, M. (2008). Investigation Markov HM-networks with multiple class customers. News of NAS RB, Series Physics and Mathematics Science 4(4): 113–119.Google Scholar
14.Kosareva, E.V., Matalytski, M.A., & Rozov, K.V. (2012). About finding incomes in HM-networks with limited waiting time applications by successive approximations, combined with the method of series. VesnikHrodzenskahaDziarzhaunahaUniversitetaImiaIankiKupaly. Seryia 2. 3, 125–130.Google Scholar