DNCext_MPARTC | MPA RTC Backend for the NetCal.org DNC

DNCext_MPARTC is a Java library. DNCext_MPARTC has no bugs, it has no vulnerabilities, it has a Weak Copyleft License and it has low support. However DNCext_MPARTC build file is not available. You can download it from GitHub.

Real-Time Calculus (RTC) is a branch of Deterministic Network Calculus. For its analysis, RTC uses the same curve definitions, min-plus-algebraic operations and bounding operations as Deterministic Network Calculus. For system modeling, RTC focusses more on components, making it a Modular Performance Analysis (MPA). The MPA RTC toolbox consists of implementations for both parts:. The modeling-part of the MPA RTC depends on the manual creation of a component-based model. Connections created between components are mapped to the order of operations to be executed. I.e., there is no automated derivation of bounds according according to an established analysis (e.g., SFA, PMOOA, TMA) as found in the NetCal DNC. Vice versa, the component models used in the MPA RTC commonly consist of more complex curves than those used in the NetCal DNC (cf. experiments and functional tests). Therefore, the min-plus operations and the bounding operations of the MPA RTC are more powerful, too. Some of the NetCal DNC analyses (foremost SFA) can in theory be applied to any shape of wide-sense increasing curves. Therefore, this NetCal project provides wrappers to make the MPA RTC curve and algebra backend compliant with the NetCal DNC interfaces. As a result, the MPA RTC can act be used as a backend in the NetCal DNC's automated derivation of bounds.