G-networks (or queueing networks with negative customers, signals, triggers, etc.) are
characterized by the following feature: in contrast with the normal positive customers …

" Constructive Computation in Stochastic Models with Applications: The RG-Factorizations"
provides a unified, constructive and algorithmic framework for numerical computation of …

An M/G/1 retrial queueing system with disasters and unreliable server is investigated in this
paper. Primary customers arrive in the system according to a Poisson process, and they …

The probability of successfully spending twice the same bitcoins is considered. A double-
spending attack consists in issuing two transactions transferring the same bitcoins. The first …

This paper presents a transient solution for the system size in an M/M/2 queue where the
service rates of the servers are not identical with the possibility of catastrophes at the system …

The idea of G-networks with negative arrivals, as well as of the relevant product form
solution including non-linear traffic equations, was first published by Erol Gelenbe in 1989 …

We analyze a double-sided queue with priority that serves patient customers and customers
with zero patience (ie, impatient customers). In a two-sided market, high and low priority …

This note illustrates that a combination of the approach in our previous papers (Boucherie
and Boxma, 1996, Probability in the Engineering and Informational Sciences10: 261–277; …

A queueing model with catastrophes and delayed action is studied in this paper. This
delayed action could be in the form of protecting or removing all the customers that are in the …

A stochastic clearing system is characterized by the existence of an output mechanism that
instantaneously clears the system, ie removes all work currently present. In this paper we …