The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Carian sumber ialah masalah asas dalam sistem Peer-to-Peer (P2P) berskala besar dan sangat dinamik. Pendekatan carian tidak berstruktur digunakan secara meluas kerana fleksibiliti dan keteguhannya. Walau bagaimanapun, pendekatan sedemikian memerlukan kos komunikasi yang tinggi. Carian berasaskan penyebaran indeks ialah sejenis pendekatan carian tidak berstruktur yang cekap. Kami menyiasat pendekatan sedemikian berkenaan dengan meminimumkan kos komunikasi sistem. Berdasarkan model sistem dinamik yang rakan sebaya terus meninggalkan dan bergabung, kami menyelesaikan dua masalah. Satu masalah ialah bagaimana untuk menyebarkan dan mengekalkan bilangan indeks dengan cekap. Satu lagi adalah untuk menentukan bilangan indeks yang optimum untuk setiap objek sumber populariti tertentu. Akhir sekali, kami mencadangkan skim penyebaran indeks yang dioptimumkan yang terdesentralisasi sepenuhnya dan menyesuaikan diri. Kelebihan yang luar biasa ialah skim ini tidak menghasilkan kos komunikasi tambahan untuk mencapai ciri penyesuaian diri.
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.
Salinan
Yu WU, Taisuke IZUMI, Fukuhito OOSHITA, Hirotsugu KAKUGAWA, Toshimitsu MASUZAWA, "A Message-Efficient Peer-to-Peer Search Protocol Based on Adaptive Index Dissemination" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 2, pp. 258-268, February 2009, doi: 10.1587/transinf.E92.D.258.
Abstract: Resource search is a fundamental problem in large-scale and highly dynamic Peer-to-Peer (P2P) systems. Unstructured search approaches are widely used because of their flexibility and robustness. However, such approaches incur high communication cost. The index-dissemination-based search is a kind of efficient unstructured search approach. We investigate such approaches with respect to minimize the system communication cost. Based on a dynamic system model that peers continuously leave and join, we solve two problems. One problem is how to efficiently disseminate and maintain a given number of indices. Another is to determine the optimal number of indices for each resource object of a given popularity. Finally, we propose an optimized index dissemination scheme which is fully decentralized and self-adaptive. A remarkable advantage is that the scheme yields no additional communication cost to achieve the self-adaptive feature.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.258/_p
Salinan
@ARTICLE{e92-d_2_258,
author={Yu WU, Taisuke IZUMI, Fukuhito OOSHITA, Hirotsugu KAKUGAWA, Toshimitsu MASUZAWA, },
journal={IEICE TRANSACTIONS on Information},
title={A Message-Efficient Peer-to-Peer Search Protocol Based on Adaptive Index Dissemination},
year={2009},
volume={E92-D},
number={2},
pages={258-268},
abstract={Resource search is a fundamental problem in large-scale and highly dynamic Peer-to-Peer (P2P) systems. Unstructured search approaches are widely used because of their flexibility and robustness. However, such approaches incur high communication cost. The index-dissemination-based search is a kind of efficient unstructured search approach. We investigate such approaches with respect to minimize the system communication cost. Based on a dynamic system model that peers continuously leave and join, we solve two problems. One problem is how to efficiently disseminate and maintain a given number of indices. Another is to determine the optimal number of indices for each resource object of a given popularity. Finally, we propose an optimized index dissemination scheme which is fully decentralized and self-adaptive. A remarkable advantage is that the scheme yields no additional communication cost to achieve the self-adaptive feature.},
keywords={},
doi={10.1587/transinf.E92.D.258},
ISSN={1745-1361},
month={February},}
Salinan
TY - JOUR
TI - A Message-Efficient Peer-to-Peer Search Protocol Based on Adaptive Index Dissemination
T2 - IEICE TRANSACTIONS on Information
SP - 258
EP - 268
AU - Yu WU
AU - Taisuke IZUMI
AU - Fukuhito OOSHITA
AU - Hirotsugu KAKUGAWA
AU - Toshimitsu MASUZAWA
PY - 2009
DO - 10.1587/transinf.E92.D.258
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2009
AB - Resource search is a fundamental problem in large-scale and highly dynamic Peer-to-Peer (P2P) systems. Unstructured search approaches are widely used because of their flexibility and robustness. However, such approaches incur high communication cost. The index-dissemination-based search is a kind of efficient unstructured search approach. We investigate such approaches with respect to minimize the system communication cost. Based on a dynamic system model that peers continuously leave and join, we solve two problems. One problem is how to efficiently disseminate and maintain a given number of indices. Another is to determine the optimal number of indices for each resource object of a given popularity. Finally, we propose an optimized index dissemination scheme which is fully decentralized and self-adaptive. A remarkable advantage is that the scheme yields no additional communication cost to achieve the self-adaptive feature.
ER -