One of the most striking properties of the Internet is its flexibility to accommodate features it
was not conceived for. Among the most significant examples, in this survey we consider the …

The decentralized peer-to-peer (P2P) technique has been widely used to implement
scalable file sharing systems. It organizes nodes in a system into a structured or …

We quantify the effectiveness of random walks for searching and construction of
unstructured peer-to-peer (P2P) networks. We have identified two cases where the use of …

We show that complex (scale-free) network topologies naturally emerge from hyperbolic
metric spaces. Hyperbolic geometry facilitates maximally efficient greedy forwarding in these …

Resource location or discovery is a key issue for Grid systems in which applications are
composed of hardware and software resources that need to be located. Classical …

This work proposes and studies the properties of a hybrid sampling scheme that mixes
independent uniform node sampling and random walk (RW)-based crawling. We show that …

We introduce stochastic time-dependency in evolving graphs: starting from an arbitrary initial
edge probability distribution, at every time step, every edge changes its state (existing or not) …

Markovian evolving graphs are dynamic-graph models where the links among a fixed set of
nodes change during time according to an arbitrary Markovian rule. They are extremely …

Cloud computing provides on-demand access to affordable hardware (eg, multi-core CPUs,
GPUs, disks, and networking equipment) and software (eg, databases, application servers …

Performing random walks in networks is a fundamental primitive that has found applications
in many areas of computer science, including distributed computing. In this article, we focus …