Volume 38, Number 2, April-June 2004Advances in modelling of complex systems
|Page(s)||105 - 119|
|Published online||15 April 2004|
Product form solution for g-networks with dependent service
Department of Probability Theory and Mathematical Statistics
Peoples' Friendship University of Russia,
2 Department of Information Engineering and Applied Mathematics, University of Salerno, Italy; email@example.com.
3 Institute of Informatics Problems Russian Academy of Sciences Moscow, Russia; APechinkin@ipiran.ru.
We consider a G-network with Poisson flow of positive customers. Each positive customer entering the network is characterized by a set of stochastic parameters: customer route, the length of customer route, customer volume and his service length at each route stage as well. The following node types are considered: Negative customers arriving at each node also form a Poisson flow. A negative customer entering a node with k customers in service, with probability 1/k chooses one of served positive customer as a “target”. Then, if the node is of a type 0 the negative customer immediately “kills” (displaces from the network) the target customer, and if the node is of types 1–3 the negative customer with given probability depending on parameters of the target customer route kills this customer and with complementary probability he quits the network with no service. A product form for the stationary probabilities of underlying Markov process is obtained.
© EDP Sciences, 2004
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.