Belated analyses of three credit-based adaptive polling algorithms

DOI10.1142/S0129054116500179MaRDI QIDQ2833543zbMATH OpenFDO

Authors Savio S. H. Tse

Publication date 18 November 2016

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054116500179

zbMATH Keywords

asynchronous communicationbit message complexitybroadcastingdistribution of degreespollingrandom tree

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Communication networks in operations research (90B18)

Recommendations

• A new approach to analysis of polling systems
• scientific article; zbMATH DE number 1058062
• scientific article; zbMATH DE number 19790
• Performance analysis of polling systems with retrials and glue periods
• Analysis of polling models with a self-ruling server
• ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS
• The Analysis of Random Polling Systems
• On Adaptive Tree Polling Algorithms
• On competitive analysis for polling systems
• On open problems in polling systems

Cites work

• On Adaptive Tree Polling Algorithms
• ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS
• The distribution of degrees in a large random tree

Cited in

(2)

• On the communication complexity of polling
• On Adaptive Tree Polling Algorithms

This page was built for publication: Belated analyses of three credit-based adaptive polling algorithms

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