2008 IEEE International Conference on Emerging Technologies and Factory Automation 2008
DOI: 10.1109/etfa.2008.4638500
|View full text |Cite
|
Sign up to set email alerts
|

Meeting reliability and real-time demands in wireless industrial communication

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
9
0

Year Published

2009
2009
2014
2014

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(9 citation statements)
references
References 24 publications
0
9
0
Order By: Relevance
“…A RT channel is an abstraction of a traffic flow over a link or a network, where resources have been allocated to guarantee a certain minimum throughput and a bounded end-to-end delay. The basic parameters of a network layer RT channel i, following the notation in (Jonsson & Kunert, 2008b) (we follow this notation in the whole chapter), are the period (or minimum interarrival time), P N,i , the maximum message length in bits each period, L N,i , and the end-to-end delay bound, D N,i , where N denotes the network layer. A RT channel can then be defined as…”
Section: Logical Real-time Channelsmentioning
confidence: 99%
“…A RT channel is an abstraction of a traffic flow over a link or a network, where resources have been allocated to guarantee a certain minimum throughput and a bounded end-to-end delay. The basic parameters of a network layer RT channel i, following the notation in (Jonsson & Kunert, 2008b) (we follow this notation in the whole chapter), are the period (or minimum interarrival time), P N,i , the maximum message length in bits each period, L N,i , and the end-to-end delay bound, D N,i , where N denotes the network layer. A RT channel can then be defined as…”
Section: Logical Real-time Channelsmentioning
confidence: 99%
“…Therefore, we set (17) In order to derive the delay bound for ordinary transmissions, (1) is rephrased as (18) As for the ordinary transmission, the new deadline of each retransmission, i.e., the isolated maximum queueing delay can be calculated by subtracting all other delays from the delay bound (further elaborated on at a later point in this paper) (19) where (20) The last possible retransmission has no ACK answer which results in fewer delay components. In (20), is included as the maximum blocking time introduced by a packet with a longer deadline (thereby actually having a lower priority), as its nonpreemptive transmission already might have been initiated. Additionally, is deducted twice for each, but the last, retransmission attempt.…”
Section: Real-time Scheduling Analysismentioning
confidence: 99%
“…Regarding the retransmission channels, (20) has to be adapted the same way as (12), affecting the result of (19). Equation (20) is therefore rewritten as (30) The delay bound for each retransmission attempt except the last one, originally calculated in (22), to be used in the runtime implementation for timeout calculations, is given by (31) Further adaptation is needed in the utilization check [(23)] by adding the needed additional network capacity for ACK packets (32) Also, the workload function [ (24)] is extended with a term for the ACK packets (33) where if is true, otherwise, zero.…”
Section: Analysis Without the Assumption Of Piggyback Acknowledgmentmentioning
confidence: 99%
See 2 more Smart Citations