Allocation of Network Error Correction Flow on Disjoint Paths |
| |
| Institution: | Zhiqing Xiao;Yunzhou Li;Jing Wang;the Department of Electronic Engineering, Tsinghua University;the Research Institute of Information Technology, Tsinghua University; |
| |
| 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: | |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
