Using Multi-Link Grouping Technique to achieve tight latency in network calculus

Zhao, Luxi; Li, Qiao; Xiong, Ying; Zheng, Zhong; Huagang, Xiong

doi:10.1109/dasc.2013.6719628

Cited by 3 publications

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In fact, the obtained upper bound is pessimistic (overestimated) because not all the local worst-case scenarios can occur in the global worst-case scenario. The pessimism can be reduced by taking into account the serialisation effect (25,27) , and this type of optimisation has been transposed to some other approaches.…”

Section: Related Workmentioning

confidence: 99%

“…It can compute a tighter upper bound of the end-to-end transmission delays than the Network Calculus approach for most scenarios. This computation can also be optimised by considering the serialisation effect (25,27) . Whereas, some recent researches find that for some corner cases the Trajectory Approach will provide an optimistic (underestimated) upper bound when considering the serialisation effect (33,34) and it cannot be used for certifications.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Analysis of forward approach for upper bounding end-to-end transmission delays over distributed real-time avionics networks

Yang

2020

Aeronaut. j.

View full text Add to dashboard Cite

Distributed real-time avionics networks have been subjected to a great evolution in terms of functionality and complexity. A direct consequence of this evolution is a continual growth of data exchange. AFDX standardised as ARINC 664 is chosen as the backbone network for those distributed real-time avionics networks as it offers high throughput and does not require global clock synchronisation. For certification reasons and engineering research, a deterministic upper bound of the end-to-end transmission delay for packets of each flow should be guaranteed. The Forward Approach (FA) is proposed for the computation of the worst-case end-to-end transmission delay. This approach iteratively estimates the maximum backlog (amount of the pending packets) in each visited switch along the transmission path, and the worst-case end-to-end transmission delay can be computed. Although it is pessimistic (overestimated), the Forward Approach can provide a tighter upper bound of the end-to-end transmission delay while considering the serialisation effect. Recently, our research finds the computation of the serialisation effect might induce an optimistic (underestimated) upper bound. In this paper, we analyse the pessimism in the Forward Approach and the optimism induced by the computation of the serialisation effect, and then we provide a new computation of the serialisation effect. We compare this new computation with the original one, the experiments show that the new computation reduces the optimism and the upper bound of the end-to-end transmission delay can be computed more accurately.

show abstract

Section: Related Workmentioning

confidence: 99%