On a class of stochastic recursive sequences arising in queueing theory

DOI10.1214/aop/1176989931zbMath0742.60095OpenAlexW2025135409MaRDI QIDQ1184093

Zhen Liu, François Baccelli

Publication date: 28 June 1992

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aop/1176989931

zbMATH Keywords

queueing theorycouplingstability conditionsubadditive ergodic theoremstochastic recursive sequencesstationary regime

Mathematics Subject Classification ID

Stationary stochastic processes (60G10) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Queueing theory (aspects of probability theory) (60K25) Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05) Stochastic stability in control theory (93E15) Sample path properties (60G17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Stochastic systems in control theory (general) (93E03) Zero-one laws (60F20) Directed graphs (digraphs), tournaments (05C20) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items (3)

Ergodicity of Jackson-type queueing networks ⋮ Marking optimization of stochastic timed event graphs using IPA ⋮ Treelike queueing networks: Asymptotic stationarity and heavy traffic

This page was built for publication: On a class of stochastic recursive sequences arising in queueing theory