このエントリーをはてなブックマークに追加
ID 19661
Eprint ID
19661
フルテキストURL
著者
Aoki Naomi Hiroshima University
Fujita Satoshi Hiroshima University
抄録
Tan et al. proposed a scheme to improve the quality of a file search in unstructured Peer-to-Peer systems by focusing on the similarity of interest of the participating peers. Although it certainly improves the cost/performance ratio of a simple flooding-based scheme used in conventional systems, the Tan's method has a serious drawback such that a query cannot reach a target peer if a requesting peer is not connected with the target peer through a path consisting of peers to have similar interest to the given query. In order to overcome such drawback of the Tan's method, we propose a scheme to reconfigure the underlying network in such a way that a requesting peer has a neighbor interested in the given query, before transmitting a query to its neighbors. The performance of the proposed scheme is evaluated by simulation. The result of simulation indicates that it certainly overcomes the drawback of the Tan's method.
発行日
2009-11-12
出版物タイトル
Proceedings : Fifth International Workshop on Computational Intelligence & Applications
2009巻
1号
出版者
IEEE SMC Hiroshima Chapter
開始ページ
147
終了ページ
152
ISSN
1883-3977
NCID
BB00577064
資料タイプ
会議発表論文
言語
English
著作権者
IEEE SMC Hiroshima Chapter
イベント
5th International Workshop on Computational Intelligence & Applications IEEE SMC Hiroshima Chapter : IWCIA 2009
イベント地
東広島市
イベント地の別言語
Higashi-Hiroshima City
論文のバージョン
publisher
査読
有り
Eprints Journal Name
IWCIA