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
Proceedings ArticleDOI
Network Coding Based Cooperative Peer-to-Peer Repair in Wireless Ad-Hoc Networks
TL;DR: The results show that employing network coding significantly improves the efficiency of CPR, and the proposed NC-DCPR, a fully distributed protocol for NC-CPR, is proposed.
Proceedings ArticleDOI
Secure Network Coding with a Cost Criterion
Jianlong Tan,Muriel Medard +1 more
TL;DR: The problem that this work attempts to solve is to find a network coding scheme that has both a low network cost and a low probability of the wiretapper being able to retrieve all the messages of interest, and makes use of random linear codes in anticipation for decentralized implementation of the scheme.
Proceedings ArticleDOI
Exact minimum-repair-bandwidth cooperative regenerating codes for distributed storage systems
Kenneth W. Shum,Yuchong Hu +1 more
TL;DR: In this paper, a lower bound on the repair-bandwidth for cooperative repair is derived and a construction of a family of exact cooperative regenerating codes matching this lower bound is presented.
Journal ArticleDOI
Mixing network coding and cooperation for reliable wireless communications
F Rossetto,Marco Zorzi +1 more
TL;DR: An overview of the literature in the field of cooperation and network coding is given, the main achievements and design guidelines found so far are summarized, and the main challenges yet to be solved are highlighted.
Proceedings ArticleDOI
Network Coding Optimization Based on Chemical Reaction Optimization
TL;DR: This paper considers the NP-hard problem of minimizing the number of coding links of a network for a given target transmission rate, and adopts the CRO framework to develop an algorithm to solve this NP- hard problem.
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.