Pastry is an algorithm that provides a scalable distributed hash table over an underlying P2P
network. Several implementations of Pastry are available and have been applied in practice …

The problem of maintaining structured peer-to-peer (P2P) overlay networks in the presence
of concurrent joins and failures of nodes is the subject of intensive research. The various …

Protocols implemented on overlay networks in a peer-to-peer (P2P) setting promise
flexibility, performance, and scalability due to the possibility for nodes to join and leave the …

Peer-to-peer protocols for maintaining distributed hash tables, such as Pastry or Chord,
have become popular for a class of Internet applications. While such protocols promise …

As a consequence of the rise of cloud computing, the reliability of network protocols is
gaining increasing attention. However, formal methods have revealed inconsistencies in …

Formal reasoning on Peer-to-Peer (P2P) systems is an intimidating task. This paper focuses
on broadcast algorithms for Content Addressable Network (CAN). Since these algorithms …

Due to their nature, Peer-to-Peer (P2P) systems are subject to a wide range of security
issues. In this paper, we focus on a specific security property, called the root authenticity (or …

Kademlia is the most popular peer-to-peer distributed hash table (DHT) currently in use. It
offers a number of desirable features that result from the use of a notion of distance between …

A simple model of multi-hop communication in ad-hoc networks is considered. Similar
models are often adopted for studying energy efficiency and load balancing of different …

Peer-to-Peer (P2P) systems can be seen as highly dynamic distributed systems designed for
very specific purposes, such as resources sharing in collaborative settings. Because of their …