Repository logo
All of OPARA
Log In
  1. Home
  2. Browse by Author

Browsing by Author "Schmidt, Thomas C."

Filter results by typing the first few letters
Now showing 1 - 4 of 4
  • Results Per Page
  • Sort Options
  • ItemOpen Access
    Data Sets for Paper "A Leaner and Faster Web: How CBOR Can Improve Dynamic Content Encoding in JSON and DNS over HTTPS"
    (Technische Universität Dresden, 2026-08-27) Lenders, Martine S.; Bormann, Carsten; Schmidt, Thomas C.; Wählisch, Matthias
    These data sets contain the files to recreate our evaluations using the code archived at https://doi.org/10.5281/zenodo.21790597. This is a supplement to the paper - M. S. Lenders, C. Bormann, T.C. Schmidt, and M. Wählisch, “**A Leaner and Faster Web: How CBOR Can Improve Dynamic Content Encoding in JSON and DNS over HTTPS**,” IEEE Transactions on Network and Service Management (TNSM), August 2026. https://doi.org/10.1109/TNSM.2026.3722114 **Paper abstract:** The Internet community has taken major efforts to decrease latency on the World Wide Web with significant improvements in accelerating content transport and in compressing static content. Less attention, however, has been dedicated to compression of dynamic content. Such content is commonly provided by JSON and DNS over HTTPS. Dynamic content objects continue to grow in size, which increases latency and fosters the digital inequality. In this paper, we propose to mitigate this increase by utilizing Concise Binary Object Representation (CBOR), a standard originally designed for the constrained Internet of Things (IoT) to restrict packet sizes and enable efficient encoding of data objects. We provide protocol design and three new data sets for the evaluation of dynamic content, DNS, and the loading of websites. Our key findings are the following: _(i)_ Switching the data representation from JSON to CBOR reduces data by up to 80%. This size reduction can decrease loading times by up to 13.8% when downloading large objects—even in local setups. _(ii)_ Enabling CBOR for DNS over HTTPS (DoH) and DNS over CoAP (DoC) reduces packet sizes significantly. Compressing only names combined with unpacked CBOR achieves maximum gain of 52.2%, using more complex but still lightweight Packed CBOR allows minimizing packets by up to 95.5%. Our lean decoder for name compression can fit into as little as 314 bytes of build size. Our results clearly show the potential of CBOR outside of IoT scenarios. Parts of this research have already influenced work within the IETF.
  • ItemOpen Access
    Datasets for paper "Discovering Encrypted Client Hello Deployments by Active ECH Probing"
    (Technische Universität Dresden, 2026-10-13) Mücke, Jonas; Gasser, Konstantin; Schmidt, Thomas C.; Wählisch, Matthias
    This data is supplement to https://doi.org/10.5281/zenodo.22012700 and contains the necessary data to recreate plots and tables of the following paper: Jonas Mücke, Konstantin Gasser, Thomas C. Schmidt, and Matthias Wählisch. 2026. Discovering Encrypted Client Hello Deployments by Active ECH Probing. In Proceedings of the 2026 ACM Internet Measurement Conference (IMC '26). Association for Computing Machinery, New York, NY, USA, 276–286. https://doi.org/10.1145/3777912.3839832 Paper abstract: We present a new measurement method to detect ECH deployments. This method leverages standard-compliant behavior of ECH servers. Prior measurements relied on DNS exposure and reported only one major ECH deployment (Cloudflare). Our measurements reveal yet undiscovered ECH deployments, including a large deployment at Meta. Meta servers support ECH, but ECH configuration is not exposed via the DNS. We also empirically study details such as the level of privacy improvement and latency impact of ECH.
  • ItemOpen Access
    Datasets for paper "ReACKed QUICer: Measuring the Performance of Instant Acknowledgments in QUIC Handshakes"
    (Technische Universität Dresden, 2024-10-28) Mücke, Jonas; Nawrocki, Marcin; Hiesgen, Raphael; Schmidt, Thomas C.; Wählisch, Matthias
    This dataset contains Qlog and packet captures to measure the Performance of Instant Acknowledgements in (i) an emulated testbed and (ii) CDNs. See https://doi.org/10.5281/zenodo.13743301 Abstract: In this paper, we present a detailed performance analysis of QUIC instant ACK, a standard-compliant approach to reduce waiting times during the QUIC connection setup in common CDN deployments. To understand the root causes of the performance properties, we combine numerical analysis and the emulation of eight QUIC implementations using the QUIC Interop Runner. Our experiments comprehensively cover packet loss and non-loss scenarios, different round trip times, and TLS certificate sizes. To clarify instant ACK deployments in the wild, we conduct active measurements of 1M popular domain names. For almost all domain names under control of Cloudflare, Cloudflare uses instant ACK, which in fact improves performance. We also find, however, that instant ACK may lead to unnecessary retransmissions or longer waiting times under some network conditions, raising awareness of drawbacks of instant ACK in the future.
  • ItemOpen Access
    Datasets for paper "Scanning the IPv6 Internet Using Subnet-Router Anycast Probing"
    (Technische Universität Dresden, 2025-10-30) Koch, Maynard; Hiesgen, Raphael; Nawrocki, Marcin; Schmidt, Thomas C.; Wählisch, Matthias
    This dataset is supplement to https://doi.org/10.5281/zenodo.17210253 and contains all the necessary data to re-create plots and tables of the following paper: Scanning the IPv6 Internet Using Subnet-Router Anycast Probing Maynard Koch, Raphael Hiesgen, Marcin Nawrocki, Thomas C. Schmidt, and Matthias Wählisch Proc. ACM Netw., Vol. 3, No. CoNEXT4, Article 50. Publication date: December 2025. https://doi.org/10.1145/3768997 Paper Abstract: 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 short 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.

DSpace software copyright © 2002-2026 LYRASIS

  • Imprint and Privacy Statement
  • End User Agreement