TY - GEN
T1 - Fault-Tolerant Graph Realizations in the Congested Clique
AU - Kumar, Manish
AU - Molla, Anisur Rahaman
AU - Sivasubramaniam, Sumathi
N1 - Publisher Copyright:
© 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2022/1/1
Y1 - 2022/1/1
N2 - 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. The algorithm uses 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 messages per round. In the NCC model, our algorithm solves degree-sequence realization in rounds and 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.
AB - 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. The algorithm uses 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 messages per round. In the NCC model, our algorithm solves degree-sequence realization in rounds and 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.
KW - Congested-Clique
KW - Crash fault
KW - Distributed algorithm
KW - Fault-tolerant algorithm
KW - Graph realizations
KW - Message complexity
KW - Time complexity
UR - https://www.scopus.com/pages/publications/85145203583
U2 - 10.1007/978-3-031-22050-0_8
DO - 10.1007/978-3-031-22050-0_8
M3 - Conference contribution
AN - SCOPUS:85145203583
SN - 9783031220494
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 108
EP - 122
BT - Algorithmics of Wireless Networks - 18th International Symposium on Algorithmics of Wireless Networks, ALGOSENSORS 2022, Proceedings
A2 - Erlebach, Thomas
A2 - Segal, Michael
PB - Springer Science and Business Media Deutschland GmbH
T2 - 18th International Symposium on Algorithmics of Wireless Network, ALGOSENSORS 2022
Y2 - 8 September 2022 through 9 September 2022
ER -