We present several optimizations aimed at improving the object location performance of locality-aware structured peer-to-peer overlays. We present simulation results that demonstrate the effectiveness of these optimizations in Tapestry, and discuss their usage of the overall storage resources of the system.

In this paper, we attempt to provide an extensive and detailed summary of existing work in the area of Structured Peer-to-Peer (P2P) systems resilience. The coverage in this paper includes resilience metrics, threats, approaches to analyze resilience and enhancements proposed to individual system design features to enhance resilience. Specifically, we first discuss important design features of ...

During this work a simulator of a mechanism of searching in collaborative application is made to manage the content through the WWW with structured Peer-to-Peer networks. The principal contribution of this work is one mechanism that joins a metadata in the queries that are sent by the DHT Routing. The Semantic Routing proposed reduces the number of the average hops to reach an object or a docum...

In this paper, we propose an approach to analyze the resilience to failures of structured P2P systems. The approach is Markov-chain based, and can be applied to systems with relatively stable size and uniformly distributed nodes. We apply our method to several well-known structured P2P systems. We find that finger neighbors and special neighbors have different influences on the resilience featu...

Structured peer-to-peer networks are highly scalable, efficient, and reliable. These characteristics are achieved by deterministically replicating and recalling content within a widely distributed and decentralized network. One practical limitation of these networks is that they are frequently subject to Sybil attacks: malicious parties can compromise the network by generating and controlling l...

The OpenKnowledge project aims at knowledge sharing through open and flexible peer interactions. Within this project, we are developing a system that supports searching, developing and sharing of interactions/workflows consisting of roles implemented by software that can be shared and executed by peers. Its main requirements are openness, scalability, decentralization and robustness. Part of th...

In this paper we present p2pCM, a new distributed componentoriented model aimed to structured peer-to-peer grid environments. Our model offers innovative contributions like a lightweight distributed container model, an adaptive component activation mechanism, which takes into account network proximity, and a decentralized component location and deployment service. We believe that all of the fea...

Multidimensional Scaling (MDS) is a technique for dimensionality reduction widely used in the field of data-mining. For P2P data networks, it holds the potential to provide an intuitive way to browse and explore heterogeneous data distributed over the system. Current MDS approaches are dependent on a centralized instance (controller) and can therefore not be used in decentralized environments. ...

Various peer-to-peer (P2P) architectures for ad-hoc networks have been proposed over the last few years. Most of them are unstructured and use some form of flooding to locate content, because the physical constraints of the underlying network make the construction of arbitrary application-layer overlays impractical. In this paper, we study the problem of applying distributed hash tables (DHT) t...

17