2016
DOI: 10.1007/s11241-016-9260-5
|View full text |Cite
|
Sign up to set email alerts
|

Deterministic delay analysis of AVB switched Ethernet networks using an extended Trajectory Approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 21 publications
(12 citation statements)
references
References 31 publications
0
12
0
Order By: Relevance
“…A first solution to overcome these issues is to use traffic shaping policies, this is what is done in AVB with the Credit-Based Shaper (CBS) defined in IEEE 801.Qav. The reader can consult [1,5] and [6] for an analysis of the CBS mechanisms.…”
Section: Quality Of Service Protocols For Ethernetmentioning
confidence: 99%
“…A first solution to overcome these issues is to use traffic shaping policies, this is what is done in AVB with the Credit-Based Shaper (CBS) defined in IEEE 801.Qav. The reader can consult [1,5] and [6] for an analysis of the CBS mechanisms.…”
Section: Quality Of Service Protocols For Ethernetmentioning
confidence: 99%
“…Previous studies of Ethernet AVB can be found in e.g. Imtiaz et al (2009), Diemer et al (2012a), Diemer et al (2012b), Reimann et al (2013), Bordoloi et al (2014), Axer et al (2014), Ashjaei et al (2017) and Li and George (2017). In Imtiaz et al (2009), a single-hop timing analysis of Ethernet AVB is presented for a scenario in which a single frame is interfered by both high-and low-priority traffic, but no formal study is executed to prove that the resulting formulas match the worst-case in all possible scenarios.…”
Section: Related Workmentioning
confidence: 99%
“…The improvement done by Bordoloi et al (2014) is not considered in Ashjaei et al (2017), as the improved solution is too complicated to determine the network bandwidth reservation. Li and George (2017) present a schedulability analysis to compute the worst-case delay of messages from classes A and B using the trajectory approach (Martin and Minet 2006) in a multi-hop network. This work partially uses busy period analysis to limit the search space of time within which the worst-case delay upper bound can be found and it provides a tighter analysis compared to Diemer et al (2012b).…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…is assumption is not necessarily true in all switch as frames get serialized from one switch to the other resulting in less blocking and smaller end-to-end delay with respect to what a local analysis can compute. To eliminate this pessimism an end-toend analysis needs to be proposed, for example a solution based on the trajectory approach [10]. is is one of our future objectives.…”
Section: Default Experimentsmentioning
confidence: 99%