This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
An Efficient Super-Node-Based Regional Lookup Algorithm in Chord
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
Most current approaches have been explored to improve Chord lookup efficiency. However, the problem that confronts every node is to increase the routing table size to maintain too much state information of other nodes. In this paper, we propose a regional lookup algorithm based on super-node that routes data keys queries by region information and super-node. The lookup process can be easily implemented by keeping only O (log K) routing information with K regions in the Chord ring at each node. Results from theoretical analysis and simulations show that the improved lookup algorithm achieves higher lookup efficiency and scales well.
Citation:
Xiaolu Zhang, Qingchao Cai, Xuejie Zhang, "An Efficient Super-Node-Based Regional Lookup Algorithm in Chord," csie, vol. 3, pp.354-358, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.