RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 1996 Volume 32, Issue 4, Pages 46–71 (Mi ppi353)

This article is cited in 8 papers

Communication Network Theory

Dominance Theorems and Ergodic Properties of Polling Systems

S. G. Foss, N. I. Chernova


Abstract: We consider a class of polling systems with stationary ergodic input flow such that the control in a system obeys a certain regeneration property. For this class, necessary and sufficient conditions for the queue-length process to be bounded in probability are found. Under these conditions, we prove that a stationary regime exists and the queue-length process for a system that starts from the zero initial state converges to this regime. In the proof, we use some monotonicity properties of the models considered and some dominance theorems based on these properties.

UDC: 621.391.1:621.394.74:519.2

Received: 24.02.1995
Revised: 15.04.1996


 English version:
Problems of Information Transmission, 1996, 32:4, 342–364

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026