The diversity provided by disjoint paths can increase the survivability of communication networks. This paper considers the allocation of network error correction flow on a network that consists of disjoint paths from the source node to the destination node. Specifically, we propose an algorithm of allocating the path-flows to support the given rate with minimum cost. Our analysis shows that the asymptotic time complexity of this algorithm is linearithmic, and this algorithm is optimal in general.
Publications
- Article type
- Year
- Co-author
Year
![](/assets/img/article/article-lock.png)
Tsinghua Science and Technology 2015, 20 (2): 182-187
Published: 23 April 2015
Downloads:14
Total 1