Network computing capacity for the reverse butterfly network

Authors:
Rathinakumar Appuswamy;Massimo Franceschetti;Nikhil Karamchandani;Kenneth Zeger
Affiliations:
Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA;Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA;Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA;Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 10
Cited 0

Communication complexity

Communication complexity
Some complexity questions related to distributive computing(Preliminary Report)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Complexity classification of network information flow problems

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Geographic gossip: efficient aggregation for sensor networks

Proceedings of the 5th international conference on Information processing in sensor networks
Randomized gossip algorithms

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
A First Course in Information Theory (Information Technology: Transmission, Processing and Storage)

A First Course in Information Theory (Information Technology: Transmission, Processing and Storage)
Network information flow

IEEE Transactions on Information Theory
Network routing capacity

IEEE Transactions on Information Theory
Fast Distributed Algorithms for Computing Separable Functions

IEEE Transactions on Information Theory
Toward a theory of in-network computation in wireless sensor networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the computation of the arithmetic sum of the q-ary source messages in the reverse butterfly network. Specifically, we characterize the maximum rate at which the message sum can be computed at the receiver and demonstrate that linear coding is suboptimal.