Edge-Cut Bounds on Network Coding Rates |
| |
Authors: | Gerhard Kramer Serap A Savari |
| |
Affiliation: | (1) Mathematics of Communications Research Department, Bell Labs, Lucent Technologies, New Jersey, USA;(2) Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, Michigan, USA;(3) Mathematics of Communications Research Department, Bell Labs, Lucent Technologies, 600 Mountain Ave, Murray Hill, New Jersey, USA |
| |
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. |
| |
Keywords: | Network capacity network coding active networks d-separation |
本文献已被 SpringerLink 等数据库收录! |
|