Stationary probability distribution for states of G-networks with constrained sojourn time

Resumo

We consider an exponential queueing network that differs from a Gelenbe network (with the usual positive and so-called negative customers), first, in that the sojourn time of customers at the network nodes is bounded by a random value whose conditional distribution for a fixed number of customers in a node is exponential. Second, we significantly relax the conditions on possible values of parameters for incoming Poisson flows of positive and negative customers in Gelenbe’s theorem. Claims serviced at the nodes and customers leaving the nodes at the end of their sojourn time can stay positive, become negative, or leave the network according to different routing matrices. We prove a theorem that generalizes Gelenbe’s theorem.