Belated Analyses of Three Credit-Based Adaptive Polling Algorithms

DOI10.1142/S0129054116500179zbMath1349.68130MaRDI QIDQ2833543

Savio S. H. Tse

Publication date: 18 November 2016

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

zbMATH Keywords

pollingbroadcastingrandom treeasynchronous communicationbit message complexitydistribution of degrees

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: Belated Analyses of Three Credit-Based Adaptive Polling Algorithms