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
Journal ArticleDOI
On the capacity of multiple unicast sessions in undirected graphs
TL;DR: Using entropy calculus, this work provides the first verification of the Li-Li conjecture that in an undirected network with multiple unicast sessions, network coding does not lead to any coding gain for this network.
Proceedings ArticleDOI
Network information flow: limits and achievability
TL;DR: An information theoretic upper bound on the information flow in discrete memoryless networks is found and proves the optimality of the coding scheme proposed in it.
Journal ArticleDOI
ANTS: network services without the red tape
TL;DR: ANTS is discussed, a new approach to deploying network services, which bases interoperability on a programmable network model, not on individual networking protocols, which can hasten progress toward a more responsive Internet.
Proceedings ArticleDOI
Active virtual network management prediction: complexity as a framework for prediction, optimization, and assurance
TL;DR: A complexity-based framework for information assurance that attempts to take a holistic view of vulnerability analysis and describes the relationship among algorithmic compression, complexity, and prediction accuracy within an active network.