Hostname: page-component-8448b6f56d-m8qmq Total loading time: 0 Render date: 2024-04-18T01:31:59.514Z Has data issue: false hasContentIssue false
  • English
  • Français

ANALYSIS OF THE NETWORK WITH MULTIPLE CLASSES OF POSITIVE AND NEGATIVE CUSTOMERS AT A TRANSIENT REGIME

Published online by Cambridge University Press:  10 April 2018

Mikhail Matalytski
Mikhail Matalytski*
Affiliation:
Institute of Mathematics, Czestochowa University of Technology, Czestochowa, Poland E-mail: m.matalytski@gmail.com
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper is devoted to the investigation of the G-network with multiple classes of positive and negative customers. The purpose of the investigation is to analyze such a network at a transient regime, to find the state probabilities of the network that depend on time. In the first part, a description of the functioning of G-networks with positive and negative customers is provided, when a negative customer when arriving to the system destroys a positive customer of its class. Streams of positive and negative customers arriving at each of the network systems are independent. Services of positive customers of all types occur in accordance with a random selection of them for service. For nonstationary probabilities of network states, a system of Kolmogorov's difference-differential equations (DDE) has been derived. A method for their finding is proposed. It is based on the use of a modified method of successive approximations, combined with the method of series. It is proved that successive approximations converge with time to a stationary probability distribution, the form of which is indicated in this paper, and the sequence of approximations converges to the unique solution of the DDE system. Any successive approximation is representable in the form of a convergent power series with an infinite radius of convergence, the coefficients of which satisfy recurrence relations, which is convenient for computer calculations. A model example illustrating the determination of the time-dependent probabilities of network states using this technique has been calculated. The obtained results can be applied in modeling the behavior of computer viruses and attacks in information and telecommunication systems and networks, for example, as a model of the impact of some file viruses on server resources. variable.

Keywords

combined with the method of seriesG-networkmethod of successive approximationsmultiple classes of positive and negative customerstransient regime
Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 33 , Issue 2 , April 2019 , pp. 172 - 185
Copyright
Copyright © Cambridge University Press 2018 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Gelenbe, E. (1991). Product form queueing networks with negative and positive customers. Journal of Applied Probability, 28: 656–663.Google Scholar
2.Gelenbe, E. & Schassberger, R. (1992). Stability of G-networks. Probability in the Engineering and Informational Sciences, 6(1): 271–276.Google Scholar
3.Gelenbe, E. (1994). G-networks: a unifying model for neural and queueing networks. Annals of Operations Research, 48: 433–461.Google Scholar
4.Fourneau, J.N., Gelenbe, E. & Suros, R. (1996). G-networks with multiple classes of negative and positive customers. Theoretical Computer Science, 155: 141–156.Google Scholar
5.Gelenbe, E., Labed, A. (1998). G-networks with multiple classes of signals and positive customers. European Journal of Operations Research, 108(2): 293–305.Google Scholar
6.Matalytski, M. (2017). Finding non-stationary state probabilities of G-network with signal and customers batch removal. Probability the Engineering and Informational Sciences, 31(4): 396–412.Google Scholar
7.Gelenbe, E. (1993). G-Networks with signals and batch removal. Probability in the Engineering and Informational Sciences, 7: 335–342.Google Scholar
8.Gelenbe, E. (1993). G-networks with instantaneous customer movement. Journal of Applied Probability, 30(3): 742–748.Google Scholar
9.Gelenbe, E. (2007). Steady-state solution of probabilistic gene regulatory networks. Physical Review, 76: 031903.Google Scholar