A Scaling Analysis of a Transient Stochastic Network
From MaRDI portal
Publication:5169505
DOI10.1239/aap/1401369705zbMath1303.60085arXiv1203.6848MaRDI QIDQ5169505
Mathieu Feuillet, Philippe Robert
Publication date: 10 July 2014
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.6848
Skorokhod problem; time scale; distributed system with breakdown; transient Markov chain with absorbing state
60F05: Central limit and other weak theorems
60K25: Queueing theory (aspects of probability theory)
90B05: Inventory, storage, reservoirs
68M14: Distributed systems
Related Items
Mean-Field Limits for Large-Scale Random-Access Networks, A large scale analysis of unreliable stochastic networks, Fluid limits of a loss storage network, Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms
Cites Work
- On the flow-level stability of data networks without congestion control: the case of linear networks and upstream trees
- Limit theorems for point processes and their functionals
- Reflected diffusions defined via the extended Skorokhod map
- Nonlinear oscillations, dynamical systems, and bifurcations of vector fields
- Reflected Brownian motion on an orthant
- Loss networks
- A martingale approach to the Poisson convergence of simple point processes
- Existence and uniqueness of semimartingale reflecting Brownian motions in an orthant
- Large loss networks
- Existence of quasi-stationary distributions: A renewal dynamical approach
- On the Transient Behavior of Ehrenfest and Engset Processes
- Retrial Queueing Systems
- Small Random perturbation of dynamical systems with reflecting boundary
- Retrial Queues
- An ODE for an Overloaded X Model Involving a Stochastic Averaging Principle
- On Quasi-Stationary distributions in absorbing discrete-time finite Markov chains
- Multiscale Methods
- Stochastic Equations for Diffusion Processes in a Bounded Region. II
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
