Simon Volpert
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Simon Volpert has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Jörg Domaschka
BenchANT GmbH, Ulm, Germany
8 shared publications - Stefan Wesner
University of Cologne, Cologne, Germany
7 shared publications - Sascha Winkelhofer
Gini Gmbh, Munich, Germany
4 shared publications - Daniel Seybold
BenchANT GmbH, Ulm, Germany
3 shared publications - Georg Eisenhart
Ulm University, Ulm, Germany
2 shared publications - Sebastian Zillien
Ulm University, Ulm, Germany
2 shared publications
Latest Publications
- Open Access
- 28 February 2026
- Published by Pensoft Publishers in JUCS - Journal of Universal Computer Science
- Vol. 32 (2) , 181-208
Steganography in the QUIC Communication Protocol
Network steganography has existed for several decades and it uses network traffic and network protocols as carriers for embedding secret messages in a stealthy manner. Quick UDP Internet Connections (QUIC) is a novel secure and reliable transport layer network protocol that is encapsulated in the User Datagram Protocol (UDP) and utilizes the Transport Layer Security Version 1.3 (TLSv1.3) standard. In addition, Hypertext Transfer Protocol Version 3 (HTTP/3) employs QUIC. In this paper, we present a systematic analysis of the covert channels that can be found in QUIC. Twenty novel covert channels are identified by applying the latest covert channel pattern based taxonomy, and an analysis of their transmission rate, undetectability, and robustness is presented, together with suggested countermeasures. A single covert channel is implemented as a proof of concept tool and is appropriately evaluated.
- 28 February 2026
- Published by Pensoft Publishers in JUCS - Journal of Universal Computer Science
- Vol. 32 (2) , 181-208
Open AccessSteganography in the QUIC Communication Protocol
Network steganography has existed for several decades and it uses network traffic and network protocols as carriers for embedding secret messages in a stealthy manner. Quick UDP Internet Connections (QUIC) is a novel secure and reliable transport layer network protocol that is encapsulated in the User Datagram Protocol (UDP) and utilizes the Transport Layer Security Version 1.3 (TLSv1.3) standard. In addition, Hypertext Transfer Protocol Version 3 (HTTP/3) employs QUIC. In this paper, we present a systematic analysis of the covert channels that can be found in QUIC. Twenty novel covert channels are identified by applying the latest covert channel pattern based taxonomy, and an analysis of their transmission rate, undetectability, and robustness is presented, together with suggested countermeasures. A single covert channel is implemented as a proof of concept tool and is appropriately evaluated.
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1951-1958
Evaluating Trusted Execution Environment Performance for Genome Sequence Alignment: An AMD SEV Case Study
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1951-1958
Open AccessEvaluating Trusted Execution Environment Performance for Genome Sequence Alignment: An AMD SEV Case Study
- Open Access
- 30 October 2025
- Published by Elsevier in Computers & Security
- Vol. 164
A survey of internet censorship and its measurement: Methodology, trends, and challenges
- 30 October 2025
- Published by Elsevier in Computers & Security
- Vol. 164
Open AccessA survey of internet censorship and its measurement: Methodology, trends, and challenges
- 10 June 2025
- Published by Springer Nature
- p. 405-410
Towards the Quantification of Performance Isolation in HPC
- 10 June 2025
- Published by Springer Nature
- p. 405-410
Towards the Quantification of Performance Isolation in HPC
- Open Access
- 5 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 122-129
Towards eBPF Overhead Quantification: An Exemplary Comparison of eBPF and SystemTap
- 5 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 122-129
Open AccessTowards eBPF Overhead Quantification: An Exemplary Comparison of eBPF and SystemTap
- Open Access
- 5 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 224-231
Detecting Noisy Neighbors in CPU-Isolated Cgroups Environments
- 5 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 224-231
Open AccessDetecting Noisy Neighbors in CPU-Isolated Cgroups Environments
- Open Access
- 7 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 60-70
An Empirical Analysis of Common OCI Runtimes' Performance Isolation Capabilities
Industry and academia have strong incentives to adopt virtualization technologies. Such technologies can reduce the total cost of ownership or facilitate business models like cloud computing. These options have recently grown significantly with the rise of Kubernetes and the OCI runtime specification. Both enabled virtualization technology vendors to easily integrate their solution into existing infrastructures, leading to increased adoption. Making a detailed decision on a technology selection based on objective characteristics is a complex task. This specifically includes the instrumentation of performance characteristics that are an important aspect for a fair comparison. Moreover, a subsequent quantification of the isolation capability based on performance metrics is not readily available. In this paper, we instrument and determine the OCI runtime isolation capability by measuring virtualized system resources. We hereby build on two previous contributions, a proven isolation measurement workflow engine, and meaningful isolation metrics. The existing workflow engine is extended to integrate OCI runtime instrumentation as well as the novel isolation metrics. We indicate a quantifiable distinction between the isolation capabilities of these technologies. Researchers and industry alike can use the results to make decisions on the adoption of virtualization technology based on their isolation characteristics. Furthermore, our extended measurement workflow engine can be leveraged to conduct further experiments with new technologies, metrics, and scenarios.
- 7 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 60-70
Open AccessAn Empirical Analysis of Common OCI Runtimes' Performance Isolation Capabilities
Industry and academia have strong incentives to adopt virtualization technologies. Such technologies can reduce the total cost of ownership or facilitate business models like cloud computing. These options have recently grown significantly with the rise of Kubernetes and the OCI runtime specification. Both enabled virtualization technology vendors to easily integrate their solution into existing infrastructures, leading to increased adoption. Making a detailed decision on a technology selection based on objective characteristics is a complex task. This specifically includes the instrumentation of performance characteristics that are an important aspect for a fair comparison. Moreover, a subsequent quantification of the isolation capability based on performance metrics is not readily available. In this paper, we instrument and determine the OCI runtime isolation capability by measuring virtualized system resources. We hereby build on two previous contributions, a proven isolation measurement workflow engine, and meaningful isolation metrics. The existing workflow engine is extended to integrate OCI runtime instrumentation as well as the novel isolation metrics. We indicate a quantifiable distinction between the isolation capabilities of these technologies. Researchers and industry alike can use the results to make decisions on the adoption of virtualization technology based on their isolation characteristics. Furthermore, our extended measurement workflow engine can be leveraged to conduct further experiments with new technologies, metrics, and scenarios.
- Open Access
- 7 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 235-241
Exemplary Determination of Cgroups-Based QoS Isolation for a Database Workload
An effective isolation among workloads within a shared and possibly contended compute environment is a crucial aspect for industry and academia alike to ensure optimal performance and resource utilization. Modern ecosystems offer a wide range of approaches and solutions to ensure isolation for a multitude of different compute resources. Past experiments have verified the effectiveness of this resource isolation with micro benchmarks. The effectiveness of QoS isolation for intricate workloads beyond micro benchmarks however, remains an open question. This paper addresses this gap by introducing a specific example involving a database workload isolated using Cgroups from a disruptor contending for CPU resources. Despite the even distribution of CPU isolation limits among the workloads, our findings reveal a significant impact of the disruptor on the QoS of the database workload. To illustrate this, we present a methodology for quantifying this isolation, accompanied by an implementation incorporating essential instrumentation through eBPF. This not only highlights the practical challenges in achieving robust QoS isolation but also emphasizes the need for additional instrumentation and realistic scenarios to comprehensively evaluate and address these challenges.
- 7 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 235-241
Open AccessExemplary Determination of Cgroups-Based QoS Isolation for a Database Workload
An effective isolation among workloads within a shared and possibly contended compute environment is a crucial aspect for industry and academia alike to ensure optimal performance and resource utilization. Modern ecosystems offer a wide range of approaches and solutions to ensure isolation for a multitude of different compute resources. Past experiments have verified the effectiveness of this resource isolation with micro benchmarks. The effectiveness of QoS isolation for intricate workloads beyond micro benchmarks however, remains an open question. This paper addresses this gap by introducing a specific example involving a database workload isolated using Cgroups from a disruptor contending for CPU resources. Despite the even distribution of CPU isolation limits among the workloads, our findings reveal a significant impact of the disruptor on the QoS of the database workload. To illustrate this, we present a methodology for quantifying this isolation, accompanied by an implementation incorporating essential instrumentation through eBPF. This not only highlights the practical challenges in achieving robust QoS isolation but also emphasizes the need for additional instrumentation and realistic scenarios to comprehensively evaluate and address these challenges.
- Open Access
- 15 April 2023
- Published by Association for Computing Machinery (ACM)
- p. 149-160
A Methodology and Framework to Determine the Isolation Capabilities of Virtualisation Technologies
- 15 April 2023
- Published by Association for Computing Machinery (ACM)
- p. 149-160
Open AccessA Methodology and Framework to Determine the Isolation Capabilities of Virtualisation Technologies
- Open Access
- 15 April 2023
- Published by Association for Computing Machinery (ACM)
- p. 311-317
Using eBPF for Database Workload Tracing: An Explorative Study
Database management systems~(DBMS) are crucial architectural components of any modern distributed software system. Yet, ensuring a smooth, high-performant operation of a DBMS is a black art that requires tweaking many knobs and is heavily dependent on the experienced workload. Misconfigurations at production systems have an heavy impact on the overall delivered service quality and hence, should be avoided at all costs. Replaying production workload on test and staging systems to estimate the ideal configuration are a valid approach. Yet, this requires traces from the production systems. While many DBMS's have built-in support to capture such traces these have a non-negligible impact on performance. eBPF is a Linux kernel feature claiming to enable low-overhead observability and application tracing. In this paper, we evaluate different eBPF-based approaches to DBMS workload tracing for PostgreSQL and MySQL. The results show that using eBPF causes lower overhead than the built-in mechanisms. Hence, eBPF can be a viable baseline for building a generic tracing framework. Yet, our current results also show that additional optimisation and fine-tuning is needed to further lower the performance overhead.
- 15 April 2023
- Published by Association for Computing Machinery (ACM)
- p. 311-317
Open AccessUsing eBPF for Database Workload Tracing: An Explorative Study
Database management systems~(DBMS) are crucial architectural components of any modern distributed software system. Yet, ensuring a smooth, high-performant operation of a DBMS is a black art that requires tweaking many knobs and is heavily dependent on the experienced workload. Misconfigurations at production systems have an heavy impact on the overall delivered service quality and hence, should be avoided at all costs. Replaying production workload on test and staging systems to estimate the ideal configuration are a valid approach. Yet, this requires traces from the production systems. While many DBMS's have built-in support to capture such traces these have a non-negligible impact on performance. eBPF is a Linux kernel feature claiming to enable low-overhead observability and application tracing. In this paper, we evaluate different eBPF-based approaches to DBMS workload tracing for PostgreSQL and MySQL. The results show that using eBPF causes lower overhead than the built-in mechanisms. Hence, eBPF can be a viable baseline for building a generic tracing framework. Yet, our current results also show that additional optimisation and fine-tuning is needed to further lower the performance overhead.