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
Multiuser Cooperative Diversity Through Network Coding Based on Classical Coding Theory
TL;DR: In this article, a generalized dynamic-network codes (GDNC) was proposed to increase the diversity order of the system without reducing its throughput, and the proposed generalization offers a much better tradeoff between rate and diversity order compared to the DNC.
Proceedings ArticleDOI
Analyzing network coding gossip made easy
TL;DR: This work shows, in most settings for the first time, that the RLNC gossip converges with high probability in optimal time, and achieves "perfect pipelining", and directly extends to highly dynamic networks in which the topology can change completely at any time.
Journal ArticleDOI
The multicast capacity of deterministic relay networks with no interference
N. Ratnakar,Gerhard Kramer +1 more
TL;DR: The multicast capacity is determined for networks that have deterministic channels with broadcasting at the transmitters and no interference at the receivers and the capacity is shown to have a cut-set interpretation.
Proceedings Article
Anatomy of a P2P Content Distribution system with Network Coding.
TL;DR: This paper uses results from live trials to present a detailed performance analysis of a P2P content distribution system that uses Network Coding and describes a novel scheme that verifies encoded blocks on-the-fly and analyzes its performance.
Proceedings ArticleDOI
Emergency related video streaming in VANET using network coding
TL;DR: It is shown that network coding allows very reliable and efficient data dissemination and thus is suitable for multimedia safety information dissemination and if the vehicle column has gaps, network coding jointly with "data muling" on vehicles in the opposite direction can deliver the multimedia files to disconnected components faster than other known schemes.
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.