Name
Abstract | ||
|---|---|---|
A typical path over the internet is composed of multiple hops. When considering the transmission of a sequence of messages (streaming messages) through packet erasure channel over a three-node network, it has been shown that taking into account the erasure pattern of each segment can result in improved performance compared to treating the channel as a point-to-point link. Since rarely there is only a single relay between the sender and the destination, it calls for trying to extend this scheme to more than a single relay. In this paper, we first extend the upper bound on the rate of transmission of a sequence of messages for any number of relays. We further suggest an achievable adaptive scheme that is shown to achieve the upper bound up to the size of an additional header that is required to allow each receiver to meet the delay constraints. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/ISIT44484.2020.9174225 | 2020 IEEE International Symposium on Information Theory (ISIT) |
Keywords | DocType | ISSN |
delay constraints,radio receiver,streaming messages,message sequence transmission,internet,point-to-point link,erasure pattern,three-node network,packet erasure channel,multiple hops,multihop relay network,streaming erasure codes,achievable adaptive scheme,single relay | Conference | 2157-8095 |
ISBN | Citations | PageRank |
978-1-7281-6433-5 | 0 | 0.34 |
References | Authors | |
2 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elad Domanovitz | 1 | 2 | 6.78 |
| Ashish Khisti | 2 | 3264 | 203.65 |
| Wai-tian Tan | 3 | 672 | 78.92 |
| Xiaoqing Zhu | 4 | 502 | 34.70 |
| John G. Apostolopoulos | 5 | 777 | 68.63 |