Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4951952 | Theoretical Computer Science | 2017 | 18 Pages |
Abstract
We propose deterministic algorithms that decide the length of the packets sent in order to maximize the goodput rate; i.e., the amount of useful payload successfully transmitted over time. To do so, we first define and study a static version of the problem, which is used as a building block for the dynamic problem. We start by assuming packets of the same length and characterizing the corresponding quasi-optimal length. Then, we show that by adapting the length of the packets, the goodput rate can be improved. Hence, we develop optimal adaptive algorithms that choose the packet lengths depending on the jams that have occurred up to that point in time, in order to maximize the total payload transmitted successfully over a period T in the presence of up to f jams.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Antonio Fernández Anta, Chryssis Georgiou, Dariusz R. Kowalski, Elli Zavou,