Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

DISTRIBUTED ALGORITHMS SOLVING THE UPDATING PROBLEMS

  • Park, Jung-Ho (Division of Computer and Information Sciences, Sun Moon University) ;
  • Park, Yoon-Young (Division of Computer and Information Sciences, Sun Moon University) ;
  • Choi, Sung-Hee (Division of Computer and Information Sciences, Sun Moon University)
  • Published : 2002.05.01

⟨ Previous Next ⟩

Abstract

In this paper, we consider the updating problems to reconstruct the biconnected-components and to reconstruct the weighted shortest path in response to the topology change of the network. We propose two distributed algorithms. The first algorithm solves the updating problem that reconstructs the biconnected-components after the several processors and links are added and deleted. Its bit complexity is O((n'+a+d)log n'), its message complexity is O(n'+a+d), the ideal time complexity is O(n'), and the space complexity is O(e long n+e' log n'). The second algorithm solves the updating problem that reconstructs the weighted shortest path. Its message complexity and ideal-time complexity are $O(u^2+a+n')$ respectively.

Keywords

References

  1. Information Processing Letters v.25 A time optimal message efficient distributed algorithm for depth first earch K.B. Laksmanan;N. Meenakshi;K. Thulasiraman
  2. Journal of IEICE(DI) Efficient distributed algorithms solving problems about the connectivity of network(in Japanese) J. Park;T. Masuzawa;K. Hagihara;N. Tokura
  3. In Proc. 8th International Workshop on Distributed Algorithm An incremental distributed algorithm for computing bioconnected components B. Swaminathan;K. J. Goldman
  4. Introduction to Distributed Algorithms G. Tel