Product form solution for a G-network with signals and impatient service

UK Simulation Society

This paper presents some results on an exponential queuing network with signals and impatient service. Positive customers and signals arrive to each node according to a Poisson process. When the service is finished in a node, a positive customer moves to another node with fixed probabilities either as a positive customer or as a signal, or quits the network. Every signal is activated during a random exponentially distributed amount of time. Activated signals with fixed probabilities either move a customer from the node they arrive to another node or kill a positive customer. Each customer can be served in a node at most a random time ("patient" time) distributed exponentially. When the patient service is finished, the customer with fixed probabilities either goes to another node or quits the network. Product form solution has been obtained for stationary state probabilities of such G-network in the case of positive customers processed by a single server in each node as well as in the case of an analogous symmetrical G-network in which service rate of a positive customer in a node depends on its state. © 2014, UK Simulation Society. All rights reserved.

G-networks; Impatient service; Positive customers; Product form solution; Article

Open access content. Open access content
open access

RUNEI oai:rour.neicon.ru:rour/243003
rudn:oai:repository.rudn.ru:r/102
1076886155

NEICON SCIENT LIBR
From OAIster®, provided by the OCLC Cooperative.

edsoai.on1076886155