DeepAI AI Chat
Log In Sign Up

Fault-Tolerant Graph Realizations in the Congested Clique

by   Anisur Rahaman Molla, et al.

In this paper, we study the graph realization problem in the Congested Clique model of distributed computing under crash faults. We consider degree-sequence realization, in which each node v is associated with a degree value d(v), and the resulting degree sequence is realizable if it is possible to construct an overlay network with the given degrees. Our main result is a O(f)-round deterministic algorithm for the degree-sequence realization problem in a n-node Congested Clique, of which f nodes could be faulty (f<n). The algorithm uses O(n^2) messages. We complement the result with lower bounds to show that the algorithm is tight w.r.t the number of rounds and the messages simultaneously. We also extend our result to the Node Capacitated Clique (NCC) model, where each node is restricted to sending and receiving at-most O(log n) messages per round. In the NCC model, our algorithm solves degree-sequence realization in O(nf/log n) rounds and O(n^2) messages. For both settings, our algorithms work without the knowledge of f, the number of faults. To the best of our knowledge, these are the first results for the graph realization problem in the crash-fault distributed network.


page 1

page 2

page 3

page 4


Distributed Graph Realizations

We study graph realization problems from a distributed perspective and w...

Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE

The Steiner tree problem is one of the fundamental and classical problem...

Distributed Computation in the Node-Congested Clique

The Congested Clique model of distributed computing, which was introduce...

A Distributed Palette Sparsification Theorem

Is fully decentralized graph streaming possible? We consider this questi...

Finding Subgraphs in Highly Dynamic Networks

In this paper we consider the fundamental problem of finding subgraphs i...

Improved Tradeoffs for Leader Election

We consider leader election in clique networks, where n nodes are connec...

Derivation of Heard-Of Predicates From Elementary Behavioral Patterns

There are many models of distributed computing, and no unifying mathemat...