Kurt Rothermel

Kurt Rothermel

Auto-generated profile, based on publicly available information

Kurt Rothermel

IPVS University of Stuttgart Germany

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 December 2017 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
NNNaresh Ganesh Nayak
Naresh Ganesh Nayak
FDFrank Durr
Frank Durr
KRKurt Rothermel
Kurt Rothermel
Several networking architectures have been developed atop IEEE 802.3 networks to provide real-time communication guarantees for time-sensitive applications in industrial automation systems. The basic principle underlying these technologies is the precise transmission scheduling of time-triggered traffic through the network for providing deterministic and bounded latency and jitter. These transmission schedules are typically synthesized offline (computational time in the order of hours), and remain fixed thereafter, making it difficult to dynamically add or remove network applications. This paper presents algorithms for incrementally adding time-triggered flows in a Time-sensitive Software-defined Network (TSSDN). TSSDN is a network architecture based on Software-defined Networking (SDN) which provides real-time guarantees for time-triggered flows by scheduling their transmissions on the hosts (network edge) only. These algorithms exploit the global view of the control plane on the data plane to schedule and route time-triggered flows needed for the dynamic applications in the Industrial Internet of Things (Industry 4.0). The evaluations show that these algorithms can compute incremental schedules for time-triggered flows in sub-seconds with an average relative optimality of 68 %.

27 November 2012 in Personal and Ubiquitous Computing
Verified
Journal Article
Closed access
PDF file
MWMarius Wernke
Marius Wernke
PSPavel Skvortsov
Pavel Skvortsov
FDFrank Dürr
Frank Dürr
KRKurt Rothermel
Kurt Rothermel

12 June 2011 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
RLRalph Lange
Ralph Lange
FDFrank Dürr
Frank Dürr
KRKurt Rothermel
Kurt Rothermel

14 December 2016 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
SBSukanya Bhowmik
Sukanya Bhowmik
MTMuhammad Adnan Tariq
Muhammad Adnan Tariq
BKBoris Koldehofe
Boris Koldehofe
FDFrank Durr
Frank Durr
TKThomas Kohler
Thomas Kohler
KRKurt Rothermel
Kurt Rothermel
With the increasing popularity of software-defined networking (SDN), ternary content-addressable memory of switches can be directly accessed by a publish/subscribe middleware to perform filtering operations at low latency. In this way, three important requirements for a publish/subscribe middleware can be fulfilled, namely, bandwidth efficiency, line-rate performance, and low latency in forwarding messages between producers and consumers. Nevertheless, it is challenging to sustain line-rate performance in the presence of dynamically changing interests of producers and consumers. In this paper, we realize a scalable, SDN-based publish/subscribe middleware, called PLEROMA, that performs efficient forwarding at line-rate. Moreover, PLEROMA offers methods to efficiently reconfigure a deployed topology in the presence of dynamic subscriptions and advertisements. We evaluate the performance of both the data plane and the control plane of PLEROMA to support our claim. Furthermore, we evaluate and benchmark the performances of SDN-compliant hardware and software switches in the context of our middleware.

10 February 2022 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
JFJonathan Falk
Jonathan Falk
HGHeiko Geppert
Heiko Geppert
FDFrank Durr
Frank Durr
SBSukanya Bhowmik
Sukanya Bhowmik
KRKurt Rothermel
Kurt Rothermel
Many networked applications, e.g., in the domain of cyber-physical systems, require strict service guarantees for time-triggered traffic flows, usually in the form of jitter and latency bounds. It is a notoriously hard problem to compute a network-wide traffic plan, i.e., a set of routes and transmission schedules, that satisfies these requirements, and dynamic changes in the flow set add even more challenges. Existing traffic-planning methods are ill-suited for dynamic scenarios because they either suffer from high computational cost, can result in low network utilization, or provide no explicit guarantees when transitioning to a new traffic plan that incorporates new flows. Therefore, we present a novel approach for dynamic traffic planning of time-triggered flows. Our conflict-graph-based modeling of the traffic planning problem allows for the reconfiguration of active flows to increase the network utilization, while also providing per-flow QoS guarantees during the transition to the new traffic plan. Additionally, we introduce a novel heuristic for computing the new traffic plans. Evaluations of our prototypical implementation show that we can efficiently compute new traffic plans in scenarios with hundreds of active flows for a wide range of settings.

18 January 2018 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
CMChristian Mayer
Christian Mayer
MTMuhammad Adnan Tariq
Muhammad Adnan Tariq
RMRuben Mayer
Ruben Mayer
KRKurt Rothermel
Kurt Rothermel
Recently, graph processing systems such as Pregel, PowerGraph, or GraphX gained popularity due to their superior performance of data analytics on graph-structured data. These systems employ partitioning algorithms to parallelize graph execution while minimizing inter-partition communication. Recent partitioning algorithms, however, unrealistically assume a uniform and constant amount of data exchanged between graph vertices (i.e., uniform vertex traffic) and homogeneous network costs between machines hosting the graph partitions. This leads to suboptimal partitioning decisions and inefficient graph processing. To this end, we developed GrapH, the first graph processing system using vertex-cut graph partitioning that considers both, diverse vertex traffic and heterogeneous network costs. The main idea is to avoid frequent communication over expensive network links using an adaptive edge migration strategy. Our evaluations show an improvement of 10% in graph processing latency and 60% in communication costs compared to state-of-the-art partitioning approaches.