Journal of KIISE:Information Networking (한국정보과학회논문지:정보통신)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

A Deterministic Resource Discovery Algorithm in Distributed Networks

분산 망에서 자원발견을 위한 결정 알고리즘

  • 박혜경 (한국전자통신연구원 MPLS S/W팀) ;
  • 유관우 (경북대학교 컴퓨터공학과)
  • Published : 2001.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we propose a deterministic algorithm to solve the resource discovery problem, that is, some subset of machines to learn the existence of each other in a large distributed network. Harchol et al. proposed a randomized algorithm solving this problem within O($log^2\;n$) rounds with high probability, which requires O($nlog^2\;n$) connection communication complexity and O($n^2log^2\;n$) pointer communication complexity, where n is the number of machines in the network. His solution is based on randomization method and it is difficult to determine convergence time. We propose an efficient algorithm which improve performance and the non-deterministic characteristics. Our algorithm requires O(log n) rounds which shows O(mlog n) connection communication complexity and O($n^2log\;n$) pointer communication complexity, where m is the number of links in the network.

본 논문에서는 네트웍으로 연결된 일련의 장치들이 서로를 발견하는 문제인 자원 발견 (Resource Discovery)문제를 해결하는 알고리즘을 제안한다. 최근 Harchol등은, 장치의 수를 n이라 할 때, O($nlog^2\;n$) 연결 통신복잡도와 O($n^2log^2\;n$) 포인터 통신복잡도를 가지고 O($log^2\;n$) 시간복잡도에 이문제를 해결하는 알고리즘을 제안하였는데, 이는 임의(randomized) 알고리즘이며 종료시점(convergence)을 식별할 방법이 없다는 단점을 가진다. 본 논문에서 우리는 이러한 단점을 없앤 더욱 효율적인 결정(deterministic) 알고리즘을 제안한다 .제안 알고리즘은, 총 링크 수를 m이라 할 때，O(mlog n) 연결 통신 복잡도와 O($n^2log\;n$) 포인터 통신복잡도를 가지고 O(log n) 시간복잡도에 자원발견 문제를 해결한다.

Keywords

References

  1. D. Agrawal, A. E. Abbadi, and R. Steinke, Epidemic algorithms in replicated database, In Proceedings of Sixth ACM SIAACT-SIGMOD-DIGART Symposium of Principles of Database Systems, pp. 161-172, Tucson, Arizona, May 1997
  2. S. Assmann and D. Kleitman, The number of rounds needed to exchange information within graph, SIAM Discrete Applied Maths, 6, pp. 117-125, 1993 https://doi.org/10.1016/0166-218X(83)90065-3
  3. A. J. Demers, D. H. Greene, C. Hauser, W. Irish, and J. Larson, Epidemic algorithms for replicated database maintenance, In Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pp. 1-12, Canada, August 1987 https://doi.org/10.1145/41840.41841
  4. S. Even and B. Monien, On the number of rounds necessary to disseminate information, In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, pp.261-266,1999 https://doi.org/10.1145/72935.72969
  5. S. Hedetniemi, S. Hedetniemi, and A. Liestman, A survey of gossiping and broadcasting in communication networks, Networks, Vol. 18, pp.319-349, 1988 https://doi.org/10.1002/net.3230180406
  6. D. C. Oppen and Y. K. Dalal, The clearinghouse: A decentralized agent for locating named objects In distributed environment, ACM Transactions on Office Information Systems, 1(3), pp.230-253, July 1983 https://doi.org/10.1145/357436.357439
  7. A. Pelc, Fault-tolerant broadcasting and gossiping in communication, Networks, 28(3): pp. l43-156, October 1996 https://doi.org/10.1002/(SICI)1097-0037(199610)28:3<143::AID-NET3>3.0.CO;2-N
  8. R. Renesse, Y. Minsky and M. Hayden, A gossip-style failure detector, 1998
  9. Akamai Inc. www.akamai.com
  10. C. A. Thekkath, T. Mann, and E. K. Lee, Frangipani: A scalable distributed file system, In ACM Symposium on Operating System Principles, October 1997 https://doi.org/10.1145/268998.266694
  11. S. Keshav, An engineering approach to computer networking, Addison-Wesley, 1997
  12. F. T. Leighton, Introduction to parallel algorithms and architectures: arrays, trees, and hypercubes, Morgan Kaufmann Publishers, 1992
  13. M. Harchol-Halter, T. Leighton, and D. Lewin, Resource discovery in distributed networks, In Proceeding of 19th ACM Symposium on Principles of Distributed Computing, May 1999 https://doi.org/10.1145/301308.301362
  14. J. Moy, OSPF version 2, rfc1583, 1994
  15. J. JaJa, An introduction to parallel algorithms, Addison Wesley, 1992
  16. Y. Shiloach, and U. Vishkin , An O(log n) parallel connectivity algorithm, Journal of Algorithms, 3(1), pp.57-67, 1982 https://doi.org/10.1016/0196-6774(82)90008-6