A Study on the Group Routing Algorithm in DHT-based Peer-to-Peer System (DHT 기반 P2P 시스템을 위한 그룹 라우팅 알고리즘에 관한 연구)

박용민

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

Journal of The Korea Society of Computer and Information
Abbr : JKSCI
2012, 17(12), pp.111-120
Publisher : The Korean Society Of Computer And Information
Research Area : Engineering > Computer Science

박용민 ¹

¹삼육보건대학

Accredited

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 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

Citation status

* References for papers published after 2023 are currently being built.

[web] / What Is Web 2. 0 / http://www.oreillynet.com

[journal] I. W. Lee / 2007 / A Trend of P2P-Based Service and Charging Technics / Electronics and Telecommunications Trends

[journal] H. J. Park / 2006 / P2P Technology Trend and Application to Home Network / Electronics and Telecommunications Trends

[journal] H. C. Kwon / 2007 / Standardization and Technology Trend of Peer-to-Peer Communication / Electronics and Telecommunications Trends

[journal] B. O. Kim / 2006 / Trend of Distributed Hash Tables-Based P2P / Electronics and Telecommunications Trends

[confproc] Ion Stoica / 2001 / Chord : A scalable Peer-To-Peer lookup service for internet applications / In Proceedings of the 2001 ACM SIGCOMM Conference : 149~160

[report] B. Y. Zhao / 2001 / Tapestry : An Infrastructure for Fault-tolerantWide-area Location and Routing / UC Berkeley, EECS

[confproc] Antony Rowstron / 2001 / Pastry : Scalable, decentralized object location, and routing for large-scale peer-to-peer systems / In IFIP/ACM International Conference on Distributed Systems Platforms (Middleware) : 329~350

[confproc] Evangelia Kalyvianaki / 2004 / Building adaptive peer-to-peer systems / In Peer-to-Peer Computing : 268~269

[confproc] E. K. Lua / 2004 / A Survey and Comparison of Peer-to-Peer Overlay Network Schemes / IEEE Communications Survey and Tutor

[report] S. Androutsellis-Theotokis / 2002 / A Survey of Peer-to-Peer File Sharing Technologies / Athens Univ. of Economics and Business White Paper

[web] / GT-ITM / http://www.isi.edu/nsnam/ns/ns-topogen.html

[other] R. Lobb / Adaptive Overlay Topology for Mesh-based p2p-tv

KJCKorea
Journal Central

Journal of The Korea Society of Computer and Information 2023 KCI Impact Factor : 0.65