A throughput-delay trade-off in packetized systems with erasures

Mikko Vehkaperä, Muriel Médard

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

20 Citations (Scopus)

Abstract

In this paper we propose an information theoretic framework for studying coding and throughput optimization for multi-layered packet transmission systems. Our approach assumes that the system is divided into two separate layers: One code word forms a packet at the physical layer and the code at the network layer spans over these packets. At the receiver, the network layer assumes that the decoded packets arriving from the physical layer either have no errors or are marked as deleted. Thus, albeit the packet loss may be caused, for example, by decoding error, congestion or channel conditions, the network layer treats all decoding errors as erasures regardless of the cause. This allows us to view the system at the network layer as transmission over memoryless erasure channel. We study the throughput optimization and code design across the layers under a total code length constraint while taking also into account the network layer imperfections in the transmission. We use random coding error exponents to achieve results that do not depend on specific coding scheme used. The proposed scheme provides also means for investigating important physical layer phenomena, such as, channel model and lower layer error correction coding in the packet erasure models. Our approach extends to fading channels and networks of multiple nodes and by viewing the two layers of coding as a concatenated coding scheme, a comparison between layer-by-layer and joint cross-layer rate optimization can be made, as outlined in this paper.

Original languageEnglish
Title of host publication2005 IEEE International Symposium on Information Theory, ISIT 2005
PublisherIEEE Institute of Electrical and Electronic Engineers
Pages1858-1862
ISBN (Print)0-7803-9151-9
DOIs
Publication statusPublished - 1 Dec 2005
MoE publication typeA4 Article in a conference publication
Event2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia
Duration: 4 Sep 20059 Sep 2005

Publication series

SeriesIEEE International Symposium on Information Theory. Proceedings
Volume2005
ISSN2157-8095

Conference

Conference2005 IEEE International Symposium on Information Theory, ISIT 05
CountryAustralia
CityAdelaide
Period4/09/059/09/05

Fingerprint

Network layers
Throughput
Trade-offs
Decoding
Coding
Coding errors
Random errors
Error correction
Packet loss
Fading channels
Optimization
Defects
Error Exponent
Cross-layer
Channel Model
Imperfections
Packet Loss
Error Correction
Fading Channels
Congestion

Cite this

Vehkaperä, M., & Médard, M. (2005). A throughput-delay trade-off in packetized systems with erasures. In 2005 IEEE International Symposium on Information Theory, ISIT 2005 (pp. 1858-1862). [1523667] IEEE Institute of Electrical and Electronic Engineers . IEEE International Symposium on Information Theory. Proceedings, Vol.. 2005 https://doi.org/10.1109/ISIT.2005.1523667
Vehkaperä, Mikko ; Médard, Muriel. / A throughput-delay trade-off in packetized systems with erasures. 2005 IEEE International Symposium on Information Theory, ISIT 2005. IEEE Institute of Electrical and Electronic Engineers , 2005. pp. 1858-1862 (IEEE International Symposium on Information Theory. Proceedings, Vol. 2005).
@inproceedings{cd47992c45e3453ba19f4e57319b3ce4,
title = "A throughput-delay trade-off in packetized systems with erasures",
abstract = "In this paper we propose an information theoretic framework for studying coding and throughput optimization for multi-layered packet transmission systems. Our approach assumes that the system is divided into two separate layers: One code word forms a packet at the physical layer and the code at the network layer spans over these packets. At the receiver, the network layer assumes that the decoded packets arriving from the physical layer either have no errors or are marked as deleted. Thus, albeit the packet loss may be caused, for example, by decoding error, congestion or channel conditions, the network layer treats all decoding errors as erasures regardless of the cause. This allows us to view the system at the network layer as transmission over memoryless erasure channel. We study the throughput optimization and code design across the layers under a total code length constraint while taking also into account the network layer imperfections in the transmission. We use random coding error exponents to achieve results that do not depend on specific coding scheme used. The proposed scheme provides also means for investigating important physical layer phenomena, such as, channel model and lower layer error correction coding in the packet erasure models. Our approach extends to fading channels and networks of multiple nodes and by viewing the two layers of coding as a concatenated coding scheme, a comparison between layer-by-layer and joint cross-layer rate optimization can be made, as outlined in this paper.",
author = "Mikko Vehkaper{\"a} and Muriel M{\'e}dard",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/ISIT.2005.1523667",
language = "English",
isbn = "0-7803-9151-9",
series = "IEEE International Symposium on Information Theory. Proceedings",
publisher = "IEEE Institute of Electrical and Electronic Engineers",
pages = "1858--1862",
booktitle = "2005 IEEE International Symposium on Information Theory, ISIT 2005",
address = "United States",

}

