このエントリーをはてなブックマークに追加
ID 28464
本文ファイル
Thumnail A1212.pdf 742 KB
著者
Aoki, Naomi
NDC
技術・工学
抄録(英)
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.
掲載誌名
5th International Workshop on Computational Intelligence & Applications Proceedings : IWCIA 2009
開始ページ
147
終了ページ
152
出版年月日
2009-11
出版者
IEEE SMC Hiroshima Chapter
ISSN
1883-3977
言語
英語
NII資源タイプ
会議発表論文
広大資料タイプ
会議発表論文
DCMIタイプ
text
フォーマット
application/pdf
著者版フラグ
publisher
権利情報
(c) Copyright by IEEE SMC Hiroshima Chapter.
関連情報URL
部局名
工学研究科