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

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

A Reactive Chord for Efficient Network Resource Utilization in Mobile P2P Environments

모바일 P2P 환경에서 효율적인 네트워크 자원 활용을 위한 반응적인 코드

  • 윤영효 (숭실대학교 정보통신전자공학부) ;
  • 곽후근 (숭실대학교 정보통신전자공학부) ;
  • 김정길 (남서울대학교 컴퓨터학과) ;
  • 정규식 (숭실대학교 정보통신전자공학부)
  • Published : 2009.04.15
Download PDF
⟨ Previous Next ⟩

Abstract

A DHT(Distributed Hash Table) based P2P is a method that compensates disadvantages of the existing unstructured P2P method. If a DHT algorithm is used, it can do fast data search and maintain search efficiency independent of the number of peers. The peers in a DHT method send messages periodically to keep the routing table updated. In a mobile environment, the peers in a DHT method should send messages more frequently to keep the routing table updated and reduce the failure of requests. However this results in increasing the overall network traffic. In this paper, we propose a method to reduce the update load of a routing table in the existing DHT by updating it in a reactive way. In the proposed reactive method, a routing table is updated only if a data request is coming whereas it is updated periodically in the existing proactive method. We perform experiments using Chord simulator(I3) made by UC Berkely. The experimental results show the performance improvement of the proposed method compared to the existing method.

분산 해쉬 테이블(DHT : Distributed Hash Table) 기반의 P2P는 기존 Unstructured P2P 방식의 단점을 보완하기 위한 방식이다. DHT 알고리즘을 사용하면 빠른 데이터 검색을 할 수 있고, 피어 개수에 무관하게 검색 효율을 유지할 수 있다. DHT 방식의 피어들은 카우팅 테이블을 최신으로 유지하기 위해 주기적으로 메시지를 보낸다. 모바일 환경의 경우, DHT 방식의 피어들은 라우팅 테이블을 최신으로 유지하고 요청 실패를 줄이기 위해서 빠른 주기로 메시지를 보내야 한다. 하지만 이로 인해, 전체 네트워크의 트래픽은 증가하게 된다. 본 논문에서는 리액티브 라우팅 테이블 업데이트 방식을 이용하여 기존 DHT에서의 라우팅 테이블 업데이트에 따른 부하를 줄이는 기법을 제안한다. 주기적으로 자신의 라우팅 테이블을 업 데이트하는 기존 방식(Proactive)과 달리, 제안된 방식에서는 데이터 요청이 들어 왔을 때만 라우팅 테이블을 업데이트하는 방식(Reactive)을 사용한다. 제안된 방식은 버클리 대학에서 만들어진 Chord 시뮬레이터(I3)를 이용하여 실험을 수행하였다. 실험을 통하여 제안된 방식이 기존 방식에 비해 성능이 향상되었음을 확인하였다.

Keywords

References

  1. eDonkey, "http://www.donkeyp2p.com/"
  2. Gnutella. "http://www.gnutella.com/"
  3. Bittorrent, "http://bitconjurer.org/BitTorrent/"
  4. Napster. "http://www.napster.com/"
  5. I. Clarke et al., Freenet: A Distributed Anonymous Information Storage and Retrieval System, available at http://freenetproject.org/freenet.pdf, 1999
  6. S. Ratnasamy et al., "A Scalable Content Addressable Network," Proc. ACM SIGCOMM, pp. 161-72, 2001
  7. A. Rowstron and P. Droschel, "Pastry: Scalable, Distributed Object Location and Routing for largeScale Peer-to-Peer Systems," In IFIP/ACM Int'l Conf. on Distributed Systems Platfonns (Middleware), pp. 329-350, Nov. 2001
  8. B. Zhao, L. Huang, J. Stribling, S. Rhea. A. Joseph. and J Kubiatowicz, "Tapestry: A Resilient Globalscale Overlay for Service Deployment," IEEE Journal on Selected Areas in Communications, Vol.22, No.1. pp. 41-43. 2004 https://doi.org/10.1109/JSAC.2003.818784
  9. I. Stoica, R. Morris. D. Liben-Nowell, D. Karger, M. Kaashoek, F. Dabek, and H. Balakrishnan, "Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications," In IEEE/ACM Transactions on Networking, Vol.12, No.2, pp. 205-218, Apr 2004 https://doi.org/10.1109/TNET.2004.826279
  10. H. Park. K. Park, "P2P Technology Trend and Application to Home Network," 전자통신동향분석, Vol.21 , No.5, Oct 2006
  11. P. Flocchini and A. Nayak, "Enhancing Peer-to-Peer Systems Through Redundancy," IEEE Journal on Selected Areas in Communications, Vol.25, No.1. pp. 15-24, Jan 2007 https://doi.org/10.1109/JSAC.2007.070103
  12. S. Serbu, S. Bianchi, P. Kropf, and P. Felber, "Dynamic Load Sharing in Peer-to-Peer Systems: When Some Peers Are More Equal than Others," IEEE Internet Computing, Vol. II , No.4. pp. 53-61, July Aug. 2007
  13. H. Cai and J. Wang, "Caching routing indices in structured P2P overlays," International Conference on Parallel Processing. pp. 521-528, June 2005
  14. B. Godfrey. K. Lakshminarayanan, S. Surana, R. Karp, and r. Stoica, "Load balancing in dynamic structured P2P systems," INFOCOM, pp. 2253-2262. March 2004
  15. M. Dischinger. "Mohility Enhancements to an Approach for Structured Overlay Routing in Wireless Mobile Ad Hoc Networks," Diploma Thesis. System Architecture Group, University of Karlsruhe, Nov. 2005
  16. S. Lee and J. Jang. "Backtracking Chord over Mobile Ad-hoc Network," 한국정보과학회 춘계학술대회, pp. 517-519, 2004
  17. R. Baden. A. Bender, D. Levin. R. Sherwood. N. Spring, and B. Bhattacharjee. "A Secure DHT via the Pigeonhole Principle," Digital Repository at the University of Maryland, Relation UM Computer Science Department, CS-TR-4884. Sep. 2007
  18. I. Stoicam, D. Adkins. S. Zhuang, S. Shenker, and S. Surana. "Internet indirection infrastructure," ACM SIGCOMM Computer Communication Review, Vol.32, pp. 73-86, 2002
  19. C. Cramer and T. Fuhnnann, "Performance Evaluation of Chord in Mobile Ad Hoc Networks," ACM International Conference on Mobile Computing and Networking, pp. 4853, 2006
  20. C. Tang, M. Buco, and R. Chang. "Low traffic overlay networks with large routing tables." ACM Special Interest Group on Measurement and Evaluation, Vol.33, pp. 14-25, 2005
  21. W. Acosta and S. Chandra. "Trace Driven Analysis of the Long Tenn EVol.ution of Gnutella Peer-to-Peer Traffic," Lecture Notes in Computer Science, Vol.4427, pp. 42-51. 2007 https://doi.org/10.1007/978-3-540-71617-4_5
  22. K. Gummadi, It Dunn. and S. Saroiu, "A Measurement Study of Napster and Gnutella as Examples of Peer-to-Peer File Sharing Systems," Symposium on Operating Systems Principles, Oct. 2003