On classes of Bitcoin-inspired infinite-server queueing systems

We analyze the time-dependent behavior of various types of infinite-server queueing systems, where, within each system we consider, jobs interact with one another in ways that induce batch departures from the system. One example of such a queue was introduced in the recent paper of Frolkova and Mandjes (Stochastic Models, 2019) in order to model a type of one-sided communication between two users in the Bitcoin network: here we show that a time-dependent version of the distributional Little’s law can be used to study the time-dependent behavior of this model, as well as a related model where blocks are communicated to a user at a rate that is allowed to vary with time. We also show that the time-dependent behavior of analogous infinite-server queueing systems with batch arrivals and exponentially distributed services can be analyzed just as thoroughly.