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 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展开更多
基金supported by the National Key Basic Research and Development (973) Program of China (No. 2013CB329002)the National High-Tech Research and Development (863) Program of China (No. 2014AA01A703)+3 种基金the National Science and Technology Major Project (No. 2013ZX03004007)the Program for New Century Excellent Talents in University (No. NCET13-0321)the International Science and Technology Cooperation Program (No. 2012DFG12010)the Tsinghua Research Funding (No. 2010THZ03-2)
文摘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
