Title

G-networks: Multiple classes of positive customers, signals, and product form results

Authors

Authors

E. Gelenbe

Keywords

QUEUES; Computer Science, Artificial Intelligence; Computer Science, Theory &; Methods; Engineering, Electrical & Electronic

Abstract

The purpose of this tutorial presentation is to introduce G-Networks, 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.

Journal Title

Performance Evaluation of Complex Systems: Techniques and Tools: Performance 2002 Tutorial Lectures

Volume

2459

Publication Date

1-1-2002

Document Type

Article

Language

English

First Page

1

Last Page

16

WOS Identifier

WOS:000179852900001

ISSN

0302-9743; 3-540-44252-9

Share

COinS