Browse > Article

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

Yoon, Young-Hyo (숭실대학교 정보통신전자공학부)
Kwak, Hu-Keun (숭실대학교 정보통신전자공학부)
Kim, Cheong-Ghil (남서울대학교 컴퓨터학과)
Chung, Kyu-Sik (숭실대학교 정보통신전자공학부)
Publication Information
Journal of KIISE:Information Networking / v.36, no.2, 2009 , pp. 80-89 More about this Journal
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.
Keywords
Mobile Environment; Distributed Hash Table; Chord; Reactive; Proactive; Routing Table Update;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Gnutella. "http://www.gnutella.com/"
2 Bittorrent, "http://bitconjurer.org/BitTorrent/"
3 Napster. "http://www.napster.com/"
4 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
5 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   DOI   ScienceOn
6 B. Godfrey. K. Lakshminarayanan, S. Surana, R. Karp, and r. Stoica, "Load balancing in dynamic structured P2P systems," INFOCOM, pp. 2253-2262. March 2004
7 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
8 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
9 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   DOI   ScienceOn
10 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
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   DOI   ScienceOn
12 I. Clarke et al., Freenet: A Distributed Anonymous Information Storage and Retrieval System, available at http://freenetproject.org/freenet.pdf, 1999
13 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   DOI   ScienceOn
14 H. Cai and J. Wang, "Caching routing indices in structured P2P overlays," International Conference on Parallel Processing. pp. 521-528, June 2005
15 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
16 S. Lee and J. Jang. "Backtracking Chord over Mobile Ad-hoc Network," 한국정보과학회 춘계학술대회, pp. 517-519, 2004
17 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
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 S. Ratnasamy et al., "A Scalable Content Addressable Network," Proc. ACM SIGCOMM, pp. 161-72, 2001
20 H. Park. K. Park, "P2P Technology Trend and Application to Home Network," 전자통신동향분석, Vol.21 , No.5, Oct 2006
21 eDonkey, "http://www.donkeyp2p.com/"
22 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