Optimal lower bounds for some distributed algorithms for a complete network of processors
Theoretical Computer Science
A hundred impossibility proofs for distributed computing
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
A trade-off between information and communication in broadcast protocols
Journal of the ACM (JACM)
Introduction to algorithms
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Compact labeling schemes for ancestor queries
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Labeling schemes for flow and connectivity
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The power of a pebble: exploring and mapping directed graphs
Information and Computation
Broadcasting Algorithms in Radio Networks with Unknown Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Journal of the ACM (JACM)
Optimal graph exploration without good maps
Theoretical Computer Science
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Faster communication in known topology radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Local MST computation with short advice
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Trade-offs between the size of advice and broadcasting time in trees
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
On the effect of the deployment setting on broadcasting in Euclidean radio networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Information and Computation
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Labeling schemes for tree representation
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Toward more localized local algorithms: removing assumptions concerning global knowledge
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Locality and checkability in wait-free computing
DISC'11 Proceedings of the 25th international conference on Distributed computing
Online graph exploration with advice
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Randomized distributed decision
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Towards a complexity theory for local distributed computing
Journal of the ACM (JACM)
| Hi-index | 0.00 |
We study the amount of knowledge about a communication network that must be given to its nodes in order to efficiently disseminate information. Our approach is quantitative: we investigate the minimum total number of bits of information (minimum size of advice) that has to be available to nodes, regardless of the type of information provided. We compare the size of advice needed to perform broadcast and wakeup (the latter is a broadcast in which nodes can transmit only after getting the source information), both using a linear number of messages (which is optimal). We show that the minimum size of advice permitting the wakeup with a linear number of messages in an n-node network, is @Q(nlogn), while the broadcast with a linear number of messages can be achieved with advice of size O(n). We also show that the latter size of advice is almost optimal: no advice of size o(n) can permit to broadcast with a linear number of messages. Thus an efficient wakeup requires strictly more information about the network than an efficient broadcast.