The Improvement of Chord Protocol about Structured P2P System
Abstract
Chord protocol is one of the most classical protocols in structured P2P system, with the good effect, reliability, high query efficiency, and many other advantages. However, Chord agreement remains two main shortcomings the one that the searching speed of resources is slower, and the other that the detention of routing is higher. This paper in view of these shortcomings, combination with modification, then put forward the new Chord structure that super nodes and common nodes coexist, super nodes management general nodes. The new structure using Zipf-law determines the proportion of super nodes and ordinary nodes. The last, the new structure is simulated by simulation software, and the improved Chord protocol make better the previous shortcoming through the new structure compares with the Chord protocol.
Full Text:
PDFReferences
Hermawan, Riyanarto S. Developing Distributed System with Service Resource Oriented Architecture. Telkomnika. 2012; 10(2): 389-399.
Ren Yong, Xu Lei. Research Progress on future Internet. Science Papek Online. 2011: 247-255.
Stoic I, R Morris. Chord: A scalable peer-to-peer lookup service for internet application. Networking. 2003; 11(1): 17-23.
Liu Yun,Yi-zhong Ma. Analysis of Capabillity and Advanced Method of Chord. Computer Engineering and Design. 2008; 11(21): 5454-5463.
Zong Ping, Xu ge. Improvement of Chord Routing Algorithm Based on DHT. Computer Technology And Development. 2012; 9(9): 139-142.
Hongwei Chen, Zhiwei Ye. BChord: Bi-directional Routing DHT based on Chord. Computer Supported Cooperative Work in Design (CSCWD). 2008: 410-415.
Wang B Q. Research and improvement of Chord routing algorithm. Computer Engineering and Applications, 2010; 46(14): 112-114.
Du Jiang, Xiao-jun Wu. Study of finger table optimization in Chord protocol. Journal of Chongqing University of Posts and Telecommunications. 2010; 22(2): 248-251.
Yufeng Wang, Xiangming Li. AB-Chord: an efficient approach for resource location in structured P2P networks. 9th International Conference on Ubiquitous Intelligence and Computing and 9th International Conference on Autonomic and Trusted Computing. 2012: 278-284.
Jing-wen LI, XIONG Yan. Ca-Chord: Chord Routing Algorithm Based on Main and Subordinate Ring. Computer Engineering. 2009; 35(11): 107-109.
Ken YK Hui, John C, S Lui. Small-World Overlay P2P Networks: Construction and Handling Dynamic Flash Crowd. Computer Networks. 2006; 50(15): 2727–2746.
Jun-fang Li, Bu-han Zhang. Limtation of Small-word Topology for Application in Nondominated Sorting Differential Evolution. Telkomnika. 2012; 10(2): 400-408.
Xue-ying Jiang, Peng-fei Gao, et al. The Improvement of Cache Stragies about Untructered P2P System. 2nd International Conference on Consumer Electronics, Communications and Networks (CECNet). 2012: 2168-2171.
Zhi-hong Xu, Zhu-lou Zhang, et al. Research of the Bidirectional Master-Slave Chord Resource Search Algorithm. Computer Engineering Science. 2011; 33(11): 80-83.
Jun-jie Jang, Ruo-yu Pan,et al. BiChord:an improved approach for lookup routing in chord.
The 9th East European conference on Advances in Databases and Information Systems. 2005: 338-348.
DOI: http://doi.org/10.12928/telkomnika.v11i2.941
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
TELKOMNIKA Telecommunication, Computing, Electronics and Control
ISSN: 1693-6930, e-ISSN: 2302-9293
Universitas Ahmad Dahlan, 4th Campus
Jl. Ringroad Selatan, Kragilan, Tamanan, Banguntapan, Bantul, Yogyakarta, Indonesia 55191
Phone: +62 (274) 563515, 511830, 379418, 371120
Fax: +62 274 564604