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
PDF (472.8 KB)
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.

References

[1]
Haider A. and Harris, R. Recovery techniques in next generation networks, IEEE Comm. Surveys and Tutorials, vol. 9, no. 3, pp. 1-17, 2007.
[2]
Lang J. and Drake, J. Mesh network resiliency using GMPLS, Proc. IEEE, vol. 90, no. 9, pp. 1559-1564, 2002.
[3]
Cai N. and Yeung, R. W. Network coding and error correction, in IEEE Inf. Theory Workshop, Bangalore, India, 2002, pp. 20-25.
[4]
Kim, S. Ho, T. Effros, M. and Avestimehr, A. Network error correction with unequal link capacities, in Proc. 47th Annual Allerton Conf. Commun., Control, Comput., Monticello, USA, 2009, pp. 1387-1394.
[5]
Kim, S. Ho, T. Effros, M. and Avestimehr, A. Network error correction with unequal link capacities, IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 1144-1164, 2011.
[6]
Ho, T. Kim, S. Yang, Y. Effros, M. and Avestimehr, S. On network error correction with limited feedback capacity, in Inf. Theory Appl. Workshop, La Jolla, USA, 2011, pp. 1-3.
[7]
Yang, S. Yeung, R. and Ngai, C. Refined coding bounds and code constructions for coherent network error correction, IEEE Trans. Inf. Theory, vol. 57, no. 3, pp. 1409-1424, 2011.
[8]
Guang, X. Fu, F. and Zhang, Z. Construction of network error correction codes in packet networks, IEEE Trans. Inf. Theory, vol. 59, no. 2, pp. 1030-1047, 2013.
[9]
Bhandari, R. Optimal physical diversity algorithms and survivable networks, in Proc. 2nd IEEE Symp. Comput. and Commun., Alexandria, Egypt, 1997, pp. 433-441.
[10]
Bellman, R. On a routing problem, Quart. Appl. Math., vol. 16, pp. 87-90, 1958.
[11]
Ford J. and Lester, R. Network Flow Theory. Santa Monica, California, USA: RAND Corporation, 1956, p. 923.
[12]
Yen, J. An algorithm for finding shortest routes from all source nodes to a given destination in general networks, Quart. Appl. Math., vol. 27, pp. 526-530, 1970.
Tsinghua Science and Technology
Pages 182-187
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

498

Views

15

Downloads

2

Crossref

N/A

Web of Science

2

Scopus

0

CSCD

Altmetrics

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