정보처리학회논문지A (The KIPS Transactions:PartA)

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

DOI QR Code

DHT 기반 피어-투-피어 시스템을 위한 적응적 근접경로 선택기법

An Adaptive Proximity Route Selection Method in DHT-Based Peer-to-Peer Systems

  • 발행 : 2006.02.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

다양한 네트워크로 구성된 인터넷 환경에서 오버레이 홉 수를 최소화하는 Chord를 비롯한 기존의 분산 해싱 테이블 기반의 피어-투-피어 시스템에서는 목적 노드까지의 실질적인 질의 라우팅 시간을 줄일 수 없다. 따라서 제안하는 적응적 근접경로 선택기법에서 각 노드는 라우팅테이블의 엔트리 노드 중 지연시간을 최소로 하는 노드를 선택하여 질의 메시지를 전달하도록 한다. 이를 위하여 각 엔트리의 목적지까지의 지연시간을 큐 라우팅 알고리듬과 지수적 최근-가중치 평균을 이용해 예측하여 검색 테이블로 저장하고, 노드들 간 메시지 전달 시 이 정보를 교환하여 추가 부하 없이 검색 테이블에 반영한다. 시뮬레이션을 통해 제안하는 기법이 전채 검색 시간과 흡 간 지연시간에 있어서 근접성을 고려하지 않은 Chord나 CFS의 서버 선택 알고리즘에 비해 월등히 좋은 성능을 보임을 확인할 수 있다.

In the Internet of various networks, it is difficult to reduce real routing time by just minimizing their hop count. We propose an adaptive proximity route selection method in DHT-based peer-to-peer systems, in which nodes select the nぉe with smallest lookup latency among their routing table entries as a next routing node. Using Q-Routing algorithm and exponential recency-weighted average, each node estimates the total latency and establishes a lookup table. Moreover, without additional overhead, nodes exchange their lookup tables to update their routing tables. Several simulations measuring the lookup latencies and hop-to-hop latency show that our method outperforms the original Chord method as well as CFS' server selection method.

키워드

참고문헌

  1. I. Stoica, M. Robert, L. N. David, R. David, M. Karger, K. Frans, D. Frank, and B. Hari, 'Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications,' IEEE/ACM Transactions on Networking, Vol.11, Issue 1, pp.17-32, 2003 https://doi.org/10.1109/TNET.2002.808407
  2. A. Rowstron and P. Druschel, 'Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,' in Proceeding of the 18th IFIP/ACM International Conference on Distributed Systems Platforms, 2001
  3. B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph, 'Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing,' Technical Report CSD-01-1141. 2001
  4. H. Zhang, A. Goel, and R. Gobindan, 'Incrementally Improving Lookup Latency in Distributed Hash Table,' in Proceeding of the 2003 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pp.114-125, 2003
  5. K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica, 'The Impact of DHT Routing Geometry on Resilience and Proximity,' in Proceeding of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp.381-394, 2003 https://doi.org/10.1145/863955.863998
  6. B. G. CHun, B.Y. Zhao, and J. D. Kubiatowicz, 'Impact of Neighbor Selection on Performance and Resilience of Structured P2P Networks,' In Proceedings of the forth IPTPS, 2005
  7. K. P. Shanahan and M. J. Freedman, 'Locality Prediction for Oblivious Clients,' In Proceedings of the forth IPTPS, 2005
  8. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica, 'Wide-Area Cooperative Storage with CFS,' in Proceeding of the 18th ACM Symposium on Operating Systems Principles, pp.202-215, 2001 https://doi.org/10.1145/502034.502054
  9. J. Boyan and M. Littman, 'Packet Rrouting in Dynamically Changing Networks: A Reinforcement Learning Approach,' in Proceedings of Neural Information Processing Systems, pp.982-988, 1994
  10. GT-ITM, http://www.isi.edu/nsnam/ns/ns-topogen.html
  11. Chord Simulator, http://pdos.lcs.mit.edu/cgi-bin/cvsweb.cgi/sfsnet/simulator
  12. N. P. Venkata and S. Lakshminarayanan, 'An Investigation of Geographic Mapping Techniques for Internet Hosts,' in Proceeding of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp.173-185, 2001 https://doi.org/10.1145/964723.383073
  13. B. M. Waxman, 'Routing of Multipoint Connections,' IEEE Journal on Selected Areas in Communications, No.9, pp.1617-1622, 1988 https://doi.org/10.1109/49.12889