Slow Transitions and Starvation in Dense Random-Access Networks
DOI10.1080/15326349.2015.1018441zbMath1325.60151arXiv1403.3325OpenAlexW1630552486WikidataQ60015392 ScholiaQ60015392MaRDI QIDQ3194558
Johan S. H. van Leeuwaarden, Alessandro Zocca, Sem C. Borst
Publication date: 20 October 2015
Published in: Stochastic Models (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.3325
hitting timesinteracting particle systemmixing timesthroughput analysiswireless random-access networksstarvation phenomena
Communication networks in operations research (90B18) Stochastic network models in operations research (90B15) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Related Items (2)
Cites Work
- A hard-core model on a Cayley tree: an example of a loss network
- Coincidence properties of birth and death processes
- Moments of first passage times in general birth-death processes
- Markov chains with almost exponential hitting times
- Inequalities for rare events in time-reversible Markov chains. II
- Ergodicity of the hard-core model on \(\mathbb{Z}^ 2\) with parity-dependent activities
- A note on integrals for birth-death processes
- Inequalities for rare events in time-reversible Markov chains. I.
- Blocking and dimer processes on the Cayley tree
- Loss networks and Markov random fields
- A Limit Theorem for Passage Times in Ergodic Regenerative Processes
- A review of transient behavior in regular diffusion and birth-death processes. Part II
- Log-concavity and log-convexity in passage time densities of diffusion and birth-death processes
- Rarity and exponentiality: an extension of Keilson's theorem, with applications
- Spectral theory for the differential equations of simple birth and death processes
This page was built for publication: Slow Transitions and Starvation in Dense Random-Access Networks
