ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS

DOI10.1142/S0129054199000150MaRDI QIDQ5249000zbMATH OpenOpenAlexFDO

Authors

Publication date 29 April 2015

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

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

zbMATH Keywords

broadcastingcommunication complexitygraph algorithmspolling algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the communication complexity of polling
• On Adaptive Tree Polling Algorithms
• Approximate analysis of non-exhaustive multiserver polling systems with applications to local area networks
• General dynamic programming algorithms applied to polling systems
• Stability of polling networks with state-dependent server routing
• On the stability of a polling system with an adaptive service mechanism

Cites work

• Clock synchronization and the power of broadcasting
• Distributed network protocols
• Parallel Information Dissemination by Packets
• Sequential information dissemination by packets

Cited in

(4)

• On the communication complexity of polling
• Belated analyses of three credit-based adaptive polling algorithms
• scientific article; zbMATH DE number 3869354 (Why is no real title available?)
• On Adaptive Tree Polling Algorithms

This page was built for publication: ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS

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