Results 1 - 7 of 7

HyperCuP - Hypercubes, Ontologies and Efficient

by Search On Networks, Mario Schlosser, Michael Sintek, Stefan Decker, Wolfgang Nejdl - LNCS , 2002
"... Peer-to-peer networks are envisioned to be deployed for a wide range of applications. However, P2P networks evolving in an unorganized manner suffer from serious scalability problems, limiting the number of nodes in the network, creating network overload and pushing search times to unacceptable ..."
Abstract - Add to MetaCart
limits. We address these problems by imposing a deterministic shape on P2P networks: We propose a graph topology which allows for very efficient broadcast and search, and we describe a broadcast algorithm that exploits the topology to reach all nodes in the network with the minimum number of messages

HyperCuP - Shaping Up Peer-to-Peer Networks

by Mario Schlosser, Michael Sintek, Stefan Decker, Wolfgang Nejdl , 2002
"... Peer-to-peer networks are envisioned to be deployed for a wide range of applications. However, P2P networks evolving in an unorganized manner suffer from serious scalability problems, limiting the number of nodes in the network, creating network overload and pushing search times to unacceptable limi ..."
Abstract - Cited by 8 (3 self) - Add to MetaCart
limits. We address these problems by imposing a deterministic shape on P2P networks: We propose a graph topology which allows for very efficient broadcast and search, and we describe a broadcast algorithm that exploits the topology to reach all nodes in the network with the minimum amount of messages

HyperCuP - Hypercubes, Ontologies and Efficient Search on P2P Networks

by Mario Schlosser, Michael Sintek, Stefan Decker, Wolfgang Nejdl - LNCS , 2002
"... Peer-to-peer networks are envisioned to be deployed for a wide range of applications. However, P2P networks evolving in an unorganized manner suffer from serious scalability problems, limiting the number of nodes in the network, creating network overload and pushing search times to unacceptable limi ..."
Abstract - Cited by 62 (5 self) - Add to MetaCart
limits. We address these problems by imposing a deterministic shape on P2P networks: We propose a graph topology which allows for very efficient broadcast and search, and we describe a broadcast algorithm that exploits the topology to reach all nodes in the network with the minimum number of messages

HyperCuP Lightweight Implementation A Universal Solution for Making Application Distributed

by Sławomir Grzonkowski
"... Contemporary applications need an efficient solution for communication to implement robust information retrieval mechanisms and fault tolerant networks. Apart from implementing an robust, scalable communication protocol the solution should be accessible with easy to use API that would not require to ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
distributed identity management system based on social networking. We describe an architecture of the HyperCuP Lightweight Implementation. We show how to deploy it with one’s own application and how to take advantage of the established hypercube topology.

Progressive Distributed Top-k Retrieval in Peer-to-Peer Networks

by Wolf-tilo Balke, Wolfgang Nejdl, Wolf Siberski, Uwe Thaden , 2005
"... Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the database objects' degree of match for each different query predicate and returning the best matching objects only. In p ..."
Abstract - Cited by 58 (10 self) - Add to MetaCart
in the context of distributed peer-to-peer information infrastructures and show how to extend the limited query processing in current peer-to-peer networks by allowing the distributed processing of top-k queries, while maintaining a minimum of data traffic. Relying on a super-peer backbone organized in the HyperCuP

Performance Modelling and Evaluation of Event-Condition-Action Rules on RDF in P2P networks

by George Papamarkos, Ra Poulovassilis, Peter T. Wood
"... This paper studies the performance and scalability aspects of processing Event-Condition-Action (ECA) rules on RDF metadata in peer-to-peer (P2P) environments. This work has been motivated by the increasing use of RDF in distributed web-based applications that require timely notification and propaga ..."
Abstract - Add to MetaCart
, and the analytical results are compared with analogous experiments conducted with the simulation, which show good agreement. Our overall conclusions are that if a HyperCup topology is used for interconnecting the superpeers, then ECA rule processing on RDF metadata in P2P environments shows good scalability

RDF-based Peer-to-Peer-Networks for Distributed (Learning) Repositories

by Wolfgang Nejdl, Mario Schlosser, Wolf Siberski, Martin Wolpers, Bernd Simon, Stefan Decker, Michael Sintek , 2002
"... Metadata for the World Wide Web are important, but metadata for Peer-to-Peer (P2P) networks are absolutely crucial. In this paper we discuss the open source project Edutella, which combines semantic web and peer-to-peer technologies in order to make distributed learning repositories possible and use ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
-based peer-to-peer network, Edutella extends conventional peer-to-peer networks by allowing different and extensible schemas to describe peer content, a necessary feature for information rich peer-to-peer networks. We describe and discuss the HyperCuP topology, which implements an optimal broadcast topology
Results 1 - 7 of 7