##
**G-networks with multiple classes of negative and positive customers.**
*(English)*
Zbl 0873.68010

Summary: In recent years a new class of queueing networks with “negative and positive” customers was introduced by one of the authors E. Gelenbe [J. Appl. Probab. 28, No. 3, 656-663 (1991; Zbl 0741.60091)], and shown to have a nonstandard product form. This model has undergone several generalizations to include triggers or signals which are special forms of customers whose role is to move other customers from some queue to another queue [E. Gelenbe, P. Glynn and K. Sigmann, ibid. 28, No. 1, 245-250 (1991; Zbl 0744.60110); E. Gelenbe and R. Schassberger, Probab. Eng. Inf. Sci. 6, 271-276 (1992); E. Gelenbe, J. Appl. Probab. 30, No. 3, 742-748 (1993; Zbl 0781.60088); E. Gelenbe, Probab. Eng. Inf. Sci. 7, 335-342 (1993)]. Positive customers are identical to the usual customers of a queueing network, while a negative customer which arrives to a queue simply destroys a positive customer. We call these generalized queueing networks G-networks. We extend the basic model of [Gelenbe (loc. cit.) to the case of multiple classes of positive customers, and multiple classes of negative customers. As in other multiple class queueing networks, a positive customer class is characterized by the routing probabilities and the service rate parameter at each service center while negative customers of different classes may have different “customer destruction” capabilities. In the present paper all service time distributions are exponential and the service centers can be of the following types: FIFO (first-in-first-out), LIFO/PR (last-in-first-out with preemption), PS (processor sharing), with class-dependent service rates.

### MSC:

68M20 | Performance evaluation, queueing, and scheduling in the context of computer systems |

60K25 | Queueing theory (aspects of probability theory) |

PDFBibTeX
XMLCite

\textit{J.-M. Fourneau} et al., Theor. Comput. Sci. 155, No. 1, 141--156 (1996; Zbl 0873.68010)

Full Text:
DOI

### References:

[1] | Atalay, V.; Gelenbe, E., Parallel algorithm for colour texture generation using the random neural network, Internat. J. Pattern Recognition Arti. Intelligence, 6, 437-446 (1992) |

[2] | Baskett, F.; Chandy, K.; Muntz, R. R.; Palacios, F. G., Open, closed and mixed networks of queues with different classes of customers, JACM, 22, 248-260 (1975) · Zbl 0313.68055 |

[3] | Fourneau, J. M., Computing the steady-state distribution of networks with positive and negative customers, (Proc. 13th IMACS World Congress on Computation and Applied Mathematics. Proc. 13th IMACS World Congress on Computation and Applied Mathematics, Dublin (1991)) |

[4] | Gelenbe, E., Random neural Networks with negative and positive signals and product form solution, Neural Comput., 1, 502-510 (1989) |

[5] | Gelenbe, E., Product form queueing networks with negative and positive customers, Appl. Probab., 28, 656-663 (1991) · Zbl 0741.60091 |

[6] | Gelenbe, E., G-networks with triggered customer movement, J Appl. Probab., 30, 742-748 (1993) · Zbl 0781.60088 |

[7] | Gelenbe, E., G-networks with signals and batch removal, Probab Eng. Inform. Sci., 7, 335-342 (1993) |

[8] | Gelenbe, E., G-networks: a unifying model for neural and queueing networks, Ann. Oper. Res., 48, 433-461 (1994) · Zbl 0803.90058 |

[9] | Gelenbe, E.; Glynn, P.; Sigmann, K., Queues with negative customers, J. Appl Probab., 28, 245-250 (1991) · Zbl 0744.60110 |

[10] | Gelenbe, E.; Schassberger, R., Stability of G-networks, Probab. Eng. Inform. Sci., 6, 271-276 (1992) · Zbl 1134.60396 |

[11] | Gelenbe, E.; Tucci, S., Performances d’un système informatique dupliqué, Comptes-Rendus Acad. Sci., 312, 27-30 (1991) |

[12] | Henderson, W., Queueing networks with negative customers and negative queue lengths, J. Appl. Probab., 30 (1993) · Zbl 0787.60115 |

[13] | Henderson, W.; Northcote, B. S.; Taylor, P. G., Geometric equilibrium distributions for queues with interactive batch departures, Ann. Oper. Res., 48, 493-511 (1994) · Zbl 0818.90051 |

[14] | Henderson, W.; Northcote, B. S.; Taylor, P. G., Networks of customer queues and resource queues, (Labetoulle, J.; Roberts, J., Proc. Internat. Teletraffic Congress, 14 (1994), Elsevier: Elsevier Amsterdam), 853-864 |

[15] | Kemmeny, J. G.; Snell, J. L., Finite Markov Chains (1965), Von Nostrand: Von Nostrand Amsterdam |

[16] | Miyazawa, M., Insensitivity and product form decomposability of reallocatable GSMP, Adv. Appl. Probab., 25, 415-437 (1993) · Zbl 0772.60079 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.