Exact Analysis of TDMA with Slot Skipping

Author

Pereira, Nuno ; Tovar, Eduardo ; Andersson, Björn

Author_Institution

Polytech. Inst. of Porto, Porto

fYear

2007

fDate

21-24 Aug. 2007

Firstpage

63

Lastpage

72

Abstract

Consider a communication medium shared among a set of computer nodes; these computer nodes issue messages that are requested to be transmitted and they must finish their transmission before their respective deadlines. TDMA/SS is a protocol that solves this problem; it is a specific type of time division multiple access (TDMA) where a computer node is allowed to skip its time slot and then this time slot can be used by another computer node. We present an algorithm that computes exact queuing times for TDMA/SS in conjunction with rate-monotonic (RM) or earliest-deadline-first (EDF).

Keywords

computer networks; queueing theory; time division multiple access; TDMA-SS; queuing times; slot skipping; time division multiple access; Access protocols; Algorithm design and analysis; Analytical models; Communication networks; Communication system control; Media Access Protocol; Processor scheduling; Queueing analysis; Telecommunication traffic; Time division multiple access;

fLanguage

English

Publisher

ieee

Conference_Titel

Embedded and Real-Time Computing Systems and Applications, 2007. RTCSA 2007. 13th IEEE International Conference on

Conference_Location

Daegu

ISSN

1533-2306

Print_ISBN

978-0-7695-2975-2

Type

conf

DOI

10.1109/RTCSA.2007.38

Filename

4296837