Improving the lookup performance of chord network by hashing landmark clusters

N. Shuai Yu, Yu Ben Miao, Ce-Kuen Shieh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers
Pages471-474
Number of pages4
DOIs
Publication statusPublished - 2006 Dec 1
Event2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers - Singapore, Singapore
Duration: 2006 Sep 132006 Sep 15

Publication series

NameProceedings - 2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers
Volume2

Other

Other2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers
CountrySingapore
CitySingapore
Period06-09-1306-09-15

Fingerprint

Sampling
Overlay networks
performance
Topology
Internet
efficiency

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Communication

Cite this

Yu, N. S., Miao, Y. B., & Shieh, C-K. (2006). Improving the lookup performance of chord network by hashing landmark clusters. In Proceedings - 2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers (pp. 471-474). [4087745] (Proceedings - 2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers; Vol. 2). https://doi.org/10.1109/ICON.2006.302674
Yu, N. Shuai ; Miao, Yu Ben ; Shieh, Ce-Kuen. / Improving the lookup performance of chord network by hashing landmark clusters. Proceedings - 2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers. 2006. pp. 471-474 (Proceedings - 2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers).
@inproceedings{0fb447d644fc444b81b5e43df2a989b2,
title = "Improving the lookup performance of chord network by hashing landmark clusters",
abstract = "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.",
author = "Yu, {N. Shuai} and Miao, {Yu Ben} and Ce-Kuen Shieh",
year = "2006",
month = "12",
day = "1",
doi = "10.1109/ICON.2006.302674",
language = "English",
isbn = "0780397460",
series = "Proceedings - 2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers",
pages = "471--474",
booktitle = "Proceedings - 2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers",

}

Yu, NS, Miao, YB & Shieh, C-K 2006, Improving the lookup performance of chord network by hashing landmark clusters. in Proceedings - 2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers., 4087745, Proceedings - 2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers, vol. 2, pp. 471-474, 2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers, Singapore, Singapore, 06-09-13. https://doi.org/10.1109/ICON.2006.302674

Improving the lookup performance of chord network by hashing landmark clusters. / Yu, N. Shuai; Miao, Yu Ben; Shieh, Ce-Kuen.

Proceedings - 2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers. 2006. p. 471-474 4087745 (Proceedings - 2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers; Vol. 2).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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/12/1

Y1 - 2006/12/1

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

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

ER -

Yu NS, Miao YB, Shieh C-K. Improving the lookup performance of chord network by hashing landmark clusters. In Proceedings - 2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers. 2006. p. 471-474. 4087745. (Proceedings - 2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers). https://doi.org/10.1109/ICON.2006.302674