English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Network Calculus (NC) is an algebraic theory that represents traffic andservice guarantees as curves in a Cartesian plane, in order to computeperformance guarantees for flows traversing a network. NC uses transformationoperations, e.g., min-plus convolution of two curves, to model how the trafficprofile changes with the traversal of network nodes. Such operations, whilemathematically well-defined, can quickly become unmanageable to compute usingsimple pen and paper for any non-trivial case, hence the need for algorithmicdescriptions. Previous work identified the class of piecewise affine functionswhich are ultimately pseudo-periodic (UPP) as being closed under the main NCoperations and able to be described finitely. Algorithms that embody NCoperations taking as operands UPP curves have been defined and proved correct,thus enabling software implementations of these operations. However, recentadvancements in NC make use of operations, namely the lower pseudo-inverse,upper pseudo-inverse, and composition, that are well defined from an algebraicstandpoint, but whose algorithmic aspects have not been addressed yet. In thispaper, we introduce algorithms for the above operations when operands are UPPcurves, thus extending the available algorithmic toolbox for NC. We discuss thealgorithmic properties of these operations, providing formal proofs ofcorrectness.

Extending the Network Calculus Algorithmic Toolbox for Ultimately Pseudo-Periodic Functions: Pseudo-Inverse and Composition