Kurt Rothermel
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Kurt Rothermel has a total of 72 co-authors. Here are the top co-authors by number of shared publications:
- Frank Dürr
Institute for Parallel and Distributed Systems, University of Stuttgart, Stuttgart, Germany
19 shared publications - Sukanya Bhowmik
University of Potsdam Potsdam Germany
11 shared publications - Heiko Geppert
IPVS University of Stuttgart Germany
6 shared publications - Muhammad Adnan Tariq
Distributed Systems, IPVS, Stuttgart, Baden Württemberg Germany
4 shared publications - Boris Koldehofe
Technische Universität Ilmenau, Ilmenau, Germany
3 shared publications - Henriette Röger
University of Stuttgart, Germany
3 shared publications
Latest Publications
- Open Access
Multicast-partitioning in Time-triggered Stream Planning for Time-Sensitive Networks
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 particularly important in time-sensitive networks. These networks are commonly used to provide latency-bounded communication for real-time systems in domains like automotive, avionics, industrial internet of things, automated shop floors, and smart energy grids. The preserved bandwidth can be used to admit additional real-time messages with specific quality of service requirements or to reduce the end-to-end latencies for messages of any type. However, using multicast communication can complicate traffic planning, as it requires free queues or available downstream egress ports on all branches of the multicast tree. In this work, we present a novel multicast partitioning technique to split multicast trees into smaller multicast or unicast trees. This allows for a more fine-grained trade-off between bandwidth utilization and traffic scheduling difficulty. Thus, schedulability in dynamic systems can be improved, in terms the number of admitted streams and the accumulated network throughput. We evaluated the multicast partitioning on different network topologies and with three different scheduling algorithms. With the partitioning, 5-15\% fewer streams were rejected, while achieving 5-125\% more network throughput, depending on the scheduling algorithm.
Open AccessMulticast-partitioning in Time-triggered Stream Planning for Time-Sensitive Networks
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 particularly important in time-sensitive networks. These networks are commonly used to provide latency-bounded communication for real-time systems in domains like automotive, avionics, industrial internet of things, automated shop floors, and smart energy grids. The preserved bandwidth can be used to admit additional real-time messages with specific quality of service requirements or to reduce the end-to-end latencies for messages of any type. However, using multicast communication can complicate traffic planning, as it requires free queues or available downstream egress ports on all branches of the multicast tree. In this work, we present a novel multicast partitioning technique to split multicast trees into smaller multicast or unicast trees. This allows for a more fine-grained trade-off between bandwidth utilization and traffic scheduling difficulty. Thus, schedulability in dynamic systems can be improved, in terms the number of admitted streams and the accumulated network throughput. We evaluated the multicast partitioning on different network topologies and with three different scheduling algorithms. With the partitioning, 5-15\% fewer streams were rejected, while achieving 5-125\% more network throughput, depending on the scheduling algorithm.
- Open Access
- 6 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (5) , 4525-4537
Efficient Conflict Graph Creation for Time-Sensitive Networks With Dynamically Changing Communication Demands
Many applications of cyber-physical systems require real-time communication: manufacturing, automotive, etc. Recent Ethernet standards for Time Sensitive Networking (TSN) offer time-triggered scheduling in order to guarantee low latency and jitter bounds. This requires precise frame transmission planning, which becomes especially hard when dealing with many streams, large networks, and dynamically changing communications. A very promising approach uses conflict graphs, modeling conflicting transmission configurations. Since the creation of conflict graphs is the bottleneck in these approaches, we provide an improvement to the conflict graph creation. We present a randomized selection process that reduces the overall size of the graph in half and three heuristics to improve the scheduling success. In our evaluations we show substantial improvements in the graph creation speed and the scheduling success compared to existing work, updating existing schedules in fractions of a second. Additionally, offline planning of 9000 streams was performed successfully within minutes.
- 6 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (5) , 4525-4537
Open AccessEfficient Conflict Graph Creation for Time-Sensitive Networks With Dynamically Changing Communication Demands
Many applications of cyber-physical systems require real-time communication: manufacturing, automotive, etc. Recent Ethernet standards for Time Sensitive Networking (TSN) offer time-triggered scheduling in order to guarantee low latency and jitter bounds. This requires precise frame transmission planning, which becomes especially hard when dealing with many streams, large networks, and dynamically changing communications. A very promising approach uses conflict graphs, modeling conflicting transmission configurations. Since the creation of conflict graphs is the bottleneck in these approaches, we provide an improvement to the conflict graph creation. We present a randomized selection process that reduces the overall size of the graph in half and three heuristics to improve the scheduling success. In our evaluations we show substantial improvements in the graph creation speed and the scheduling success compared to existing work, updating existing schedules in fractions of a second. Additionally, offline planning of 9000 streams was performed successfully within minutes.
- Open Access
- 6 April 2025
- Published by Elsevier in Computer Networks
- Vol. 264
Just a second — Scheduling thousands of time-triggered streams in large-scale networks
- 6 April 2025
- Published by Elsevier in Computer Networks
- Vol. 264
Open AccessJust a second — Scheduling thousands of time-triggered streams in large-scale networks
- Open Access
- 20 February 2025
- Published by Springer Nature in Discover Internet of Things
- Vol. 5 (1) , 1-24
Proximity-based service discovery for distributed digital twin systems
Over the past decade, there has been a significant increase in interest in digital twin (DT) technology in a variety of domains. While research on DTs of single assets was initially prevalent, there has been a notable shift towards distributed systems of DTs, which connect to each other to collaborate. Typically, collaboration is enabled by DTs providing services that can be consumed by other DTs. In service-oriented systems, a service is typically identified by type information. However, this is not sufficient in distributed DT systems, where DTs associated with different physical entities may provide the same type of service. Consequently, selecting the appropriate service depends not only on the service type, but also on the associated physical entity. However, requiring DTs to know the mapping of services to their physical environment is not feasible for large dynamic systems. This paper presents a novel proximity-based service discovery method that allows DTs to select services based on service type and their proximity to other objects. That is, service specifications are fully abstracted from the mapping of services to physical objects, relieving DTs from maintaining information about this mapping. Furthermore, service discovery is robust to changes in the physical environment and service population. The proposed service discovery method has been implemented on top of a spatial DBMS. We argue that this implementation is optimal in terms of network utilization and latency, and perform comprehensive evaluations to show the performance of discovery queries as a function of their complexity.
- 20 February 2025
- Published by Springer Nature in Discover Internet of Things
- Vol. 5 (1) , 1-24
Open AccessProximity-based service discovery for distributed digital twin systems
Over the past decade, there has been a significant increase in interest in digital twin (DT) technology in a variety of domains. While research on DTs of single assets was initially prevalent, there has been a notable shift towards distributed systems of DTs, which connect to each other to collaborate. Typically, collaboration is enabled by DTs providing services that can be consumed by other DTs. In service-oriented systems, a service is typically identified by type information. However, this is not sufficient in distributed DT systems, where DTs associated with different physical entities may provide the same type of service. Consequently, selecting the appropriate service depends not only on the service type, but also on the associated physical entity. However, requiring DTs to know the mapping of services to their physical environment is not feasible for large dynamic systems. This paper presents a novel proximity-based service discovery method that allows DTs to select services based on service type and their proximity to other objects. That is, service specifications are fully abstracted from the mapping of services to physical objects, relieving DTs from maintaining information about this mapping. Furthermore, service discovery is robust to changes in the physical environment and service population. The proposed service discovery method has been implemented on top of a spatial DBMS. We argue that this implementation is optimal in terms of network utilization and latency, and perform comprehensive evaluations to show the performance of discovery queries as a function of their complexity.
- Open Access
- 12 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Proximity-based Service Discovery for Distributed Digital Twin Systems
Over the past decade, there has been a significant increase in interest in digital twin (DT) technology in a variety of domains. While research on DTs of single assets was initially prevalent, there has been a notable shift towards distributed systems of DTs, which connect to each other to collaborate. Typically, collaboration is enabled by DTs providing services that can be consumed by other DTs. In service-oriented systems, a service is typically identified by type information. However, this is not sufficient in distributed DT systems, where DTs associated with different physical entities may provide the same type of service. Consequently, selecting the appropriate service depends not only on the service type, but also on the associated physical entity. However, requiring DTs to know the mapping of services to their physical environment is not feasible for large dynamic systems. This paper presents a novel proximity-based service discovery method that allows DTs to select services based on service type and their proximity to other objects. That is, service specifications are fully abstracted from the mapping of services to physical objects, relieving DTs from maintaining information about this mapping. Furthermore, service discovery is robust to changes in the physical environment and service population. The proposed service discovery method has been implemented on top of a spatial DBMS. We argue that this implementation is optimal in terms of network utilization and latency, and perform comprehensive evaluations to show the performance of discovery queries as a function of their complexity.
- 12 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessProximity-based Service Discovery for Distributed Digital Twin Systems
Over the past decade, there has been a significant increase in interest in digital twin (DT) technology in a variety of domains. While research on DTs of single assets was initially prevalent, there has been a notable shift towards distributed systems of DTs, which connect to each other to collaborate. Typically, collaboration is enabled by DTs providing services that can be consumed by other DTs. In service-oriented systems, a service is typically identified by type information. However, this is not sufficient in distributed DT systems, where DTs associated with different physical entities may provide the same type of service. Consequently, selecting the appropriate service depends not only on the service type, but also on the associated physical entity. However, requiring DTs to know the mapping of services to their physical environment is not feasible for large dynamic systems. This paper presents a novel proximity-based service discovery method that allows DTs to select services based on service type and their proximity to other objects. That is, service specifications are fully abstracted from the mapping of services to physical objects, relieving DTs from maintaining information about this mapping. Furthermore, service discovery is robust to changes in the physical environment and service population. The proposed service discovery method has been implemented on top of a spatial DBMS. We argue that this implementation is optimal in terms of network utilization and latency, and perform comprehensive evaluations to show the performance of discovery queries as a function of their complexity.
- Open Access
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Using Forecasting Models to Reduce Computation, Communication and Compensate Delay
Executing complex time series computations on mobile edge devices in general and augmented reality (AR) devices in particular enables a variety of novel applications. As the complexity of such computations typically exceeds the resources of the mobile device, the task may be offloaded to a remote server. However, the resulting delay of the response substantially impacts the user experience, especially for real-time applications. To overcome this delay, we propose a novel system in which client and server exchange forecasting models instead of simple values. This allows the server to forecast future input values and precalculate the corresponding output. New results can thus be predicted in advance and, considering the communication delay, arrive just in time on the mobile device. The lightweight forecasting models not only reduce the amount of data that needs to be communicated, but also local (mobile device) computation to a minimum. Our results show that we can achieve a medium euclidean distance (MED) error of 0.477 mm for bio-mechanical simulation visualizations, even in the presence of jitter and with a round trip time of 98 ms. Compared to regular offloading, we reduce the MED by 61 % and the number of transmitted messages by 81 %, while providing a better user experience.
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessUsing Forecasting Models to Reduce Computation, Communication and Compensate Delay
Executing complex time series computations on mobile edge devices in general and augmented reality (AR) devices in particular enables a variety of novel applications. As the complexity of such computations typically exceeds the resources of the mobile device, the task may be offloaded to a remote server. However, the resulting delay of the response substantially impacts the user experience, especially for real-time applications. To overcome this delay, we propose a novel system in which client and server exchange forecasting models instead of simple values. This allows the server to forecast future input values and precalculate the corresponding output. New results can thus be predicted in advance and, considering the communication delay, arrive just in time on the mobile device. The lightweight forecasting models not only reduce the amount of data that needs to be communicated, but also local (mobile device) computation to a minimum. Our results show that we can achieve a medium euclidean distance (MED) error of 0.477 mm for bio-mechanical simulation visualizations, even in the presence of jitter and with a round trip time of 98 ms. Compared to regular offloading, we reduce the MED by 61 % and the number of transmitted messages by 81 %, while providing a better user experience.
- Open Access
Efficient Conflict Graph Creation for Time-Sensitive Networks with Dynamically Changing Communication Demands
Many applications of cyber-physical systems require real-time communication: manufacturing, automotive, etc. Recent Ethernet standards for Time Sensitive Networking (TSN) offer time-triggered scheduling in order to guarantee low latency and jitter bounds. This requires precise frame transmission planning, which becomes especially hard when dealing with many streams, large networks, and dynamically changing communications. A very promising approach uses conflict graphs, modeling conflicting transmission configurations. Since the creation of conflict graphs is the bottleneck in these approaches, we provide an improvement to the conflict graph creation. We present a randomized selection process that reduces the overall size of the graph in half and three heuristics to improve the scheduling success. In our evaluations we show substantial improvements in the graph creation speed and the scheduling success compared to existing work, updating existing schedules in fractions of a second. Additionally, offline planning of 9000 streams was performed successfully within minutes.
Open AccessEfficient Conflict Graph Creation for Time-Sensitive Networks with Dynamically Changing Communication Demands
Many applications of cyber-physical systems require real-time communication: manufacturing, automotive, etc. Recent Ethernet standards for Time Sensitive Networking (TSN) offer time-triggered scheduling in order to guarantee low latency and jitter bounds. This requires precise frame transmission planning, which becomes especially hard when dealing with many streams, large networks, and dynamically changing communications. A very promising approach uses conflict graphs, modeling conflicting transmission configurations. Since the creation of conflict graphs is the bottleneck in these approaches, we provide an improvement to the conflict graph creation. We present a randomized selection process that reduces the overall size of the graph in half and three heuristics to improve the scheduling success. In our evaluations we show substantial improvements in the graph creation speed and the scheduling success compared to existing work, updating existing schedules in fractions of a second. Additionally, offline planning of 9000 streams was performed successfully within minutes.
- Open Access
- 24 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 123-134
Color-based Lightweight Utility-aware Load Shedding for Real-Time Video Analytics at the Edge
Real-time video analytics typically require video frames to be processed by a query to identify objects or activities of interest while adhering to an end-to-end frame processing latency constraint. This imposes a continuous and heavy load on backend compute and network infrastructure. Video data has inherent redundancy and does not always contain an object of interest for a given query. We leverage this property of video streams to propose a lightweight Load Shedder that can be deployed on edge servers or on inexpensive edge devices co-located with cameras. The proposed Load Shedder uses pixel-level color-based features to calculate a utility score for each ingress video frame and a minimum utility threshold to select interesting frames to send for query processing. Dropping unnecessary frames enables the video analytics query in the backend to meet the end-to-end latency constraint with fewer compute and network resources. To guarantee a bounded end-to-end latency at runtime, we introduce a control loop that monitors the backend load and dynamically adjusts the utility threshold. Performance evaluations show that the proposed Load Shedder selects a large portion of frames containing each object of interest while meeting the end-to-end frame processing latency constraint. Furthermore, it does not impose a significant latency overhead when running on edge devices with modest compute resources.
- 24 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 123-134
Open AccessColor-based Lightweight Utility-aware Load Shedding for Real-Time Video Analytics at the Edge
Real-time video analytics typically require video frames to be processed by a query to identify objects or activities of interest while adhering to an end-to-end frame processing latency constraint. This imposes a continuous and heavy load on backend compute and network infrastructure. Video data has inherent redundancy and does not always contain an object of interest for a given query. We leverage this property of video streams to propose a lightweight Load Shedder that can be deployed on edge servers or on inexpensive edge devices co-located with cameras. The proposed Load Shedder uses pixel-level color-based features to calculate a utility score for each ingress video frame and a minimum utility threshold to select interesting frames to send for query processing. Dropping unnecessary frames enables the video analytics query in the backend to meet the end-to-end latency constraint with fewer compute and network resources. To guarantee a bounded end-to-end latency at runtime, we introduce a control loop that monitors the backend load and dynamically adjusts the utility threshold. Performance evaluations show that the proposed Load Shedder selects a large portion of frames containing each object of interest while meeting the end-to-end frame processing latency constraint. Furthermore, it does not impose a significant latency overhead when running on edge devices with modest compute resources.
- Open Access
- 7 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
A Proximity Model for Distributed Digital Twin Systems
Over the last decade, digital twin technology has gained increasing interest in various fields, such as industrial engineering and manufacturing, healthcare, transportation, energy, logistics, or city operations. While digital twins of single assets dominated in the beginning, we are seeing more and more digital twins for systems of assets, where digital twins need to collaborate with other digital twins to accomplish their objectives. As in service-oriented systems, digital twins provide services that can be used by other twins. While in service-oriented systems a service is typically identified by type information, this is not sufficient in digital twin systems, where there may be a large number of service instances of the same type that are not interchangeable. In this paper, we present a proximity model that allows digital twins to specify the required services by so-called neighborhoods, whose definition is based on spatial relationships between client and service instances. This concept not only simplifies service discovery in digital twin systems, but also allows for efficient implementations. To support this, we illustrate how service discovery based on the proposed proximity model can be implemented on top of a spatial DBMS.
- 7 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessA Proximity Model for Distributed Digital Twin Systems
Over the last decade, digital twin technology has gained increasing interest in various fields, such as industrial engineering and manufacturing, healthcare, transportation, energy, logistics, or city operations. While digital twins of single assets dominated in the beginning, we are seeing more and more digital twins for systems of assets, where digital twins need to collaborate with other digital twins to accomplish their objectives. As in service-oriented systems, digital twins provide services that can be used by other twins. While in service-oriented systems a service is typically identified by type information, this is not sufficient in digital twin systems, where there may be a large number of service instances of the same type that are not interchangeable. In this paper, we present a proximity model that allows digital twins to specify the required services by so-called neighborhoods, whose definition is based on spatial relationships between client and service instances. This concept not only simplifies service discovery in digital twin systems, but also allows for efficient implementations. To support this, we illustrate how service discovery based on the proposed proximity model can be implemented on top of a spatial DBMS.
- Open Access
Grand Perspective: Load Shedding in Distributed CEP Applications
In distributed Complex Event Processing (CEP) applications with high load but limited resources, bottleneck operators in the operator graph can significantly slow down processing of event streams, thus compelling the need to shed load. A high-quality load shedding strategy that resolves the bottleneck with high output quality evaluates each event's importance with regards to the application's final output and drops less important events from the event stream for the benefit of important ones. So far, no solution has been proposed that is able to permit good load shedding in distributed, multi-operator CEP applications. On one hand, shedding strategies have been proposed for single-operator CEP applications that can measure an event's importance immediately at the bottleneck operator, only, and thereby ignore the effect of other streams in the application on an event's importance. On the other hand, shedding strategies have been proposed for applications with multiple operators from the area of stream processing that provide a fixed selectivity which is not given in the conditional CEP operators. We, therefore, propose a load-shedding solution for distributed CEP applications that maximizes the application's final output and ensures timely processing of important events by using a set of CEP-tailored selectivity functions and a linear program, which is an abstraction of the CEP application. Moreover, our solution ensures a quality optimal shedder configuration even in the presence of dynamically changing conditions. With the help of extensive evaluations on both synthetic and real data, we show that our solution successfully resolves overload at bottleneck operators and at the same time maximizes the quality of the application's output.
Open AccessGrand Perspective: Load Shedding in Distributed CEP Applications
In distributed Complex Event Processing (CEP) applications with high load but limited resources, bottleneck operators in the operator graph can significantly slow down processing of event streams, thus compelling the need to shed load. A high-quality load shedding strategy that resolves the bottleneck with high output quality evaluates each event's importance with regards to the application's final output and drops less important events from the event stream for the benefit of important ones. So far, no solution has been proposed that is able to permit good load shedding in distributed, multi-operator CEP applications. On one hand, shedding strategies have been proposed for single-operator CEP applications that can measure an event's importance immediately at the bottleneck operator, only, and thereby ignore the effect of other streams in the application on an event's importance. On the other hand, shedding strategies have been proposed for applications with multiple operators from the area of stream processing that provide a fixed selectivity which is not given in the conditional CEP operators. We, therefore, propose a load-shedding solution for distributed CEP applications that maximizes the application's final output and ensures timely processing of important events by using a set of CEP-tailored selectivity functions and a linear program, which is an abstraction of the CEP application. Moreover, our solution ensures a quality optimal shedder configuration even in the presence of dynamically changing conditions. With the help of extensive evaluations on both synthetic and real data, we show that our solution successfully resolves overload at bottleneck operators and at the same time maximizes the quality of the application's output.