<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-21T01:00:04Z</responseDate>
  <request identifier="26622" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:26622</identifier>
        <datestamp>2026-07-02T09:38:19Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Controlling Adaptive HARQ Erasure Coding for Real-Time Transport under Channel Model Mismatch (Artifact)</dc:title>
          <dc:creator>Miodek, Moritz</dc:creator>
          <dc:creator>Böhmer, Marlene</dc:creator>
          <dc:creator>Herfet, Thorsten</dc:creator>
          <dc:subject>Transport protocol</dc:subject>
          <dc:subject>Real-time systems</dc:subject>
          <dc:subject>Real-time communication</dc:subject>
          <dc:subject>Linux</dc:subject>
          <dc:subject>Rust</dc:subject>
          <dc:subject>Network reliability</dc:subject>
          <dc:subject>adaptive erasure coding</dc:subject>
          <dc:subject>HARQ</dc:subject>
          <dc:subject>closed-loop control</dc:subject>
          <dc:subject>anytime search</dc:subject>
          <dc:subject>model mismatch</dc:subject>
          <dc:description>This artifact contains the source code of the PRRT protocol implementation, and evaluation scripts in the form of Jupyter notebooks to reproduce Figure 2, Figure 3, Figure 4, and Table 2 presented in the paper. The evaluation is split into two parts: evaluating the PRRT network protocol operating over a lossy loopback device (using Linux traffic control), and evaluating the performance aspects of the incremental search in isolation. The artifact contains two repositories, the PRRT protocol implementation, and the evaluation scripts.&#13;
Running the complete suite of experiments to reproduce all paper results takes approximately 1 hour on the specified hardware.&#13;
The evaluation is sensitive to the real-time capabilities of the underlying operating system. To faithfully reproduce the results of the paper, we recommend using the existing real-time capabilities of modern Linux kernels, and provide a Docker image to ease the installation process compared to the native setup. We also provide the OVA for cross-platform evaluation purposes, it allows to functionally reproduce the results, but may produce degraded results depending on the host and hypervisor real-time capabilities.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Moritz Miodek and Marlene Böhmer and Thorsten Herfet</dc:contributor>
          <dc:date>2026</dc:date>
          <dc:relation>Is Part Of DARTS, Volume 12, Issue 2, Special Issue of the 38th European Conference on Real-Time Systems (ECRTS 2026)</dc:relation>
          <dc:type>Article</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DARTS.12.2.5</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-266220</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DARTS.12.2.5</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
