TY - GEN
T1 - Improving the lookup performance of chord network by hashing landmark clusters
AU - Yu, N. Shuai
AU - Miao, Yu Ben
AU - Shieh, Ce Kuen
PY - 2006
Y1 - 2006
N2 - DHTs are efficient peer-to-peer systems which can locate objects within an bounded amount of overlay hops. Originally, those systems don't exploit network proximity in the underlying Internet and lead to high latency when searching a target. Recently, some approaches, such as Random Landmarking (RLM) and Lookup-Parasitic Random Sampling (LPRS), have been suggested to build topology-aware overlay to improve the lookup efficiency. Although these approaches help the nodes in P2P system to be aware of the underlying network, they do a limited improvement because of their proximity neighbor selection. In this paper, a hashing landmark clusters (HLC) method is proposed to improve the performance of Chord by improving the accuracy of proximity mapping between overlay network and physical network The analysis demonstrates that our approach can reduce the lookup latency better than RLM & LPRS can.
AB - DHTs are efficient peer-to-peer systems which can locate objects within an bounded amount of overlay hops. Originally, those systems don't exploit network proximity in the underlying Internet and lead to high latency when searching a target. Recently, some approaches, such as Random Landmarking (RLM) and Lookup-Parasitic Random Sampling (LPRS), have been suggested to build topology-aware overlay to improve the lookup efficiency. Although these approaches help the nodes in P2P system to be aware of the underlying network, they do a limited improvement because of their proximity neighbor selection. In this paper, a hashing landmark clusters (HLC) method is proposed to improve the performance of Chord by improving the accuracy of proximity mapping between overlay network and physical network The analysis demonstrates that our approach can reduce the lookup latency better than RLM & LPRS can.
UR - http://www.scopus.com/inward/record.url?scp=46449105880&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=46449105880&partnerID=8YFLogxK
U2 - 10.1109/ICON.2006.302674
DO - 10.1109/ICON.2006.302674
M3 - Conference contribution
AN - SCOPUS:46449105880
SN - 0780397460
SN - 9780780397460
T3 - Proceedings - 2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers
SP - 471
EP - 474
BT - Proceedings - 2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers
T2 - 2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers
Y2 - 13 September 2006 through 15 September 2006
ER -