Data recovery after geographic correlated attacks

Guy Grebla, Alon Efrat, Esther Ezra, Rom Pinchasi, Swaminathan Sankararaman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In distributed storage networks, ensuring data availability in the presence of hardware faults is an important requirement. Typically, redundancy schemes such as replication and erasure coding are used to ensure this. In case of hardware failures, these networks may be disconnected into multiple components, each of which may require access to the data. In addition, the placement of redundant information must also be optimized as it is ever-changing and requires constant updating. We study the problem of selecting a set of nodes in networks of this kind so that data availability is maintained in the face of geographically correlated failures. We model failure events of arbitrary shapes as the union of disks or line segments in the plane and present approximation algorithms for the problem of selecting a minimum number of redundant information locations (such as replicas or coded file segments) so that data recovery is guaranteed at every node in the face of any failure event. Using tools from computational geometry, our algorithms are efficient and provide good guarantees.

Original languageEnglish (US)
Title of host publication2015 11th International Conference on the Design of Reliable Communication Networks, DRCN 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages65-72
Number of pages8
ISBN (Print)9781479977956
DOIs
StatePublished - Jul 2 2015
Externally publishedYes
Event2015 11th International Conference on the Design of Reliable Communication Networks, DRCN 2015 - Kansas City, United States
Duration: Mar 24 2015Mar 27 2015

Other

Other2015 11th International Conference on the Design of Reliable Communication Networks, DRCN 2015
CountryUnited States
CityKansas City
Period3/24/153/27/15

Fingerprint

Availability
Hardware
Computational geometry
Recovery
Approximation algorithms
Redundancy

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Networks and Communications

Cite this

Grebla, G., Efrat, A., Ezra, E., Pinchasi, R., & Sankararaman, S. (2015). Data recovery after geographic correlated attacks. In 2015 11th International Conference on the Design of Reliable Communication Networks, DRCN 2015 (pp. 65-72). [7148986] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/DRCN.2015.7148986

Data recovery after geographic correlated attacks. / Grebla, Guy; Efrat, Alon; Ezra, Esther; Pinchasi, Rom; Sankararaman, Swaminathan.

2015 11th International Conference on the Design of Reliable Communication Networks, DRCN 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 65-72 7148986.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Grebla, G, Efrat, A, Ezra, E, Pinchasi, R & Sankararaman, S 2015, Data recovery after geographic correlated attacks. in 2015 11th International Conference on the Design of Reliable Communication Networks, DRCN 2015., 7148986, Institute of Electrical and Electronics Engineers Inc., pp. 65-72, 2015 11th International Conference on the Design of Reliable Communication Networks, DRCN 2015, Kansas City, United States, 3/24/15. https://doi.org/10.1109/DRCN.2015.7148986
Grebla G, Efrat A, Ezra E, Pinchasi R, Sankararaman S. Data recovery after geographic correlated attacks. In 2015 11th International Conference on the Design of Reliable Communication Networks, DRCN 2015. Institute of Electrical and Electronics Engineers Inc. 2015. p. 65-72. 7148986 https://doi.org/10.1109/DRCN.2015.7148986
Grebla, Guy ; Efrat, Alon ; Ezra, Esther ; Pinchasi, Rom ; Sankararaman, Swaminathan. / Data recovery after geographic correlated attacks. 2015 11th International Conference on the Design of Reliable Communication Networks, DRCN 2015. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 65-72
@inproceedings{37cb76350d1248168e12fe5f1455214f,
title = "Data recovery after geographic correlated attacks",
abstract = "In distributed storage networks, ensuring data availability in the presence of hardware faults is an important requirement. Typically, redundancy schemes such as replication and erasure coding are used to ensure this. In case of hardware failures, these networks may be disconnected into multiple components, each of which may require access to the data. In addition, the placement of redundant information must also be optimized as it is ever-changing and requires constant updating. We study the problem of selecting a set of nodes in networks of this kind so that data availability is maintained in the face of geographically correlated failures. We model failure events of arbitrary shapes as the union of disks or line segments in the plane and present approximation algorithms for the problem of selecting a minimum number of redundant information locations (such as replicas or coded file segments) so that data recovery is guaranteed at every node in the face of any failure event. Using tools from computational geometry, our algorithms are efficient and provide good guarantees.",
author = "Guy Grebla and Alon Efrat and Esther Ezra and Rom Pinchasi and Swaminathan Sankararaman",
year = "2015",
month = "7",
day = "2",
doi = "10.1109/DRCN.2015.7148986",
language = "English (US)",
isbn = "9781479977956",
pages = "65--72",
booktitle = "2015 11th International Conference on the Design of Reliable Communication Networks, DRCN 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Data recovery after geographic correlated attacks

AU - Grebla, Guy

AU - Efrat, Alon

AU - Ezra, Esther

AU - Pinchasi, Rom

AU - Sankararaman, Swaminathan

PY - 2015/7/2

Y1 - 2015/7/2

N2 - In distributed storage networks, ensuring data availability in the presence of hardware faults is an important requirement. Typically, redundancy schemes such as replication and erasure coding are used to ensure this. In case of hardware failures, these networks may be disconnected into multiple components, each of which may require access to the data. In addition, the placement of redundant information must also be optimized as it is ever-changing and requires constant updating. We study the problem of selecting a set of nodes in networks of this kind so that data availability is maintained in the face of geographically correlated failures. We model failure events of arbitrary shapes as the union of disks or line segments in the plane and present approximation algorithms for the problem of selecting a minimum number of redundant information locations (such as replicas or coded file segments) so that data recovery is guaranteed at every node in the face of any failure event. Using tools from computational geometry, our algorithms are efficient and provide good guarantees.

AB - In distributed storage networks, ensuring data availability in the presence of hardware faults is an important requirement. Typically, redundancy schemes such as replication and erasure coding are used to ensure this. In case of hardware failures, these networks may be disconnected into multiple components, each of which may require access to the data. In addition, the placement of redundant information must also be optimized as it is ever-changing and requires constant updating. We study the problem of selecting a set of nodes in networks of this kind so that data availability is maintained in the face of geographically correlated failures. We model failure events of arbitrary shapes as the union of disks or line segments in the plane and present approximation algorithms for the problem of selecting a minimum number of redundant information locations (such as replicas or coded file segments) so that data recovery is guaranteed at every node in the face of any failure event. Using tools from computational geometry, our algorithms are efficient and provide good guarantees.

UR - http://www.scopus.com/inward/record.url?scp=84944034139&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84944034139&partnerID=8YFLogxK

U2 - 10.1109/DRCN.2015.7148986

DO - 10.1109/DRCN.2015.7148986

M3 - Conference contribution

AN - SCOPUS:84944034139

SN - 9781479977956

SP - 65

EP - 72

BT - 2015 11th International Conference on the Design of Reliable Communication Networks, DRCN 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -