Rate adaptation using acknowlegement feedback: throughput upper bounds

C.K. Ho, J.C. Oostveen, J.P.M.G. Linnartz

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

101 Downloads (Pure)


We consider packet-by-packet rate adaptation to maximize the throughput over a finite-state Markov channel. To limit the amount of feedback data, we use past packet acknowledgements (ACKs) and past rates as channel state information. It is known that the maximum achievable throughput is computationally prohibitive to determine. Thus, in this paper we derive two upper bounds on the maximum achievable throughput, which are tighter than previously known ones. We compare the upper bounds with a known myopic rate-adaptation policy. Numerical studies over a wide range of SNR suggest that the myopic rate-adaptation policy is close to the upper bounds and may be adequate in slowly time-varying channels.
Original languageEnglish
Title of host publicationIEEE Global Telecommunications Conference, 2008 : IEEE GLOBECOM 2008 ; Nov. 30, 2008 - Dec. 4, 2008, New Orleans, Louisiana ; [including] World Telecommunications Congress 2008 (WTC)
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Number of pages5
ISBN (Print)978-1-4244-2324-8
Publication statusPublished - 2008


Dive into the research topics of 'Rate adaptation using acknowlegement feedback: throughput upper bounds'. Together they form a unique fingerprint.

Cite this