Comments on Cut-Set Bounds on Network Function Computation

  title={Comments on Cut-Set Bounds on Network Function Computation},
  author={Cupjin Huang and Zihan Tan and Shenghao Yang and Xuan Guang},
  journal={IEEE Transactions on Information Theory},
A function computation problem over a directed acyclic network has been considered in the literature, where a sink node is required to compute a target function correctly with the inputs arbitrarily generated at multiple source nodes. The network links are error free but capacity limited, and the intermediate nodes perform network coding. The computing rate of a network code is the average number of times that the target function is computed for one use of the network, i.e., each link in the… 

Figures from this paper

Improved Upper Bound on the Network Function Computing Capacity

This paper obtains an improved upper bound on the computing capacity, which is applicable to arbitrary target functions and arbitrary network topologies, and applies this bound to the problem of computing a vector-linear function over a network.

An Enhanced Capacity Bound for Network Function Computation

This paper obtains an improved upper bound on the computing capacity, which is applicable to arbitrary target functions and arbitrary network topologies and is able to enhance a previous result on computing a vector-linear function over a network but also simplify the proof significantly.

Function Load Balancing Over Networks

The notion of entropic surjectivity is introduced as a measure to determine how sparse the function is and to understand the limits of functional compression for computation and a flow-based delay minimization problem is formulated.

Secure Network Function Computation for Linear Functions - Part I: Source Security

An upper bound on the secure computing capacity is proved, which is applicable to arbitrary network topologies and arbitrary security levels, and an equivalent expression of the upper bound is obtained by using a graph-theoretic approach and accordingly an efficient approach for computing this bound is developed.

Network Function Computation With Different Secure Conditions

In this paper, we investigate function computation problems under different secure conditions over a network with multiple source nodes and a single sink node which desires a function of all source

On the Generic Capacity of K-User Symmetric Linear Computation Broadcast

The generic capacity of the symmetric LCBC for large number of users for every user has m ′ dimensions of side-information and m dimensions of demand is shown, which is at least as hard as the index coding problem.

Communication-efficient Clock Synchronization

An algorithm that outperforms the natural (uncoded) baseline is proposed for the general setting that is a mix of the two cases and classes of such mixed setting are identified where the algorithm represents the optimal solution.

Hyper Binning for Distributed Function Coding

  • D. MalakM. Médard
  • Computer Science
    2020 IEEE 21st International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)
  • 2020
We consider the distributed source encoding problem with 2 correlated sources X1 and X2 and a destination that seeks the outcome of a continuous function f(X1, X2). We develop a compression scheme

Expand-and-Randomize: An Algebraic Approach to Secure Computation

This paper considers the secure computation problem in a minimal model, where Alice and Bob each holds an input and wish to securely compute a function of their inputs at Carol without revealing any additional information about the inputs, and proposes a novel coding scheme built from two steps.

A Distributed Computationally Aware Quantizer Design via Hyper Binning

This work designs a distributed function-aware quantization scheme for distributed functional compression and develops a compression scheme called hyper binning that captures the correlation between the sources and the function's structure as a means of dimensionality reduction.



An improved upper bound on network function computation using cut-set partition

A general upper bound on the network computing capacity is obtained, which is applicable to arbitrary target functions and network topologies and it is shown that this new upper bound is in general strictly better than the best existing one proposed by Huang, Tan and Yang.

On Network Coding for Sum-Networks

  • B. K. RaiB. Dey
  • Computer Science, Mathematics
    IEEE Transactions on Information Theory
  • 2012
The insufficiency of linear net- work coding and unachievability of the network coding capacity are proved for sum-networks by using similar known results for communication networks.

Optimal Function Computation in Directed and Undirected Graphs

This work considers the problem of information aggregation in sensor networks, where one is interested in computing a function of the sensor measurements, and presents a cut-set lower bound and an achievable scheme based on aggregation along trees.

Network information flow

This work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated, and by employing coding at the nodes, which the work refers to as network coding, bandwidth can in general be saved.

Complexity classification of network information flow problems

This paper establishes a three-way partition consisting of problems solvable without resorting to network coding, problems requiring network coding that are polynomial-time solvable, and problems for which obtaining a linear network coding solution is NP-hard.

Linear Function Computation in Networks: Duality and Constant Gap Results

The distortion for computing the sum of an arbitrary number of independent Gaussian sources over the Gaussian network is proven to be within a constant factor of the optimal performance and the constant factor results are extended to include asymmetric functions for the case of two sources.

Computing Linear Functions by Linear Coding Over Networks

This work identifies a class of linear functions that can be computed using linear codes in every network that satisfies a natural cut-based condition and shows that the cut- based condition does not guarantee the existence of a linear coding solution.

Computing and communicating functions over sensor networks

The maximum rate at which functions of sensor measurements can be computed and communicated to the sink node is studied, focusing on symmetric functions, where only the data from a sensor is important, not its identity.

Communicating the Sum of Sources Over a Network

An efficient encoding scheme is presented which enables the communication of ΣX<sub>i</sub> for the three sources, three terminals case, given that each source terminal pair is connected by two edge disjoint paths.

Linear Codes, Target Function Classes, and Network Computing Capacity

Computing capacity bounds and achievability are given with respect to these target function classes for network codes that use routing, linear coding, or nonlinear coding in single-receiver networks.