Efficient Topology-Aware Overlay Network

dc.contributor.authorWaldvogel, Marcel
dc.contributor.authorRinaldi, Robertodeu
dc.date.accessioned2011-03-24T16:09:35Zdeu
dc.date.available2011-03-24T16:09:35Zdeu
dc.date.issued2003deu
dc.description.abstractPeer-to-peer (P2P) networking has become a household word in the past few years, being marketed as a work-around for server scalability problems and wonder drug'' to achieve resilience. Current widely-used P2P networks rely on central directory servers or massive message flooding, clearly not scalable solutions. Distributed Hash Tables (DHT) are expected to eliminate flooding and central servers, but can require many long-haul message deliveries. We introduce Mithos, an content-addressable overlay network that only uses minimal routing information and is directly suitable as an underlay network for P2P systems, both using traditional and DHT addressing. Unlike other schemes, it also efficiently provides locality-aware connectivity, thereby ensuring that a message reaches its destination with minimal overhead. Mithos provides for highly efficient forwarding, making it suitable for use in high-throughput applications. Paired with its ability to have addresses directly mapped into a subspace of the IPv6 address space, it provides a potential candidate for native deployment. Additionally, Mithos can be used to support third-party triangulation to quickly select a close-by replica of data or services.eng
dc.description.versionpublished
dc.format.mimetypeapplication/pdfdeu
dc.identifier.citationFirst publ. in: Computer Communication Review 33 (2003), 1deu
dc.identifier.doi10.1145/774763.774779
dc.identifier.ppn261975188deu
dc.identifier.urihttp://kops.uni-konstanz.de/handle/123456789/6109
dc.language.isoengdeu
dc.legacy.dateIssued2007deu
dc.rightsterms-of-usedeu
dc.rights.urihttps://rightsstatements.org/page/InC/1.0/deu
dc.subject.ddc004deu
dc.titleEfficient Topology-Aware Overlay Networkeng
dc.typeJOURNAL_ARTICLEdeu
dspace.entity.typePublication
kops.citation.bibtex
@article{Waldvogel2003Effic-6109,
  year={2003},
  doi={10.1145/774763.774779},
  title={Efficient Topology-Aware Overlay Network},
  number={1},
  volume={33},
  journal={Computer Communication Review},
  author={Waldvogel, Marcel and Rinaldi, Roberto}
}
kops.citation.iso690WALDVOGEL, Marcel, Roberto RINALDI, 2003. Efficient Topology-Aware Overlay Network. In: Computer Communication Review. 2003, 33(1). Available under: doi: 10.1145/774763.774779deu
kops.citation.iso690WALDVOGEL, Marcel, Roberto RINALDI, 2003. Efficient Topology-Aware Overlay Network. In: Computer Communication Review. 2003, 33(1). Available under: doi: 10.1145/774763.774779eng
kops.citation.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/6109">
    <dcterms:abstract xml:lang="eng">Peer-to-peer (P2P) networking has become a household word in the past few years, being marketed as a work-around for server scalability problems and wonder drug'' to achieve resilience. Current widely-used P2P networks rely on central directory servers or massive message flooding, clearly not scalable solutions. Distributed Hash Tables (DHT) are expected to eliminate flooding and central servers, but can require many long-haul message deliveries. We introduce Mithos, an content-addressable overlay network that only uses minimal routing information and is directly suitable as an underlay network for P2P systems, both using traditional and DHT addressing. Unlike other schemes, it also efficiently provides locality-aware connectivity, thereby ensuring that a message reaches its destination with minimal overhead. Mithos provides for highly efficient forwarding, making it suitable for use in high-throughput applications. Paired with its ability to have addresses directly mapped into a subspace of the IPv6 address space, it provides a potential candidate for native deployment. Additionally, Mithos can be used to support third-party triangulation to quickly select a close-by replica of data or services.</dcterms:abstract>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6109"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6109/1/waldvogel02efficient.pdf"/>
    <dcterms:title>Efficient Topology-Aware Overlay Network</dcterms:title>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:09:35Z</dcterms:available>
    <dc:contributor>Rinaldi, Roberto</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6109/1/waldvogel02efficient.pdf"/>
    <dc:language>eng</dc:language>
    <dc:rights>terms-of-use</dc:rights>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:issued>2003</dcterms:issued>
    <dc:format>application/pdf</dc:format>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:09:35Z</dc:date>
    <dcterms:bibliographicCitation>First publ. in: Computer Communication Review 33 (2003), 1</dcterms:bibliographicCitation>
    <dc:creator>Waldvogel, Marcel</dc:creator>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Waldvogel, Marcel</dc:contributor>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:creator>Rinaldi, Roberto</dc:creator>
  </rdf:Description>
</rdf:RDF>
kops.description.openAccessopenaccessgreen
kops.flag.knbibliographyfalse
kops.identifier.nbnurn:nbn:de:bsz:352-opus-23252deu
kops.opus.id2325deu
kops.sourcefieldComputer Communication Review. 2003, <b>33</b>(1). Available under: doi: 10.1145/774763.774779deu
kops.sourcefield.plainComputer Communication Review. 2003, 33(1). Available under: doi: 10.1145/774763.774779deu
kops.sourcefield.plainComputer Communication Review. 2003, 33(1). Available under: doi: 10.1145/774763.774779eng
relation.isAuthorOfPublication84e1ce62-b720-46ef-b156-ce00a632dd4f
relation.isAuthorOfPublication.latestForDiscovery84e1ce62-b720-46ef-b156-ce00a632dd4f
source.bibliographicInfo.issue1
source.bibliographicInfo.volume33
source.periodicalTitleComputer Communication Review

Dateien

Originalbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
waldvogel02efficient.pdf
Größe:
536.56 KB
Format:
Adobe Portable Document Format
waldvogel02efficient.pdf
waldvogel02efficient.pdfGröße: 536.56 KBDownloads: 691