Computer Science and Information Engineering, World Congress on (2009)
Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.986
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.
Qingchao Cai, Xiaolu Zhang, Xuejie Zhang, "An Efficient Super-Node-Based Regional Lookup Algorithm in Chord", Computer Science and Information Engineering, World Congress on, vol. 03, no. , pp. 354-358, 2009, doi:10.1109/CSIE.2009.986