Home > Research > Publications & Outputs > Low-latency access to robust amnesic storage

Research

Associated organisational units

Links

Text available via DOI:

Keywords

View graph of relations

Low-latency access to robust amnesic storage

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Standard

Low-latency access to robust amnesic storage. / Dobre, D.; Majuntke, M.; Suri, Neeraj.
LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware. ACM, 2009. 12.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Harvard

Dobre, D, Majuntke, M & Suri, N 2009, Low-latency access to robust amnesic storage. in LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware., 12, ACM. https://doi.org/10.1145/1529974.1529991

APA

Dobre, D., Majuntke, M., & Suri, N. (2009). Low-latency access to robust amnesic storage. In LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware Article 12 ACM. https://doi.org/10.1145/1529974.1529991

Vancouver

Dobre D, Majuntke M, Suri N. Low-latency access to robust amnesic storage. In LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware. ACM. 2009. 12 doi: 10.1145/1529974.1529991

Author

Dobre, D. ; Majuntke, M. ; Suri, Neeraj. / Low-latency access to robust amnesic storage. LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware. ACM, 2009.

Bibtex

@inproceedings{8e7142917bf1468e882c91d01addca96,
title = "Low-latency access to robust amnesic storage",
abstract = "We address the problem of building a reliable distributed read/write storage from unreliable storage units, e.g. a collection of servers, of which up to one-third can fail by not responding or by undetectably corrupting the data stored on them. Our contribution consists in the development of Byzantine-resilient storage algorithms that for the first time combine strong consistency and liveness guarantees with space-efficiency. Previous solutions featuring equivalent properties resort to storing an unlimited number of data versions in the storage units, thus eventually running into problems of space exhaustion. {\textcopyright} ACM 2008.",
keywords = "Byzantine failures, Liveness, Low-latency, Number of datum, Space efficiencies, Storage units, Strong consistency, Middleware",
author = "D. Dobre and M. Majuntke and Neeraj Suri",
year = "2009",
month = sep,
day = "15",
doi = "10.1145/1529974.1529991",
language = "English",
isbn = "9781605582962",
booktitle = "LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware",
publisher = "ACM",

}

RIS

TY - GEN

T1 - Low-latency access to robust amnesic storage

AU - Dobre, D.

AU - Majuntke, M.

AU - Suri, Neeraj

PY - 2009/9/15

Y1 - 2009/9/15

N2 - We address the problem of building a reliable distributed read/write storage from unreliable storage units, e.g. a collection of servers, of which up to one-third can fail by not responding or by undetectably corrupting the data stored on them. Our contribution consists in the development of Byzantine-resilient storage algorithms that for the first time combine strong consistency and liveness guarantees with space-efficiency. Previous solutions featuring equivalent properties resort to storing an unlimited number of data versions in the storage units, thus eventually running into problems of space exhaustion. © ACM 2008.

AB - We address the problem of building a reliable distributed read/write storage from unreliable storage units, e.g. a collection of servers, of which up to one-third can fail by not responding or by undetectably corrupting the data stored on them. Our contribution consists in the development of Byzantine-resilient storage algorithms that for the first time combine strong consistency and liveness guarantees with space-efficiency. Previous solutions featuring equivalent properties resort to storing an unlimited number of data versions in the storage units, thus eventually running into problems of space exhaustion. © ACM 2008.

KW - Byzantine failures

KW - Liveness

KW - Low-latency

KW - Number of datum

KW - Space efficiencies

KW - Storage units

KW - Strong consistency

KW - Middleware

U2 - 10.1145/1529974.1529991

DO - 10.1145/1529974.1529991

M3 - Conference contribution/Paper

SN - 9781605582962

BT - LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware

PB - ACM

ER -