Byzantine fault tolerance of regenerating codes
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...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Language: | English |
| Published: |
2011
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/93864 http://hdl.handle.net/10220/7074 http://ieeexplore.ieee.org/Xplore/guesthome.jsp |
| _version_ | 1826122660598251520 |
|---|---|
| author | Oggier, Frederique Datta, Anwitaman |
| author2 | School of Computer Engineering |
| author_facet | School of Computer Engineering Oggier, Frederique Datta, Anwitaman |
| author_sort | Oggier, Frederique |
| collection | NTU |
| description | 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. |
| first_indexed | 2024-10-01T05:51:49Z |
| format | Conference Paper |
| id | ntu-10356/93864 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T05:51:49Z |
| publishDate | 2011 |
| record_format | dspace |
| spelling | ntu-10356/938642020-05-28T07:17:20Z Byzantine fault tolerance of regenerating codes Oggier, Frederique Datta, Anwitaman School of Computer Engineering IEEE International Conference on Peer-to-Peer Computing (11th : 2011 : Tokyo, Japan) National Research Foundation Singapore DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks 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. Accepted version 2011-09-15T07:19:00Z 2019-12-06T18:46:47Z 2011-09-15T07:19:00Z 2019-12-06T18:46:47Z 2011 2011 Conference Paper Oggier, F., & Datta, A. (2011). Byzantine Fault Tolerance of Regenerating Codes. Proceedings of the 11th IEEE International Conference on Peer-to-Peer Computing, Tokyo. https://hdl.handle.net/10356/93864 http://hdl.handle.net/10220/7074 http://ieeexplore.ieee.org/Xplore/guesthome.jsp 160945 en © 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. 12 p. application/pdf |
| spellingShingle | DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks Oggier, Frederique Datta, Anwitaman Byzantine fault tolerance of regenerating codes |
| title | Byzantine fault tolerance of regenerating codes |
| title_full | Byzantine fault tolerance of regenerating codes |
| title_fullStr | Byzantine fault tolerance of regenerating codes |
| title_full_unstemmed | Byzantine fault tolerance of regenerating codes |
| title_short | Byzantine fault tolerance of regenerating codes |
| title_sort | byzantine fault tolerance of regenerating codes |
| topic | DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks |
| url | https://hdl.handle.net/10356/93864 http://hdl.handle.net/10220/7074 http://ieeexplore.ieee.org/Xplore/guesthome.jsp |
| work_keys_str_mv | AT oggierfrederique byzantinefaulttoleranceofregeneratingcodes AT dattaanwitaman byzantinefaulttoleranceofregeneratingcodes |