Title
G-Networks With Resets
Keywords
Existence; Gelenbe networks; Negative customers; Product forms; Queuing networks; Resets; Triggers; Uniqueness
Abstract
Gelenbe networks (G-networks) are product form queuing networks which, in addition to ordinary customers, contain unusual entities such as "negative customers" which eliminate normal customers and "triggers" which move other customers from some queue to another. These models have generated much interest in the literature since the early 1990s. The present paper discusses a novel model for a reliable system composed of N unreliable systems, which can hinder or enhance each other's reliability. Each of the N systems also tests other systems at random; it is able to reset another system if it is itself in working condition and discovers that the other system has failed, so that the global reliability of the system is enhanced. This paper shows how an extension of G-networks that includes novel "reset" customers can be used to model this behavior. We then show that a general G-network model with resets has product form, and prove existence and uniqueness of its solution. © 2002 Elsevier Science B.V. All rights reserved.
Publication Date
9-1-2002
Publication Title
Performance Evaluation
Volume
49
Issue
1-4
Number of Pages
179-191
Document Type
Article; Proceedings Paper
Personal Identifier
scopus
DOI Link
https://doi.org/10.1016/S0166-5316(02)00127-X
Copyright Status
Unknown
Socpus ID
1642334040 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/1642334040
STARS Citation
Gelenbe, Erol and Fourneau, Jean Michel, "G-Networks With Resets" (2002). Scopus Export 2000s. 2459.
https://stars.library.ucf.edu/scopus2000/2459