Super-peer-based routing strategies for RDF-based peer-to-peer networks

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Autoren

  • Wolfgang Nejdl
  • Martin Wolpers
  • Wolf Siberski
  • Christoph Schmitz
  • Mario Schlosser
  • Ingo Brunkhorst
  • Alexander Löser

Organisationseinheiten

Externe Organisationen

  • Technische Universität Berlin
Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Seiten (von - bis)177-186
Seitenumfang10
FachzeitschriftWeb Semantics
Jahrgang1
Ausgabenummer2
Frühes Online-Datum26 Feb. 2004
PublikationsstatusVeröffentlicht - 2004

Abstract

RDF-based P2P networks have a number of advantages compared to simpler P2P networks such as Napster, Gnutella or to approaches based on distributed indices on binary keys such as CAN and CHORD. RDF-based P2P networks allow complex and extendable descriptions of resources instead of fixed and limited ones, and they provide complex query facilities against these metadata instead of simple keyword-based searches. In this paper, we will discuss RDF-based P2P networks like Edutella as a specific example of a new type of P2P networks-schema-based P2P networks-and describe the use of super-peer based topologies for these networks. Super-peer based networks can provide better scalability than broadcast based networks, and provide support for inhomogeneous schema-based networks, with different metadata schemas and ontologies (crucial for the Semantic Web). Based on (dynamic) metadata routing indices, stated in RDF, the super-peer network supports sophisticated routing and distribution strategies, as well as preparing the ground for advanced mediation and clustering functionalities.

ASJC Scopus Sachgebiete

Zitieren

Super-peer-based routing strategies for RDF-based peer-to-peer networks. / Nejdl, Wolfgang; Wolpers, Martin; Siberski, Wolf et al.
in: Web Semantics, Jahrgang 1, Nr. 2, 2004, S. 177-186.

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Nejdl, W, Wolpers, M, Siberski, W, Schmitz, C, Schlosser, M, Brunkhorst, I & Löser, A 2004, 'Super-peer-based routing strategies for RDF-based peer-to-peer networks', Web Semantics, Jg. 1, Nr. 2, S. 177-186. https://doi.org/10.1016/j.websem.2003.11.004
Nejdl, W., Wolpers, M., Siberski, W., Schmitz, C., Schlosser, M., Brunkhorst, I., & Löser, A. (2004). Super-peer-based routing strategies for RDF-based peer-to-peer networks. Web Semantics, 1(2), 177-186. https://doi.org/10.1016/j.websem.2003.11.004
Nejdl W, Wolpers M, Siberski W, Schmitz C, Schlosser M, Brunkhorst I et al. Super-peer-based routing strategies for RDF-based peer-to-peer networks. Web Semantics. 2004;1(2):177-186. Epub 2004 Feb 26. doi: 10.1016/j.websem.2003.11.004
Nejdl, Wolfgang ; Wolpers, Martin ; Siberski, Wolf et al. / Super-peer-based routing strategies for RDF-based peer-to-peer networks. in: Web Semantics. 2004 ; Jahrgang 1, Nr. 2. S. 177-186.
Download
@article{f71642fd3cd34c2787f5cc159fca64ae,
title = "Super-peer-based routing strategies for RDF-based peer-to-peer networks",
abstract = "RDF-based P2P networks have a number of advantages compared to simpler P2P networks such as Napster, Gnutella or to approaches based on distributed indices on binary keys such as CAN and CHORD. RDF-based P2P networks allow complex and extendable descriptions of resources instead of fixed and limited ones, and they provide complex query facilities against these metadata instead of simple keyword-based searches. In this paper, we will discuss RDF-based P2P networks like Edutella as a specific example of a new type of P2P networks-schema-based P2P networks-and describe the use of super-peer based topologies for these networks. Super-peer based networks can provide better scalability than broadcast based networks, and provide support for inhomogeneous schema-based networks, with different metadata schemas and ontologies (crucial for the Semantic Web). Based on (dynamic) metadata routing indices, stated in RDF, the super-peer network supports sophisticated routing and distribution strategies, as well as preparing the ground for advanced mediation and clustering functionalities.",
keywords = "Distributed RDF repositories, Peer-to-Peer, Routing protocols, Schema-based routing, Semantic networks, Semantic Web",
author = "Wolfgang Nejdl and Martin Wolpers and Wolf Siberski and Christoph Schmitz and Mario Schlosser and Ingo Brunkhorst and Alexander L{\"o}ser",
year = "2004",
doi = "10.1016/j.websem.2003.11.004",
language = "English",
volume = "1",
pages = "177--186",
journal = "Web Semantics",
issn = "1570-8268",
publisher = "Elsevier",
number = "2",

}

Download

TY - JOUR

T1 - Super-peer-based routing strategies for RDF-based peer-to-peer networks

AU - Nejdl, Wolfgang

AU - Wolpers, Martin

AU - Siberski, Wolf

AU - Schmitz, Christoph

AU - Schlosser, Mario

AU - Brunkhorst, Ingo

AU - Löser, Alexander

PY - 2004

Y1 - 2004

N2 - RDF-based P2P networks have a number of advantages compared to simpler P2P networks such as Napster, Gnutella or to approaches based on distributed indices on binary keys such as CAN and CHORD. RDF-based P2P networks allow complex and extendable descriptions of resources instead of fixed and limited ones, and they provide complex query facilities against these metadata instead of simple keyword-based searches. In this paper, we will discuss RDF-based P2P networks like Edutella as a specific example of a new type of P2P networks-schema-based P2P networks-and describe the use of super-peer based topologies for these networks. Super-peer based networks can provide better scalability than broadcast based networks, and provide support for inhomogeneous schema-based networks, with different metadata schemas and ontologies (crucial for the Semantic Web). Based on (dynamic) metadata routing indices, stated in RDF, the super-peer network supports sophisticated routing and distribution strategies, as well as preparing the ground for advanced mediation and clustering functionalities.

AB - RDF-based P2P networks have a number of advantages compared to simpler P2P networks such as Napster, Gnutella or to approaches based on distributed indices on binary keys such as CAN and CHORD. RDF-based P2P networks allow complex and extendable descriptions of resources instead of fixed and limited ones, and they provide complex query facilities against these metadata instead of simple keyword-based searches. In this paper, we will discuss RDF-based P2P networks like Edutella as a specific example of a new type of P2P networks-schema-based P2P networks-and describe the use of super-peer based topologies for these networks. Super-peer based networks can provide better scalability than broadcast based networks, and provide support for inhomogeneous schema-based networks, with different metadata schemas and ontologies (crucial for the Semantic Web). Based on (dynamic) metadata routing indices, stated in RDF, the super-peer network supports sophisticated routing and distribution strategies, as well as preparing the ground for advanced mediation and clustering functionalities.

KW - Distributed RDF repositories

KW - Peer-to-Peer

KW - Routing protocols

KW - Schema-based routing

KW - Semantic networks

KW - Semantic Web

UR - http://www.scopus.com/inward/record.url?scp=27544471535&partnerID=8YFLogxK

U2 - 10.1016/j.websem.2003.11.004

DO - 10.1016/j.websem.2003.11.004

M3 - Article

AN - SCOPUS:27544471535

VL - 1

SP - 177

EP - 186

JO - Web Semantics

JF - Web Semantics

SN - 1570-8268

IS - 2

ER -

Von denselben Autoren