@prefix dcat: <http://www.w3.org/ns/dcat#> .
@prefix dct: <http://purl.org/dc/terms/> .
@prefix foaf: <http://xmlns.com/foaf/0.1/> .
@prefix vcard: <http://www.w3.org/2006/vcard/ns#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00777155v2> a dcat:Dataset ;
    dct:description """
              We consider the problem of reliably broadcasting information in a multihop asynchronous network, despite the presence of Byzantine failures: some nodes are malicious and behave arbitrarly. We focus on non-cryptographic solutions. Most existing approaches give conditions for perfect reliable broadcast (all correct nodes deliver the good information), but require a highly connected network. A probabilistic approach was recently proposed for loosely connected networks: the Byzantine failures are randomly distributed, and the correct nodes deliver the good information with high probability. A first solution require the nodes to initially know their position on the network, which may be difficult or impossible in self-organizing or dynamic networks. A second solution relaxed this hypothesis but has much weaker Byzantine tolerance guarantees. In this paper, we propose a parameterizable broadcast protocol that does not require nodes to have any knowledge about the network. We give a deterministic technique to compute a set of nodes that always deliver authentic information, for a given set of Byzantine failures. Then, we use this technique to experimentally evaluate our protocol, and show that it significantely outperforms previous solutions with the same hypotheses. Important disclaimer: these results have NOT yet been published in an international conference or journal. This is just a technical report presenting intermediary and incomplete results. A generalized version of these results may be under submission.
            """ ;
    dct:identifier "hal-00777155" ;
    dct:issued "2026-05-07T21:59:32.604815"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-05-07T21:59:32.604821"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "Parameterizable Byzantine Broadcast in Loosely Connected Networks" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00777155v2/resource/55f4242a-33a2-4f7b-9069-e8738552297d> ;
    dcat:keyword "broadcast",
        "byzantine-failures",
        "distributed-computing",
        "fault-tolerance",
        "infoeu-reposemanticsreport",
        "infoinfo-crcomputer-science-cscryptography-and-security-cscr",
        "infoinfo-dccomputer-science-csdistributed-parallel-and-cluster-computing-csdc",
        "infoinfo-dscomputer-science-csdata-structures-and-algorithms-csds",
        "infoinfo-nicomputer-science-csnetworking-and-internet-architecture-csni",
        "networks",
        "protocol",
        "random-failure",
        "reports" ;
    dcat:landingPage <https://hal.sorbonne-universite.fr/hal-00777155> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00777155v2/resource/55f4242a-33a2-4f7b-9069-e8738552297d> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-05-07T21:59:32.606951"^^xsd:dateTime ;
    dct:modified "2026-05-07T21:59:32.590691"^^xsd:dateTime ;
    dct:title "Parameterizable Byzantine Broadcast in Loosely Connected Networks" ;
    dcat:accessURL <https://hal.sorbonne-universite.fr/hal-00777155> .

<https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> a foaf:Agent ;
    foaf:name "test_moissonnage_selune" .

<https://hal.sorbonne-universite.fr/hal-00777155> a foaf:Document .