Title of article
Allocation of Network Error Correction Flow on Disjoint Paths
Author/Authors
Xiao, Zhiqing Department of Electronic Engineering - Tsinghua University , Li, Yunzhou Research Institute of Information Technology - Tsinghua University , Wang, Jing Research Institute of Information Technology - Tsinghua University
Pages
6
From page
182
To page
187
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.
Keywords
network error correction , maximum distance separable codes , disjoint paths , network survivability
Journal title
Astroparticle Physics
Serial Year
2015
Record number
2423003
Link To Document