A discrete model of a large polling system

DOI10.1007/S11006-006-0061-3MaRDI QIDQ881036zbMATH OpenOpenAlexFDO

Authors A. A. Sergeev

Publication date 21 May 2007

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11006-006-0061-3

zbMATH Keywords

generating functionlimit distributionMarkov chainnodes and annihilators of networkPoisson input flowpolling system

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• On polling systems with large setups
• A decomposition result for a class of polling models
• Mathematical methods to study the polling systems
• The Analysis of Random Polling Systems
• A new approach to analysis of polling systems
• scientific article; zbMATH DE number 1552339
• On open problems in polling systems
• scientific article; zbMATH DE number 1058062
• A Markov chain model of a polling system with parameter regeneration

Cited in

(7)

• A polling model with reneging at polling instants
• Limit Theorems for One Class of Polling Models
• scientific article; zbMATH DE number 1275410 (Why is no real title available?)
• Polling under the randomly timed gated regime
• Markov and non-Markov probabilistic models of interacting flows of annihilating particles
• BMAP/G/1 Cyclic Polling Model with Binomial Disciplines
• Reduction of a polling network to a single node

This page was built for publication: A discrete model of a large polling system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q881036)