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

limit distributionMarkov chaingenerating functionpolling systemPoisson input flownodes and annihilators of network

Mathematics Subject Classification ID

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

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

(6)

• Markov and non-Markov probabilistic models of interacting flows of annihilating particles
• Polling under the randomly timed gated regime
• BMAP/G/1 Cyclic Polling Model with Binomial Disciplines
• A polling model with reneging at polling instants
• Limit Theorems for One Class of Polling Models
• 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)