Browse > Article
http://dx.doi.org/10.9708/jksci/2012.17.12.111

A Study on the Group Routing Algorithm in DHT-based Peer-to-Peer System  

Park, Yong-Min (Dept. of Medical Information System, Sahmyook Health University College)
Publication Information
Journal of the Korea Society of Computer and Information / v.17, no.12, 2012 , pp. 111-120 More about this Journal
Abstract
As the P2P System is a distributed system that shares resources of nodes that participate in the system, all the nodes serve as a role of server and client. Currently, although systematic, structured P2P systems such as Chord, Pastry, and Tapestry were suggested based on the distributed hash table, these systems are limited to $log_2N$ for performance efficiency. For this enhanced performance efficiency limited, the article herein suggests group routing algorithm. The suggested algorithm is a node-to-group routing algorithm which divides circular address space into groups and uses a concept of pointer representing each group, which is an algorithm where routing is performed based on pointer. To evaluate algorithm performance, a comparative analysis was conducted on average hops, routing table size, and delayed transmission for chord and routing, a signature algorithm in P2P systems. Therefore, enhanced performance is verified for comparative items from the simulation results.
Keywords
P2P; DHT(Distributed Hash Table); Overlay network; Hop count; Routing table;
Citations & Related Records
연도 인용수 순위
  • Reference
1 H.J. Park, K.R. Park, "P2P Technology Trend and Application to Home Network," Electronics and Telecommunications Trends, Oct, 2006.
2 H.C. Kwon, Y.H. Moon, J.B. Gu, S.K. Kho, J.H. Nah, J.S. Jang, "Standardization and Technology Trend of Peer-to-Peer Communication," Electronics and Telecommunications Trends, Feb, 2007.
3 B. O. Kim, I. W. Lee, H. J. Park, "Trend of Distributed Hash Tables-Based P2P," Electronics and Telecommunications Trends, Dec, 2006.
4 S. Androutsellis-Theotokis and D. Spinellis, "A Survey of Peer-to-Peer File Sharing Technologies," Athens Univ. of Economics and Business White Paper (WHP-2002-03), 2002
5 GT-ITM, http://www.isi.edu/nsnam/ns/ns-topogen.html
6 R. Lobb, A. P. Couto da Silva, E. Leonardi, M. Mellia, and M. Meo, "Adaptive Overlay Topology for Mesh-based p2p-tv Systems" in ACM NOSSDAV, June 2009.
7 B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph, "Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing." Tech. Rep. UCB/CSD-01-1121, UC Berkeley, EECS, 2001.
8 What Is Web 2.0, http://www.oreillynet.com
9 I.W. Lee, H.J. Park, "A Trend of P2P-Based Service and Charging Technics," Electronics and Telecommunications Trends, Oct, 2007.
10 Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, and Hari Balakrishnan. "Chord: A scalable Peer-To-Peer lookup service for internet applications." In Proceedings of the 2001 ACM SIGCOMM Conference, pages 149-160, 2001.
11 Antony Rowstron and Peter Druschel. "Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems". In IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pages 329-350, 2001.
12 Evangelia Kalyvianaki and Ian A. Pratt. Building adaptive peer-to-peer systems. In Peer-to-Peer Computing, pages 268-269, 2004.
13 E. K. Lua, J. Crowcroft, M. Pias, R. Sharma and S. Lim, "A Survey and Comparison of Peer-to-Peer Overlay Network Schemes," IEEE Communications Survey and Tutorial, March 2004.