8 research outputs found
Storage and Search in Dynamic Peer-to-Peer Networks
We study robust and efficient distributed algorithms for searching, storing,
and maintaining data in dynamic Peer-to-Peer (P2P) networks. P2P networks are
highly dynamic networks that experience heavy node churn (i.e., nodes join and
leave the network continuously over time). Our goal is to guarantee, despite
high node churn rate, that a large number of nodes in the network can store,
retrieve, and maintain a large number of data items. Our main contributions are
fast randomized distributed algorithms that guarantee the above with high
probability (whp) even under high adversarial churn:
1. A randomized distributed search algorithm that (whp) guarantees that
searches from as many as nodes ( is the stable network size)
succeed in -rounds despite churn, for
any small constant , per round. We assume that the churn is
controlled by an oblivious adversary (that has complete knowledge and control
of what nodes join and leave and at what time, but is oblivious to the random
choices made by the algorithm).
2. A storage and maintenance algorithm that guarantees (whp) data items can
be efficiently stored (with only copies of each data item)
and maintained in a dynamic P2P network with churn rate up to
per round. Our search algorithm together with our
storage and maintenance algorithm guarantees that as many as nodes
can efficiently store, maintain, and search even under churn per round. Our algorithms require only polylogarithmic in bits to
be processed and sent (per round) by each node.
To the best of our knowledge, our algorithms are the first-known,
fully-distributed storage and search algorithms that provably work under highly
dynamic settings (i.e., high churn rates per step).Comment: to appear at SPAA 201
Fast Byzantine Leader Election in Dynamic Networks
International audienceWe study the fundamental Byzantine leader election problem in dynamic networks where the topology can change from round to round and nodes can also experience heavy churn (i.e., nodes can join and leave the network continuously over time). We assume the full information model where the Byzantine nodes have complete knowledge about the entire state of the network at every round (including random choices made by all the nodes), have unbounded computational power and can deviate arbitrarily from the protocol. The churn is controlled by an adversary that has complete knowledge and control over which nodes join and leave and at what times and also may rewire the topology in every round and has unlimited computational power, but is oblivious to the random choices made by the algorithm.Our main contribution is an O(log^3 n) round algorithm that achieves Byzantine leader election under the presence of up to O(n^(1/2)−ε) Byzantinenodes (for a small constant ε > 0) and a churn of up to O( √n/ polylog(n)) nodes per round (where n is the stable network size). The algorithm elects a leader with probability at least 1 − n^(−Ω(1)) and guarantees that it is an honest node with probability at least 1 − n^(−Ω(1)); assuming the algorithm succeeds, the leader’s identity will be known to a 1 − o(1) fraction of the honest nodes. Our algorithm is fully-distributed, lightweight, and is simple to implement. It is also scalable, as it runs in polylogarithmic (in n) time and requires nodes to send and receive messages of only polylogarithmic size per round. To the best of our knowledge, our algorithm is the first scalable solution for Byzantine leader election in a dynamic network with a high rate of churn; our protocol can also be used to solve Byzantine agreement in a straightforward way. We also show how to implement an (almost-everywhere) public coin with constant bias in a dynamic network with Byzantine nodes and provide a mechanism for enabling honest nodes to store information reliably in the network, which might be of independent interest
Time- and Communication-Efficient Overlay Network Construction via Gossip
We focus on the well-studied problem of distributed overlay network
construction. We consider a synchronous gossip-based communication model where
in each round a node can send a message of small size to another node whose
identifier it knows. The network is assumed to be reconfigurable, i.e., a node
can add new connections (edges) to other nodes whose identifier it knows or
drop existing connections. Each node initially has only knowledge of its own
identifier and the identifiers of its neighbors. The overlay construction
problem is, given an arbitrary (connected) graph, to reconfigure it to obtain a
bounded-degree expander graph as efficiently as possible. The overlay
construction problem is relevant to building real-world peer-to-peer network
topologies that have desirable properties such as low diameter, high
conductance, robustness to adversarial deletions, etc.
Our main result is that we show that starting from any arbitrary (connected)
graph on nodes and edges, we can construct an overlay network that
is a constant-degree expander in polylog rounds using only
messages. Our time and message bounds are both essentially optimal (up to
polylogarithmic factors). Our distributed overlay construction protocol is very
lightweight as it uses gossip (each node communicates with only one neighbor in
each round) and also scalable as it uses only messages, which is
sublinear in (even when is moderately dense). To the best of our
knowledge, this is the first result that achieves overlay network construction
in polylog rounds and messages. Our protocol uses graph sketches in
a novel way to construct an expander overlay that is both time and
communication efficient. A consequence of our overlay construction protocol is
that distributed computation can be performed very efficiently in this model.Comment: Slightly shortened abstrac
Local treewidth of random and noisy graphs with applications to stopping contagion in networks
We study the notion of local treewidth in sparse random graphs: the maximum
treewidth over all -vertex subgraphs of an -vertex graph. When is not
too large, we give nearly tight bounds for this local treewidth parameter; we
also derive tight bounds for the local treewidth of noisy trees, trees where
every non-edge is added independently with small probability. We apply our
upper bounds on the local treewidth to obtain fixed parameter tractable
algorithms (on random graphs and noisy trees) for edge-removal problems
centered around containing a contagious process evolving over a network. In
these problems, our main parameter of study is , the number of "infected"
vertices in the network. For a certain range of parameters the running time of
our algorithms on -vertex graphs is , improving
upon the performance of the best-known
algorithms designed for worst-case instances of these edge deletion problems
The effect of faults on network expansion
In this paper we study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain so that it still contains a large (i.e. linear-sized) connected component that still has approximately the same expansion as the original fault-free network. For this we apply a pruning technique which culls away parts of the faulty network which have poor expansion. This technique can be applied to both adversarial faults and to random faults. For adversarial faults we prove that for every network with expansion α, a large connected component with basically the same expansion as the original network exists for up to a constant times α·n faults. This result is tight in the sense that every graph G of size n and uniform expansion α(·), i.e. G has an expansion of α(n) and every subgraph G ′ of size m of G has an expansion of O(α(m)), can be broke