The Power-Series Algorithm for Polling Systems with Time Limits

DOI10.1017/S0269964800005167MaRDI QIDQ4266371zbMATH OpenFDO

Authors J. P. C. Blanc

Publication date 30 September 1999

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

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

zbMATH Keywords

polling systemstime limits

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Recommendations

• Performance evaluation of polling systems by means of the power-series algorithm
• Analysis of multiple-server polling systems by means of the power-series algorithm
• The power-series algorithm applied to cyclic polling systems
• scientific article; zbMATH DE number 19790

Cites work

• Computation of Derivatives by Means of the Power-Series Algorithm
• Monotonicity and stability of periodic polling models
• Optimization of polling systems with Bernoulli schedules
• Performance evaluation of polling systems by means of the power-series algorithm
• Polling systems and multitype branching processes

Cited in

(6)

• Mathematical methods to study the polling systems
• Time-limited polling systems with batch arrivals and~phase-type service times
• The power-series algorithm applied to cyclic polling systems
• Analytic approximations of queues with lightly- and heavily-correlated autoregressive service times
• Performance evaluation of polling systems by means of the power-series algorithm
• scientific article; zbMATH DE number 411218 (Why is no real title available?)

This page was built for publication: The Power-Series Algorithm for Polling Systems with Time Limits

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