Bounds on end-to-end performance of networks employing erasure control coding

Xiao-Hong Peng*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Erasure control coding has been exploited in communication networks with an aim to improve the end-to-end performance of data delivery across the network. To address the concerns over the strengths and constraints of erasure coding schemes in this application, we examine the performance limits of two erasure control coding strategies, forward erasure recovery and adaptive erasure recovery. Our investigation shows that the throughput of a network using an (n, k) forward erasure control code is capped by r =k/n when the packet loss rate p ≤ (te/n) and by k(l-p)/(n-te) when p > (t e/n), where te is the erasure control capability of the code. It also shows that the lower bound of the residual loss rate of such a network is (np-te)/(n-te) for (te/n) < p ≤ 1. Especially, if the code used is maximum distance separable, the Shannon capacity of the erasure channel, i.e. 1-p, can be achieved and the residual loss rate is lower bounded by (p+r-1)/r, for (1-r) < p ≤ 1. To address the requirements in real-time applications, we also investigate the service completion time of different schemes. It is revealed that the latency of the forward erasure recovery scheme is fractionally higher than that of the scheme without erasure control coding or retransmission mechanisms (using UDP), but much lower than that of the adaptive erasure scheme when the packet loss rate is high. Results on comparisons between the two erasure control schemes exhibit their advantages as well as disadvantages in the role of delivering end-to-end services. To show the impact of the bounds derived on the end-to-end performance of a TCP/IP network, a case study is provided to demonstrate how erasure control coding could be used to maximize the performance of practical systems.

Original languageEnglish
Title of host publicationISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and its Applications
PublisherIEEE
Pages650-655
Number of pages6
ISBN (Print)978-1-4244-6017-5
DOIs
Publication statusPublished - 2010
Event20th International Symposium on Information Theory and its Applications - Taichung, Taiwan, Province of China
Duration: 17 Oct 201020 Oct 2010

Symposium

Symposium20th International Symposium on Information Theory and its Applications
Abbreviated titleISITA 2010/ISSSTA 2010
CountryTaiwan, Province of China
CityTaichung
Period17/10/1020/10/10

Fingerprint

Packet loss
Recovery
Telecommunication networks
Throughput

Cite this

Peng, X-H. (2010). Bounds on end-to-end performance of networks employing erasure control coding. In ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and its Applications (pp. 650-655). IEEE. https://doi.org/10.1109/ISITA.2010.5649686
Peng, Xiao-Hong. / Bounds on end-to-end performance of networks employing erasure control coding. ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and its Applications. IEEE, 2010. pp. 650-655
@inproceedings{8d51dbe7fc9040779e9f02cc8d53f9c7,
title = "Bounds on end-to-end performance of networks employing erasure control coding",
abstract = "Erasure control coding has been exploited in communication networks with an aim to improve the end-to-end performance of data delivery across the network. To address the concerns over the strengths and constraints of erasure coding schemes in this application, we examine the performance limits of two erasure control coding strategies, forward erasure recovery and adaptive erasure recovery. Our investigation shows that the throughput of a network using an (n, k) forward erasure control code is capped by r =k/n when the packet loss rate p ≤ (te/n) and by k(l-p)/(n-te) when p > (t e/n), where te is the erasure control capability of the code. It also shows that the lower bound of the residual loss rate of such a network is (np-te)/(n-te) for (te/n) < p ≤ 1. Especially, if the code used is maximum distance separable, the Shannon capacity of the erasure channel, i.e. 1-p, can be achieved and the residual loss rate is lower bounded by (p+r-1)/r, for (1-r) < p ≤ 1. To address the requirements in real-time applications, we also investigate the service completion time of different schemes. It is revealed that the latency of the forward erasure recovery scheme is fractionally higher than that of the scheme without erasure control coding or retransmission mechanisms (using UDP), but much lower than that of the adaptive erasure scheme when the packet loss rate is high. Results on comparisons between the two erasure control schemes exhibit their advantages as well as disadvantages in the role of delivering end-to-end services. To show the impact of the bounds derived on the end-to-end performance of a TCP/IP network, a case study is provided to demonstrate how erasure control coding could be used to maximize the performance of practical systems.",
author = "Xiao-Hong Peng",
year = "2010",
doi = "10.1109/ISITA.2010.5649686",
language = "English",
isbn = "978-1-4244-6017-5",
pages = "650--655",
booktitle = "ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and its Applications",
publisher = "IEEE",
address = "United States",

}

