Medium access control mechanisms where data transmissions are driven according to their deadlines have proven to offer interesting performance in networked real-time applications. In case of lossy networks, allocating a budget of the available bandwidth, through worst-case schedulability analysis, to retransmission of failed data, permits to combine timeliness and reliability, as typically required by these applications. This paper tackles the problem of allocating retransmissions to a set of time-critical data so as to maximize some meaningful reward function while meeting the imposed deadlines. Few methods are proposed and evaluated, which are based on theoretical analysis, integer linear programming, and solution space exploration.
Optimal retransmission allocation for EDF-based networked real-time applications
G Cena;S Scanzio;A Valenzano
2019
Abstract
Medium access control mechanisms where data transmissions are driven according to their deadlines have proven to offer interesting performance in networked real-time applications. In case of lossy networks, allocating a budget of the available bandwidth, through worst-case schedulability analysis, to retransmission of failed data, permits to combine timeliness and reliability, as typically required by these applications. This paper tackles the problem of allocating retransmissions to a set of time-critical data so as to maximize some meaningful reward function while meeting the imposed deadlines. Few methods are proposed and evaluated, which are based on theoretical analysis, integer linear programming, and solution space exploration.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


