AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Powered by AMiner. Clicking this button will take you away from SciOpen.
Home Tsinghua Science and Technology Article
PDF (472.8 KB)
Cite
EndNote(RIS) BibTeX
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access

Allocation of Network Error Correction Flow on Disjoint Paths

Department of Electronic Engineering, Tsinghua University, Beijing 100084, China.
Research Institute of Information Technology, Tsinghua University, Beijing 100084, China.
Show Author Information

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 survivabilitydisjoint pathsmaximum distance separable codesnetwork error correction

References

【1】
【1】
 
 
Crossref Google Scholar
Tsinghua Science and Technology
Volume 20 Issue 2,
April 2015
Pages 182-187
DOI: 10.1109/TST.2015.7085631

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Cite this Report
Close
Close
Cite this article:
Xiao Z, Li Y, Wang J. Allocation of Network Error Correction Flow on Disjoint Paths. Tsinghua Science and Technology, 2015, 20(2): 182-187. https://doi.org/10.1109/TST.2015.7085631

975

Views

43

Downloads

3

Crossref

N/A

Web of Science

2

Scopus

0

CSCD
Received: 10 January 2014
Revised: 17 June 2014
Accepted: 21 July 2014
Published: 23 April 2015
© The author(s) 2015