IEICE TRANSACTIONS on Communications
A Proximity-Based Self-Organizing Hierarchical Overlay Framework for Distributed Hash Tables
Summary :
Several structured peer-to-peer networks have been created to solve the scalability problem of previous peer-to-peer systems such as Gnutella and Napster. These peer-to-peer networks which support distributed hash table functionality construct a sort of structured overlay network, which can cause a topology mismatch between the overlay and the underlying physical network. To solve this mismatch problem, we propose a topology-aware hierarchical overlay framework for DHTs. The hierarchical approach for the overlay is based on the concept that the underlying global Internet is also a hierarchical architecture, that is, a network of networks. This hierarchical approach for the overlay puts forth two benefits: finding data in a physically near place with a high probability, and smaller lookup time. Our hierarchical overlay framework is different from other hierarchical architecture systems in a sense that it provides a specific self-organizing grouping algorithm. Our additional optimization schemes complete the basic algorithm which constructs a hierarchical structure without any central control.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E90-B No.7 pp.1651-1662
- Publication Date
- 2007/07/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e90-b.7.1651
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kwangwook SHIN, Seunghak LEE, Geunhwi LIM, Hyunsoo YOON, "A Proximity-Based Self-Organizing Hierarchical Overlay Framework for Distributed Hash Tables" in IEICE TRANSACTIONS on Communications,
vol. E90-B, no. 7, pp. 1651-1662, July 2007, doi: 10.1093/ietcom/e90-b.7.1651.
Abstract: Several structured peer-to-peer networks have been created to solve the scalability problem of previous peer-to-peer systems such as Gnutella and Napster. These peer-to-peer networks which support distributed hash table functionality construct a sort of structured overlay network, which can cause a topology mismatch between the overlay and the underlying physical network. To solve this mismatch problem, we propose a topology-aware hierarchical overlay framework for DHTs. The hierarchical approach for the overlay is based on the concept that the underlying global Internet is also a hierarchical architecture, that is, a network of networks. This hierarchical approach for the overlay puts forth two benefits: finding data in a physically near place with a high probability, and smaller lookup time. Our hierarchical overlay framework is different from other hierarchical architecture systems in a sense that it provides a specific self-organizing grouping algorithm. Our additional optimization schemes complete the basic algorithm which constructs a hierarchical structure without any central control.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e90-b.7.1651/_p
Copy
@ARTICLE{e90-b_7_1651,
author={Kwangwook SHIN, Seunghak LEE, Geunhwi LIM, Hyunsoo YOON, },
journal={IEICE TRANSACTIONS on Communications},
title={A Proximity-Based Self-Organizing Hierarchical Overlay Framework for Distributed Hash Tables},
year={2007},
volume={E90-B},
number={7},
pages={1651-1662},
abstract={Several structured peer-to-peer networks have been created to solve the scalability problem of previous peer-to-peer systems such as Gnutella and Napster. These peer-to-peer networks which support distributed hash table functionality construct a sort of structured overlay network, which can cause a topology mismatch between the overlay and the underlying physical network. To solve this mismatch problem, we propose a topology-aware hierarchical overlay framework for DHTs. The hierarchical approach for the overlay is based on the concept that the underlying global Internet is also a hierarchical architecture, that is, a network of networks. This hierarchical approach for the overlay puts forth two benefits: finding data in a physically near place with a high probability, and smaller lookup time. Our hierarchical overlay framework is different from other hierarchical architecture systems in a sense that it provides a specific self-organizing grouping algorithm. Our additional optimization schemes complete the basic algorithm which constructs a hierarchical structure without any central control.},
keywords={},
doi={10.1093/ietcom/e90-b.7.1651},
ISSN={1745-1345},
month={July},}
Copy
TY - JOUR
TI - A Proximity-Based Self-Organizing Hierarchical Overlay Framework for Distributed Hash Tables
T2 - IEICE TRANSACTIONS on Communications
SP - 1651
EP - 1662
AU - Kwangwook SHIN
AU - Seunghak LEE
AU - Geunhwi LIM
AU - Hyunsoo YOON
PY - 2007
DO - 10.1093/ietcom/e90-b.7.1651
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E90-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2007
AB - Several structured peer-to-peer networks have been created to solve the scalability problem of previous peer-to-peer systems such as Gnutella and Napster. These peer-to-peer networks which support distributed hash table functionality construct a sort of structured overlay network, which can cause a topology mismatch between the overlay and the underlying physical network. To solve this mismatch problem, we propose a topology-aware hierarchical overlay framework for DHTs. The hierarchical approach for the overlay is based on the concept that the underlying global Internet is also a hierarchical architecture, that is, a network of networks. This hierarchical approach for the overlay puts forth two benefits: finding data in a physically near place with a high probability, and smaller lookup time. Our hierarchical overlay framework is different from other hierarchical architecture systems in a sense that it provides a specific self-organizing grouping algorithm. Our additional optimization schemes complete the basic algorithm which constructs a hierarchical structure without any central control.
ER -
English
