Byzantine fault tolerance of regenerating codes

DSpace/Manakin Repository


Search DR-NTU

Advanced Search Subject Search


My Account

Byzantine fault tolerance of regenerating codes

Show simple item record

dc.contributor.author Oggier, Frederique
dc.contributor.author Datta, Anwitaman
dc.date.accessioned 2011-09-15T07:19:00Z
dc.date.available 2011-09-15T07:19:00Z
dc.date.copyright 2011
dc.date.issued 2011-09-15
dc.identifier.citation Oggier, F., & Datta, A. (2011). Byzantine Fault Tolerance of Regenerating Codes. Proceedings of the 11th IEEE International Conference on Peer-to-Peer Computing, Tokyo.
dc.identifier.uri http://hdl.handle.net/10220/7074
dc.description.abstract Recent years have witnessed a slew of coding techniques custom designed for networked storage systems. Network coding inspired regenerating codes are the most prolifically studied among these new age storage centric codes. A lot of effort has been invested in understanding the fundamental achievable trade-offs of storage and bandwidth usage to maintain redundancy in presence of different models of failures, showcasing the efficacy of regenerating codes with respect to traditional erasure coding techniques. For practical usability in open and adversarial environments, as is typical in peer-to-peer systems, we need however not only resilience against erasures, but also from (adversarial) errors. In this paper, we study the resilience of generalized regenerating codes (supporting multi-repairs, using collaboration among newcomers) in the presence of two classes of Byzantine nodes, relatively benign selfish (non-cooperating) nodes, as well as under more active, malicious polluting nodes. We give upper bounds on the resilience capacity of regenerating codes, and show that the advantages of collaborative repair can turn to be detrimental in the presence of Byzantine nodes. We further exhibit that system mechanisms can be combined with regenerating codes to mitigate the effect of rogue nodes.
dc.format.extent 12 p.
dc.language.iso en
dc.rights © 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: http://ieeexplore.ieee.org/Xplore/guesthome.jsp.
dc.subject DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks
dc.title Byzantine fault tolerance of regenerating codes
dc.type Conference Paper
dc.contributor.conference IEEE International Conference on Peer-to-Peer Computing (11th : 2011 : Tokyo, Japan)
dc.contributor.school School of Computer Engineering
dc.identifier.openurl http://ieeexplore.ieee.org/Xplore/guesthome.jsp
dc.description.version Accepted version
dc.contributor.organization Singapore National Research Foundation
dc.identifier.rims 160945

Files in this item

Files Size Format View
arxivBFT-RGC.pdf 237.3Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record


Total views

All Items Views
Byzantine fault tolerance of regenerating codes 549

Total downloads

All Bitstreams Views
arxivBFT-RGC.pdf 222

Top country downloads

Country Code Views
United States of America 86
China 51
Singapore 23
Russian Federation 12
France 7

Top city downloads

city Views
Mountain View 59
Beijing 27
Singapore 23
Redwood City 4
Southampton 4

Downloads / month

  2015-03 2015-04 2015-05 total
arxivBFT-RGC.pdf 0 0 15 15