Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Elements of information theory
Elements of information theory
PLAN: a packet language for active networks
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Active Networks and Active Network Management: A Proactive Management Framework
Active Networks and Active Network Management: A Proactive Management Framework
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Information Theory
Capacity results for the discrete memoryless network
IEEE Transactions on Information Theory
An information-theoretic view of network management
IEEE Transactions on Information Theory
On the capacity of information networks
IEEE Transactions on Information Theory
On the capacity of multiple unicast sessions in undirected graphs
IEEE Transactions on Information Theory
Network planning in wireless ad hoc networks: a cross-Layer approach
IEEE Journal on Selected Areas in Communications
The SwitchWare active network architecture
IEEE Network: The Magazine of Global Internetworking
On the capacity of information networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Foundations and Trends® in Networking
Foundations and Trends® in Networking
Topics in Multi-User Information Theory
Foundations and Trends in Communications and Information Theory
An overview of network coding for dynamically changing networks
International Journal of Autonomous and Adaptive Communications Systems
Multicast throughput order of network coding in wireless ad-hoc networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Industry perspectives: wireless ad hoc nanoscale networking
IEEE Wireless Communications - Special issue on seamless content delivery in the future mobile internet
A constant bound on throughput improvement of multicast network coding in undirected networks
IEEE Transactions on Information Theory
On the multimessage capacity region for undirected ring networks
IEEE Transactions on Information Theory
Pairwise intersession network coding on directed networks
IEEE Transactions on Information Theory
The serializability of network codes
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Lower bounds on the maximum energy benefit of network coding for wireless multiple unicast
EURASIP Journal on Wireless Communications and Networking - Special issue on network coding for wireless networks
Toward in vivo nanoscale communication networks: utilizing an active network architecture
Frontiers of Computer Science in China
Hi-index | 0.18 |
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.