Skip to main content
×
×
Home

FINDING EXPECTED REVENUES IN G-NETWORK WITH MULTIPLE CLASSES OF POSITIVE AND NEGATIVE CUSTOMERS

  • Mikhail Matalytski (a1)
Abstract

Investigation of the G-network with multiple classes of positive and negative customers has been carried out in the article. The purpose of the investigation is to analyze such a network at a transient regime, finding expected revenues in the network systems depending on time. A negative customer arriving to the system and destroys a positive customer of its class. Streams of positive and negative customers arriving to 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 the expected revenues, a system of Kolmogorov's difference-differential equations 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. A model example illustrating the finding of time-dependent expected revenues of network systems has been calculated, which shows that the expected revenues of network systems can be either increasing or decreasing time functions. 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.

Copyright
References
Hide All
1. Crabil, T. (1972). Optimal control of a service facility with variable exponential service times and constant arrival rate. Manage. Sci. (18): 560566.
2. Foschini, G. (1977). On heavy traffic diffusion analysis and dynamic routing in packet switched networks. Comput. Perform. (10): 499514.
3. Stidham, S., Weber, R. (1993). A survey of Markov decision models for control of networks of queue. Queueing Syst. (3): 291314.
4. Matalytski, M., Pankov, A. (2003). Analysis of the stochastic model of the changing of incomes in the open banking network. Comput. Sci. 3(5): 1929.
5. Matalytski, M., Pankov, A. (2003). Incomes probabilistic models of the banking network. Sci. Res. Inst. Math. Comput. Sci. Czestochowa Univ. Technol. 1(2): 99104.
6. Matalytski, M. (2009). On some results in analysis and optimization of Markov networks with incomes and their application. Autom. Remote Control 70(10): 16831697.
7. Howard, R. (1964). Dynamic programming and Markov processes. Moskow. Sov. Radio.
8. Gelenbe, E., Glynn, P., Sigman, K. (1991). Queues with negative arrivals. J. Appl. Probab. 28: 245250.
9. Gelenbe, E. (1993). G-Networks with triggered customer movement. J. Appl. Probab. 30(3): 742748.
10. Gelenbe, E. (1993). G-Networks with signals and batch removal. Probab. Eng. Inf. Sci. 7: 335342.
11. Gelenbe, E. (1991). Product form queueing networks with negative and positive customers. J. Appl. Probab. 28: 656663.
12. Matalytski, M. (2015). Analysis and forecasting of expected incomes in Markov networks with bounded waiting time for claims. Autom. Remote Control (6): 10051017.
13. Matalytski, M. (2015). Analysis and forecasting of expected incomes in Markov networks with unreliable servicing systems. Autom. Remote Control (12): 21792189.
14. Matalytski, M. (2017). Forecasting anticipated incomes in the Markov networks with positive and negative customers. Autom. Remote Control 78(5): 815825.
15. Gelenbe, E., Schassberger, R. (1992). Stability of G-networks. Probab. Eng. Inf. Sci. 6(1): 271276.
16. Gelenbe, E. (1994). G-networks: a unifying model for neural and queueing networks. Ann. Oper. Res. 48: 433461.
17. Fourneau, J.N., Gelenbe, E., Suros, R. (1996). G-networks with multiple classes of negative and positive customers. Theor. Comput. Sci. 155: 141156.
18. Gelenbe, E., Labed, A. (1998). G-networks with multiple classes of signals and positive customers. Eur. J. Oper. Res. 108(2): 293305.
19. Matalytski, M. (2017). Analysis of G-network with multiple classes of customers at transient behavior. Probab. Eng. Inf. Sci.
20. Matalytski, M. (2017). Finding non-stationary state probabilities of G-network with signal and customers batch removal. Probab. Eng. Inf. Sci. 31(4): 396412.
21. Korobeinik, Yu.F. (1970). Differential equations of infinite order and infinite systems of differential equations. Proc. USSR Acad. Sci. Math. Series 34(4): 881922.
22. Valeev, K.G., Zhautykov, O.A. (1974). Infinite systems of differential equations. Alma-Ata: Sci. 415 p.
23. Matalytski, M., Naumenko, V. (2015). Simulation modeling of HM-networks with consideration of positive and negative messages. J. Appl. Math. Comput. Mech. 14(2): 4960.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Probability in the Engineering and Informational Sciences
  • ISSN: 0269-9648
  • EISSN: 1469-8951
  • URL: /core/journals/probability-in-the-engineering-and-informational-sciences
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed