On Adaptive Tree Polling Algorithms

DOI10.1109/TCOM.1984.1096015MaRDI QIDQ3341885zbMATH OpenFDO

Authors Don Towsley, Jack Keil Wolf

Publication date 1984

Published in IEEE Transactions on Communications (Search for Journal in Brave)

zbMATH Keywords

adaptive tree polling algorithmsnetwork of users

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• scientific article; zbMATH DE number 3869354
• ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS
• On the communication complexity of polling
• Belated analyses of three credit-based adaptive polling algorithms
• Performance evaluation of polling systems by means of the power-series algorithm

Cited in

(6)

• ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS
• A unified minimum-search method for resolving contentions in multiaccess networks with ternary feedback
• On a Frankl-type problem for a mixed parabolic-hyperbolic equation
• scientific article; zbMATH DE number 3869354 (Why is no real title available?)
• scientific article; zbMATH DE number 1759379 (Why is no real title available?)
• Belated analyses of three credit-based adaptive polling algorithms

This page was built for publication: On Adaptive Tree Polling Algorithms

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