Among the novel metrics used to study the relative importance of nodes in complex
networks, k-core decomposition has found a number of applications in areas as diverse as …

Large-scale overlay networks have become crucial ingredients of fully-decentralized
applications and peer-to-peer systems. Depending on the task at hand, overlay networks are …

Proximity measures quantify the closeness or similarity between nodes in a social network
and form the basis of a range of applications in social sciences, business, information …

Gossip-based algorithms were first introduced for reliably disseminating data in large-scale
distributed systems. However, their simplicity, robustness, and flexibility make them attractive …

Gossiping has been identified as a useful building block for the development of large-scale,
decentralized collaborative systems. With gossiping, individual nodes periodically interact …

In this paper, we present the design, implementation and evaluation of Rappel, a peer-to-
peer feed-based publish-subscribe service. By using a combination of probabilistic and …

In the Interplanetary File System (IPFS), consumers can help each other protect data against
hardware failures and improve data availability through replication. While previous …

As computer systems have become more complex, numerous competing approaches have
been proposed for these systems to self-configure, self-manage, self-repair, etc. such that …

We propose and investigate a gossip based, social principles and behavior inspired
decentralized mechanism (GoDisco) to disseminate information in online social community …

The peer sampling service is a middleware service that provides random samples from a
large decentralized network to support gossip-based applications such as multicast, data …