RUB » Faculty of Mathematics » Center of Computer Science » DNet | Distributed and Networked Systems 

Open Theses

Max-Plus Network Calculus

Network calculus usually relies on min-plus-algebraic operations (in contrast to the common plus-times algebra). A dual network calculus in max-plus algebra exists and some operations are considerably less expensive in this algebra. It remains to evaluate the performance improvement of switching between algebras during an analysis.

Further details will be provided upon request.

Supervisor: Jun.-Prof. Dr.-Ing. Steffen Bondorf

Literature
  • Victor Pollex, Henrik Lipskoch, Frank Slomka and Steffen Kollmann. Runtime improved computation of path latencies with the real-time calculus. WCTT 2011. (@ACM)
  • Jörg Liebeherr. Duality of the Max-Plus and Min-Plus Network Calculus. Foundation and Trends in Networking, 2017. (PDF @author)

A Heuristic for Flow Prolongation

Flow prolongation is a technique that can improve the quality of performance bounds derived with deterministic network calculus. During the analysis it is, however, not possible to know the most beneficial prolongation among all alternatives. An exhaustive enumeration was shown not scale well (see literature below).

Further details will be provided upon request.

Supervisor: Jun.-Prof. Dr.-Ing. Steffen Bondorf

Literature
  • Steffen Bondorf. Better Bounds by Worse Assumptions — Improving Network Calculus Accuracy by Adding Pessimism to the Network Model. IEEE ICC 2017. (@IEEE)

Please contact our team members for additional theses.