Edge-Cut Bounds on Network Coding Rates
Gerhard Kramer,Serap A. Savari +1 more
Reads0
Chats0
TLDR
A new bound on communication rates is developed that applies to network coding, which is a promising active network application that has processors transmit packets that are general functions, for example a bit-wise XOR of selected received packets.Abstract:
Active networks are network architectures with processors that are capable of executing code carried by the packets passing through them. A critical network management concern is the optimization of such networks and tight bounds on their performance serve as useful design benchmarks. A new bound on communication rates is developed that applies to network coding, which is a promising active network application that has processors transmit packets that are general functions, for example a bit-wise XOR, of selected received packets. The bound generalizes an edge-cut bound on routing rates by progressively removing edges from the network graph and checking whether certain strengthened d-separation conditions are satisfied. The bound improves on the cut-set bound and its efficacy is demonstrated by showing that routing is rate-optimal for some commonly cited examples in the networking literature.read more
Citations
More filters
Book
Network Information Theory
Abbas El Gamal,Young-Han Kim +1 more
TL;DR: In this article, a comprehensive treatment of network information theory and its applications is provided, which provides the first unified coverage of both classical and recent results, including successive cancellation and superposition coding, MIMO wireless communication, network coding and cooperative relaying.
Book
Cooperative Communications
TL;DR: This article reviews progress in cooperative communication networks and intends its presentation to be a tutorial for the reader who is familiar with information theory concepts but has not actively followed the field.
Book
Topics in Multi-User Information Theory
TL;DR: This survey builds up knowledge on random coding, binning, superposition coding, and capacity converses by introducing progressively more sophisticated tools for a selection of source and channel models.
Journal ArticleDOI
Networks, Matroids, and Non-Shannon Information Inequalities
TL;DR: The Vamos network is constructed, and it is proved that Shannon-type information inequalities are insufficient even for computing network coding capacities of multiple-unicast networks.
Book
Principles Of Cognitive Radio
TL;DR: 1. The concept of cognitive radio, capacity of cognitiveRadio networks, and Propagation issues for cognitive radio: a review.
References
More filters
Proceedings ArticleDOI
Network planning in wireless ad hoc networks: a cross-Layer approach
TL;DR: An iterative cross-layer optimization is proposed, which alternates between jointly optimizing the timesharing in the medium access layer and the sum of max of flows assignment in the network layer and updating the operational states in the physical layer, which results in a set of achievable tradeoffs between throughput and energy efficiency.
Journal ArticleDOI
On the capacity of information networks
TL;DR: An outer bound on the rate region of noise-free information networks is given and it is shown that multicommodity flow solutions achieve the capacity in an infinite class of undirected graphs, thereby making progress on a conjecture of Li and Li.
On the Max Flow Min Cut Theorem of Networks.
TL;DR: In this paper, it was shown that Menger's theorem and the Max Flow Min Cut Theorem on networks are applications of the duality theorem of linear inequality theory, and that they can be applied to networks.
Journal ArticleDOI
An information-theoretic view of network management
TL;DR: It is shown that the minimum node-based requirement for failures of links adjacent to a single receiver is achieved with receiver-based schemes, and a lower bound for arbitrary connections and an upper bound for multitransmitter multicast connections are included.
Proceedings ArticleDOI
On the utility of network coding in dynamic environments
TL;DR: This work considers a distributed randomized network coding approach that enables efficient decentralized operation of multi-source multicast networks and shows that this approach provides substantial benefits over traditional routing methods in dynamically varying environments.