On the communication complexity of polling

DOI10.1016/0020-0190(96)00127-5MaRDI QIDQ1350916zbMATH OpenOpenAlexFDO

Authors Adele A. Rescigno

Publication date 27 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(96)00127-5

zbMATH Keywords

Interconnection networksDistributed computing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS
• scientific article; zbMATH DE number 3869354
• Belated analyses of three credit-based adaptive polling algorithms
• Communication complexity of gossiping by packets
• Communication complexity of gossiping by packets

Cites work

• scientific article; zbMATH DE number 3869354 (Why is no real title available?)
• scientific article; zbMATH DE number 710624 (Why is no real title available?)
• scientific article; zbMATH DE number 857072 (Why is no real title available?)
• A survey of gossiping and broadcasting in communication networks
• Architectures and monitoring techniques for active databases: An evaluation
• Fast Gossiping by Short Messages
• Methods and problems of communication in usual networks
• Parallel Information Dissemination by Packets
• Sequential information dissemination by packets
• The Communication Complexity of Atomic Commitment and of Gossiping

Cited in

(5)

• ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS
• Communication complexity of fault-tolerant information diffusion
• scientific article; zbMATH DE number 3869354 (Why is no real title available?)
• On Adaptive Tree Polling Algorithms
• Efficient and decentralized polling protocol for general social networks

This page was built for publication: On the communication complexity of polling

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