We study how to spread k tokens of information to every node on an n-node dynamic
network, the edges of which are changing at each round. This basic gossip problem can be …

We introduce projection analysis-a new technique to analyze the stop** time of gossip
protocols that are based on random linear network coding (RLNC). Projection analysis …

Motivated by the need for robust and fast distributed computation in highly dynamic Peer-to-
Peer (P2P) networks, we study algorithms for the fundamental distributed agreement …

In this work, we study the fundamental naming and counting problems (and some variations)
in networks that are anonymous, unknown, and possibly dynamic. In counting, nodes must …

The paper investigates efficient distributed computation in dynamic networks in which the
network topology changes (arbitrarily) from round to round. Random walks are a …

We study lower bounds on information dissemination in adversarial dynamic networks.
Initially, k pieces of information (henceforth called tokens) are distributed among n nodes …

End-to-end communication over the network layer (or data link in overlay networks) is one of
the most important communication tasks in every communication network, including legacy …

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 …

We consider the well-studied rumor spreading model in which nodes contact a random
neighbor in each round in order to push or pull the rumor. Unlike most previous works which …

In this paper we consider dynamic networks that can change over time. Often, such networks
have a repetitive pattern despite constant and otherwise unpredictable changes. Based on …