Download Now Free registration required
Many network design cases with network coding can be formulated as combinatorial optimization problems, which are NP-hard and hard to approximate even in a centralized manner. In this paper, guided by Markov approximation framework, the authors provide a unified distributed solution for one important subcategory of combinatorial network coding problems: combinatorial coding sub-graph selection problems. They show the scheme by studying one problem instance: optimal coding sub-graph selection over wire-line networks under arbitrary bounds on graph diameter.
- Format: PDF
- Size: 84 KB