Journal ArticleDOI
Network information flow
TLDR
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.Abstract:
We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be multicast to certain sets of destinations. We assume that the information sources are mutually independent. The problem is to characterize the admissible coding rate region. This model subsumes all previously studied models along the same line. We study the problem with one information source, and we have obtained a simple characterization of the admissible coding rate region. Our result can be regarded as the max-flow min-cut theorem for network information flow. Contrary to one's intuition, our 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. Rather, by employing coding at the nodes, which we refer to as network coding, bandwidth can in general be saved. This finding may have significant impact on future design of switching systems.read more
Citations
More filters
Journal ArticleDOI
Optical Physical-Layer Network Coding
TL;DR: This work proposes and demonstrates a practical optical PNC prototype for multicast protection in optical flow, burst, and packet switching networks that does not require bit synchronization and can be easily implemented.
Journal ArticleDOI
Time-Switching Uplink Network-Coded Cooperative Communication With Downlink Energy Transfer
Guilherme Luiz Moritz,Joao Luiz Rebelatto,Richard Demo Souza,Bartolomeu F. Uchoa-Filho,Yonghui Li +4 more
TL;DR: A closed-form approximation is obtained for the system outage probability and an approximation for the optimal energy transfer period that minimizes such outage probability for a multiuser cooperative wireless network where the energy-constrained sources have independent information to transmit to a common destination.
Proceedings ArticleDOI
Multi-rate peer-to-peer video conferencing: A distributed approach using scalable coding
TL;DR: Primal and Primal-dual based distributed algorithms to maximize aggregate utility of all receivers in all groups by multi-tree routing and show their convergence are developed.
Journal ArticleDOI
Survey on cooperative strategies for wireless relay channels
TL;DR: In this paper, a survey of cooperative strategies for three basic wireless relay channels, namely, the parallel relay channel, the multiple access relay channel and the broadcast relay channel is presented.
Journal ArticleDOI
Analyzing Network Coding (Gossip) Made Easy
TL;DR: In this paper, projection analysis is used to analyze the stopping time of RLNC gossip protocols in a general framework for network and communication models that encompasses and unifies the models used previously in this context.
References
More filters
Book
Elements of information theory
Thomas M. Cover,Joy A. Thomas +1 more
TL;DR: The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
Journal ArticleDOI
Factor graphs and the sum-product algorithm
TL;DR: A generic message-passing algorithm, the sum-product algorithm, that operates in a factor graph, that computes-either exactly or approximately-various marginal functions derived from the global function.
Journal ArticleDOI
Noiseless coding of correlated information sources
David Slepian,Jack K. Wolf +1 more
TL;DR: The minimum number of bits per character R_X and R_Y needed to encode these sequences so that they can be faithfully reproduced under a variety of assumptions regarding the encoders and decoders is determined.
Journal ArticleDOI
Linear network coding
TL;DR: This work forms this multicast problem and proves that linear coding suffices to achieve the optimum, which is the max-flow from the source to each receiving node.
Journal ArticleDOI
Achievable rates for multiple descriptions
Abbas El Gamal,Thomas M. Cover +1 more
TL;DR: These rates are shown to be optimal for deterministic distortion measures for random variables and Shannon mutual information.