Multiplicative solution for exponential g-networks with dependent service and preemptive resume of service of killed customers

G-networks with Poisson flow of positive customers, multi-server exponential nodes, and dependent service at the different nodes are studied. Every customer arriving at the network is defined by a set of random parameters: customer route, the length of customer route, customer volume and his service time at each route stage as well, A killed positive customer is removed at the last place in the queue and quits the network just after his remaining service time will be elaborated, Product form solution for multidimensional stationary distribution of the network state is derived. © ASMTA 2006, All Rights Reserved.

Authors
Bocharov P. 1 , Manzo R.2 , Pechinkin A. 3
Conference proceedings
Proceedings of ASMTA 2006: 13th International Conference on Analytical and Stochastic Modelling Techniques and Applications
Language
English
Pages
117-123
Status
Published
Year
2006
Organizations
  • 1 Department of Probability Theory and Mathematical Statistics, Peoples' Friendship University of Russia, Miklukho-Maklaya 6, Moscow 117198, Russian Federation
  • 2 Department of Information Engineering and Applied Mathematics, University of Salerno, via Ponte Don Melillo, 84084 Fisciano (SA), Italy
  • 3 Institute of Informatics Problems, RAS Vavilova 44, bat. 2, Moscow 119333, Russian Federation
Keywords
Dependent service; Exponential networks; Negative customers; Product form solution
Date of creation
19.10.2018
Date of change
19.10.2018
Short link
https://repository.rudn.ru/en/records/article/record/3312/
Share

Other records