Vehkaperä, M & Médard, M 2005, A throughput-delay trade-off in packetized systems with erasures. in 2005 IEEE International Symposium on Information Theory, ISIT 2005., 1523667, IEEE Institute of Electrical and Electronic Engineers , IEEE International Symposium on Information Theory. Proceedings, vol. 2005, pp. 1858-1862, 2005 IEEE International Symposium on Information Theory, ISIT 05, Adelaide, Australia, 4/09/05. https://doi.org/10.1109/ISIT.2005.1523667

A throughput-delay trade-off in packetized systems with erasures. / Vehkaperä, Mikko; Médard, Muriel.

2005 IEEE International Symposium on Information Theory, ISIT 2005. IEEE Institute of Electrical and Electronic Engineers , 2005. p. 1858-1862 1523667 (IEEE International Symposium on Information Theory. Proceedings, Vol. 2005).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

TY - GEN

T1 - A throughput-delay trade-off in packetized systems with erasures

AU - Vehkaperä, Mikko

AU - Médard, Muriel

PY - 2005/12/1

Y1 - 2005/12/1

N2 - In this paper we propose an information theoretic framework for studying coding and throughput optimization for multi-layered packet transmission systems. Our approach assumes that the system is divided into two separate layers: One code word forms a packet at the physical layer and the code at the network layer spans over these packets. At the receiver, the network layer assumes that the decoded packets arriving from the physical layer either have no errors or are marked as deleted. Thus, albeit the packet loss may be caused, for example, by decoding error, congestion or channel conditions, the network layer treats all decoding errors as erasures regardless of the cause. This allows us to view the system at the network layer as transmission over memoryless erasure channel. We study the throughput optimization and code design across the layers under a total code length constraint while taking also into account the network layer imperfections in the transmission. We use random coding error exponents to achieve results that do not depend on specific coding scheme used. The proposed scheme provides also means for investigating important physical layer phenomena, such as, channel model and lower layer error correction coding in the packet erasure models. Our approach extends to fading channels and networks of multiple nodes and by viewing the two layers of coding as a concatenated coding scheme, a comparison between layer-by-layer and joint cross-layer rate optimization can be made, as outlined in this paper.

AB - In this paper we propose an information theoretic framework for studying coding and throughput optimization for multi-layered packet transmission systems. Our approach assumes that the system is divided into two separate layers: One code word forms a packet at the physical layer and the code at the network layer spans over these packets. At the receiver, the network layer assumes that the decoded packets arriving from the physical layer either have no errors or are marked as deleted. Thus, albeit the packet loss may be caused, for example, by decoding error, congestion or channel conditions, the network layer treats all decoding errors as erasures regardless of the cause. This allows us to view the system at the network layer as transmission over memoryless erasure channel. We study the throughput optimization and code design across the layers under a total code length constraint while taking also into account the network layer imperfections in the transmission. We use random coding error exponents to achieve results that do not depend on specific coding scheme used. The proposed scheme provides also means for investigating important physical layer phenomena, such as, channel model and lower layer error correction coding in the packet erasure models. Our approach extends to fading channels and networks of multiple nodes and by viewing the two layers of coding as a concatenated coding scheme, a comparison between layer-by-layer and joint cross-layer rate optimization can be made, as outlined in this paper.

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

U2 - 10.1109/ISIT.2005.1523667

DO - 10.1109/ISIT.2005.1523667

M3 - Conference article in proceedings

AN - SCOPUS:33749447536

SN - 0-7803-9151-9

T3 - IEEE International Symposium on Information Theory. Proceedings

SP - 1858

EP - 1862

BT - 2005 IEEE International Symposium on Information Theory, ISIT 2005

PB - IEEE Institute of Electrical and Electronic Engineers

ER -

Vehkaperä M, Médard M. A throughput-delay trade-off in packetized systems with erasures. In 2005 IEEE International Symposium on Information Theory, ISIT 2005. IEEE Institute of Electrical and Electronic Engineers . 2005. p. 1858-1862. 1523667. (IEEE International Symposium on Information Theory. Proceedings, Vol. 2005). https://doi.org/10.1109/ISIT.2005.1523667