dc.contributor.author | Andersson, Björn | |
dc.contributor.author | Tovar, Eduardo | |
dc.contributor.author | Pereira, Nuno | |
dc.date.accessioned | 2014-01-21T15:59:55Z | |
dc.date.available | 2014-01-21T15:59:55Z | |
dc.date.issued | 2005 | |
dc.description.abstract | We propose a schedulability analysis for a particular class of time division multiple access (TDMA) networks, which we label as TDMA/SS. SS stands for slot skipping, reflecting the fact that a slot is skipped whenever it is not used. Hence, the next slot can start earlier in benefit of hard real-time traffic. In the proposed schedulability analysis, we assume knowledge of all message streams in the system, and that each node schedules messages in its output queue according to a rate monotonic policy (as an example). We present the analysis in two steps. Firstly, we address the case where a node is only permitted to transmit a maximum of one message per TDMA cycle. Secondly, we generalise the analysis to the case where a node is assigned a budget of messages per TDMA cycle it may transmit. A simple algorithm to assign budgets to nodes is also presented. | por |
dc.identifier.uri | http://hdl.handle.net/10400.22/3408 | |
dc.language.iso | eng | por |
dc.peerreviewed | no | por |
dc.publisher | IPP-Hurray Group | por |
dc.relation.publisherversion | http://www.cister.isep.ipp.pt/docs/ | por |
dc.title | Analysing TDMA with slot skipping | por |
dc.type | report | |
dspace.entity.type | Publication | |
oaire.citation.endPage | 12 | por |
oaire.citation.startPage | 1 | por |
person.familyName | Tovar | |
person.familyName | Pereira | |
person.givenName | Eduardo | |
person.givenName | Nuno | |
person.identifier.ciencia-id | 6017-8881-11E8 | |
person.identifier.ciencia-id | 7818-7C77-02BA | |
person.identifier.orcid | 0000-0001-8979-3876 | |
person.identifier.orcid | 0000-0001-6370-9373 | |
person.identifier.scopus-author-id | 7006312557 | |
person.identifier.scopus-author-id | 8404645300 | |
rcaap.rights | openAccess | por |
rcaap.type | report | por |
relation.isAuthorOfPublication | 80b63d8a-2e6d-484e-af3c-55849d0cb65e | |
relation.isAuthorOfPublication | 33fee0a6-53b7-45d5-9be3-f48b1c7064d1 | |
relation.isAuthorOfPublication.latestForDiscovery | 80b63d8a-2e6d-484e-af3c-55849d0cb65e |