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

RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices 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 previous papers, we have described the Edutella infrastructure and different kinds of Edutella peers implementing such an RDFbased P2P network. In this paper we will discuss these RDF-based P2P networks 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 do provide perfect support for inhomogeneous schema-based networks, which support different metadata schemas and ontologies (crucial for the Seman...

• Type: Conference
• Year: 2003
• Where: WWW
• Authors: Alexander Löser, Christoph Schmitz, Ingo Brunkhorst, Mario T. Schlosser, Martin Wolpers, Wolf Siberski, Wolfgang Nejdl
• Keywords: Internet Technology, RDF-based P2P Networks, Schema-based P2p Networks, Simpler P2p Networks, WWW 2003