Routing and Data Location in Overlay Peer-to-Peer Networks

Rinaldi, Roberto; Waldvogel, Marcel

Routing and Data Location in Overlay Peer-to-Peer Networks

Dateien

rinaldi02routing_techreport.pdfGröße: 1.47 MBDownloads: 507

Datum

2002

Autor:innen

Rinaldi, Roberto

Waldvogel, Marcel

Schriftenreihe

IBM Research Report

URI (zitierfähiger Link)

http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-23392

Link zur Lizenz

Attribution-NonCommercial-NoDerivs 2.0 Generic

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Working Paper/Technical Report

Publikationsstatus

Published

Zusammenfassung

Peer-to-peer overlay networks offer a novel platform for a variety of scalable and decentralized distributed applications. Systems known as Distributed Hash Tables provide efficient and fault-tolerant routing, object location and load balancing within a self-organizing overlay network. The alternative solution we propose is an overlay location and routing infrastructure that efficiently uses minimal local information to achieve global routing. The main novelty of our approach consists in fitting the overlay network in a hyper-toroidal space and building it with locality awareness. Thanks to this specific network construction phase, forwarding decisions always take into account locality preservation in an implicit manner, leading to significant improvements in end-to-end delays and path lengths.

With this overlay network it is possible to obtain global routing by adding minimal information to each single host and by making only local forwarding decisions. Our analysis shows how the average path length coming from the overlay routing is close to the optimal average path length of the underlaying network: on average, they only differ by a factor of 2. Furthermore, locality preservation has a significant impact on the end-to-end latency of the routing process as well. Such a system can be viewed as novel in the field of peer-to-peer data location and addressing, allowing the development of new applications in a real low-latency environment.

Fachgebiet (DDC)

004 Informatik

Zitieren

ISO 690

RINALDI, Roberto, Marcel WALDVOGEL, 2002. Routing and Data Location in Overlay Peer-to-Peer Networks

BibTex

@techreport{Rinaldi2002Routi-5982,
  year={2002},
  series={IBM Research Report},
  title={Routing and Data Location in Overlay Peer-to-Peer Networks},
  number={RZ-3433, July 2002},
  author={Rinaldi, Roberto and Waldvogel, Marcel}
}

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/5982">
    <dc:creator>Rinaldi, Roberto</dc:creator>
    <dc:format>application/pdf</dc:format>
    <dcterms:title>Routing and Data Location in Overlay Peer-to-Peer Networks</dcterms:title>
    <dcterms:issued>2002</dcterms:issued>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:32Z</dc:date>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Rinaldi, Roberto</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:32Z</dcterms:available>
    <dc:creator>Waldvogel, Marcel</dc:creator>
    <dcterms:abstract xml:lang="eng">Peer-to-peer overlay networks offer a novel platform for a variety of scalable and decentralized distributed applications. Systems known as Distributed Hash Tables provide efficient and fault-tolerant routing, object location and load balancing within a self-organizing overlay network. The alternative solution we propose is an overlay location and routing infrastructure that efficiently uses minimal local information to achieve global routing. The main novelty of our approach consists in fitting the overlay network in a hyper-toroidal space and building it with locality awareness. Thanks to this specific network construction phase, forwarding decisions always take into account locality preservation in an implicit manner, leading to significant improvements in end-to-end delays and path lengths.&lt;br /&gt;&lt;br /&gt;With this overlay network it is possible to obtain global routing by adding minimal information to each single host and by making only local forwarding decisions. Our analysis shows how the average path length coming from the overlay routing is close to the optimal average path length of the underlaying network: on average, they only differ by a factor of 2. Furthermore, locality preservation has a significant impact on the end-to-end latency of the routing process as well. Such a system can be viewed as novel in the field of peer-to-peer data location and addressing, allowing the development of new applications in a real low-latency environment.</dcterms:abstract>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5982"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5982/1/rinaldi02routing_techreport.pdf"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5982/1/rinaldi02routing_techreport.pdf"/>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <dc:contributor>Waldvogel, Marcel</dc:contributor>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:language>eng</dc:language>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Nein