Queueing networks with negative customers (Gnetworks), 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. For such G-networks, the multidimensional stationary distribution of the network state probabilities is shown to be representable in product form.
Product Form Solution for Exponential G-Networks with Dependent Service and Completion of Service of Killed Customers
D'APICE, Ciro;
2005-01-01
Abstract
Queueing networks with negative customers (Gnetworks), 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. For such G-networks, the multidimensional stationary distribution of the network state probabilities is shown to be representable in product form.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
