Details
| Original language | English |
|---|---|
| Pages (from-to) | 177-186 |
| Number of pages | 10 |
| Journal | Web Semantics |
| Volume | 1 |
| Issue number | 2 |
| Early online date | 26 Feb 2004 |
| Publication status | Published - 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.
Keywords
- Distributed RDF repositories, Peer-to-Peer, Routing protocols, Schema-based routing, Semantic networks, Semantic Web
ASJC Scopus subject areas
- Computer Science(all)
- Software
- Computer Science(all)
- Human-Computer Interaction
- Computer Science(all)
- Computer Networks and Communications
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: Web Semantics, Vol. 1, No. 2, 2004, p. 177-186.
Research output: Contribution to journal › Article › Research › peer review
}
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 -