Proceedings ArticleDOI
Distributed function computation over a tree network
Milad Sefidgaran,Aslan Tchamkerten +1 more
- pp 1-5
Reads0
Chats0
TLDR
This paper investigates a distributed function computation setting where the underlying network is a rooted directed tree and the root wants to compute a function of the sources of information available at the nodes of the network.Abstract:
This paper investigates a distributed function computation setting where the underlying network is a rooted directed tree and where the root wants to compute a function of the sources of information available at the nodes of the network. The main result provides the rate region for an arbitrary function under the assumption that the sources satisfy a general criterion. This criterion is satisfied, in particular, when the sources are independent.read more
Citations
More filters
Posted Content
Overhead Performance Tradeoffs - A Resource Allocation Perspective
TL;DR: It is shown that information rate savings can be obtained by recognizing that the controller only needs to determine the result of this extremization function, and simple achievable schemes for both the lossy and interactive variants of this problem are considered.
Journal ArticleDOI
Rate Distortion for Lossy In-Network Linear Function Computation and Consensus: Distortion Accumulation and Sequential Reverse Water-Filling
TL;DR: This work quantifies the accumulation of information loss in distributed computing, and obtains fundamental limits on network computation rate as a function of incremental distortions (and hence incremental loss of information) along the edges of the network.
Journal ArticleDOI
Overhead Performance Tradeoffs—A Resource Allocation Perspective
TL;DR: In this article, it is shown that information rate savings can be obtained by recognizing that the controller only needs to determine the result of this extremization function, and that the rate savings are shown in most cases to be at most 2 b independent of the number of competing users.
Journal ArticleDOI
Graph Codes for Distributed Instant Message Collection in an Arbitrary Noisy Broadcast Network
TL;DR: In this paper, the authors considered the problem of minimizing the number of broadcasts for collecting all sensor measurements at a sink node in a noisy broadcast sensor network, and provided fundamental limits on the required number of data gathering and a general in-network computing strategy to achieve an upper bound within factor of the fundamental limits.
Proceedings ArticleDOI
Coding for lossy function computation: Analyzing sequential function computation with distortion accumulation
TL;DR: The key in applying the analysis of Distortion Accumulation is showing that the random-coding based codeword on the receiver side is close in mean-square sense to the MMSE estimate of the sources, even if the knowledge of the source distribution is not fully accurate.
References
More filters
Journal ArticleDOI
Coding for computing
Alon Orlitsky,J.R. Roche +1 more
TL;DR: It is shown that if only the sender can transmit, the number of bits required is a conditional entropy of a naturally defined graph.
Journal ArticleDOI
How to encode the modulo-two sum of binary sources (Corresp.)
János Körner,K. Marton +1 more
TL;DR: If the sequences are the outputs of two correlated memoryless binary sources, then in some cases the rate of this information may be substantially less than the joint entropy of the two sources.
Proceedings ArticleDOI
Coding for computing
Alon Orlitsky,J.R. Roche +1 more
TL;DR: It is shown that if only the sender can transmit, the number of bits required is a conditional entropy of a naturally defined graph.
Journal ArticleDOI
The zero-error side information problem and chromatic numbers (Corresp.)
TL;DR: A discrete random variable X is to be transmitted by means of a discrete signal so that the probability of error must be exactly zero, and the problem is to minimize the signal's alphabet size.
Journal ArticleDOI
Network Coding for Computing: Cut-Set Bounds
TL;DR: In this paper, the authors considered the network coding problem for a single-receiver network and gave a lower bound on the computing capacity in terms of the Steiner tree packing number and a different bound for symmetric functions.
Related Papers (5)
A new information-theoretic lower bound for distributed function computation
Aolin Xu,Maxim Raginsky +1 more