.png){kind=icon}
.png){kind=icon}
Return
Hierarchical Performance Analysis on Random Linear Network Coding
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2017.2787991.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Random linear network coding (RLNC) is a promising network coding solution when the network topology information is not fully available to all the nodes. However, in practice, nodes have partial knowledge of the network topology information. Motivated by this, we investigate the performance of RLNC and obtain different upper bounds on the failure probability of RLNC for the network constrained by different partial network topology information. These upper bounds not only improve the existing ones in the literature, but also show that the partial network topology information can bring benefits to the performance analysis of RLNC. On the other hand, it is observed that if more network topology information can be utilized, tighter upper bounds can be obtained, as expected. The upper bounds on two classical networks are compared for demonstration. To obtain a deeper understanding about the performance of RLNC, the asymptotic behavior of RLNC as the field size goes to infinity is also investigated.
Keywords:
Random linear network coding
failure probability
hierarchical performance
upper bound
asymptotic behavior
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
View more organizations