WEKO3
アイテム
A Tag-Based Scheme to Realize Real-Time File Search in Hierarchical Peer-to-Peer Systems
https://ipsj.ixsq.nii.ac.jp/records/81782
https://ipsj.ixsq.nii.ac.jp/records/81782d76ef9c8-0673-4771-9247-af56c4c49155
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
|
|
Copyright (c) 2012 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2012-04-15 | |||||||||||||
| タイトル | ||||||||||||||
| タイトル | A Tag-Based Scheme to Realize Real-Time File Search in Hierarchical Peer-to-Peer Systems | |||||||||||||
| タイトル | ||||||||||||||
| 言語 | en | |||||||||||||
| タイトル | A Tag-Based Scheme to Realize Real-Time File Search in Hierarchical Peer-to-Peer Systems | |||||||||||||
| 言語 | ||||||||||||||
| 言語 | eng | |||||||||||||
| キーワード | ||||||||||||||
| 主題Scheme | Other | |||||||||||||
| 主題 | 一般論文 | |||||||||||||
| 資源タイプ | ||||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||||
| 資源タイプ | journal article | |||||||||||||
| 著者所属 | ||||||||||||||
| The authors are with the Department of Information Engineering, Hiroshima University | ||||||||||||||
| 著者所属 | ||||||||||||||
| The authors are with the Department of Information Engineering, Hiroshima University | ||||||||||||||
| 著者所属 | ||||||||||||||
| The authors are with the Department of Information Engineering, Hiroshima University | ||||||||||||||
| 著者所属 | ||||||||||||||
| The authors are with the Department of Information Engineering, Hiroshima University | ||||||||||||||
| 著者所属(英) | ||||||||||||||
| en | ||||||||||||||
| The authors are with the Department of Information Engineering, Hiroshima University | ||||||||||||||
| 著者所属(英) | ||||||||||||||
| en | ||||||||||||||
| The authors are with the Department of Information Engineering, Hiroshima University | ||||||||||||||
| 著者所属(英) | ||||||||||||||
| en | ||||||||||||||
| The authors are with the Department of Information Engineering, Hiroshima University | ||||||||||||||
| 著者所属(英) | ||||||||||||||
| en | ||||||||||||||
| The authors are with the Department of Information Engineering, Hiroshima University | ||||||||||||||
| 著者名 |
TingTingQin
× TingTingQin
× Qi, Cao
× QiYingWei
× Satoshi, Fujita
|
|||||||||||||
| 著者名(英) |
Ting, Qin
× Ting, Qin
× Qi, Cao
× Qi, YingWei
× Satoshi, Fujita
|
|||||||||||||
| 論文抄録 | ||||||||||||||
| 内容記述タイプ | Other | |||||||||||||
| 内容記述 | In this paper, we propose a new method to realize quick update of information concerned with shared contents in Peer-to-Peer (P2P) networks. The proposed method is a combination of a hierarchical P2P architecture and a tag-based file management scheme. The hierarchical architecture consists of three layers: the top layer consisting of a collection of central servers, the middle layer consisting of a set of sub-servers, and the bottom layer consisting of a number of user peers. Indexes of files held by each user peer are stored at the sub-servers in the middle layer, and the correlation between file indexes and sub-servers is maintained by central servers using tags. We implemented a prototype of the proposed method using Java, and evaluated the performance through simulations using PeerSim 1.0.4. The results of our experiments indicate that the proposed method is a good candidate for “real-time search engines” in P2P systems; e.g., it completes an upload of 10,000 file indexes to the relevant sub-servers in a few minutes and achieves query forwarding to relevant peers within 100ms. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.20(2012) No.2 (online) DOI http://dx.doi.org/10.2197/ipsjjip.20.463 ------------------------------ |
|||||||||||||
| 論文抄録(英) | ||||||||||||||
| 内容記述タイプ | Other | |||||||||||||
| 内容記述 | In this paper, we propose a new method to realize quick update of information concerned with shared contents in Peer-to-Peer (P2P) networks. The proposed method is a combination of a hierarchical P2P architecture and a tag-based file management scheme. The hierarchical architecture consists of three layers: the top layer consisting of a collection of central servers, the middle layer consisting of a set of sub-servers, and the bottom layer consisting of a number of user peers. Indexes of files held by each user peer are stored at the sub-servers in the middle layer, and the correlation between file indexes and sub-servers is maintained by central servers using tags. We implemented a prototype of the proposed method using Java, and evaluated the performance through simulations using PeerSim 1.0.4. The results of our experiments indicate that the proposed method is a good candidate for “real-time search engines” in P2P systems; e.g., it completes an upload of 10,000 file indexes to the relevant sub-servers in a few minutes and achieves query forwarding to relevant peers within 100ms. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.20(2012) No.2 (online) DOI http://dx.doi.org/10.2197/ipsjjip.20.463 ------------------------------ |
|||||||||||||
| 書誌レコードID | ||||||||||||||
| 収録物識別子タイプ | NCID | |||||||||||||
| 収録物識別子 | AN00116647 | |||||||||||||
| 書誌情報 |
情報処理学会論文誌 巻 53, 号 4, 発行日 2012-04-15 |
|||||||||||||
| ISSN | ||||||||||||||
| 収録物識別子タイプ | ISSN | |||||||||||||
| 収録物識別子 | 1882-7764 | |||||||||||||