activity
20172025
most citedDynamic QoS-Aware Traffic Planning for Time-Triggered Flows in the Real-time Data Plane

26 citations · 27 across the 5 of their papers we have counts for

collaborators

6 papers

cs.NI2025

Multicast-partitioning in Time-triggered Stream Planning for Time-Sensitive Networks

Heiko Geppert, Frank Dürr, Simon Naß +1

Multicast allows sending a message to multiple recipients without having to create and send a separate message for each recipient. This preserves network bandwidth, which is partic…

cs.NI2025

An (m,k)-firm Elevation Policy for Weakly Hard Real-Time in Converged 5G-TSN Networks

Simon Egger, Robin Laidig, Heiko Geppert +4

Ongoing standardization efforts in 5G and Time-Sensitive Networking (TSN) aim to provide safety-critical applications with real-time communication. However, 5G-TSN network schedule…

cs.NI2024

Efficient Conflict Graph Creation for Time-Sensitive Networks with Dynamically Changing Communication Demands

Heiko Geppert, Frank Dürr, Kurt Rothermel

Many applications of cyber-physical systems require real-time communication: manufacturing, automotive, etc. Recent Ethernet standards for Time Sensitive Networking (TSN) offer tim…

cs.NI2023★ 1 cited

Just a Second -- Scheduling Thousands of Time-Triggered Streams in Large-Scale Networks

Heiko Geppert, Frank Dürr, Sukanya Bhowmik +1

Deterministic real-time communication with bounded delay is an essential requirement for many safety-critical cyber-physical systems, and has received much attention from major sta…

cs.NI2021★ 26 cited

Dynamic QoS-Aware Traffic Planning for Time-Triggered Flows in the Real-time Data Plane

Jonathan Falk, Heiko Geppert, Frank Dürr +2

Many networked applications, e.g., in the domain of cyber-physical systems, require strict service guarantees, usually in the form of jitter and latency bounds, for time-triggered…

cs.DC2017

ADWISE: Adaptive Window-based Streaming Edge Partitioning for High-Speed Graph Processing

Christian Mayer, Ruben Mayer, Muhammad Adnan Tariq +4

In recent years, the graph partitioning problem gained importance as a mandatory preprocessing step for distributed graph processing on very large graphs. Existing graph partitioni…