Throughput maximization for ARQ-like system fading channels with coding and queuing delay constraints

Nadeem Ahmed; Richard G. Baraniuk

Throughput maximization for ARQ-like system fading channels with coding and queuing delay constraints

Research output: Contribution to journal › Conference article › peer-review

Abstract

Practical delay-limited communication systems often employ retransmission algorithms such as ARQ to ensure reliable communications in fading channels. Maximizing the communications throughput in such systems can cause excessive queueing delays due to the random number of retransmission attempts required for each codeword. In this paper we consider the problem of delay-limited throughput maximization with a constraint on the expected waiting-time, which incorporates both queueing and coding delays. We explore the trade-off between queueing and coding delays and propose a novel queue management technique for fading channels.

Original language	English (US)
Pages (from-to)	1463-1467
Number of pages	5
Journal	Conference Record - Asilomar Conference on Signals, Systems and Computers
Volume	2
State	Published - Dec 1 2004
Event	Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers - Pacific Grove, CA, United States Duration: Nov 7 2004 → Nov 10 2004

Keywords

Block-fading
Capacity
Delay
Outage
Rate control
Throughput

ASJC Scopus subject areas

Signal Processing
Computer Networks and Communications

Cite this

@article{10a6e95ebc4b4580a6ef944f07c83f3b,

title = "Throughput maximization for ARQ-like system fading channels with coding and queuing delay constraints",

abstract = "Practical delay-limited communication systems often employ retransmission algorithms such as ARQ to ensure reliable communications in fading channels. Maximizing the communications throughput in such systems can cause excessive queueing delays due to the random number of retransmission attempts required for each codeword. In this paper we consider the problem of delay-limited throughput maximization with a constraint on the expected waiting-time, which incorporates both queueing and coding delays. We explore the trade-off between queueing and coding delays and propose a novel queue management technique for fading channels.",

keywords = "Block-fading, Capacity, Delay, Outage, Rate control, Throughput",

author = "Nadeem Ahmed and Baraniuk, {Richard G.}",

year = "2004",

month = dec,

day = "1",

language = "English (US)",

volume = "2",

pages = "1463--1467",

journal = "Conference Record - Asilomar Conference on Signals, Systems and Computers",

issn = "1058-6393",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers ; Conference date: 07-11-2004 Through 10-11-2004",

}

TY - JOUR

T1 - Throughput maximization for ARQ-like system fading channels with coding and queuing delay constraints

AU - Ahmed, Nadeem

AU - Baraniuk, Richard G.

PY - 2004/12/1

Y1 - 2004/12/1

N2 - Practical delay-limited communication systems often employ retransmission algorithms such as ARQ to ensure reliable communications in fading channels. Maximizing the communications throughput in such systems can cause excessive queueing delays due to the random number of retransmission attempts required for each codeword. In this paper we consider the problem of delay-limited throughput maximization with a constraint on the expected waiting-time, which incorporates both queueing and coding delays. We explore the trade-off between queueing and coding delays and propose a novel queue management technique for fading channels.

AB - Practical delay-limited communication systems often employ retransmission algorithms such as ARQ to ensure reliable communications in fading channels. Maximizing the communications throughput in such systems can cause excessive queueing delays due to the random number of retransmission attempts required for each codeword. In this paper we consider the problem of delay-limited throughput maximization with a constraint on the expected waiting-time, which incorporates both queueing and coding delays. We explore the trade-off between queueing and coding delays and propose a novel queue management technique for fading channels.

KW - Block-fading

KW - Capacity

KW - Delay

KW - Outage

KW - Rate control

KW - Throughput

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

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

M3 - Conference article

AN - SCOPUS:21644454365

SN - 1058-6393

VL - 2

SP - 1463

EP - 1467

JO - Conference Record - Asilomar Conference on Signals, Systems and Computers

JF - Conference Record - Asilomar Conference on Signals, Systems and Computers

T2 - Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers

Y2 - 7 November 2004 through 10 November 2004

ER -

Throughput maximization for ARQ-like system fading channels with coding and queuing delay constraints

Abstract

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this