記
錄
5741
編
號
狀
NC093FJU00392002
態
助
教
查
核
索
書
號
學
校
輔仁大學
名
稱
系
所
資訊工程學系
名
稱
舊
系
所
名
稱
學
49251602
號
研
究
林信宏
生(
中)
研
究
Hsin-Hung Lin
生(
英)
論
建構以共同興趣為群組之同儕網路
文
名
稱(
中)
論
文
名 Constructing Peer-to-Peer Networks Using Common Interest Grouping
稱(
英)
其
他
題
名
指
導
教 呂俊賢
授(
中)
指
導
教 Jonathan C. Lu
授(
英)
校
內全
文開
放日
期
校
外
全
文
開
放
日
期
全
文
不
開
放
理
由
電
子
全
文
送
交
國
圖.
國
圖
全
文
開
放
日
期.
檔
案
說明
電
子
全
文
學
位
碩士
類
別
畢
業
學 93
年
度
出
版
年
語
文 英文
別
關
鍵
演算法 使用者 興趣 頻寬 群組
字(
中)
關
鍵
group interest peer p2p dynamic
字(
英)
隨著網路頻寬的增加，同儕網路(Peer-to-Peer Network)技術已廣泛被使用在檔案傳
輸、分散式計算與語音通訊等應用。如何在同儕網路的廣大資源中搜尋所需的檔案
，是目前最為熱門的研究議題。大部分相關研究都著重在如何將檔案對應
(mapping)到負責的Peer上，使得在搜尋檔案時只要找尋該Peer即可，讓搜尋更為簡
易而有效率。但這些結果大多忽略了許多使用者可能大部分時間都在尋找合乎某一
方面興趣的檔案，而非漫無目的搜尋。如果我們能將具有著共同興趣的Peer聚集在
摘
一起，讓檔案在鄰近的地方就能夠快速地被搜尋到，如此將能降低搜尋反應時間，
要(
並同時減少許多不必要的頻寬浪費。 在本篇論文之中，我們提出一個依使用者興
中)
趣為基礎的同儕網路，使Peer在加入同儕網路時，能以Peer的共同興趣形成叢集，
並透過我們設計的動態調整演算法，使相似的叢集能互相鄰近。我們並提出一個有
效率的搜尋機制，讓使用者能在花費較少的頻寬下依照本身地興趣快速搜尋到相符
的檔案。電腦模擬結果顯示我們所提出的架構在使用者搜尋興趣較為集中時，和
Gnutella架構相比，約可減少百分之三十至七十的頻寬使用，並且所有符合條件的
檔案，有較高的涵蓋比率。
With the help of increasing network bandwidth, peer-to-peer systems have been widely
applied to various applications such as file transfer, distributed computing, and voice over
IP communication. How to the desired search files in a large-scale peer-to-peer network
has been a very popular research topic in recent years. Most researches in this area have
focused on mapping files to their responsible peers to improve the efficiency of the
document search. However, most of them did not take into consideration the fact that a
摘 peer usually searches for files related to a specific interest. If a peer could join a group the
peers in which share a lot of common interest, then most of its searches may be satisfied
要(
within the group without going to the outside. Therefore, the search response time and
英) network bandwidth consumption can both be much reduced. In this work, we focused on
how to make use of users’ interest to organize peers into different clusters. We proposed
both a dynamic adjustment algorithm and an interest search method which could enable
peers to confine the search only in the clusters of similar interest instead of flooding to
the whole network. Simulation results showed that our method consumed thirty to
seventy percent less bandwidth than the Gnutella protocol when each peer’s search
focused on a specific interest.
論
文
目
次
Contents 1 Introduction................................................1 1.1 Peer-to-Peer
Network......................................2 1.2 Peer-to-Peer Network Architecture.........................2
1.2.1 Centralized Model.......................................3 1.2.2 Decentralized and Unstructured
Model....................4 1.2.3 Decentralized and Structured Model......................5 1.2.4
Hybrid Model............................................7 1.3 Building an Interest-Group Based Peer-toPeer Network.....9 2 Related Work...............................................11 3 System
Architecture........................................14 3.1 System Concept...........................................14
3.2 Interest-Group Based Peer-to-Peer System.................15 3.2.1 System Architecture
Overview...........................15 3.2.1.1 Group and the Leader of Group........................16
3.2.1.2 Peer Joining and Rejoining...........................18 3.2.2 Dynamic Adjustment of
Logical Network..................20 3.2.2.1 Dynamic Adjustment of Inter-Group
Links..............20 3.3 File Search..............................................23 3.3.1 Neighborhood
Search....................................23 3.3.2 Global Search..........................................24 4
Simulation.................................................26 4.1 Simulation
Environment...................................26 4.2 Simulation Results.......................................26 5
Conclusions and Future Research............................33
References...................................................35
參
考
文
獻
References [1] H. Kobayashi, H. Takizawa, T. Inaba, and Y. Takizawa, “A SelfOrganizing Overlay Network to Exploit the Locality of Interests for Effective Resource
Discovery in P2P Systems,” Proceedings of 2005 Symposium on Applications and the
Internet (SAINT’05), January 2005. [2] Flavio DePaoli and Leonardo Mariani,
“Dependability in Peer-to-Peer System,” IEEE Internet Computing, July/August 2004. [3]
Heng Tao Shen, Yanfeng Shu, and Bei Yu, “Efficient Semantic-Based Content Search in
P2P Network,“ IEEE Trans. Knowledge and Data Engineering, Vol.16, No.7, July 2004.
[4] M. Srivatsa, B. Gedik, and Ling Liu, “Scaling Unstructured Peer-to-Peer Networks
With Multi-Tier Capacity-Aware Overlay Topologies,” Proceedings of the Tenth
International Conference on Parallel and Distributed Systems (ICPADS’04), July 2004.
[5] Paul Stacey, Damon Berry, and Eugene Coyle, “Using Structured P2P Overlay
Networks to Build Content Sensitive Communities,” Proceedings of the Tenth
International Conference on Parallel and Distributed Systems (ICPADS’04), July 2004.
[6] Due A. Tran, Kien A. Hua, and Tai T. Do, “A Peer-to-Peer Architecture for Media
Streaming,” IEEE Journal on Selected Areas in Communications, VOL. 22, NO. 1,
January 2004. [7] Zhi Li and Prasant Mohapatra, “QRON: QoS-Aware Routing in
Overlay Networks,” IEEE Journal on Selected Areas in Communications, VOL. 22, NO.
1, January 2004. [8] Jian Yang, Yip Zhong and Shiong Zhang, “An Efficient InterestGroup Based Search Mechanism in Unstructured Peer-to-Peer Networks,” International
Conference on Computer Networks and Mobile Computing (ICCNMC’03), Oct. 2003.
[9] Kazuhiro Kojimam, “Grouped Peer-to-Peer Networks and Self-Organization
Algorithm,” IEEE International Conference on Systems, Man and Cybernetics, Oct. 2003.
[10] Domenicao Talia and Paolo Trunfio,“Toward a Synergy Between P2P and Grids,”
IEEE Internet Computing, July/August 2003. [11] Kunwadee Sripanidkulchai, Bruce
Maggs, and Hui Zhang, ”Efficient Content Location Using Interest-Based Locality in
Peer-to-Peer Systems," in IEEE INFOCOM, April 2003. [12] Ion Stoica, et al.,“Chord: A
Scalable Peer-to-Peer Lookup Protocol for Internet Applications,”IEEE/ACM
Transactions on Networking, February 2003. [13] Bernard Traversat, Mohamed
Abdelaziz, and Eric Pouyoul, “Project JXTA: A Loosely-Consistent DHT Rendezvous
Walker,” available at http://www.jxta.org, 2003. [14] Murali Krishna Ramanathan, Vana
Kalogeraki, and Jim Pruyne. “Finding Good Peers in Peer-to-Peer Network,” In
Proceedings of the International Parallel and Distributed Processing Symposium
(IPDPS’02), April 2002. [15] Matei Ripeanu, Adriana Iamnitchi, and Ian Foster,
“Mapping the Gnutella Network,” IEEE Internet Computing, January/February 2002.
[16] Steve Waterhouse, et al., “Distributed Search in Peer-to-Peer Networks,” IEEE
Internet Computing, January/February 2002. [17] Stefan Saroiu, P. Krishna Gummadi,
and Steven D. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems,” in
Proceedings of the Multimedia Computing and Networking (MMCN), January 2002. [18]
Hui Zhang, Ashish Goel, and Ramesh Govindan, “Using the Small-World Model to
Improve Freenet Performance,” IEEE INFOCOM, 2002. [19] Y. Beverly and G. M.
Hector, “Designing a Super-Peer Network,” Technical report, Stanford Univ., 2002. [20]
B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph, “Tapestry: An Infrastructure for FaultResilient Wide-Area Location and Routing,” Technical Report UCB//CSD-01-1141, U.
C. Berkeley, April 2001. [21] A. Rowstron and P. Druschel, ”Pastry: Scalable, Dstributed
Object Location and Routing for Large-Scale Peer-to-Peer Systems” IFIP/ACM
International Conference on Distributed System Platforms (Middleware), Nov. 2001. [22]
S. Ratnasamy, Ratnasamy, P. Francis, M. Handley, and R. Karp, “A Scalable ContentAddressable Network,” Proc. Of the ACM SIGOMM Conference, 2001. [23] L. Fan, P.
Cao, J. Almeida, and A. Broder, “Summary Cache: A Scalable Wide-Area Web Cache
Sharing Protocol,” IEEE/ACM Transactions on Networking, Vol.8, No.3, pp. 281-293,
2000. [24] D.J. Watts, “Small-Worlds,” Princeton Univ. Press., 1999. [25] P. Salton, A.
Wong, and C. S. Yang, “A Vector Space Model for Automatic Indexing.”
Communications of the ACM, Nov. 1975. [26] B. Bloom, “Space/time Trade-offs in
Hash Coding with Allowable Errors,” Communications of the ACM, vol. 13, no. 7, pp.
422–426, July 1970. [27] “Napster,” http://www.napster.com [28] “Gnutella,”
http://gnutella.wego.com [29] “Gnutella Protocol Specification v0.6”, http://rfcgnutella.sourceforge.net/developer/testing/index.html [30] “KaZaA,“
http://www.kazaa.com [31] “LimeWire,” http://www.limewire.com
論
文
38
頁
數
附
註
全
文
點
閱次
數
資
料
建
置
時
間
轉
檔
日
期
全
文
檔
存
取
記
錄
異
動
M admin Y2008.M7.D3 23:17 61.59.161.35
記
錄