디지털콘텐츠학회 논문지 (Journal of Digital Contents Society)

  • 제12권1호
  • /
  • Pages.133-139
  • /
  • 2011
  • /
  • 1598-2009(pISSN)
  • /
  • 2287-738X(eISSN)
한국디지털콘텐츠학회 (Digital Contents Society)
권호 표지
DOI QR코드

DOI QR Code

구조화된 Peer-to-Peer 네트워크를 위한 적응적 링크 복구 주기 결정 알고리듬

Adaptive Link Recovery Period Determination Algorithm for Structured Peer-to-peer Networks

  • 김석현 (남서울대학교 멀티미디어학과) ;
  • 김태은 (남서울대학교 멀티미디어학과)
  • 투고 : 2011.03.08
  • 심사 : 2011.03.30
  • 발행 : 2011.03.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

구조화된 P2P (Structured Peer-to-peer) 네트워크는 지금까지 많은 관심을 받아왔다. 중앙 서버가 없는 분산 환경에서 구조화된 P2P 네트워크를 사용하면 원하는 자료를 로그 스케일의 검색 시간 안에 찾을 수 있다. 구조화된 P2P 네트워크의 이러한 특성을 유지하려면 그것의 링크 구조를 유지해야 한다. 네트워크에 노드가 빈번하게 참여, 이탈하는 상황에서 구조화된 P2P 네트워크를 운용하면 유효하지 않은 (unavailable) 링크가 발생하게 되고, 이러한 링크가 많아지면 검색 성능이 점차 떨어지게 된다. 구조화된 P2P 네트워크의 특성을 유지하기 위해 주로 사용 되어온 방법은 주기적으로 링크를 복구하는 것이다. 그러나 이 방법은 노드의 참여, 이탈 속도가 빈번하게 변하는 환경에서 충분히 링크를 복구하지 못하거나, 필요 이상의 메시지를 사용할 수 있는 단점을 가지고 있다. 본 논문은 노드의 참여, 이탈 속도에 대응하여 링크 복구 주기를 결정함으로써 노드가 참여, 이탈하는 속도가 동적으로 변화하는 환경에서 구조화된 P2P 네트워크의 특성을 유지할 수 있는 알고리듬을 제시한다. 시뮬레이션 결과 제시한 알고리듬은 다양한 노드의 이탈 속도에 대해 적절한 QoS를 유지함을 확인할 수 있었다.

Structured P2P (peer-to-peer) networks have received much attention in research communities and the industry. The data stored in structured P2P networks can be located in a log-scale time without using central severs. The link-structure of structured P2P networks should be maintained for keeping log-scale search performance of it. When nodes join or leave structured P2P networks frequently, some links become unavailable and search performance is degraded by these links. To sustain search performance of structured P2P networks, periodic link recovery scheme is generally used. However, when the link recovery period is short or long compared with node join and leave rates, it is possible that sufficient number of links are not restored or excessive messages are used after the link-structure is restored. We propose the adaptive link recovery determination algorithm to maintain the link-structure of structured P2P networks when the rates of node joining and leaving are changed dynamically. The simulation results show that the proposed algorithm can maintain similar QoS under various node leaving rates.

키워드

참고문헌

  1. Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., and Balakrishnan, H. Chord: A scalable peer-to-peer lookup service for internet applications. SIGCOMM Comput. Commun. Rev. 31, 4 (Oct. 2001), 149-160. https://doi.org/10.1145/964723.383071
  2. Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Shenker, S. 2001. A scalable content-addressable network. In Proceedings of the 2001 Conferenceon Applications, Technologies, Architectures, and Protocols For Computer Communications (San Diego, California, United States). SIGCOMM '01. ACM, New York, NY, 161-172.
  3. Rowstron, A., and Druschel, P. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms (MIDDLEWARE '01) (Heidelberg, Germany). Springer, LNCS 2218., 2001, 329-350.
  4. Locher, T., Schmid, S. and Wattenhofer, R. eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System. In Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing (P2P '06), vol., no., Sept. 2006, 3-11.
  5. Anceaume, E., Ludinard, R., Ravoaja, A. and Brasileiro, F. PeerCube: A Hypercube-Based P2P Overlay Robust against Collusion and Churn. In Proceedings of the Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2008 (SASO '08) , vol., no., Oct. 2008, 15-24.
  6. Anceaume, E., Ludinard, R. and Sericola, B. Analytic Study of the Impact of Churn in Cluster-Based Structured P2P Overlays. In Proceedings of the IEEE International Conference on Communications (ICC' 10), vol., no., May 2010, 1-5.
  7. Li, X., Misra, J., and Plaxton, CG., Active and Concurrent Topology Maintenance. In Proceedings of the 18th annual Conrference on Distributed Computing (DISC '04), (Trippenhuis, Amsterdam, Netherlands). Springer, LNCS 3274., 2004, 320-334.
  8. Rhea, S., Geels, D., Roscoe, T., and Kubiatowicz, J. Handling churn in a DHT. In Proceedings of the Annual Conference on USENIX Annual Technical Conference (Boston, MA, June 27 - July 02, 2004). USENIX Annual Technical Conference. USENIX Association, Berkeley, CA, 2004, 10-10.
  9. Ou, Z., Harjula, E., Kassinen, O., and Ylianttila, M. Performance Evaluation of a Kademlia-based Communication-oriented P2P System Under Churn, Computer Networks, Elsevier, Vol 54., 2010, 689-705. https://doi.org/10.1016/j.comnet.2009.09.022
  10. Shah, D. Gossip Algorithms. Found. Trends Netw. 3, 1 (Jan. 2009)
  11. Ghodsi, A., Alima, L. O., and Haridi, S. Low-Bandwidth Topology Maintenance for Robustness in Structured Overlay Networks, In Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS'05), (Big Island, Hawaii). IEEE Computer Society, Los Alamitos, CA, USA, 2005, 302a.
  12. Kempe, D., Dobra, A. and Gehrke, J. Gossip-Based Computation of Aggregate Information, In Proceedings of Annual IEEE Symposium on Foundations of Computer Science (FOCS'03). IEEE Computer Society, Los Alamitos, CA, USA, 2003, 482.
  13. Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A., and van Steen, M. Gossip-based peer sampling. ACM Trans. Comput. Syst. 25, 3 (Aug. 2007), 2007, 8.