|
Problemy Peredachi Informatsii, 1996, Volume 32, Issue 4, Pages 46–71
(Mi ppi353)
|
|
|
|
This article is cited in 8 scientific papers (total 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.
Received: 24.02.1995 Revised: 15.04.1996
Citation:
S. G. Foss, N. I. Chernova, “Dominance Theorems and Ergodic Properties of Polling Systems”, Probl. Peredachi Inf., 32:4 (1996), 46–71; Problems Inform. Transmission, 32:4 (1996), 342–364
Linking options:
https://www.mathnet.ru/eng/ppi353 https://www.mathnet.ru/eng/ppi/v32/i4/p46
|
Statistics & downloads: |
Abstract page: | 347 | Full-text PDF : | 118 | First page: | 2 |
|