DocumentCode :
1977619
Title :
OHChord: Improvement of Chord routing algorithm based on optimized routing table and hot point
Author :
Liu, Kejian ; Wang, Xiaoguang ; Shi, Xiaomei ; Li, Hailing
Author_Institution :
Sch. of Math. & Comput. Eng., Xihua Univ., Chengdu, China
fYear :
2011
fDate :
16-18 Sept. 2011
Firstpage :
6021
Lastpage :
6023
Abstract :
It is a hot issue to study on how to locate the resource efficiently in P2P networks and grid computing. Chord is a structured P2P routing protocol based on DHT, with the features of fully distributed, load balancing and availability and so on. But it has a poor performance because of redundant information in the finger table. In this Paper, OHChord was proposed. It reduce redundancy and improve query stability by two methods. Firstly, an improved finger structure is presented for removing redundancy. Secondly, adding a hot routing table for each node. Compared with the original Chord and partition-based Chord, OHChord can improve the resource retrieving efficiently.
Keywords :
distributed processing; grid computing; peer-to-peer computing; resource allocation; telecommunication network routing; Chord routing algorithm; DHT; OHChord; P2P networks; grid computing; hot point; load balancing; optimized routing table; partition based Chord; query stability; Algorithm design and analysis; Computers; Educational institutions; Fingers; IP networks; Redundancy; Routing; Chord routing algorithm; DHT; Hot point; Resource Locating;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electrical and Control Engineering (ICECE), 2011 International Conference on
Conference_Location :
Yichang
Print_ISBN :
978-1-4244-8162-0
Type :
conf
DOI :
10.1109/ICECENG.2011.6057269
Filename :
6057269
Link To Document :
بازگشت