G-network

This article is about the mathematical model. For the wireless standard, see 802.11g.

In queueing theory, a discipline within the mathematical theory of probability, a G-network (generalized queueing network,^[1][2] often called a Gelenbe network^[3]) 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.^[4][5] 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</ref>^[6][7]
• "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.^[8]

Definition

A network of m interconnected queues is a G-network if

1. each queue has one server, who serves at rate μ_i,
2. external arrivals of positive customers or of triggers or resets form Poisson processes of rate ${\displaystyle \scriptstyle {\Lambda _{i}}}$ for positive customers, while triggers and resets, including negative customers, form a Poisson process of rate ${\displaystyle \scriptstyle {\lambda _{i}}}$,
3. on completing service a customer moves from queue i to queue j as a positive customer with probability ${\displaystyle \scriptstyle {p_{ij}^{+}}}$, as a trigger or reset with probability ${\displaystyle \scriptstyle {p_{ij}^{-}}}$ and departs the network with probability ${\displaystyle \scriptstyle {d_{i}}}$,
4. on arrival to a queue, a positive customer acts as usual and increases the queue length by 1,
5. 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,

${\displaystyle \rho _{i}={\frac {\lambda _{i}^{+}}{\mu _{i}+\lambda _{i}^{-}}}}$

where the ${\displaystyle \scriptstyle {\lambda _{i}^{+},\lambda _{i}^{-}}}$ for ${\displaystyle \scriptstyle {i=1,\ldots ,m}}$ satisfy

${\displaystyle \lambda _{i}^{+}=\sum _{j}\rho _{j}\mu _{j}p_{ji}^{+}+\Lambda _{i}\,}$

(1)

${\displaystyle \lambda _{i}^{-}=\sum _{j}\rho _{j}\mu _{j}p_{ji}^{-}+\lambda _{i}.\,}$

(2)

Then writing (n₁, ... ,n_m) for the state of the network (with queue length n_i at node i), if a unique non-negative solution ${\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

${\displaystyle \pi (n_{1},n_{2},\ldots ,n_{m})=\prod _{i=1}^{m}(1-\rho _{i})\rho _{i}^{n_{i}}.}$

Proof

It is sufficient to show ${\displaystyle \pi }$ satisfies the global balance equations which, quite differently from Jackson networks are non-linear. We note that the model also allows for multiple classes.

G-networks have been used in a wide range of applications, including to represent Gene Regulatory Networks, the mix of control and payload in packet networks, neural networks, and the representation of colour images and medical images such as Magnetic Resonance Images.

Response time distribution

The response time is the length of time a customer spends in the system. The response time distribution for a single G-queue is known^[9] where customers are served using a FCFS discipline at rate μ, with positive arrivals at rate λ⁺ and negative arrivals at rate λ⁻ which kill customers from the end of the queue. The Laplace transform of response time distribution in this situation is^[9][10]

${\displaystyle W^{\ast }(s)={\frac {\mu (1-\rho )}{\lambda ^{+}}}{\frac {s+\lambda +\mu (1-\rho )-{\sqrt {[s+\lambda +\mu (1-\rho )]^{2}-4\lambda ^{+}\lambda ^{-}}}}{\lambda ^{-}-\lambda ^{+}-\mu (1-\rho )-s+{\sqrt {[s+\lambda +\mu (1-\rho )]^{2}-4\lambda ^{+}\lambda ^{-}}}}}}$

where λ = λ⁺ + λ⁻ and ρ = λ⁺/(λ⁻ + μ), requiring ρ < 1 for stability.

The response time for a tandem pair of G-queues (where customers who finish service at the first node immediately move to the second, then leave the network) is also known, and it is thought extensions to larger networks will be intractable.^[10]

References

1. Gelenbe, Erol (1991). "Product-form queueing networks with negative and positive customers" (PDF). Journal of Applied Probability. 28 (3): 656–663. doi:10.2307/3214499.
2. Gelenbe, Erol (Sep 1993). "G-Networks with Triggered Customer Movement". Journal of Applied Probability. 30 (3): 742–748. doi:10.2307/3214781. JSTOR 3214781.
3. Gelenbe, Erol; Fourneau, Jean-Michel (2002). "G-networks with resets". Performance Evaluation. 49 (1/4): 179–191. doi:10.1016/S0166-5316(02)00127-X.
4. Gelenbe, Erol (1989). "Random neural networks with negative and positive signals and product form solution" (PDF). Neural Computation. 1 (4): 502–510. doi:10.1162/neco.1989.1.4.502.
5. Harrison, Peter (2009). "Turning Back Time – What Impact on Performance?". The Computer Journal. 53 (6): 860–868. CiteSeerX 10.1.1.574.9535. doi:10.1093/comjnl/bxp021.
6. Gelenbe, Erol (1993). "G-Networks with signals and batch removal". Probability in the Engineering and Informational Sciences. 7 (3): 335–342. doi:10.1017/s0269964800002953.
7. Artalejo, J.R. (Oct 2000). "G-networks: A versatile approach for work removal in queueing networks". European Journal of Operational Research. 126 (2): 233–249. doi:10.1016/S0377-2217(99)00476-2.
8. Gelenbe, Erol; Mao, Zhi-Hong; Da Li, Yan (1999). "Function approximation with spiked random networks". IEEE Transactions on Neural Networks. 10 (1): 3–9. CiteSeerX 10.1.1.46.7710. doi:10.1109/72.737488. PMID 18252498.
9. Harrison, P. G.; Pitel, E. (1993). "Sojourn Times in Single-Server Queues with Negative Customers". Journal of Applied Probability. 30 (4): 943–963. doi:10.2307/3214524. JSTOR 3214524.
10. Harrison, Peter G. (1998). Response times in G-nets. 13th International Symposium on Computer and Information Sciences (ISCIS 1998). pp. 9–16. ISBN 9051994052.