Matthias Wählisch
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Matthias Wählisch has a total of 171 co-authors. Here are the top co-authors by number of shared publications:
- Thomas C. Schmidt
Hamburg University of Applied Sciences, Hamburg, Germany
55 shared publications Thomas C. Schmidt
46 shared publications- Thomas C. Schmidt
HAW Hamburg
12 shared publications - Raphael Hiesgen
HAW Hamburg, Hamburg, Germany
11 shared publications Hans L. Cycon
Senior Member; HTW Berlin and Daviko GmbH, Germany
9 shared publicationsSebastian Meiling
HAW Hamburg, Dept. Informatik, Berliner Tor 7, D-20099 Hamburg, Germany
8 shared publications
Latest Publications
- Open Access
- 12 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 1217-1218
Poster: Structural Analysis of Network Telescope Data Using Contrastive Learning and Correlation Clustering
- 12 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 1217-1218
Open AccessPoster: Structural Analysis of Network Telescope Data Using Contrastive Learning and Correlation Clustering
- Open Access
- 12 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 1213-1214
Poster: Expanding RPKI Timing Measurements to In-the-Wild Prefixes
- 12 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 1213-1214
Open AccessPoster: Expanding RPKI Timing Measurements to In-the-Wild Prefixes
- Open Access
- 12 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 276-286
Discovering Encrypted Client Hello Deployments by Active ECH Probing
- 12 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 276-286
Open AccessDiscovering Encrypted Client Hello Deployments by Active ECH Probing
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25, 26041-26056
LZn: Robust LoRa Frame Synchronization Under Frame Collisions and Ultra-Low SNR Conditions
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25, 26041-26056
Open AccessLZn: Robust LoRa Frame Synchronization Under Frame Collisions and Ultra-Low SNR Conditions
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 7904-7922
A Leaner and Faster Web: How CBOR Can Improve Dynamic Content Encoding in JSON and DNS Over HTTPS
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 7904-7922
Open AccessA Leaner and Faster Web: How CBOR Can Improve Dynamic Content Encoding in JSON and DNS Over HTTPS
- Open Access
Adaptive Learning Mechanisms for Learning Management Systems: A Scoping Review and Practical Considerations
Background: Traditional Learning Management Systems (LMS) usually offer a one-size-fits-all solution that cannot be customized to meet specific learner needs. To address this issue, adaptive learning mechanisms are integrated either by LMS-specific approaches into individual LMSs or by system-independent mechanisms into various existing LMSs to increase reusability. Objective: We conducted a systematic review of the literature addressing the following research questions. How are adaptive learning mechanisms integrated into LMSs system-independently? How are they provided, how are they specified, and on which database do they operate? A priori, we proposed three hypotheses. First, the focused adaptive learning mechanisms, rarely consider existing data. Second, they usually support a limited number of data processing mechanisms. Third, the users intended to provide them, are rarely given the ability to adapt how they work. Furthermore, to investigate the differences between system-independent and LMS-specific approaches, we also included the latter. Design: We used Scopus, Web of Science and Google Scholar for gray literature to identify 3370 papers published between 2003 and 2023 for screening, and conducted a snowball search. Results: We identified 61 relevant approaches and extracted eight variables for them through in-depth reading. The results support the proposed hypotheses. Conclusion: Based on the challenges raised by the proposed hypotheses with regard to the relevant user groups, we defined two future research directions - developing a conceptual model for the system-independent specification of adaptive learning mechanisms and a corresponding architecture for the provision, and supporting the authoring of these mechanisms by users with low technical expertise.
Open AccessAdaptive Learning Mechanisms for Learning Management Systems: A Scoping Review and Practical Considerations
Background: Traditional Learning Management Systems (LMS) usually offer a one-size-fits-all solution that cannot be customized to meet specific learner needs. To address this issue, adaptive learning mechanisms are integrated either by LMS-specific approaches into individual LMSs or by system-independent mechanisms into various existing LMSs to increase reusability. Objective: We conducted a systematic review of the literature addressing the following research questions. How are adaptive learning mechanisms integrated into LMSs system-independently? How are they provided, how are they specified, and on which database do they operate? A priori, we proposed three hypotheses. First, the focused adaptive learning mechanisms, rarely consider existing data. Second, they usually support a limited number of data processing mechanisms. Third, the users intended to provide them, are rarely given the ability to adapt how they work. Furthermore, to investigate the differences between system-independent and LMS-specific approaches, we also included the latter. Design: We used Scopus, Web of Science and Google Scholar for gray literature to identify 3370 papers published between 2003 and 2023 for screening, and conducted a snowball search. Results: We identified 61 relevant approaches and extracted eight variables for them through in-depth reading. The results support the proposed hypotheses. Conclusion: Based on the challenges raised by the proposed hypotheses with regard to the relevant user groups, we defined two future research directions - developing a conceptual model for the system-independent specification of adaptive learning mechanisms and a corresponding architecture for the provision, and supporting the authoring of these mechanisms by users with low technical expertise.
- Open Access
A Leaner and Faster Web: How CBOR Can Improve Dynamic Content Encoding in JSON and DNS over HTTPS
The Internet community has taken major efforts to decrease latency in the World Wide Web. Significant improvements have been achieved in accelerating content transport and in compressing static content. Less attention, however, has been dedicated to dynamic content compression. Such content is commonly provided by JSON and DNS over HTTPS. Aligned with the overall Web trend, dynamic content objects continue to grow in size, which increases latency and fosters the digital inequality. In this paper, we propose to counter this increase by utilizing components engineered for the constrained Internet of Things (IoT). We focus on the Concise Binary Object Representation (CBOR) and its use for dynamic content encoded in JSON or in DNS over HTTPS messages. CBOR was originally introduced to restrict packet sizes in constrained environments and enables small, effective encoding of data objects. We measure that simply switching the data representation from JSON to CBOR reduces data by up to 80.0% for a corpus of JSON objects collected via the HTTP Archive. This size reduction can decrease loading times by up to 13.8% when downloading large objects -- even in local setups. A new CBOR-based DNS message format designed for use with DNS over HTTPS (DoH) and DNS over CoAP (DoC) minimizes packets by up to 95.5% in its packed form and shows large potential for additionally compressing names and addresses. We contribute two name compression schemes that apply to the new CBOR format and save up to 226 bytes in a response. The decoder for our name compression scheme is lean and can fit into as little as 314 bytes of binary build size. One of those compression schemes and further optimization proposals directly influenced further improvements of the new CBOR format within Internet standardization.
Open AccessA Leaner and Faster Web: How CBOR Can Improve Dynamic Content Encoding in JSON and DNS over HTTPS
The Internet community has taken major efforts to decrease latency in the World Wide Web. Significant improvements have been achieved in accelerating content transport and in compressing static content. Less attention, however, has been dedicated to dynamic content compression. Such content is commonly provided by JSON and DNS over HTTPS. Aligned with the overall Web trend, dynamic content objects continue to grow in size, which increases latency and fosters the digital inequality. In this paper, we propose to counter this increase by utilizing components engineered for the constrained Internet of Things (IoT). We focus on the Concise Binary Object Representation (CBOR) and its use for dynamic content encoded in JSON or in DNS over HTTPS messages. CBOR was originally introduced to restrict packet sizes in constrained environments and enables small, effective encoding of data objects. We measure that simply switching the data representation from JSON to CBOR reduces data by up to 80.0% for a corpus of JSON objects collected via the HTTP Archive. This size reduction can decrease loading times by up to 13.8% when downloading large objects -- even in local setups. A new CBOR-based DNS message format designed for use with DNS over HTTPS (DoH) and DNS over CoAP (DoC) minimizes packets by up to 95.5% in its packed form and shows large potential for additionally compressing names and addresses. We contribute two name compression schemes that apply to the new CBOR format and save up to 226 bytes in a response. The decoder for our name compression scheme is lean and can fit into as little as 314 bytes of binary build size. One of those compression schemes and further optimization proposals directly influenced further improvements of the new CBOR format within Internet standardization.
- Open Access
- 24 November 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 3 (CoNEXT4) , 1-15
Scanning the IPv6 Internet Using Subnet-Router Anycast Probing
Identifying active IPv6 addresses is challenging. Various methods emerged to master the measurement challenge in this huge address space, including hitlists, new probing techniques, and AI-generated target lists. In this paper, we apply active Subnet-Router anycast (SRA) probing, a commonly unused method to explore the IPv6 address space. We compare our results with lists of active IPv6 nodes obtained from prior methods and with random probing. Our findings indicate that probing an SRA address reveals on average 10% more router IP addresses than random probing and is far less affected by ICMP rate limiting. Compared to targeting router addresses directly, SRA probing discovers 80% more addresses. We conclude that SRA probing is an important addition to the IPv6 measurement toolbox and may improve the stability of results significantly. We also find evidence that some active scans can cause harmful conditions in current IPv6 deployments, which we started to fix in collaboration with network operators.
- 24 November 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 3 (CoNEXT4) , 1-15
Open AccessScanning the IPv6 Internet Using Subnet-Router Anycast Probing
Identifying active IPv6 addresses is challenging. Various methods emerged to master the measurement challenge in this huge address space, including hitlists, new probing techniques, and AI-generated target lists. In this paper, we apply active Subnet-Router anycast (SRA) probing, a commonly unused method to explore the IPv6 address space. We compare our results with lists of active IPv6 nodes obtained from prior methods and with random probing. Our findings indicate that probing an SRA address reveals on average 10% more router IP addresses than random probing and is far less affected by ICMP rate limiting. Compared to targeting router addresses directly, SRA probing discovers 80% more addresses. We conclude that SRA probing is an important addition to the IPv6 measurement toolbox and may improve the stability of results significantly. We also find evidence that some active scans can cause harmful conditions in current IPv6 deployments, which we started to fix in collaboration with network operators.
- Open Access
- 24 November 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 3 (CoNEXT4) , 1-26
Waiting for QUIC: Passive Measurements to Understand QUIC Deployments
QUIC experiences a rapid adoption since its standardization in 2021, and hypergiants configure their infrastructure to optimize for QUIC performance. In this paper, we introduce a passive measurement method to study both the progressive rollout and individual hypergiant configurations during the last five years. By analyzing backscatter traffic of the UCSD network telescope, we are able to make the following observations. First, Meta, Google, and Cloudflare configure significantly different maximal retransmission numbers and timeouts. Second, we can identify different off-net deployments of hypergiants, using packet features, such as QUIC connection IDs, packet coalescence, and packet lengths. Third, we observe changing hypergiant deployment configurations during our different measurement periods. Fourth, connection IDs can allow further insights into load balancer deployments, such as the number of servers. We bolster our results using two orthogonal measurements: passive recording of QUIC flows and active probing.
- 24 November 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 3 (CoNEXT4) , 1-26
Open AccessWaiting for QUIC: Passive Measurements to Understand QUIC Deployments
QUIC experiences a rapid adoption since its standardization in 2021, and hypergiants configure their infrastructure to optimize for QUIC performance. In this paper, we introduce a passive measurement method to study both the progressive rollout and individual hypergiant configurations during the last five years. By analyzing backscatter traffic of the UCSD network telescope, we are able to make the following observations. First, Meta, Google, and Cloudflare configure significantly different maximal retransmission numbers and timeouts. Second, we can identify different off-net deployments of hypergiants, using packet features, such as QUIC connection IDs, packet coalescence, and packet lengths. Third, we observe changing hypergiant deployment configurations during our different measurement periods. Fourth, connection IDs can allow further insights into load balancer deployments, such as the number of servers. We bolster our results using two orthogonal measurements: passive recording of QUIC flows and active probing.
- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 3915-3929
Forward to Hell? On the Potentials of Misusing Transparent DNS Forwarders in Reflective Amplification Attacks
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 3915-3929
Open AccessForward to Hell? On the Potentials of Misusing Transparent DNS Forwarders in Reflective Amplification Attacks