TY - GEN
T1 - Brief Announcement
T2 - 24th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2022
AU - Gupta, Siddharth
AU - Kumar, Manish
AU - Pai, Shreyas
N1 - Funding Information:
S. Gupta—Supported by Engineering and Physical Sciences Research Council (EPSRC) grant no: EP/V007793/1. M. Kumar—Supported by the Rita Altura trust chair in computer science, and by the Lynne and William Frankel Center for Computer Science, BGU, Israel. S. Pai—Supported in part by the Academy of Finland, Grant 334238.
Publisher Copyright:
© 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2022/1/1
Y1 - 2022/1/1
N2 - In a reconfiguration problem, given a problem and two feasible solutions of the problem, the task is to find a sequence of transformations to reach from one solution to the another such that every intermediate state is also a feasible solution to the problem. In this paper, we study the distributed spanning tree reconfiguration problem and we define a new reconfiguration step, called k -simultaneous add and delete, in which every node is allowed to add at most k edges and delete at most k edges such that multiple nodes do not add or delete the same edge. We first show that, if the two input spanning trees are rooted then we can transform one into another in one round using a single 1-simultaneous add and delete step in the CONGEST model. Therefore, we focus our attention towards unrooted spanning trees and show that transforming an unrooted spanning tree into another using a single 1-simultaneous add and delete step requires Ω(n) rounds in the LOCAL model. We additionally show that transforming an unrooted spanning tree into another using a single 2-simultaneous add and delete step can be done in O(log n) rounds in the CONGEST model.
AB - In a reconfiguration problem, given a problem and two feasible solutions of the problem, the task is to find a sequence of transformations to reach from one solution to the another such that every intermediate state is also a feasible solution to the problem. In this paper, we study the distributed spanning tree reconfiguration problem and we define a new reconfiguration step, called k -simultaneous add and delete, in which every node is allowed to add at most k edges and delete at most k edges such that multiple nodes do not add or delete the same edge. We first show that, if the two input spanning trees are rooted then we can transform one into another in one round using a single 1-simultaneous add and delete step in the CONGEST model. Therefore, we focus our attention towards unrooted spanning trees and show that transforming an unrooted spanning tree into another using a single 1-simultaneous add and delete step requires Ω(n) rounds in the LOCAL model. We additionally show that transforming an unrooted spanning tree into another using a single 2-simultaneous add and delete step can be done in O(log n) rounds in the CONGEST model.
KW - Distributed algorithms
KW - Reconfiguration
KW - Spanning trees
UR - https://www.scopus.com/pages/publications/85142697754
U2 - 10.1007/978-3-031-21017-4_25
DO - 10.1007/978-3-031-21017-4_25
M3 - Conference contribution
AN - SCOPUS:85142697754
SN - 9783031210167
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 346
EP - 351
BT - Stabilization, Safety, and Security of Distributed Systems - 24th International Symposium, SSS 2022, Proceedings
A2 - Devismes, Stéphane
A2 - Petit, Franck
A2 - Altisen, Karine
A2 - Di Luna, Giuseppe Antonio
A2 - Fernandez Anta, Antonio
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 15 November 2022 through 17 November 2022
ER -