Name
Abstract | ||
|---|---|---|
Batched network coding is a variation of random linear network coding which has low computational and storage costs. In order to adapt random fluctuations in the number of erasures in individual batches, it is not optimal to recode and transmit the same number of packets for all batches. Different distributed optimization problems, which are called adaptive recoding, were formulated for this purpose. The key component of these optimization problems is the expected value of the rank distribution of a batch at the next network node, which also known as the expected rank. In this paper, we put forth a unified adaptive recoding framework. We show that the expected rank functions are concave when the packet loss pattern follows a stationary stochastic process regardless of the field size, which covers but not limited to independent packet loss and burst packet loss. Under this concavity property, we show that there always exists a preferred solution which not only can make the number of recoded packets almost deterministic but can also tolerate rank distribution errors due to inaccurate measurements or limited precision of the machine. To obtain such an optimal solution, we propose tuning schemes that can turn any feasible solution into one with the above desired properties. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/ISIT.2019.8849277 | 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) |
Field | DocType | Citations |
Linear network coding,Discrete mathematics,Computer science,Network packet,Node (networking),Algorithm,Stochastic process,Packet loss,Expected value,Optimization problem | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hoover H. F. Yin | 1 | 0 | 1.35 |
| Bin Tang | 2 | 78 | 15.55 |
| Ka Hei Ng | 3 | 0 | 2.03 |
| Shenghao Yang | 4 | 33 | 13.84 |
| Xishi Wang | 5 | 0 | 1.35 |
| Qiaoqiao Zhou | 6 | 0 | 0.34 |