Name
Abstract | ||
|---|---|---|
Batched network coding is a practical realization of random linear network coding, which encodes the packets for transmission into small batches of coded packets. The advantage of network coding can be reduced when a burst loss occurs. Block interleaver is one of the approach to spread the burst across multiple batches. However, an intermediate node has to receive all the packets in a batch which are not dropped by the channel before it can perform recoding on the batch, which means that the node has to deinterleave for recoding and reinterleave again for transmission. This gives us the freedom to select heterogeneous interleaver depth among the intermediate nodes. In general, the larger the interleaver depth, the better the spread of the bursts. On the other hand, we want the delay as short as possible to enable real-time applications. In this paper, we investigate the delay induced by applying a block interleaver on batched network codes. We also show that a homogeneous interleaver depth is the largest interleaver depth we can use to achieve a minimum delay. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/ISIT.2019.8849519 | 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) |
Field | DocType | Citations |
Linear network coding,Discrete mathematics,Homogeneous,Computer science,Network packet,Algorithm,Communication channel,Burst loss | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hoover H. F. Yin | 1 | 0 | 1.35 |
| Ka Hei Ng | 2 | 0 | 2.03 |
| Xishi Wang | 3 | 0 | 1.35 |
| Qi Cao | 4 | 0 | 0.68 |