Steffen Bondorf, an ERCIM fellow is visiting our team from June 3rd to June 7th. He will give a talk on Scalability of the Network Calculus Analysis (more details below).
The talk takes place on Thursday June 6th from 10:30 in A315 (Inria Paris – https://www.inria.fr/en/centre/paris/overview/how-to-reach-us)
Thank you for joining us if interested, the traditional welcome coffee or tea are available, Liliana
Title:
On the Scalability of the Network Calculus Analysis
Abstract:
The demand for deterministic networking is growing beyond the areas where it was traditionally employed for decades such as the avionics sector and factory automation. New domain-independent standards are being developed and formal methods for timing verification add models for the features found in these standards. There is a large body of work in Network Calculus that is dedicated to modeling. Additionally, the literature provides results on deriving tight deterministic delay bounds from network models. Yet, this work tends to neglect scalability of the proposed Network Calculus analysis — an aspect of considerable practical importance for ever larger deterministic network deployments and, e.g., their configuration synthesis. This talk will discuss the Network Calculus analysis that currently provides the best tradeoff between delay bound tightness and the effort for obtaining it.
Short Bio:
Steffen Bondorf received his B.Sc. (2009), M.Sc. (2012) and Ph.D. (2016) in Computer Science from TU Kaiserslautern, Germany. He was a postdoctoral research fellow at TU Kaiserslautern, the National University of Singapore and the University of Toronto. He currently holds an ERCIM (European Research Consortium for Informatics and Mathematics) fellowship and is a postdoc the NTNU Trondheim, Norway. Steffen’s research interests are in performance analysis of communication networks.
