DMCA
Network information flow (2000)
Cached
Download Links
| Venue: | IEEE TRANS. INFORM. THEORY |
| Citations: | 1964 - 24 self |
BibTeX
@ARTICLE{Ahlswede00networkinformation,
author = {Rudolf Ahlswede and Ning Cai and Shuo-Yen Robert Li and Raymond W. Yeung},
title = {Network information flow},
journal = {IEEE TRANS. INFORM. THEORY},
year = {2000},
volume = {46},
number = {4},
pages = {1204--1216}
}
Share
 |
 |
 |
 |
||
OpenURL
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 mulitcast 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. In this paper, 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.
