Viktor Trón, Viktor Tóth, Callum Toner, Dan Nickless, Dániel A. Nagy, Áron Fischer, György Barabás
{"title":"Non-local redundancy: Erasure coding and dispersed replicas for robust retrieval in the Swarm peer-to-peer network","authors":"Viktor Trón, Viktor Tóth, Callum Toner, Dan Nickless, Dániel A. Nagy, Áron Fischer, György Barabás","doi":"arxiv-2409.01259","DOIUrl":null,"url":null,"abstract":"This paper describes in detail how erasure codes are implemented in the Swarm\nsystem. First, in Section 1, we introduce erasure codes, and show how to apply\nthem to files in Swarm (Section 2). In Section 3, we introduce security levels\nof data availability and derive their respective parameterisations. In Section\n4, we describe a construct that enables cross-neighbourhood redundancy for\nsingleton chunks and which completes erasure coding. Finally, in 5, we propose\na number of retrieval strategies applicable to erasure-coded files.","PeriodicalId":501280,"journal":{"name":"arXiv - CS - Networking and Internet Architecture","volume":"6 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Networking and Internet Architecture","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.01259","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
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.