Proceedings of the 22nd International Conference on Real-Time Networks and Systems 2014
DOI: 10.1145/2659787.2659801
|View full text |Cite
|
Sign up to set email alerts
|

A Forward end-to-end delays Analysis for packet switched networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
40
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 18 publications
(40 citation statements)
references
References 9 publications
0
40
0
Order By: Relevance
“…However, a formal proof for the fix proposed in [31] is still required. Recently, another approach, namely the forward endto-end delays analysis (FA), has been proposed to obtain the delay upper bounds [32]. Similar to the trajectory approach, this method focuses on one frame and analyzes iteratively the components (ES and Switches) through which the frame passed.…”
Section: Related Workmentioning
confidence: 99%
“…However, a formal proof for the fix proposed in [31] is still required. Recently, another approach, namely the forward endto-end delays analysis (FA), has been proposed to obtain the delay upper bounds [32]. Similar to the trajectory approach, this method focuses on one frame and analyzes iteratively the components (ES and Switches) through which the frame passed.…”
Section: Related Workmentioning
confidence: 99%
“…This problem was addressed by [9]. Most recently, [7] presented the forward end-to-end delay approach (FA) which computes an upper bound for the end-to-end delay for AFDX networks based on the maximum backlog of single priority traffic. As an intermediate result of the end-to-end delay, FA computes the largest buffer backlog for each output port.…”
Section: Related Workmentioning
confidence: 99%
“…It has been applied in the AFDX context where it can lead to tighter bounds than NC (Bauer et al, 2010). However, TA cannot compute bounds for some types of configurations (high load on several nodes among a given path) and it has been proved (Kemayo et al, 2014) that in some corner cases, the bounds computed with TA can be underestimated and thus cannot be used for certification purpose. The forward end-to-end delays analysis (FA) (Kemayo et al, 2014) overcomes the drawbacks of TA while keeping tighter bounds than NC.…”
Section: Afdx In Imamentioning
confidence: 99%
“…B h is a sufficient bound on t, computed with a fixed-point algorithm on the utilisation factor ( Ci Ti ) which can be found in Kemayo et al (2014).…”
Section: Response Time Analysismentioning
confidence: 99%