7 citations · 13 across the 5 of their papers we have counts for
6 papers
Differentiable Programming & Network Calculus: Configuration Synthesis under Delay Constraints
Fabien Geyer, Steffen Bondorf
With the advent of standards for deterministic network behavior, synthesizing network designs under delay constraints becomes the natural next task to tackle. Network Calculus (NC)…
Network Calculus with Flow Prolongation -- A Feedforward FIFO Analysis enabled by ML
Fabien Geyer, Alexander Scheffler, Steffen Bondorf
The derivation of upper bounds on data flows' worst-case traversal times is an important task in many application areas. For accurate bounds, model simplifications should be avoide…
On the Robustness of Deep Learning-predicted Contention Models for Network Calculus
Fabien Geyer, Steffen Bondorf
The network calculus (NC) analysis takes a simple model consisting of a network of schedulers and data flows crossing them. A number of analysis "building blocks" can then be appli…
Sublinear-Time Non-Adaptive Group Testing with Tests via Bit-Mixing Coding
Steffen Bondorf, Binbin Chen, Jonathan Scarlett +2
The group testing problem consists of determining a small set of defective items from a larger set of items based on tests on groups of items, and is relevant in applications such…
Cross-Sender Bit-Mixing Coding
Steffen Bondorf, Binbin Chen, Jonathan Scarlett +2
Scheduling to avoid packet collisions is a long-standing challenge in networking, and has become even trickier in wireless networks with multiple senders and multiple receivers. In…
Quality and Cost of Deterministic Network Calculus - Design and Evaluation of an Accurate and Fast Analysis
Steffen Bondorf, Paul Nikolaus, Jens B. Schmitt
Networks are integral parts of modern safety-critical systems and certification demands the provision of guarantees for data transmissions. Deterministic Network Calculus (DNC) can…