scispace - formally typeset
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
Dissertation

Networking from a network coding perspective

Tracey Ho
TL;DR: An information theoretic framework for network management for recovery from non-ergodic link failures, based on the very general network coding concept of network behavior as a code is developed, which provides a way to quantify essential management information as that needed to switch among different codes for different failure scenarios.
Journal ArticleDOI

Wireless Network Code Design and Performance Analysis Using Diversity-Multiplexing Tradeoff

TL;DR: In this article, the authors design and analyze deterministic and random network coding schemes for a cooperative communication setup with multiple sources and destinations, and derive the necessary and sufficient conditions to achieve the maximum diversity order.
Journal ArticleDOI

WiMAX networks: from access to service platform

TL;DR: The design of a new network layer that can support multihop communications efficiently in WiMAX networks and that can fully exploit the features of the WiMAX standards is advocated.
Proceedings ArticleDOI

MIMO compute-and-forward

TL;DR: This work generalizes the compute-and-forward framework to the multiple antenna setting, and shows that it is often beneficial to use extra antennas at the receiver to rotate the channel coefficients towards the nearest integer vector instead of separating out the transmitted signals.
Journal ArticleDOI

Expanding the Compute-and-Forward Framework: Unequal Powers, Signal Levels, and Multiple Linear Combinations

TL;DR: An expanded compute-and-forward framework is proposed that incorporates both the advantages of employing unequal powers at the transmitters and decoding more than one linear combination at each receiver and permits an intuitive interpretation in terms of signal levels.
References
More filters
Book

Elements of information theory

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

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

TL;DR: These rates are shown to be optimal for deterministic distortion measures for random variables and Shannon mutual information.
Related Papers (5)