The Transactions of the Korea Information Processing Society (한국정보처리학회논문지)

Korea Information Processing Society (한국정보처리학회)
권호 표지

An Efficient Distributed Algoritm for the Weighted Shortest-path Updating Problem

최단 경로 갱신문제를 해결하는 분산알고리듬

  • 박정호 (선문대학교 컴퓨터정보학부) ;
  • 이경오 (선문대학교 컴퓨터정보학부) ;
  • 강규철 (성결대학교 경영행정학부)
  • Published : 2000.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

We consider the weighted shortest path updating problem, that is, the problem to reconstruct the weighted shortest paths in response to topology change of the network. This appear proposes a distributed algorithms that reconstructs the weighted shortest paths after several processors and links are added and deleted. its message complexity and ideal-time complexity are O(p$^2$+q+n') and O(p$^2$+q+n') respectively, where n' is the number of processors in the network after the topology change, q is the number of added links, and p is the total number of processors in he biconnected components (of the network before the topology change) including the deleted links or added links.

Keywords

References

  1. B. Awerbuch : 'Complexity of network synchronization,' Journal of ACM. Vol 32, No.4, pp.804-823(Oct. 1985) https://doi.org/10.1145/4221.4227
  2. B Awerbuch and R. G. Gallager. 'A new distributed algorithm to find breadth first search trees,' IEEE Trans on Information Theory, Vol.IT-33, No.3, pp.315- 322(1987) https://doi.org/10.1109/TIT.1987.1057314
  3. B. Awerbuch : 'Distributed shortest paths algorithm,' Proc. of 21st Symposium on Theory of Computing. pp.490-500(1980)
  4. M. Ahuja and Y. Zhu : 'An efficient distributed algorithms for finding articulation points, bridges and biconnected components in asynchronous network,' In Proc. 9th Conference on Foundations of Software Technology and Theoretical Computer Science(LNCS 405), pp.99-108(1989) https://doi.org/10.1007/3-540-52048-1_36
  5. T H. Cormen, C. E Lerserson and R. L. Rivest: 'Introduction to Algorithms,' The MIT Press(1990)
  6. J. Park, T. Masuzawa, K Hagihara and N. Tokura : 'An efficient distributed algorithm for breadth first spanning tree problem,' Journal of IEICE(D). Vol. J71-D, No.7, pp.l576-1188(1988)
  7. B. Swaminathan and K. J Goldman: 'An incremental distributed algorithm: for computing biconnected components,' Proc. 8th International Workshop on Distributed Algorithms(LNCS 857), pp. 238-252(1994)
  8. T. Kameda and M Yamashita : 'Distributed Algorithms,' Kindai-Kagaku-sya(l994)
  9. J. Park, C. Lee : 'An Algorithm Solving the Biconnected-components Reconstruction Problem,' Journal of KIPS,' Vol.5, No,10. pp.2512-2520(1998)