Replica placement and location using distributed hash tables

Waldvogel, Marcel; Bauer, Daniel; Hurley, Paul

Replica placement and location using distributed hash tables

Files

DynReplica.pdf(240.08 KB)

Date

2007

Authors

Waldvogel, Marcel

Bauer, Daniel

Hurley, Paul

Publication type

Contribution to a conference collection

Published in

32nd IEEE Conference on Local Computer Networks, LCN 2007 : Dublin, Ireland, October 15 - 18, 2007 ; including 2007 Workshops ON-MOVE, P2MNet, SenseApp, WLN, WNM, WNS / IEEE Computer Society (ed.). - Los Alamos, CA : IEEE Computer Society, 2007. - pp. 315-324. - ISBN 978-0-7695-3000-0

Abstract

Interest in distributed storage is fueled by demand for reliability and resilience combined with decreasing hardware costs. Peer-to-peer storage networks based on distributed hash tables are attractive for their efficient use of resources and result- ing performance. The placement and subsequent efficient location of replicas in such systems remain open problems, especially (1) the requirement to update replicated content, (2) working in the absence of global information, and (3) determination of the locations in a dynamic system without introducing single points of failure.
We present and evaluate a novel and versatile technique, replica enumeration, which allows for controlled replication and replica access. The possibility of enumerating and addressing individual replicas allows dynamic updates as well as superior performance without burdening the network with state informa- tion, yet taking advantage of locality information when available. We simulate, analyze, and prove properties of the system, and discuss some applications.

Subject (DDC)

004 Computer Science

Cite This

ISO 690

WALDVOGEL, Marcel, Daniel BAUER, Paul HURLEY, 2007. Replica placement and location using distributed hash tables. In: IEEE COMPUTER SOCIETY, , ed.. 32nd IEEE Conference on Local Computer Networks, LCN 2007 : Dublin, Ireland, October 15 - 18, 2007 ; including 2007 Workshops ON-MOVE, P2MNet, SenseApp, WLN, WNM, WNS. Los Alamos, CA:IEEE Computer Society, pp. 315-324. ISBN 978-0-7695-3000-0

BibTex

@inproceedings{Waldvogel2007Repli-12633,
  year={2007},
  title={Replica placement and location using distributed hash tables},
  isbn={978-0-7695-3000-0},
  publisher={IEEE Computer Society},
  address={Los Alamos, CA},
  booktitle={32nd IEEE Conference on Local Computer Networks, LCN 2007 : Dublin, Ireland, October 15 - 18, 2007 ; including 2007 Workshops ON-MOVE, P2MNet, SenseApp, WLN, WNM, WNS},
  pages={315--324},
  editor={IEEE Computer Society},
  author={Waldvogel, Marcel and Bauer, Daniel and Hurley, Paul}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/12633">
    <dc:creator>Bauer, Daniel</dc:creator>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:creator>Waldvogel, Marcel</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/12633"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/12633/1/DynReplica.pdf"/>
    <dcterms:abstract xml:lang="eng">Interest in distributed storage is fueled by demand for reliability and resilience combined with decreasing hardware costs. Peer-to-peer storage networks based on distributed hash tables are attractive for their efficient use of resources and result- ing performance. The placement and subsequent efficient location of replicas in such systems remain open problems, especially (1) the requirement to update replicated content, (2) working in the absence of global information, and (3) determination of the locations in a dynamic system without introducing single points of failure.&lt;br /&gt;We present and evaluate a novel and versatile technique, replica enumeration, which allows for controlled replication and replica access. The possibility of enumerating and addressing individual replicas allows dynamic updates as well as superior performance without burdening the network with state informa- tion, yet taking advantage of locality information when available. We simulate, analyze, and prove properties of the system, and discuss some applications.</dcterms:abstract>
    <dcterms:issued>2007</dcterms:issued>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-05-12T07:37:20Z</dcterms:available>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/12633/1/DynReplica.pdf"/>
    <dc:language>eng</dc:language>
    <dc:contributor>Hurley, Paul</dc:contributor>
    <dcterms:title>Replica placement and location using distributed hash tables</dcterms:title>
    <dc:rights>terms-of-use</dc:rights>
    <dc:contributor>Bauer, Daniel</dc:contributor>
    <dc:creator>Hurley, Paul</dc:creator>
    <dcterms:bibliographicCitation>First publ. in: IEEE Computer society, 32nd IEEE Conference on Local Computer Networks, 2007, pp.315-324</dcterms:bibliographicCitation>
    <dc:contributor>Waldvogel, Marcel</dc:contributor>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-05-12T07:37:20Z</dc:date>
  </rdf:Description>
</rdf:RDF>

Bibliography of Konstanz

Yes