Network information flow
Ahlswede, R.
Ning Cai
Li, S.-Y.R.
Yeung, R.W.
Fakultat fur Math., Bielefeld Univ.;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: Jul 2000
Volume: 46,
Issue: 4
On page(s): 1204-1216
ISSN: 0018-9448
References Cited: 14
CODEN: IETTAW
INSPEC Accession Number: 6660200
Digital Object Identifier: 10.1109/18.850663
Current Version Published: 2002-08-06
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
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
