Motivated by the need for designing efficient and robust fully-distributed computation in
highly dynamic networks such as Peer-to-Peer (P2P) networks, we study distributed …

This paper proposes a compression-based architecture for bit-write reduction in emerging
non-volatile memories (NVMs). Bit-write reduction has many practical benefits, including …

The skip list is an elegant dictionary data structure that is commonly deployed in RAM. A skip
list with N elements supports searches, inserts, and deletes in O (log N) operations with high …

Dynamic Networks. Large real-world networks are inherently very dynamic: the participants
in peer-to-peer (P2P) networks change over time, mobile nodes in wireless networks move …

Peer-to-peer systems rely on a scalable overlay network that enables efficient routing
between its members. Hypercubic topologies facilitate such operations while each node …

The Chord peer-to-peer system is considered, together with CAN, Tapestry and Pastry, as
one of the pioneering works on peer-to-peer distributed hash tables (DHT) that inspired a …

Until now, the analysis of fault tolerance of peer-to-peer systems usually only covers random
faults of some kind. Contrary to traditional algorithmic research, faults as well as joins and …

We present Corona, a deterministic self-stabilizing algorithm for skip list construction in
structured overlay networks. Corona operates in the low-atomicity message-passing …

We present a fully-distributed self-healing algorithm dex that maintains a constant degree
expander network in a dynamic setting. To the best of our knowledge, our algorithm provides …

Overlay networks are expected to operate in hostile environments where node and link
failures are commonplace. One way to make overlay networks robust is to design self …