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

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

재결정 위상의 분산적 구성과 비구조적 피어투피어 망에서의 효율적 검색

Distributed Construction of the Recrystallization Topology and Efficient Searching in the Unstructured Peer-to-Peer Network

  • 박재현 (중앙대학교 컴퓨터공학과)
  • 발행 : 2008.08.15
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 논문에서 비구조적 피어투피어 망을 위한 적은 검색 시간을 가지는 최적화된 위상을 구성하는 분산된 위상 제어 알고리즘을 제안한다. 각 노드는 높은 검색 적중률을 가지는 최적의 노드들을 노드 자신의 적중률에 지수적으로 비례하는 수만큼 선택하고, 그들과 연계한다. 총체적 거동은 자연계에서는 볼 수 있는, 각 입자의 에너지 준위에 따라 입자들이 결합되는 재결정 현상과 결과적으로 거의 유사하다. 구성된 위상의 노드들의 적중율들 사이에는 부분 순서(Partial-order) 관계가 있다. 그러므로, 질의 메시지가 노드를 방문하는 경우에, 그 노드는 항상 직전에 방문하였던 노드들 보다 더 높은 적중률을 가지고 있다. 또한, 무위도식(Freeloader) 노드로부터 보내진 질의 메시지는 한 홉 전달에 의해, 무위도식하지 않은 노드들로 전달될 수 있고, 그것은 다시는 무위도식하는 노드들을 방문하지 않는다. 이처럼 검색은 제한된 지연시간 안에 이루어진다. 또한, 본 논문에서는 이 위상을 활용하여 효과적인 연쇄반응적 검색 방법을 제안한다. 그러한 제어된 다중 전송 방식은, 방송을 사용하는 방식 보다 질의 메시지들의 수를 43 퍼센트만큼 줄이며, 검색시간을 94 퍼센트 절감한다. 제안된 방안의 검색 성공률은 99 퍼센트이다.

In this paper, we present a distributed topology control algorithm for constructing an optimized topology having a minimal search-time in unstructured peer-to-peer network. According to the proposed algorithm, each node selects the best nodes having higher hit-ratio than other nodes as many as the number being exponentially proportional to the hit-ratio of the node itself, and then it connects to them. The ensemble behavior of the proposed algorithm is very similar to the recrystrallizing phenomenon that is observed in nature. There is a partial order relationship among the hit-ratios of most nodes of constructed topology. Therefore once query message visits a node, it has a higher hit-ratio than the node that was visited last by the message. The query message even sent from freeloader can escape to the node having high hit-ratio by one hop forwarding, and it never revisits any freeloader again. Thus the search can be completed within a limited search time. We also propose the Chain-reactive search scheme using the constructed topology. Such a controlled multicasting reduces the query messages by 43 percent compared to that of the naive Gnutella using broadcasting, while it saves the search time by 94 percent. The search success rate of the proposed scheme is 99 percent.

키워드

