The KIPS Transactions:PartC (정보처리학회논문지C)

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

DOI QR Code

An Improved Reactive Chord for Minimizing Network Traffic and Request Latency

트래픽 및 요청 지연을 최소화한 향상된 리액티브 Chord

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

Abstract

The peers in the Chord method send messages periodically to keep the routing table updated. In a mobile P2P network, the peers in the Chord method should send messages more frequently to keep the routing table updated and reduce the failure of a request. However this results in increasing the overall network traffic. In our previous method, we proposed a method to reduce the update load of the routing table in the existing Chord by updating it in a reactive way, but there were disadvantages to generate more traffic if the number of requests per second increases and to have more delay in the request processing time than the existing Chord. In this paper, we propose an improved method of reactive routing table update to reduce the request processing time. In the proposed method, when a data request comes, the routing table is updated only if its information is not recent while it is always updated in the previous 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.

Chord 방식의 피어들은 라우팅 테이블을 최신으로 유지하기 위해 주기적으로 메시지를 보낸다. 모바일 P2P 네트워크에서 Chord 방식의 피어들은 라우팅 테이블을 최신으로 유지하고 요청 실패를 줄이기 위해서 빠른 주기로 메시지를 보내야 한다. 하지만 이로 인해, 전체 네트워크의 트래픽은 증가하게 된다. 본 연구자들은 기존 연구에서 리액티브 라우팅 테이블 업데이트 방식을 이용하여 기존 Chord에서의 라우팅 테이블 업데이트에 따른 부하를 줄이는 기법을 제안하였으나, 초당 요청 메시지 개수가 많아지게 되면 기존의 방식보다 트래픽 양이 많아지게 되는 단점과 요청처리시간 지연이 기존방식보다 떨어진다는 단점을 가진다. 이에 본 논문에서는 요청처리 시간을 줄이기 위한 향상된 리액티브 라우팅 테이블 업데이트 방식을 제안한다. 기존에 제안된 방식은 요청이 들어올 때마다 테이블을 업데이트 하는 반면, 제안된 방식은 요청이 들어 왔을 때 현재의 테이블 정보가 최신정보인지를 확인하고 만일 아니라면 테이블을 업데이트하는 방식이다. 실험은 버클리 대학에서 만들어진 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 https://doi.org/10.1145/964723.383072
  7. A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,” In IFIP/ACM Int'l Conf. on Distributed Systems Platforms(Middleware), pp.329-350, Nov., 2001 https://doi.org/10.1007/3-540-45518-3_18
  8. B. Zhao, L. Huang, J. Stribling, S. Rhea, A. Joseph, and J. Kubiatowicz, “Tapestry: A Resilient Global-scale 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. 윤영효, 곽후근, 김정길, 정규식, “모바일 환경을 위한 리액티브 방식의 Chord”, KCC 2008, 한국정보과학회, 2007
  12. 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
  13. Z. Hui, A. Goel, and R. Govindan, “Improving lookup latency in distributed hash table systems using random sampling”, IEEE/ACM Transactions on Networking, Vol.13, pp.1121-1134, Nov., 2005 https://doi.org/10.1109/TNET.2005.857106
  14. M. Cai, A. Chervenak, and M. Frank, “A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table”, Supercomputing, 2004. Proceedings of the ACM/IEEE SC2004 Conference, pp.56-61, July, 2004 https://doi.org/10.1109/SC.2004.7
  15. P. Keleher, S. Bhattacharjee, and B. Silaghi, “Are Virtualized Overlay Networks Too Much of a Good Thing?”, Proceedings of International Workshop on Peer-to-Peer Systems (IPTPS'02), pp.225-231, Mar. 2002 https://doi.org/10.1007/3-540-45748-8_21
  16. M. Dischinger, “Mobility Enhancements to an Approach for Structured Overlay Routing in Wireless Mobile Ad Hoc Networks”, Diploma Thesis, System Architecture Group, University of Karlsruhe, Nov., 2005
  17. S. Lee and J. Jang, “Backtracking Chord over Mobile Ad-hoc Network”, 한국정보과학회 춘계학술대회, pp.517-519, 2004
  18. M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D.S. Wallach, “Secure routing for structured peer-to-peer overlay networks” , Massachusetts (2002) To appear Boston, 2002
  19. 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 https://doi.org/10.1145/964725.633033
  20. C. Cramer and T. Fuhrmann, “Performance Evaluation of Chord in Mobile Ad Hoc Networks”, ACM International Conference on Mobile Computing and Networking, pp.48-53, 2006 https://doi.org/10.1145/1161252.1161264
  21. 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 https://doi.org/10.1145/1071690.1064216
  22. W. Acosta and S. Chandra, “Trace Driven Analysis of the Long Term Evolution 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
  23. K. Gummadi, R. 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

Cited by

  1. An Adaptive Chord for Minimizing Network Traffic in a Mobile P2P Environment vol.16C, pp.6, 2009, https://doi.org/10.3745/KIPSTC.2009.16C.6.761