An efficient method for search associate nodes in P2P network
碩士 === 國立屏東商業技術學院 === 資訊管理系(所) === 98 === Existing P2P search methods in unstructured networks usually calculate its own node capacity before develop all possible design issues, thus making lookup more efficient. This study proposes a novel search scheme based on clustering analysis. The target Peer...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/75468039660550089977 |
| Summary: | 碩士 === 國立屏東商業技術學院 === 資訊管理系(所) === 98 === Existing P2P search methods in unstructured networks usually calculate its own node capacity before develop all possible design issues, thus making lookup more efficient. This study proposes a novel search scheme based on clustering analysis. The target Peer first chooses some neighbors and computes the similarity between itself and them. Searching is started based on similarity accordingly. Finally, we experiment and validate the performance of system parameters.
|
|---|