<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462010000400006</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Fault-Tolerance and Load-Balance Tradeoff in a Distributed Storage System]]></article-title>
<article-title xml:lang="es"><![CDATA[Estudio de la interdependencia entre tolerancia a fallas y balance de carga en un sistema de almacenamiento distribuido]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Quezada Naquid]]></surname>
<given-names><![CDATA[Moisés]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Marcelín Jiménez]]></surname>
<given-names><![CDATA[Ricardo]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[López Guerrero]]></surname>
<given-names><![CDATA[Miguel]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,Universidad Autónoma Metropolitana Department of Electrical Engineering ]]></institution>
<addr-line><![CDATA[México City ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2010</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2010</year>
</pub-date>
<volume>14</volume>
<numero>2</numero>
<fpage>151</fpage>
<lpage>163</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462010000400006&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462010000400006&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462010000400006&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[In recent years distributed storage systems have been the object of increasing interest by the research community. They promise improvements on information availability, security and integrity. Nevertheless, at this point in time, there is no a predominant approach, but a wide spectrum of proposals in the literature. In this paper we report our findings with a combination of redundancy techniques intended to simultaneously provide fault tolerance and load balance in a small-scale distributed storage system. Based on our analysis, we provide general guidelines for system designers and developers under similar conditions.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[En los últimos años los sistemas de almacenamiento distribuido han sido objeto de un gran interés por parte de la comunidad de investigadores. Estos sistemas prometen mejoras en cuanto a integridad, seguridad y disponibilidad de la información. Sin embargo, hasta este momento no existe un enfoque predominante, aunque hay diversas propuestas en la literatura. En este artículo reportamos los resultados de nuestras investigaciones con una combinación de técnicas de redundancia que tienen el propósito de proveer simultáneamente tolerancia a fallas y balance de carga en un sistema de almacenamiento distribuido de pequeña escala. Con base en nuestro análisis proporcionamos líneas directrices generales para diseñadores y desarrolladores de sistemas similares.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[IDA]]></kwd>
<kwd lng="en"><![CDATA[storage schemes]]></kwd>
<kwd lng="en"><![CDATA[failures]]></kwd>
<kwd lng="en"><![CDATA[recovery]]></kwd>
<kwd lng="en"><![CDATA[simulations]]></kwd>
<kwd lng="es"><![CDATA[IDA]]></kwd>
<kwd lng="es"><![CDATA[esquemas de almacenamiento]]></kwd>
<kwd lng="es"><![CDATA[fallas]]></kwd>
<kwd lng="es"><![CDATA[recuperación]]></kwd>
<kwd lng="es"><![CDATA[simulaciones]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[ <p align="justify"><font face="verdana" size="4">Art&iacute;culos</font></p>     <p align="justify"><font face="verdana" size="4">&nbsp;</font></p>     <p align="center"><font face="verdana" size="4"><b>Fault&#150;Tolerance and Load&#150;Balance Tradeoff in a Distributed Storage System</b></font></p>     <p align="center"><font face="verdana" size="2">&nbsp;</font></p>     <p align="center"><font face="verdana" size="3"><b>Estudio de la interdependencia entre tolerancia a fallas y balance de carga en un sistema de almacenamiento distribuido</b></font></p>     <p align="center"><font face="verdana" size="2">&nbsp;</font></p>     <p align="center"><font face="verdana" size="2"><b>Mois&eacute;s Quezada Naquid, Ricardo Marcel&iacute;n Jim&eacute;nez and Miguel L&oacute;pez Guerrero</b></font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><i>Department of Electrical Engineering , Universidad Aut&oacute;noma Metropolitana &#150; Iztapalapa 09340 &#150; M&eacute;xico City, Mexico. E&#150;mail:</i> <a href="mailto:moises@arte.izt.uam.mx">moises@arte.izt.uam.mx</a>, <a href="mailto:calu@xanum.uam.mx">calu@xanum.uam.mx</a>, <a href="mailto:milo@xanum.uam.mx">milo@xanum.uam.mx</a></font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2">Article received or September 1, 2008.    <br>   Accepted on September 25, 2009.</font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><b>Abstract</b></font></p>     <p align="justify"><font face="verdana" size="2">In recent years distributed storage systems have been the object of increasing interest by the research community. They promise improvements on information availability, security and integrity. Nevertheless, at this point in time, there is no a predominant approach, but a wide spectrum of proposals in the literature. In this paper we report our findings with a combination of redundancy techniques intended to simultaneously provide fault tolerance and load balance in a small&#150;scale distributed storage system. Based on our analysis, we provide general guidelines for system designers and developers under similar conditions.</font></p>     <p align="justify"><font face="verdana" size="2"><b>Keywords:</b> IDA, storage schemes, failures, recovery, simulations.</font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><b>Resumen</b></font></p>     <p align="justify"><font face="verdana" size="2">En los &uacute;ltimos a&ntilde;os los sistemas de almacenamiento distribuido han sido objeto de un gran inter&eacute;s por parte de la comunidad de investigadores. Estos sistemas prometen mejoras en cuanto a integridad, seguridad y disponibilidad de la informaci&oacute;n. Sin embargo, hasta este momento no existe un enfoque predominante, aunque hay diversas propuestas en la literatura. En este art&iacute;culo reportamos los resultados de nuestras investigaciones con una combinaci&oacute;n de t&eacute;cnicas de redundancia que tienen el prop&oacute;sito de proveer simult&aacute;neamente tolerancia a fallas y balance de carga en un sistema de almacenamiento distribuido de peque&ntilde;a escala. Con base en nuestro an&aacute;lisis proporcionamos l&iacute;neas directrices generales para dise&ntilde;adores y desarrolladores de sistemas similares.</font></p>     <p align="justify"><font face="verdana" size="2"><b>Palabras clave:</b> IDA, esquemas de almacenamiento, fallas, recuperaci&oacute;n, simulaciones.</font></p>     ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><a href="/pdf/cys/v14n2/v14n2a6.pdf" target="_blank">DESCARGAR ART&Iacute;CULO EN FORMATO PDF</a> </font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><b>References</b></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2"><b>1. Adya, A., Bolosky, W. J., Castro, M., Cermark, G., Chaiken, R., Douceur, J. R., Howell, J., Lorch, J. R., Theimer, M. &amp; Wattenhofer R. P. (2002). </b>FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment. <i>5<sup>th</sup> Symposium on Operating Systems Design and Implementation (OSDI), </i>Boston, USA, 1&#150;14.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2051086&pid=S1405-5546201000040000600001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2"><b>2. Bhagwan, R., Moore, D., Savage, S. &amp; Voelker, G. M. (2003). </b>Replication strategies for highly available peer&#150;to&#150;peer storage. In Schiper, A., Shvartsman, A.A., Weatherspoon, H., Zhao, B.Y. (Eds.) <i>Future Directions in Distributed Computing </i>(153&#150;158). New Jersey: Springer.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2051088&pid=S1405-5546201000040000600002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2"><b>3. </b>Celeste: An Automatic Storage System (s.f.). Retrieved from <a href="http://hub.opensolaris.org/bin/view/Project+celeste/WebHome" target="_blank">http://hub.opensolaris.org/bin/view/Project+celeste/WebHome</a></font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2051090&pid=S1405-5546201000040000600003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2"><b>4. Chang, F., Dean, J., Ghemawat, S., Hsieh, W. C., Wallach, D. A., Burrows, M., Chandra, T., Fikes, A. &amp; Gruber, R. E.(2006). </b>Bigtable: A Distributed Storage System for Structured Data. <i>7<sup>th</sup> Symposium on Operating Systems Design and Implementation (OSDI), </i>Seattle, USA, 205&#150;218.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2051091&pid=S1405-5546201000040000600004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2"><b>5. Chen, Y., Edler, J., Goldberg, A. V., Gottlieb, A., Sobti, S. &amp; Yianilos, P. N. (1999). </b>A Prototype implementation of Archival Intermemory. <i>4th ACM Conference on Digital Libraries, </i>California, USA, 28&#150;37.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2051093&pid=S1405-5546201000040000600005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2"><b>6. </b>Cleversafe&nbsp;(s.f.). Retrieved from http://www.cleversafe.org</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2051095&pid=S1405-5546201000040000600006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2"><b>7. Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C. &amp; Zhao, B. (2000) </b>OceanStore: An Architecture for Global&#150;Scale Persistent Storage. <i>ACM SIGPLAN Notice, 35 (11), </i>New York, USA, 190&#150;201.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2051096&pid=S1405-5546201000040000600007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2"><b>8. Marcel&iacute;n&#150;Jim&eacute;nez, R., Rajsbaum, S. &amp; Stevens, B. (2006). </b>Cyclic Storage for Fault&#150;tolerant Distributed Executions. <i>IEEE Transactions on Parallel and Distributed Systems, </i>17(9), 1028&#150;1036.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2051098&pid=S1405-5546201000040000600008&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2"><b>9. Rabin, M. O. (1989). </b>Efficient Dispersal of Information for Security, Load Balancing and Fault Tolerance. <i>Journal of the ACM, </i>38(2), 335&#150;348.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2051100&pid=S1405-5546201000040000600009&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2"><b>10. Rodrigues, R. &amp; Liskov, B. (2005). </b>High Availability in DHT's: Erasure Coding vs Replication. <i>Peer&#150;to&#150;Peer Systems IV. </i>4<sup>th</sup> <i>International Workshop on Peer&#150;to&#150;Peer Systems, Lecture Notes on Computer Science </i>, 3640, 226&#150;239.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2051102&pid=S1405-5546201000040000600010&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2"><b>11. Rowstron, A. &amp; Druschel, P. (2001). </b>Storage management and caching in PAST, a large&#150;scale, persistent, peer&#150;to&#150;peer storage utility. <i>ACM SIGOPS Operating Systems Review, </i>35(5), 188&#150;201.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2051104&pid=S1405-5546201000040000600011&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2"><b>12. Quezada&#150;Naquid, M., Marcel&iacute;n&#150;Jim&eacute;nez, R. &amp; L&oacute;pez&#150;Guerrero, M. (2007). </b>Service Policies for a Storage Services Dispatcher in a Distributed Fault&#150;Tolerant Storage Network and their Performance Evaluation. <i>Canadian Conference on Electrical and Computer Engineering (CCECE '07), </i>Vancouver, Canada, 34&#150;40.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2051106&pid=S1405-5546201000040000600012&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2"><b>13. </b>OMNeT++: Discrete Event Simulation System (s.f.). Retrieved from <a href="http://omnetpp.org/" target="_blank">http://omnetpp.org/</a></font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2051108&pid=S1405-5546201000040000600013&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2"><b>14. Yianilos, P. &amp; Sobti, S. (2001). </b>The Evolving Field of Distributed Storage. <i>IEEE Internet Computing. </i>5 (5), 3539</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2051109&pid=S1405-5546201000040000600014&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --> ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Adya]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Bolosky]]></surname>
<given-names><![CDATA[W. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Castro]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Cermark]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Chaiken]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Douceur]]></surname>
<given-names><![CDATA[J. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Howell]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Lorch]]></surname>
<given-names><![CDATA[J. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Theimer]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Wattenhofer]]></surname>
<given-names><![CDATA[R. P]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment]]></article-title>
<source><![CDATA[]]></source>
<year>2002</year>
<conf-name><![CDATA[5 Symposium on Operating Systems Design and Implementation (OSDI)]]></conf-name>
<conf-loc>Boston </conf-loc>
<page-range>1-14</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bhagwan]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Moore]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Savage]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Voelker]]></surname>
<given-names><![CDATA[G. M]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Replication strategies for highly available peer-to-peer storage]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Schiper]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Shvartsman]]></surname>
<given-names><![CDATA[A.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Weatherspoon]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhao]]></surname>
<given-names><![CDATA[B.Y]]></given-names>
</name>
</person-group>
<source><![CDATA[Future Directions in Distributed Computing]]></source>
<year>2003</year>
<page-range>153-158</page-range><publisher-loc><![CDATA[New Jersey ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="">
<source><![CDATA[Celeste: An Automatic Storage System]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chang]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Dean]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Ghemawat]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Hsieh]]></surname>
<given-names><![CDATA[W. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Wallach]]></surname>
<given-names><![CDATA[D. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Burrows]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Chandra]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Fikes]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Gruber]]></surname>
<given-names><![CDATA[R. E]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Bigtable: A Distributed Storage System for Structured Data]]></article-title>
<source><![CDATA[]]></source>
<year>2006</year>
<conf-name><![CDATA[7 Symposium on Operating Systems Design and Implementation (OSDI)]]></conf-name>
<conf-loc>Seattle </conf-loc>
<page-range>205-218</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Edler]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Goldberg]]></surname>
<given-names><![CDATA[A. V.]]></given-names>
</name>
<name>
<surname><![CDATA[Gottlieb]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Sobti]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Yianilos]]></surname>
<given-names><![CDATA[P. N]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A Prototype implementation of Archival Intermemory]]></article-title>
<source><![CDATA[]]></source>
<year>1999</year>
<conf-name><![CDATA[4 ACM Conference on Digital Libraries]]></conf-name>
<conf-loc>California </conf-loc>
<page-range>28-37</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="">
<collab>Cleversafe</collab>
<source><![CDATA[]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kubiatowicz]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Bindel]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Czerwinski]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Eaton]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Geels]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Gummadi]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Rhea]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Weatherspoon]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Weimer]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Wells]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhao]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[OceanStore: An Architecture for Global-Scale Persistent Storage]]></article-title>
<source><![CDATA[ACM SIGPLAN Notice]]></source>
<year>2000</year>
<volume>35</volume>
<numero>11</numero>
<issue>11</issue>
<page-range>190-201</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Marcelín-Jiménez]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Rajsbaum]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Stevens]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Cyclic Storage for Fault-tolerant Distributed Executions]]></article-title>
<source><![CDATA[IEEE Transactions on Parallel and Distributed Systems]]></source>
<year>2006</year>
<volume>17</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>1028-1036</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rabin]]></surname>
<given-names><![CDATA[M. O]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Efficient Dispersal of Information for Security, Load Balancing and Fault Tolerance]]></article-title>
<source><![CDATA[Journal of the ACM]]></source>
<year>1989</year>
<volume>38</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>335-348</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rodrigues]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Liskov]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[High Availability in DHT's: Erasure Coding vs Replication]]></article-title>
<source><![CDATA[]]></source>
<year>2005</year>
<conf-name><![CDATA[ Peer-to-Peer Systems IV. 4th International Workshop on Peer-to-Peer Systems, Lecture Notes on Computer Science]]></conf-name>
<conf-loc> </conf-loc>
<page-range>226-239</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rowstron]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Druschel]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Storage management and caching in PAST, a large-scale, persistent, peer-to-peer storage utility]]></article-title>
<source><![CDATA[ACM SIGOPS Operating Systems Review]]></source>
<year>2001</year>
<volume>35</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>188-201</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Quezada-Naquid]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Marcelín-Jiménez]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[López-Guerrero]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Service Policies for a Storage Services Dispatcher in a Distributed Fault-Tolerant Storage Network and their Performance Evaluation]]></article-title>
<source><![CDATA[]]></source>
<year>2007</year>
<conf-name><![CDATA[ Canadian Conference on Electrical and Computer Engineering (CCECE '07)]]></conf-name>
<conf-loc>Vancouver </conf-loc>
<page-range>34-40</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="">
<source><![CDATA[OMNeT++: Discrete Event Simulation System]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yianilos]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Sobti]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[The Evolving Field of Distributed Storage]]></article-title>
<source><![CDATA[IEEE Internet Computing]]></source>
<year>2001</year>
<volume>5</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>3539</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
