Queues on a Dynamically Evolving Graph

@article{Mandjes2017QueuesOA,
  title={Queues on a Dynamically Evolving Graph},
  author={Michel Mandjes and Nicos J. Starreveld and Ren{\'e} Bekker},
  journal={Journal of Statistical Physics},
  year={2017},
  volume={173},
  pages={1124 - 1148}
}
This paper considers a population process on a dynamically evolving graph, which can be alternatively interpreted as a queueing network. The queues are of infinite-server type, entailing that at each node all customers present are served in parallel. The links that connect the queues have the special feature that they are unreliable, in the sense that their status alternates between ‘up’ and ‘down’. If a link between two nodes is down, with a fixed probability each of the clients attempting to… 
View on Springer
link.springer.com
4 Citations

4 Citations

Queues, random graphs, and queues on random graphs

The work presented in this thesis lies on the interface of two key areas in probability theory, namely queueing theory and random graph theory, which introduces and analyzes two models of randomly evolving graphs.

Modelling complex stochastic systems: approaches to management and stability

This thesis is about coping with variability in outcomes for complex stochastic systems where jobs arrive randomly throughout time to utilise resources for a random amount of time before departure and develops a sophisticated loss system type model for cloud computing systems.

UvA-DARE (Digital Academic Repository) An Infinite-Server System with Lévy Shot-Noise Modulation Moments and Asymptotics

We consider an infinite-server system with as input process a non-homogeneous Poisson process with rate function Λ( t ) = a (cid:124) X ( t ) . Here { X ( t ) : t ≥ 0 } is a generalized multivariate…

A Complete Bibliography of the Journal of Statistical Physics: 2000{2009

(2 + 1) [XTpXpH12, CTH11]. + [Zuc11b]. 0 [Fed17]. 1 [BELP15, CAS11, Cor16, Fed17, GDL10, GBL16, Hau16, JV19, KT12, KM19c, Li19, MN14b, Nak17, Pal11, Pan14, RT14, RBS16b, RY12, SS18c, Sug10, dOP18]. 1…

36 References

Networks of infinite-server queues with multiplicative transitions

Diffusion limits for networks of Markov-modulated infinite-server queues

Markov-modulated infinite-server queues driven by a common background process

ABSTRACT This paper studies a system with multiple infinite-server queues that are modulated by a common background process. If this background process, being modeled as a finite-state…

Networks of infinite-server queues with nonstationary Poisson input

A more general Poisson-arrival-location model (PALM) is introduced in which arrivals move independently through a general state space according to a location stochastic process after arrivingaccording to a nonhomogeneous Poisson process.

An infinite-server queue influenced by a semi-Markovian environment

This work derives a system of equations that are satisfied by various “parts” of the generating function of the steady-state queue-length, while assuming that all arrivals bring an amount of work to the system that is either Erlang or hyperexponentially distributed.

Markov-modulated infinite-server queues with general service times

Under this scaling it turns out that the number of customers at time t≥0 obeys a central limit theorem; the convergence of the finite-dimensional distributions is proven.

A Functional Central Limit Theorem for a Markov-Modulated Infinite-Server Queue

We consider a model in which the production of new molecules in a chemical reaction network occurs in a seemingly stochastic fashion, and can be modeled as a Poisson process with a varying arrival…

Random graph models for dynamic networks

An introduction to the dynamic case of many static network models, including the classic random graph, the configuration model, and the stochastic block model, where one assumes that the appearance and disappearance of edges are governed by continuous-time Markov processes with rate parameters that can depend on properties of the nodes.

Temporal Networks

Functional central limit theorems for Markov-modulated infinite-server systems

The Markov-modulated M/M/$$\infty $$∞ queue is studied, with a focus on the correlation structure of the number of jobs, and the system’s asymptotic behavior under a particular scaling of the model parameters is described under a functional central limit theorem.