In queueing theory, a discipline within the mathematical theory of probability, a G-network (generalized queueing network, often called a Gelenbe network) is an open network of G-queues first introduced by Erol Gelenbe as a model for queueing systems with specific control functions, such as traffic re-routing or traffic destruction, as well as a model for neural networks. A G-queue is a network of queues with several types of novel and useful customers:
positive customers, which arrive from other queues or arrive externally as Poisson arrivals, and obey standard service and routing disciplines as in conventional network models, negative customers, which arrive from another queue, or which arrive externally as Poisson arrivals, and remove (or 'kill') customers in a non-empty queue, representing the need to remove traffic when the network is congested, including the removal of "batches" of customers "triggers", which arrive from other queues or from outside the network, and which displace customers and move them to other queues A product-form solution superficially similar in form to Jackson's theorem, but which requires the solution of a system of non-linear equations for the traffic flows, exists for the stationary distribution of G-networks while the traffic equations of a G-network are in fact surprisingly non-linear, and the model does not obey partial balance. This broke previous assumptions that partial balance was a necessary condition for a product-form solution. A powerful property of G-networks is that they are universal approximators for continuous and bounded functions, so that they can be used to approximate quite general input-output behaviours.
Definition
A network of m interconnected queues is a G-network if
each queue has one server, who serves at rate μi, external arrivals of positive customers or of triggers or resets form Poisson processes of rate Λ i {\displaystyle \scriptstyle {\Lambda _{i}}} for positive customers, while triggers and resets, including negative customers, form a Poisson process of rate λ i {\displaystyle \scriptstyle {\lambda _{i}}} , on completing service a customer moves from queue i to queue j as a positive customer with probability p i j + {\displaystyle \scriptstyle {p_{ij}^{+}}} , as a trigger or reset with probability p i j − {\displaystyle \scriptstyle {p_{ij}^{-}}} and departs the network with probability d i {\displaystyle \scriptstyle {d_{i}}} , on arrival to a queue, a positive customer acts as usual and increases the queue length by 1, on arrival to a queue, the negative customer reduces the length of the queue by some random number (if there is at least one positive customer present at the queue), while a trigger moves a customer probabilistically to another queue and a reset sets the state of the queue to its steady-state if the queue is empty when the reset arrives. All triggers, negative customers and resets disappear after they have taken their action, so that they are in fact "control" signals in the network, note that normal customers leaving a queue can become triggers or resets and negative customers when they visit the next queue. A queue in such a network is known as a G-queue.
Stationary distribution Define the utilization at each node,
ρ i = λ i + μ i + λ i − {\displaystyle \rho _{i}={\frac {\lambda _{i}^{+}}{\mu _{i}+\lambda _{i}^{-}}}}
where the λ i + , λ i − {\displaystyle \scriptstyle {\lambda _{i}^{+},\lambda _{i}^{-}}} for i = 1 , … , m {\displaystyle \scriptstyle {i=1,\ldots ,m}} satisfy
Then writing (n1, ... ,nm) for the state of the network (with queue length ni at node i), if a unique non-negative solution ( λ i + , λ i − ) {\displaystyle \scriptstyle {(\lambda _{i}^{+},\lambda _{i}^{-})}} exists to the above equations (1) and (2) such that ρi for all i then the stationary probability distribution π exists and is given by
… excerpt ends here. Continue reading the full article.
