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
Book
Multi-way Communications: An Information Theoretic Perspective
Anas Chaaban,Aydin Sezgin +1 more
TL;DR: Fundamental limits on the achievable rates are reviewed, and making use of a linear high-SNR deterministic channelmodel to provide valuable insights which are helpful when discussing the coding schemes for Gaussian channel models in detail are discussed.
Proceedings ArticleDOI
Zero-error function computation in sensor networks
Hemant Kowshik,P. R. Kumar +1 more
TL;DR: The goal is to characterize the rate region in R∣ℰ∣ by determining the optimal encoders on each edge which achieve zero-error block computation of the function at the collector node.
Journal ArticleDOI
A network pharmacology-based approach to analyse potential targets of traditional herbal formulas: An example of Yu Ping Feng decoction.
TL;DR: A novel network pharmacology based method shows promise for identifying its potential therapeutic targets, which could contribute to the modern scientific illustration of TCMs’ traditional clinical applications.
Proceedings ArticleDOI
Bounds on the Benefit of Network Coding: Throughput and Energy Saving in Wireless Networks
TL;DR: In this paper, it was shown that the gain of network coding in terms of transport capacity is bounded by a constant factor pi in any arbitrary wireless network and for all traditional channel models, and a lower bound on the expected number of transmissions of multiple unicast sessions under an arbitrary network coding was given.
Journal ArticleDOI
Wireless Energy Harvesting in Two-Way Network Coded Cooperative Communications: A Stochastic Approach for Large Scale Networks
Prodromos-Vasileios Mekikis,Aris S. Lalos,Angelos Antonopoulos,Luis Alonso,Christos Verikoukis +4 more
TL;DR: Theoretical expressions for key network performance metrics, i.e., the probability of successful data exchange and the network lifetime gain, are derived via extensive Monte Carlo simulations, demonstrating the potential benefits of the energy harvested by the wireless transmissions.
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.