Optimal Broadcast with Partial Knowledge

DOI10.1137/S0097539795279931MaRDI QIDQ4210163zbMATH OpenOpenAlexFDO

Authors Baruch Awerbuch, Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg

Publication date 21 September 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539795279931

zbMATH Keywords

distributed algorithmserror correcting codeself stabilizationuniversal hashtopology update

Mathematics Subject Classification ID

Communication theory (94A05) Distributed algorithms (68W15) Stochastic network models in operations research (90B15)

Recommendations

• Optimal and near-optimal algorithms for \(k\)-item broadcast
• Optimal multiple message broadcasting in telephone-like communication systems
• scientific article; zbMATH DE number 4062584
• A trade-off between information and communication in broadcast protocols
• scientific article; zbMATH DE number 2068168

Cites work

• Efficient dispersal of information for security, load balancing, and fault tolerance
• Event driven topology broadcast without sequence numbers
• Noiseless coding of correlated information sources
• Optimal maintenance of a spanning tree
• Self-stabilizing extensions for message-passing systems
• Self-stabilizing systems in spite of distributed control
• The maintenance of common data in a distributed system
• Two graph algorithms derived
• Universal classes of hash functions

Cited in

(2)

• Optimal Broadcast with Partial Knowledge
• Time-efficient broadcast in radio networks

This page was built for publication: Optimal Broadcast with Partial Knowledge

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