Saturation in a Markovian parking process
From MaRDI portal
Publication:1872420
DOI10.1214/aoap/1015345397zbMath1012.60087OpenAlexW2088922729MaRDI QIDQ1872420
Publication date: 6 May 2003
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoap/1015345397
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Continuous-time Markov processes on discrete state spaces (60J27) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- One-dimensional circuit-switched networks
- The philosophers' process: An ergodic reversible nearest particle system
- Non-negative matrices and Markov chains. 2nd ed
- Loss networks
- Parking arcs on the circle with applications to one-dimensional communication networks
- Dynamic and equilibrium behavior of controlled loss networks
- Interval packing: the vacant interval distribution.
- Order of decay of the wasted space for a stochastic packing problem.
- Parking cars with spin but no length
- Bounds and Policies for Dynamic Routing in Loss Networks
- Stochastic Models of Queue Storage
- A Stochastic Model of Fragmentation in Dynamic Storage Allocation
- Random collision models in oriented graphs
- Refined Asymptotic Approximations to Loss Probabilities and Their Sensitivities in Shared Unbuffered Resources
- On Quasi-Stationary distributions in absorbing discrete-time finite Markov chains
- A one dimensional random space-filling problem
- A Random Interval Filling Problem
This page was built for publication: Saturation in a Markovian parking process