Using traffic phase shifting to improve AFDX link utilization

Mancuso, Renato; Louis, Andrew V.; Caccamo, Marco

doi:10.1109/emsoft.2015.7318281

Cited by 3 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the view of the network calculus analysis, VLs correspond to multicast flows that reserve large resource shares. An examination of the problems due to VLs' coarse granularity can be found in [15]. Moreover, network calculus does not provide a specialized analysis for multicast communication.…”

Section: Afdx Case Studymentioning

confidence: 99%

Calculating Accurate End-to-End Delay Bounds - You Better Know Your Cross-Traffic

Bondorf¹,

Schmitt²

2016

Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools

View full text Add to dashboard Cite

Bounds on the end-to-end delay of data flows play a crucial role in di↵erent areas, ranging from certification of hard real-time communication capabilities to quality of experience assurance for end users. Deterministic Network Calculus (DNC) allows to derive worst-case delay bounds; for instance, DNC is applied by the avionics industry to formally verify aircraft networks against strict delay requirements. Calculating tight end-to-end delays, however, was proven to be NP-hard. As a result, analyses focus on deriving fairly accurate bounds with feasible e↵ort. Previous work constantly improved on capturing flow scheduling and cross-tra c multiplexing e↵ects on the analyzed flow's path. In contrast, we present an enhanced analysis of the cross-tra c itself to decrease the bound on its worst-case data arrivals that interfere with the analyzed flow. This improvement is beneficial for both of e↵ects, scheduling and multiplexing. By replacing the currently used procedure to bound cross-tra c arrivals with our new method, we can improve network calculus accuracy considerably-we demonstrate improvements that reduce the worst-case delay bound by more than factor 6.

show abstract

Section: Afdx Case Studymentioning

confidence: 99%

Calculating Accurate End-to-End Delay Bounds - You Better Know Your Cross-Traffic

Bondorf¹,

Schmitt²

2016

Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools

View full text Add to dashboard Cite

show abstract

“…In the view of the network calculus, VLs correspond to multicast flows that reserve large resource shares. An examination of the problems due to VLs' coarse granularity can be found in [36]. The analysis of multicast flows with algDNC was presented in [3], yet, a multicast ULP has not been provided.…”

Section: Afdx Topology Case Studymentioning

confidence: 99%

Quality and Cost of Deterministic Network Calculus - Design and Evaluation of an Accurate and Fast Analysis

Bondorf¹,

Nikolaus²,

Schmitt³

2016

Preprint

View full text Add to dashboard Cite

Networks are integral parts of modern safety-critical systems and certification demands the provision of guarantees for data transmissions. Deterministic Network Calculus (DNC) can compute a worst-case bound on a data flow's end-to-end delay. Accuracy of DNC results has been improved steadily, resulting in two DNC branches: the classical algebraic analysis and the more recent optimization-based analysis. The optimization-based branch provides a theoretical solution for tight bounds. Its computational cost grows, however, (possibly super-)exponentially with the network size. Consequently, a heuristic optimization formulation trading accuracy against computational costs was proposed. In this article, we challenge optimization-based DNC with a new algebraic DNC algorithm.We show that:1. no current optimization formulation scales well with the network size and 2. algebraic DNC can be considerably improved in both aspects, accuracy and computational cost.To that end, we contribute a novel DNC algorithm that transfers the optimization's search for best attainable delay bounds to algebraic DNC. It achieves a high degree of accuracy and our novel efficiency improvements reduce the cost of the analysis dramatically. In extensive numerical experiments, we observe that our delay bounds deviate from the optimization-based ones by only 1.142% on average while computation times simultaneously decrease by several orders of magnitude.

show abstract

“…In [34], a traffic phase shifting technique is proposed to improve the bandwidth utilization by assigning offsets to periodic traffic flows. However, the improvement is achieved at the expense of increasing endto-end delay due to the fact that the frames are buffered at switches to wait for their time slots for transmission.…”

Section: Related Workmentioning

confidence: 99%