IEICE TRANSACTIONS on Fundamentals
The Failure Probabilities of Random Linear Network Coding at Sink Nodes
Summary :
In the paradigm of network coding, when the network topology information cannot be utilized completely, random linear network coding (RLNC) is proposed as a feasible coding scheme. But since RLNC neither considers the global network topology nor coordinates codings between different nodes, it may not achieve the best possible performance of network coding. Hence, the performance analysis of RLNC is very important for both theoretical research and practical applications. Motivated by a fact that different network topology information can be available for different network communication problems, we study and obtain several upper and lower bounds on the failure probability at sink nodes depending on different network topology information in this paper, which is also the kernel to discuss some other types of network failure probabilities. In addition, we show that the obtained upper bounds are tight, the obtained lower bound is asymptotically tight, and we give the worst cases for different scenarios.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E99-A No.6 pp.1255-1259
- Publication Date
- 2016/06/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E99.A.1255
- Type of Manuscript
- LETTER
- Category
- Information Theory
Authors
Dan LI
Tianjin University of Technology
Xuan GUANG
Nankai University
Fang-Wei FU
Nankai University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Dan LI, Xuan GUANG, Fang-Wei FU, "The Failure Probabilities of Random Linear Network Coding at Sink Nodes" in IEICE TRANSACTIONS on Fundamentals,
vol. E99-A, no. 6, pp. 1255-1259, June 2016, doi: 10.1587/transfun.E99.A.1255.
Abstract: In the paradigm of network coding, when the network topology information cannot be utilized completely, random linear network coding (RLNC) is proposed as a feasible coding scheme. But since RLNC neither considers the global network topology nor coordinates codings between different nodes, it may not achieve the best possible performance of network coding. Hence, the performance analysis of RLNC is very important for both theoretical research and practical applications. Motivated by a fact that different network topology information can be available for different network communication problems, we study and obtain several upper and lower bounds on the failure probability at sink nodes depending on different network topology information in this paper, which is also the kernel to discuss some other types of network failure probabilities. In addition, we show that the obtained upper bounds are tight, the obtained lower bound is asymptotically tight, and we give the worst cases for different scenarios.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E99.A.1255/_p
Copy
@ARTICLE{e99-a_6_1255,
author={Dan LI, Xuan GUANG, Fang-Wei FU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={The Failure Probabilities of Random Linear Network Coding at Sink Nodes},
year={2016},
volume={E99-A},
number={6},
pages={1255-1259},
abstract={In the paradigm of network coding, when the network topology information cannot be utilized completely, random linear network coding (RLNC) is proposed as a feasible coding scheme. But since RLNC neither considers the global network topology nor coordinates codings between different nodes, it may not achieve the best possible performance of network coding. Hence, the performance analysis of RLNC is very important for both theoretical research and practical applications. Motivated by a fact that different network topology information can be available for different network communication problems, we study and obtain several upper and lower bounds on the failure probability at sink nodes depending on different network topology information in this paper, which is also the kernel to discuss some other types of network failure probabilities. In addition, we show that the obtained upper bounds are tight, the obtained lower bound is asymptotically tight, and we give the worst cases for different scenarios.},
keywords={},
doi={10.1587/transfun.E99.A.1255},
ISSN={1745-1337},
month={June},}
Copy
TY - JOUR
TI - The Failure Probabilities of Random Linear Network Coding at Sink Nodes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1255
EP - 1259
AU - Dan LI
AU - Xuan GUANG
AU - Fang-Wei FU
PY - 2016
DO - 10.1587/transfun.E99.A.1255
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E99-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2016
AB - In the paradigm of network coding, when the network topology information cannot be utilized completely, random linear network coding (RLNC) is proposed as a feasible coding scheme. But since RLNC neither considers the global network topology nor coordinates codings between different nodes, it may not achieve the best possible performance of network coding. Hence, the performance analysis of RLNC is very important for both theoretical research and practical applications. Motivated by a fact that different network topology information can be available for different network communication problems, we study and obtain several upper and lower bounds on the failure probability at sink nodes depending on different network topology information in this paper, which is also the kernel to discuss some other types of network failure probabilities. In addition, we show that the obtained upper bounds are tight, the obtained lower bound is asymptotically tight, and we give the worst cases for different scenarios.
ER -
English
