<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>RoBuSt: A Crash-Failure-Resistant Distributed Storage System</title></titleInfo>





<name type="personal">
  <namePart type="given">Christian</namePart>
  <namePart type="family">Scheideler</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">20792</identifier></name>
<name type="personal">
  <namePart type="given">Alexander</namePart>
  <namePart type="family">Setzer</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">11108</identifier></name>
<name type="personal">
  <namePart type="given">Martina</namePart>
  <namePart type="family">Eikel</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">79</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>





<name type="corporate">
  <namePart>SFB 901</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>
<name type="corporate">
  <namePart>SFB 901 - Subprojekt C1</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>
<name type="corporate">
  <namePart>SFB 901 - Project Area C</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">In this work we present the first distributed storage system that is provably robust against crash failures issued by an adaptive adversary, i.e., for each batch of requests the adversary can decide based on the entire system state which servers will be unavailable for that batch of requests. Despite up to \gamma n^{1/\log\log n} crashed servers, with \gamma&gt;0 constant and n denoting the number of servers, our system can correctly process any batch of lookup and write requests (with at most a polylogarithmic number of requests issued at each non-crashed server) in at most a polylogarithmic number of communication rounds, with at most polylogarithmic time and work at each server and only a logarithmic storage overhead. Our system is based on previous work by Eikel and Scheideler (SPAA 2013), who presented IRIS, a distributed information system that is provably robust against the same kind of crash failures. However, IRIS is only able to serve lookup requests. Handling both lookup and write requests has turned out to require major changes in the design of IRIS.</abstract>

<relatedItem type="constituent">
  <location>
    <url displayLabel="371-RoBuSt-OPODIS.pdf">https://ris.uni-paderborn.de/download/371/1401/371-RoBuSt-OPODIS.pdf</url>
  </location>
  <physicalDescription><internetMediaType>application/pdf</internetMediaType></physicalDescription>
</relatedItem>
<originInfo><dateIssued encoding="w3cdtf">2014</dateIssued>
</originInfo>



<relatedItem type="host"><titleInfo><title>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</title></titleInfo><identifier type="doi">10.1007/978-3-319-14472-6_8</identifier>
<part><extent unit="pages">107--122</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<ama>Scheideler C, Setzer A, Eikel M. RoBuSt: A Crash-Failure-Resistant Distributed Storage System. In: &lt;i&gt;Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)&lt;/i&gt;. LNCS. ; 2014:107--122. doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-319-14472-6_8&quot;&gt;10.1007/978-3-319-14472-6_8&lt;/a&gt;</ama>
<chicago>Scheideler, Christian, Alexander Setzer, and Martina Eikel. “RoBuSt: A Crash-Failure-Resistant Distributed Storage System.” In &lt;i&gt;Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)&lt;/i&gt;, 107--122. LNCS, 2014. &lt;a href=&quot;https://doi.org/10.1007/978-3-319-14472-6_8&quot;&gt;https://doi.org/10.1007/978-3-319-14472-6_8&lt;/a&gt;.</chicago>
<ieee>C. Scheideler, A. Setzer, and M. Eikel, “RoBuSt: A Crash-Failure-Resistant Distributed Storage System,” in &lt;i&gt;Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)&lt;/i&gt;, 2014, pp. 107--122.</ieee>
<apa>Scheideler, C., Setzer, A., &amp;#38; Eikel, M. (2014). RoBuSt: A Crash-Failure-Resistant Distributed Storage System. In &lt;i&gt;Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)&lt;/i&gt; (pp. 107--122). &lt;a href=&quot;https://doi.org/10.1007/978-3-319-14472-6_8&quot;&gt;https://doi.org/10.1007/978-3-319-14472-6_8&lt;/a&gt;</apa>
<mla>Scheideler, Christian, et al. “RoBuSt: A Crash-Failure-Resistant Distributed Storage System.” &lt;i&gt;Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)&lt;/i&gt;, 2014, pp. 107--122, doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-319-14472-6_8&quot;&gt;10.1007/978-3-319-14472-6_8&lt;/a&gt;.</mla>
<bibtex>@inproceedings{Scheideler_Setzer_Eikel_2014, series={LNCS}, title={RoBuSt: A Crash-Failure-Resistant Distributed Storage System}, DOI={&lt;a href=&quot;https://doi.org/10.1007/978-3-319-14472-6_8&quot;&gt;10.1007/978-3-319-14472-6_8&lt;/a&gt;}, booktitle={Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)}, author={Scheideler, Christian and Setzer, Alexander and Eikel, Martina}, year={2014}, pages={107--122}, collection={LNCS} }</bibtex>
<short>C. Scheideler, A. Setzer, M. Eikel, in: Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS), 2014, pp. 107--122.</short>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>371</recordIdentifier><recordCreationDate encoding="w3cdtf">2017-10-17T12:42:04Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2022-01-06T06:59:31Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
