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.
Multiplicative solution for exponential G-networks with dependent service and preemptive resume of service of killed customers
MANZO, Rosanna;
2006-01-01
Abstract
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
