Complexity of network synchronization
Journal of the ACM (JACM)
Gap theorems for distributed computing
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
On the bit complexity of distributed computations in a ring with a leader
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Probabilistic solitude verification on a ring
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
The effects of link failures on computations in asynchronous rings
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Time and message bounds for election in synchronous and asynchronous complete networks
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Computing on an anonymous ring
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reverse path forwarding of broadcast packets
Communications of the ACM
Graph Algorithms
Lower Bounds for Synchronous Networks and the Advantage of Local Information
Proceedings of the 2nd International Workshop on Distributed Algorithms
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Tradeoffs for selection in distributed networks (Preliminary Version)
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Tight lower and upper bounds for some distributed algorithms for a complete network of processors
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
The impact of synchronous communication on the problem of electing a leader in a ring
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Extremal Graph Theory
Cost-sensitive analysis of communication protocols
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Deterministic broadcasting in unknown radio networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Assigning labels in unknown anonymous networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Fast distributed graph coloring with O(&Dgr;) colors
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Tradeoffs between knowledge and time of communication in geometric radio networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Broadcasting in radio networks
Handbook of wireless networks and mobile computing
Information Dissemination in Distributed Systems with Faulty Units
IEEE Transactions on Computers
Distributed coloring and communication in rings with local knowledge
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Deterministic Broadcasting Time with Partial Knowledge of the Network
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Efficient Communication in Unknown Networks
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Deterministic Radio Broadcasting at Low Cost
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Deterministic broadcasting time with partial knowledge of the network
Theoretical Computer Science
Sense of direction in distributed computing
Theoretical Computer Science - Special issue: Distributed computing
Deterministic broadcasting in ad hoc radio networks
Distributed Computing
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Distributed Colouring and Communication in Rings with Local Knowledge
Combinatorics, Probability and Computing
Oracle size: a new measure of difficulty for communication tasks
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Broadcasting in geometric radio networks
Journal of Discrete Algorithms
Trade-offs between the size of advice and broadcasting time in trees
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Optimal maintenance of a spanning tree
Journal of the ACM (JACM)
r3: Resilient Random Regular Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Communication algorithms with advice
Journal of Computer and System Sciences
Time-efficient broadcasting in radio networks: a review
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
A minimum spanning tree algorithm for efficient P2P video streaming system
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Messy broadcasting - Decentralized broadcast schemes with limited knowledge
Discrete Applied Mathematics
On the message complexity of global computations
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
On the complexity of universal leader election
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Hi-index | 0.01 |
This paper concerns the message complexity of broadcast in arbitrary point-to-point communication networks. Broadcast is a task initiated by a single processor that wishes to convey a message to all processors in the network. The widely accepted model of communication networks, in which each processor initially knows the identity of its neighbors but does not know the entire network topology, is assumed. Although it seems obvious that the number of messages required for broadcast in this model equals the number of links, no proof of this basic fact has been given before.It is shown that the message complexity of broadcast depends on the exact complexity measure. If messages of unbounded length are counted at unit cost, then broadcast requires &THgr;(↿V↾) messages, where V is the set of processors in the network. It is proved that, if one counts messages of bounded length, then broadcast requires &THgr;(↿E↾) messages, where E is the set of edges in the network. Assuming an intermediate model in which each vertex knows the topology of the network in radius &rgr; ≥ 1 from itself, matching upper and lower bounds of &THgr;(min{↿E↾, ↿V↾1+&THgr;(l)/&rgr;}) is proved on the number of messages of bounded length required for broadcast. Both the upper and lower bounds hold for both synchronous and asynchronous network models.The same results hold for the construction of spanning trees, and various other global tasks.