@article{Xiao2015, 
author = {Zhiqing Xiao and Yunzhou Li and Jing Wang},
title = {Allocation of Network Error Correction Flow on Disjoint Paths},
year = {2015},
journal = {Tsinghua Science and Technology},
volume = {20},
number = {2},
pages = {182-187},
keywords = {network survivability, disjoint paths, maximum distance separable codes, network error correction},
url = {https://www.sciopen.com/article/10.1109/TST.2015.7085631},
doi = {10.1109/TST.2015.7085631},
abstract = {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.}
}