A Capability–aware Tree-like Overlay for Unstructured P2P Networks
碩士 === 國立清華大學 === 資訊工程學系 === 92 === Unstructured P2P systems rely on a certain kind of flooding to discover resources. A popular unstructured P2P system, Gnutella, uses the blind flooding which causes a large amount of network traffic due to redundant messages. The recent statistics results conclude...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2004
|
Online Access: | http://ndltd.ncl.edu.tw/handle/67416873476500945789 |
id |
ndltd-TW-092NTHU5392100 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-092NTHU53921002015-10-13T13:08:03Z http://ndltd.ncl.edu.tw/handle/67416873476500945789 A Capability–aware Tree-like Overlay for Unstructured P2P Networks 無結構性點對點網路中利用節點能力的樹狀架構 Shih-Yen Gau 高世彥 碩士 國立清華大學 資訊工程學系 92 Unstructured P2P systems rely on a certain kind of flooding to discover resources. A popular unstructured P2P system, Gnutella, uses the blind flooding which causes a large amount of network traffic due to redundant messages. The recent statistics results concluded that the total traffic introduced by a 50,000-node Gnutella network is roughly 1 Gbit per second. There are thus several research works on improving search efficiency (including the reduction of search network traffic) for unstructured P2P systems. However, previous studies do not address issues such as quality of search results. In this thesis, we propose a multiple tree-like overlay structure for resource discovery in unstructured P2P systems. We exploit the heterogeneity of peers in each tree-like cluster by connecting peers with more capacity closer to the root of the tree. Based on our structure, the traffic overhead caused by pure flooding can be reduced considerably. We also address the application-specific issue in our system by tailoring each cluster according to users’ needs. We implement our system with Java v1.4.2 and validate the correctness of our implementation using prototype experiments. The experimental results show that peers can rapidly join our system; the system is robust even if peers arbitrarily join or leave. Chung-Ta King 金仲達 2004 學位論文 ; thesis 43 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立清華大學 === 資訊工程學系 === 92 === Unstructured P2P systems rely on a certain kind of flooding to discover resources. A popular unstructured P2P system, Gnutella, uses the blind flooding which causes a large amount of network traffic due to redundant messages. The recent statistics results concluded that the total traffic introduced by a 50,000-node Gnutella network is roughly 1 Gbit per second. There are thus several research works on improving search efficiency (including the reduction of search network traffic) for unstructured P2P systems. However, previous studies do not address issues such as quality of search results.
In this thesis, we propose a multiple tree-like overlay structure for resource discovery in unstructured P2P systems. We exploit the heterogeneity of peers in each tree-like cluster by connecting peers with more capacity closer to the root of the tree. Based on our structure, the traffic overhead caused by pure flooding can be reduced considerably. We also address the application-specific issue in our system by tailoring each cluster according to users’ needs. We implement our system with Java v1.4.2 and validate the correctness of our implementation using prototype experiments. The experimental results show that peers can rapidly join our system; the system is robust even if peers arbitrarily join or leave.
|
author2 |
Chung-Ta King |
author_facet |
Chung-Ta King Shih-Yen Gau 高世彥 |
author |
Shih-Yen Gau 高世彥 |
spellingShingle |
Shih-Yen Gau 高世彥 A Capability–aware Tree-like Overlay for Unstructured P2P Networks |
author_sort |
Shih-Yen Gau |
title |
A Capability–aware Tree-like Overlay for Unstructured P2P Networks |
title_short |
A Capability–aware Tree-like Overlay for Unstructured P2P Networks |
title_full |
A Capability–aware Tree-like Overlay for Unstructured P2P Networks |
title_fullStr |
A Capability–aware Tree-like Overlay for Unstructured P2P Networks |
title_full_unstemmed |
A Capability–aware Tree-like Overlay for Unstructured P2P Networks |
title_sort |
capability–aware tree-like overlay for unstructured p2p networks |
publishDate |
2004 |
url |
http://ndltd.ncl.edu.tw/handle/67416873476500945789 |
work_keys_str_mv |
AT shihyengau acapabilityawaretreelikeoverlayforunstructuredp2pnetworks AT gāoshìyàn acapabilityawaretreelikeoverlayforunstructuredp2pnetworks AT shihyengau wújiégòuxìngdiǎnduìdiǎnwǎnglùzhōnglìyòngjiédiǎnnénglìdeshùzhuàngjiàgòu AT gāoshìyàn wújiégòuxìngdiǎnduìdiǎnwǎnglùzhōnglìyòngjiédiǎnnénglìdeshùzhuàngjiàgòu AT shihyengau capabilityawaretreelikeoverlayforunstructuredp2pnetworks AT gāoshìyàn capabilityawaretreelikeoverlayforunstructuredp2pnetworks |
_version_ |
1717732124629401600 |