Over the Internet today, computing and communications environments are significantly more
complex and chaotic than classical distributed systems, lacking any centralized organization …

Distributed computer architectures labeled" peer-to-peer" are designed for the sharing of
computer resources (content, storage, CPU cycles) by direct exchange, rather than requiring …

Nakamoto's famous blockchain protocol enables achieving consensus in a so-called
permissionless setting—anyone can join (or leave) the protocol execution, and the protocol …

A fundamental problem that confronts peer-to-peer applications is the efficient location of the
node that stores a desired data item. This paper presents Chord, a distributed lookup …

Provides a modern mathematical approach to the design of communication networks for
graduate students, blending control, optimization, and stochastic network theories. A broad …

In tree-based multicast systems, a relatively small number of interior nodes carry the load of
forwarding multicast messages. This works well when the interior nodes are highly …

The dynamics of peer participation, or churn, are an inherent property of Peer-to-Peer (P2P)
systems and critical for design and evaluation. Accurately characterizing churn requires …

This paper addresses the problem of churn--the continuous process of node arrival and
departure--in distributed hash tables (DHTs). We argue that DHTs should perform lookups …

The main challenge in P2P computing is to design and implement a robust and scalable
distributed system composed of inexpensive, individually unreliable computers in unrelated …

Peer-to-peer (P2P) file sharing accounts for an astonishing volume of current Internet traffic.
This paper probes deeply into modern P2P file sharing systems and the forces that drive …