Stationary solutions of stochastic recursions describing discrete event systems

DOI10.1016/S0304-4149(97)00019-7zbMath0911.60076MaRDI QIDQ1275925

Takis Konstantopoulos, Venkat Anantharam

Publication date: 14 January 1999

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

zbMATH Keywords

ergodic theoryqueueing processesstochastic recursions

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Special processes (60K99)

Related Items (6)

The queue with impatience: construction of the stationary workload under FIFO ⋮ Piecewise linear concave dynamical systems appearing in the microscopic traffic modeling ⋮ Stability in distribution of randomly perturbed quadratic maps as Markov processes ⋮ Coupling in the queue with impatience: case of several servers ⋮ On stability of queueing networks with job deadlines ⋮ A generalized backward scheme for solving nonmonotonic stochastic recursions

Cites Work

• Ergodic theorems. With a supplement by Antoine Brunel
• On the Ergodicity and Stability of the Sequence $w_{n + 1} = f(w_n ,\xi _n )$: Applications to Communication Networks
• An invariant distribution for the G/G/1 queueing operator
• On the cut-off phenomenon in some queueing systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stationary solutions of stochastic recursions describing discrete event systems