In P2P content distribution systems, there are many cases in which the content can be classified into hierarchically organized categories. In this paper, we propose a hybrid overlay network design suitable for such content called Pastry/NSHCC (Pastry for Non-Strictly Hierarchically Categorized Content). The semantic information of classification hierarchies of the content can be utilized regardless of whether they are in a strict tree structure or not. By doing so, the search scope can be restrained to any granularity, and the number of query messages also decreases while maintaining keyword searching availability. Through simulation, we showed that the proposed method provides better performance and lower overhead than unstructured overlays exploiting the same semantic information.
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.
Copy
Yi WAN, Takuya ASAKA, Tatsuro TAKAHASHI, "A Hybrid P2P Overlay Network for Non-strictly Hierarchically Categorized Content" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 11, pp. 3608-3616, November 2008, doi: 10.1093/ietcom/e91-b.11.3608.
Abstract: In P2P content distribution systems, there are many cases in which the content can be classified into hierarchically organized categories. In this paper, we propose a hybrid overlay network design suitable for such content called Pastry/NSHCC (Pastry for Non-Strictly Hierarchically Categorized Content). The semantic information of classification hierarchies of the content can be utilized regardless of whether they are in a strict tree structure or not. By doing so, the search scope can be restrained to any granularity, and the number of query messages also decreases while maintaining keyword searching availability. Through simulation, we showed that the proposed method provides better performance and lower overhead than unstructured overlays exploiting the same semantic information.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.11.3608/_p
Copy
@ARTICLE{e91-b_11_3608,
author={Yi WAN, Takuya ASAKA, Tatsuro TAKAHASHI, },
journal={IEICE TRANSACTIONS on Communications},
title={A Hybrid P2P Overlay Network for Non-strictly Hierarchically Categorized Content},
year={2008},
volume={E91-B},
number={11},
pages={3608-3616},
abstract={In P2P content distribution systems, there are many cases in which the content can be classified into hierarchically organized categories. In this paper, we propose a hybrid overlay network design suitable for such content called Pastry/NSHCC (Pastry for Non-Strictly Hierarchically Categorized Content). The semantic information of classification hierarchies of the content can be utilized regardless of whether they are in a strict tree structure or not. By doing so, the search scope can be restrained to any granularity, and the number of query messages also decreases while maintaining keyword searching availability. Through simulation, we showed that the proposed method provides better performance and lower overhead than unstructured overlays exploiting the same semantic information.},
keywords={},
doi={10.1093/ietcom/e91-b.11.3608},
ISSN={1745-1345},
month={November},}
Copy
TY - JOUR
TI - A Hybrid P2P Overlay Network for Non-strictly Hierarchically Categorized Content
T2 - IEICE TRANSACTIONS on Communications
SP - 3608
EP - 3616
AU - Yi WAN
AU - Takuya ASAKA
AU - Tatsuro TAKAHASHI
PY - 2008
DO - 10.1093/ietcom/e91-b.11.3608
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2008
AB - In P2P content distribution systems, there are many cases in which the content can be classified into hierarchically organized categories. In this paper, we propose a hybrid overlay network design suitable for such content called Pastry/NSHCC (Pastry for Non-Strictly Hierarchically Categorized Content). The semantic information of classification hierarchies of the content can be utilized regardless of whether they are in a strict tree structure or not. By doing so, the search scope can be restrained to any granularity, and the number of query messages also decreases while maintaining keyword searching availability. Through simulation, we showed that the proposed method provides better performance and lower overhead than unstructured overlays exploiting the same semantic information.
ER -