Peng, X-H 2010, Bounds on end-to-end performance of networks employing erasure control coding. in ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and its Applications. IEEE, pp. 650-655, 20th International Symposium on Information Theory and its Applications, Taichung, Taiwan, Province of China, 17/10/10. https://doi.org/10.1109/ISITA.2010.5649686

Bounds on end-to-end performance of networks employing erasure control coding. / Peng, Xiao-Hong.

ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and its Applications. IEEE, 2010. p. 650-655.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Bounds on end-to-end performance of networks employing erasure control coding

AU - Peng, Xiao-Hong

PY - 2010

Y1 - 2010

N2 - Erasure control coding has been exploited in communication networks with an aim to improve the end-to-end performance of data delivery across the network. To address the concerns over the strengths and constraints of erasure coding schemes in this application, we examine the performance limits of two erasure control coding strategies, forward erasure recovery and adaptive erasure recovery. Our investigation shows that the throughput of a network using an (n, k) forward erasure control code is capped by r =k/n when the packet loss rate p ≤ (te/n) and by k(l-p)/(n-te) when p > (t e/n), where te is the erasure control capability of the code. It also shows that the lower bound of the residual loss rate of such a network is (np-te)/(n-te) for (te/n) < p ≤ 1. Especially, if the code used is maximum distance separable, the Shannon capacity of the erasure channel, i.e. 1-p, can be achieved and the residual loss rate is lower bounded by (p+r-1)/r, for (1-r) < p ≤ 1. To address the requirements in real-time applications, we also investigate the service completion time of different schemes. It is revealed that the latency of the forward erasure recovery scheme is fractionally higher than that of the scheme without erasure control coding or retransmission mechanisms (using UDP), but much lower than that of the adaptive erasure scheme when the packet loss rate is high. Results on comparisons between the two erasure control schemes exhibit their advantages as well as disadvantages in the role of delivering end-to-end services. To show the impact of the bounds derived on the end-to-end performance of a TCP/IP network, a case study is provided to demonstrate how erasure control coding could be used to maximize the performance of practical systems.

AB - Erasure control coding has been exploited in communication networks with an aim to improve the end-to-end performance of data delivery across the network. To address the concerns over the strengths and constraints of erasure coding schemes in this application, we examine the performance limits of two erasure control coding strategies, forward erasure recovery and adaptive erasure recovery. Our investigation shows that the throughput of a network using an (n, k) forward erasure control code is capped by r =k/n when the packet loss rate p ≤ (te/n) and by k(l-p)/(n-te) when p > (t e/n), where te is the erasure control capability of the code. It also shows that the lower bound of the residual loss rate of such a network is (np-te)/(n-te) for (te/n) < p ≤ 1. Especially, if the code used is maximum distance separable, the Shannon capacity of the erasure channel, i.e. 1-p, can be achieved and the residual loss rate is lower bounded by (p+r-1)/r, for (1-r) < p ≤ 1. To address the requirements in real-time applications, we also investigate the service completion time of different schemes. It is revealed that the latency of the forward erasure recovery scheme is fractionally higher than that of the scheme without erasure control coding or retransmission mechanisms (using UDP), but much lower than that of the adaptive erasure scheme when the packet loss rate is high. Results on comparisons between the two erasure control schemes exhibit their advantages as well as disadvantages in the role of delivering end-to-end services. To show the impact of the bounds derived on the end-to-end performance of a TCP/IP network, a case study is provided to demonstrate how erasure control coding could be used to maximize the performance of practical systems.

UR - http://www.scopus.com/inward/record.url?scp=78651295128&partnerID=8YFLogxK

UR - http://ieeexplore.ieee.org/document/5649686/

U2 - 10.1109/ISITA.2010.5649686

DO - 10.1109/ISITA.2010.5649686

M3 - Conference contribution

AN - SCOPUS:78651295128

SN - 978-1-4244-6017-5

SP - 650

EP - 655

BT - ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and its Applications

PB - IEEE

ER -

Peng X-H. Bounds on end-to-end performance of networks employing erasure control coding. In ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and its Applications. IEEE. 2010. p. 650-655 https://doi.org/10.1109/ISITA.2010.5649686