A trade-off between information and communication in broadcast protocols

Recommendations

scientific article; zbMATH DE number 4062584
On information complexity in the broadcast model
Reliable broadcasts and communication models: tradeoffs and lower bounds
STACS 2004
Optimization of the transfer of the broadcasting information in computer networks
A bandwidth latency tradeoff for broadcast and reduction
On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission
scientific article; zbMATH DE number 3946031
Optimal algorithms for dissemination of information in generalized communication modes
Optimal Broadcast with Partial Knowledge

Cited in

(52)

A bandwidth latency tradeoff for broadcast and reduction
Deterministic broadcasting time with partial knowledge of the network.
Information-theoretic broadcast with dishonest majority for long messages
Compact routing messages in self-healing trees
Sense of direction in distributed computing
Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model
Fooling views: a new lower bound technique for distributed computations under congestion
Message lower bounds via efficient network synchronization
Energy-optimal broadcast and exploration in a tree using mobile agents
Convergecast and broadcast by power-aware mobile agents
Efficient communication in unknown networks
Message Lower Bounds via Efficient Network Synchronization
Asynchronous broadcasting with bivalent beeps
On the message complexity of distributed problems
Time-efficient broadcast in radio networks
Local Maps: New Insights into Mobile Agent Algorithms
scientific article; zbMATH DE number 4050994 (Why is no real title available?)
scientific article; zbMATH DE number 4062584 (Why is no real title available?)
Topology broadcast algorithms
Optimal Broadcast with Partial Knowledge
Communication-Space Tradeoffs for Unrestricted Protocols
Message complexity versus space complexity in fault tolerant broadcast protocols
scientific article; zbMATH DE number 1390069 (Why is no real title available?)
Energy-Optimal Broadcast in a Tree with Mobile Agents
Time-message trade-offs in distributed algorithms
Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model
Assigning labels in an unknown anonymous network with a leader
Interval routing schemes allow broadcasting with linear message-complexity
Deterministic broadcasting in ad hoc radio networks
Hundreds of impossibility results for distributed computing
Oracle size, a new measure of difficulty for communication tasks
The impact of locality in the broadcast congested clique model
On the complexity of global computation in the presence of link failures: the case of uni-directional faults
Trade-offs between the size of advice and broadcasting time in trees
On the Complexity of Universal Leader Election
Balancing load versus decreasing communication: Parameterizing the tradeoff
Topology recognition and leader election in colored networks
Communication costs in a geometric communication network
Brief Announcement: What Can We Compute in a Single Round of the Congested Clique?
Distributed CONGEST Algorithms against Mobile Adversaries
Improved Tradeoffs for Leader Election
Messy broadcasting - decentralized broadcast schemes with limited knowledge
Communication efficient self-stabilizing leader election
Singularly optimal randomized leader election
Connectivity lower bounds in broadcast congested clique
A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem
The message complexity of distributed graph optimization
Tight bounds on the message complexity of distributed tree verification
Near-optimal schedules for simultaneous multicasts
Team formation and applications
Broadcasting in geometric radio networks
Communication algorithms with advice

This page was built for publication: A trade-off between information and communication in broadcast protocols

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