Distributed algorithms for reconstructing MST after topology change
This paper considers the Updating Minimum-weight Spanning Tree Problem (UMP), that is, the problem to update the Minimum-weight Spanning Tree (MST) in response to topology change of the network. This paper proposes the algorithm which reconstructs the MST after several links are deleted and added. Its message complexity and its ideal-time complexity are O(m+n log (t+f)) and O(n+n log(t+f)) respectively, where n is the number of processors in the network, t (resp. f) is the number of added links (resp. the number of deleted links of the old MST), and m=t+n if f=0, m=e (i.e. the number of links in the network after the topology change) otherwise. The last part of this paper touches on the algorithm which deals with deletion and addition of processors as well as links.
Unable to display preview. Download preview PDF.
- B. Awerbuch: "Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and related problems", Proceedings 19th Annual ACM Symposium on Theory of Computing, pp.230–240(1987).Google Scholar
- I.Cimet and S.P.Kumar: "A Resilient Distributed Algorithms for Minimum Weight Spanning Trees", Proceedings of the 1987 International Conference on Parallel Processing., pp.196–203(1987).Google Scholar
- R. Gallager, P. Humblet and P. Spira: "A Distributed Algorithm for Minimum Weight Spanning Trees", ACM TOPLAS, 5, 1, pp.66–77(1983).Google Scholar
- J.Park, T.Masuzawa, K.Hagihara and N.Tokura: "Distributed Algorithms for Reconstructing Minimum Spanning Tree — The Case of Link Deletions —", Tech. Rep. IECEJ, COMP-89-25(in Japanese) (1989).Google Scholar
- Y.H.Tsin: "An Asynchronous Distributed MST Updating Algorithm for Handling Vertex Insertions in Networks", Proc. of the International Conference on Parallel Processing and Applications, pp.221–226(1987).Google Scholar