(3.238.130.97) 您好!臺灣時間:2021/05/18 08:46
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:黃文度
研究生(外文):Wen-Du Hwang
論文名稱:以樹為基礎的點對點網路建構
論文名稱(外文):Tree-Based P2P Community Network Construction
指導教授:喬逸偉
指導教授(外文):Yi-Wei Chiao
學位類別:碩士
校院名稱:佛光人文社會學院
系所名稱:資訊學系碩士班
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2005
畢業學年度:94
語文別:中文
論文頁數:54
中文關鍵詞:社群網路點對點網路
外文關鍵詞:community networksp2ptree
相關次數:
  • 被引用被引用:0
  • 點閱點閱:96
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
本篇論文提出一個在點對點網路上利用樹的結構建構網路社群的演算法,使得點對點網路內的節點可以根據其本身主動提出的專業興趣屬性自動組成一個緊密的社群網路(community networks)。而為了加速社群網路的形成,同時去除掉集中式索引節點的作用,這個演算法在不同的社群之間,利用社群的興趣屬性作為索引建立一個參考樹,當新的節點連結上點對點網路但沒找到和自己興趣相符的社群時,就可以利用這個參考樹的資訊快速的找到自己的社群。
In this paper, we propose a tree-based algorithm which constructs community networks based on pre-claimed attributes on any peer-to-peer networks. In order to accelerate the process of community forming without the help of centralized indexing nodes, this algorithm builds a reference tree among different community networks based on their attributes. Thus, whenever a new node arrived, it will be automatically referenced to the proper community networks through the information recorded in the reference tree. In such community network, we may apply any P2P document-search method or distributed data storage system.
第一章:摘要
第二章:研究動機
第三章:相關工作
第四章:導論
第五章:研究目標及問提描述
第六章:通訊協定的設計
第七章:模擬方法
第八章:實驗結果與比較
第九章:結論
參考資料
附表
[1] Mujtaba Khambatti, Kyung Ryu, Partha Dasgupta , Push-Pull Gossiping for Information Sharing in Peer-to-Peer Communities? International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA), Las Vegas, Nevada, June 2003, pp. 1393-1399.

[2] Mayank Bawa, Gurmeet Singh Manku, Prabhakar Raghavan, SETS: Search Enhanced by Topic Segmentation (2003), ACM SIGIR, 31 July 2003

[3] Mario Schlosser, Michael Sintek, Stefan Decker, Wolfgang Nejdl, HyperCuP--Hypercubes, Ontologies and Efficient Search on P2P Networks, 1st Workshop on Agents and P2P Computing, Bologna , Italy, July 2002

[4] Prosenjit Bose & Pat Morin, Ivan Stojmenovic and Jorge Urrutia, Routing with Guaranteed Delivery in Ad Hoc Wireless Networks, Wireless Networks 7, 609–616, 2001

[5] Amir Ben-Dor, Shai Halevi, Assaf Schuster, Potential Function Analysis of Greedy Hot-Potato Routing, Symposium on Principles of Distributed Computing, 1997

[6] Young-Bae Ko, Nitin Vaidya, Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms, Technical Report, TR-98-018, TEXAS A&M University, 1998

[7] Google, http://www.google.com/

[8] Citeseer, http://citeseer.ist.psu.edu/

[9] G. Antoniou and F. van Harmelen, A Semantic Web Primer, The MIT Press, 2004

[10] G. Weiss, Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence, The MIT Press, 2000

[11] Dejan S. Milojicic, Vana Kalogeraki, Rajan Lukose, Kiran Nagaraja, Jim Pruyne, Bruno Richard, Sami Rollins, Zhichen Xu, Peer-to-Peer Computing , HP Labs 2002 Technical Reports, HPL-2002-57R1

[12] W3C(2001). Semantic Web. Retrieved May 30, 2004, from the World Wide Web: http://www.w3.org/2001/sw/

[13] Wooldridge, Jennings :Intelligent Agents: Theory and Practice –Knowledge Engineering Review (1995)

[14] Stoica, Morris..Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications, SIG COMM’01 August 27-31 - (2001)

[15] David Karger, Eric Lehman, Tom Leighton, Mathhew Levine, Daniel Lewin, Rina Panigrahy, Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web , ACM Symposium on Theory of Computing (1997)
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top