English  |  正體中文  |  简体中文  |  Items with full text/Total items : 69937/69937 (100%)
Visitors : 23188958      Online Users : 754
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/9447


    Title: 具位置知覺之混合式P2P興趣分群系統;A Locality-Awared Hybrid P2P System with Interest Grouping
    Authors: 胡鈞証;Chun-Cheng Hu
    Contributors: 資訊工程研究所
    Keywords: 超立方體結構;興趣分群;位置知覺;混合式P2P系統;hypercube;interest grouping;locality-awared;hybrid P2P system
    Date: 2007-09-10
    Issue Date: 2009-09-22 11:47:57 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 同儕網路 (Peer-to-Peer;P2P) 近幾年來被大量的應用在網路服務上,而一個同儕系統如果具有位置知覺能力的話將會大幅增加系統效能。所以本篇論文提出利用層級架構 (hierarchical structure)來達成位置知覺並且將使用者依興趣分群的混合式P2P系統。在本系統中,使用者會依照位置區域和興趣分群並且利用超立方體結構 (hypercube structure) 來替使用者定址。整個系統從位置區域的觀點來看,系統將依實體位置相近的使用者分配在同一個區域之內,從興趣的觀點來看,系統將把使用者依興趣性質邏輯上的分成若干個興趣叢集 (Interest Cluster),然後經由選舉出的超級節點 (super node) 來替其底下普通節點 (peer node)來進行跨區域與跨興趣的詢問,也就是說在本系統之下大部分的詢問訊息 (Query Message) 將只在鄰近的區域與同樣的興趣叢集之下發生,進而提升同儕網路的詢問與搜尋效能。我們還為系統運作設計了三種通訊協定,分別是節點加入、離開與搜尋通訊協定。最後我們利用 NS2 來模擬系統,並分別以點對點延遲與詢問所經過的 hop 數模擬距離以評估本系統的效能,模擬的結果顯示出在依時間順序加入系統的節點,假設其位置是均勻分散且網路節點相當多的情況之下本篇論文所提出的方法會大大的提升系統效能。 Peer-to-peer system (P2P system) is becoming a key technology and has been widely a platform for users to search and share file over the Internet. However P2P system tends to waste the network bandwidth because of its decentralized resource management. Consequently, efficient querying or searching becomes one of the important design issues in peer-to-peer system (P2P system). In this paper, we proposed a locality-awared hybrid P2P system with interest grouping. In this system, users are physically divided into several locality regions and logically grouped into several interest clusters. And we employ a hypercube structure to address users. Moreover, super nodes are elected to route the inter-region and inter-cluster query messages. That is the bulk of query messages will be routed in the same locality region and interest cluster. We also devised corresponding node Join, Leave and Search protocol. Finally, we evaluate the system performance of our approach by NS2 simulator. The experimental results show that if the number of participant nodes in the network are enough and even the nodes which the location are uniform distributed will join the system in time sequence, our approach will be outstanding. The results show that the query delay will be reduced to 1/6.63 with comparing to PeerCluster approach.
    Appears in Collections:[資訊工程研究所] 博碩士論文

    Files in This Item:

    File SizeFormat


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明