Non-local redundancy: Erasure coding and dispersed replicas for robust retrieval in the Swarm peer-to-peer network

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Trón, Viktor, Tóth, Viktor, Toner, Callum, Nickless, Dan, Nagy, Dániel A., Fischer, Áron, Barabás, György
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866929483303354368
author Trón, Viktor
Tóth, Viktor
Toner, Callum
Nickless, Dan
Nagy, Dániel A.
Fischer, Áron
Barabás, György
author_facet Trón, Viktor
Tóth, Viktor
Toner, Callum
Nickless, Dan
Nagy, Dániel A.
Fischer, Áron
Barabás, György
contents This paper describes in detail how erasure codes are implemented in the Swarm system. First, in Section 1, we introduce erasure codes, and show how to apply them to files in Swarm (Section 2). In Section 3, we introduce security levels of data availability and derive their respective parameterisations. In Section 4, we describe a construct that enables cross-neighbourhood redundancy for singleton chunks and which completes erasure coding. Finally, in 5, we propose a number of retrieval strategies applicable to erasure-coded files.
format Preprint
id arxiv_https___arxiv_org_abs_2409_01259
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Non-local redundancy: Erasure coding and dispersed replicas for robust retrieval in the Swarm peer-to-peer network
Trón, Viktor
Tóth, Viktor
Toner, Callum
Nickless, Dan
Nagy, Dániel A.
Fischer, Áron
Barabás, György
Networking and Internet Architecture
This paper describes in detail how erasure codes are implemented in the Swarm system. First, in Section 1, we introduce erasure codes, and show how to apply them to files in Swarm (Section 2). In Section 3, we introduce security levels of data availability and derive their respective parameterisations. In Section 4, we describe a construct that enables cross-neighbourhood redundancy for singleton chunks and which completes erasure coding. Finally, in 5, we propose a number of retrieval strategies applicable to erasure-coded files.
title Non-local redundancy: Erasure coding and dispersed replicas for robust retrieval in the Swarm peer-to-peer network
topic Networking and Internet Architecture
url https://arxiv.org/abs/2409.01259