Title
G-Networks: Multiple Classes Of Positive Customers, Signals, And Product Form Results
Abstract
The purpose of this tutorial presentation is to introduce GNetworks, or Gelenbe Networks, which are product form queueing networks which include normal or positive customers, as well as negative customers which destroy other customers, and triggers which displace other customers from one queue to another. We derive the balance equations for these models in the context of multiple customer classes, show the product form results, and exhibit the traffic equations which – in this case, contrary to BCMP and Jackson networks - are non-linear. This leads to interesting issues of existence and uniqueness of the steady-state solution. Gelenbe Network can be used to model large scale computer systems and networks in which signaling functions represented by negative customers and triggers are used to achieve flow and congestion control.
Publication Date
1-1-2002
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume
2459
Number of Pages
1-16
Document Type
Article; Proceedings Paper
Personal Identifier
scopus
DOI Link
https://doi.org/10.1007/3-540-45798-4_1
Copyright Status
Unknown
Socpus ID
79952707649 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/79952707649
STARS Citation
Gelenbe, Erol, "G-Networks: Multiple Classes Of Positive Customers, Signals, And Product Form Results" (2002). Scopus Export 2000s. 2712.
https://stars.library.ucf.edu/scopus2000/2712