참고문헌

  1. R. Matei, A. Iamnitchi, and P.Foster, "Mapping the Gnutella network," IEEE Internet Computing, Vol. 6, No. 1, pp. 50-57, 2002
  2. Lada A. Adamic, Rajan M. Lukose, Amit R. Puniyani, and Bernardo A. Huberman, "Search in power-law networks," Physical Review E, Vol. 64, No. 4, pp. 046135, 2001 https://doi.org/10.1103/PhysRevE.64.046135
  3. Saurabh Tewari and Leonard Kleinrock, "Optimal search performance in unstructured peer-to-peer networks with clustered demands," IEEE Journal on Selected Areas in Communications, Vol.25, No. 1, pp. 84-95, 2007
  4. ASDF호1Alexander Loser, Steffen Staab, and Christoph Tempich, "Semantic social overlay networks," IEEE Journal on Selected Areas in Communications, Vol. 25, No. 1, pp. 5-14, 2007 https://doi.org/10.1109/JSAC.2007.070102
  5. Xiaoyan Song, and Markus Rettenmayr, "Modeling recrystallization in a material containing fine and coarse particles," Computational Materials Science, Available online, 2006
  6. D. Hughes, G. Coulson, and J. Walkerdine, "Free riding on Gnutella revisited: the bell tolls?," IEEE Distributed Systems Online, Vol. 6, No. 6, 2005
  7. H. Guclu and M. Yuksel, "Scale-Free Overlay Topologies with Hard Cutoffs for Unstructured Peer-to-Peer Networks," 27th International Conference on Distributed Computing Systems (ICDCS'07), USA, pp. 32, 2007
  8. T. Condie, S. Kamvar, and H. Garcia-Molina, "Adaptive peer-to-peer topologies," Proc. 4th Int. Conf. Peer-to-Peer Comput., pp. 53-62, 2004
  9. H. Tian, S. Zou, W. Wang and S. Cheng, "Constructing efficient peer-to-peer overlay topologies by adaptive connection establishment," Computer Communications, Vol. 29, No. 17, pp. 3567-3579, 2006 https://doi.org/10.1016/j.comcom.2006.05.016
  10. R. Cohen and S. Havlin, "Scale-free networks are ultrasmall," Physical Review Letters, 90:058701, 2003
  11. P. Dasgupta, "A Multi-agent Mechanism for Topology Balancing in Unstructured P2P Networks," Proceedings of the IEEE/WIC/ACM international Conference on intelligent Agent Technology, IAT 2006, Washington DC, pp. 389-392, 2006
  12. S. Merugu, S. Srinivasan, and E. Zegura, "Adding structure to unstructured peer-to-peer networks: The use of small-world graphs," J. Parallel and Distributed Computing, pp. 142-153, 2005
  13. S. Amari, K. Kurata, and H. Nagaoka, "Information geometry of Boltzmann machines," IEEE Transactions on Neural Networks, Vol.3, No.2, pp. 260-271, 1992 https://doi.org/10.1109/72.125867
  14. E. Aarts and J. Korst, Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing, Reading Mass., New York: John Wiley & Sons, Inc., 1989, pp. 126-177
  15. M. Fleischer, "Simulated annealing: past, present, and future," Proceedings of the 1995 Winter Simulation Conference, pp. 155-161, 3-6 Dec. 1995
  16. C. Blum and A. Roli, "Metaheuristics in combinatorial optimization: overview and conceptual comparison," ACM Comput. Surv., Vol. 35, No. 3, pp. 268-308, 2003 https://doi.org/10.1145/937503.937505
  17. J. D Vicente, J. Lanchares, and R. Hermida, "Annealing placement by thermodynamic combinatorial optimization," ACM Trans. Des. Autom. Electron. Syst., Vol. 9, No. 3, pp. 310-332, 2004 https://doi.org/10.1145/1013948.1013951
  18. C. Kittel and H. Kroemer, Thermal Physics, 2nd ed., Reading Mass., New York: W.H. Freeman, 1980, pp. 42-64
  19. Krishna P. Gummadi, Richard J. Dunn, Stefan Saroiu, Steven D. Gribble, Henry M. Levy, and John Zahorjan, "Measurement, modeling, and analysis of a peer-to-peer file-sharing workload," Proceedings of the nineteenth ACM symposium on Operating systems principles 2003, USA, pp. 314-329, October, 2003
  20. W. Feller, An Introduction to Probability Theory and Its Applications, vol. 1, Reading Mass., New York: John Wiley & Sons, Inc., 1950, pp. 344-349
  21. Q. He, M. Ammar, G. Riley, H. Raj, and R. Fujimoto, "Mapping peer behavior to packet-level details: a framework for packet-level simulation of peer-to-peer systems," Proceedings of 11th IEEE/ ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, MASCOTS 2003, USA, pp. 71-78, October, 2003
  22. A. Medina, A. Lakhina, I. Matta, and J. Byers, "Brite: An approach to universal topology generation," Proc. of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunications Systems (MASCOTS) 2001, pp. 346-356, 2001
  23. Reka Albert and Albert-Laszlo Barabasi, "Topology of evolving networks: local events and universality," Phys. Rev. Lett., Vol. 85, No. 24, pp. 5234-5237, 2000 https://doi.org/10.1103/PhysRevLett.85.5234