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
SCAP: Smart Caching inWireless Access Points to Improve P2P Streaming
TL;DR: This paper proposes an efficient caching mechanism called SCAP (Smart Caching in Access Points), which improves the throughput of the WLAN by up to 88% and reduces the response delay to other Internet users meanwhile.
Proceedings ArticleDOI
On queueing in coded networks - queue size follows degrees of freedom
TL;DR: The queueing scheme that is proposed here forms a natural bridge between the virtual queue size and the physical queue size, and thus extends their result to the stability of the physical queues as well.
Journal ArticleDOI
Toward practical opportunistic routing with intra-session network coding for mesh networks
TL;DR: A novel optimization framework for opportunistic routing based on network utility maximization (NUM) is presented that enables it to derive optimal flow control, routing, scheduling, and rate adaptation schemes, where the use of network coding is used to ease the routing problem.
Journal ArticleDOI
Cooperative wireless networks based on physical layer network coding
TL;DR: A generic wireless network design framework based on physical layer network coding as a novel cooperation technique is developed and several transmitters in a cooperative network may transmit signals simultaneously to the same receiver to improve overall performance.
Posted Content
Performance Analysis of Two-Step Bi-Directional Relaying with Multiple Antennas
TL;DR: In this article, the authors investigate different downlink broadcast schemes which employ binary or analog network coding at the relay and compare their performances in terms of diversity order and symbol error probability.
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.