DocumentCode :
2099155
Title :
An Optimized Chord Algorithm for Accelerating the Query of Hot Resources
Author :
Li, Jiajing ; Yang, Xudong
Author_Institution :
Beijing Key Lab. of Intell. Telecommun. Software & Multimedia, Beijing Univ. of Posts & Telecommun., Beijing, China
Volume :
2
fYear :
2008
fDate :
20-22 Dec. 2008
Firstpage :
644
Lastpage :
647
Abstract :
Chord is the most essential and efficient peer-to-peer routing algorithm that, however, cannot reflect the hot resources problem in practical networks. To solve the problem, an optimized Chord algorithm has been put forward in this paper to accelerate locating the hot resources. The optimized Chord algorithm records the access time of resources and categories the resources into three classes. As for the class of hot resources, the optimized Chord would broadcast its location information and shorten its query hops. As a result, the average query hops would be shorter than the original Chord algorithm.
Keywords :
peer-to-peer computing; query processing; resource allocation; telecommunication network routing; hot resource problem; optimized Chord algorithm; peer-to-peer routing algorithm; query hop; Acceleration; Computer networks; Computer science; Fingers; Network servers; Network topology; Peer to peer computing; Routing; Software algorithms; Telecommunication network topology; Chord; average query hops; hot resources; peer-to-peer;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Science and Computational Technology, 2008. ISCSCT '08. International Symposium on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-3746-7
Type :
conf
DOI :
10.1109/ISCSCT.2008.351
Filename :
4731706
Link To Document :
بازگشت