On the Stability of Greedy Polling Systems with General Service Policies

DOI10.1017/S0269964800005052zbMath0962.60099OpenAlexW2085215875MaRDI QIDQ4950708

Günter Last, Sergeĭ Georgievich Foss

Publication date: 9 April 2000

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964800005052

zbMATH Keywords

stabilitypollingqueueing systemsgreedy policy

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25)

Related Items (11)

Polling: past, present, and perspective ⋮ On polling systems with infinitely many stations ⋮ Stability and performance of greedy server systems ⋮ On the greedy walk problem ⋮ Multitype branching processes with immigration in random environment, and polling systems ⋮ On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing ⋮ Mathematical methods to study the polling systems ⋮ Stability of a spatial polling system with greedy myopic service ⋮ Periodicity in the transient regime of exhaustive polling systems ⋮ Comments on: ``Polling: past, present and perspective ⋮ Greedy walk on the real line

Cites Work

• Criteria for the recurrence or transience of stochastic process. I
• On random walks arising in queueing systems: Ergodicity and transience via quadratic forms as Lyapounov functions. I
• Monotonicity and stability of periodic polling models
• Stability of polling systems with exhaustive service policies and state-dependent routing

This page was built for publication: On the Stability of Greedy Polling Systems with General Service Policies