中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/44512
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 80990/80990 (100%)
造訪人次 : 41678338      線上人數 : 1451
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/44512


    題名: 以階層式叢集聲譽為基礎之行動同儕網路拓撲架構;HiCO: A Mobile Peer-to-Peer Overlay with Cluster-Based Reputation Hierarchy
    作者: 郭子涵;Tzu-Han Kuo
    貢獻者: 通訊工程研究所
    關鍵詞: 覆蓋網路建構;混合覆蓋網路;聲譽系統;同儕網路;內容散佈;hybrid overlay;overlay construction;reputation system;content distribution;P2P
    日期: 2010-07-27
    上傳時間: 2010-12-09 13:46:49 (UTC+8)
    出版者: 國立中央大學
    摘要: 此篇論文提出一個以叢集為基礎的階層式同儕網路拓撲架構。此架構在龐大數量的參與節點中依然擁有可程式化之特性,且於高動態的網路環境中可自我調節。此拓撲架構的組成考慮了節點在網路中的實體位置關係與鄰近關係,且屬於同儕網路中的部份集中式與半結構化架構。在擁有多種特性的動態網路環境中,節點的不可預期性、移動性、搜尋效率及成本將成為此類研究必須克服之問題,然而本篇論文的設計可以讓此架構保有優良的效率與彈性。此外本系統中還加入了聲譽觀念以改善節點不願提出貢獻的問題。以聲譽為考量的特別階層式樹狀架構擁有將節點分群、分割及合併叢集,並減少不公平與不平衡的資源利用。另外,此階層式架構擁有一些緊密合作的程序,以確保在發生節點錯誤時擁有自我修復的彈性。至此,我們研究出了一個強健且有效率的階層式行動同儕網路拓撲架構。在實驗模擬中,此架構將在模擬程式中被驗證,且被證實具有在不降低網路效能的情況下,擁有對抗上述各種問題的能力。This paper proposes a hierarchical cluster-based peer-to-peer overlay scheme which is not only scalable to tremendous peer population, but also sustainable to high network dynamics in a large-scale network environment. This scheme is based on both partially-centralized and semi-structured overlay models by exploiting network locality and proximity. This joint design can keep up system efficacy and flexibility in dynamic network environments where several issues, peer churn, peer mobility, search redundancy and traffic overhead become stickier. In addition, reputation notion is integrated to mitigate the free-riding problem. According to special reputation tree hierarchy, the process of peer clustering elegantly operates cluster division and union to adjust the overall cluster hierarchy so as to somewhat moderate unfair or imbalanced resource utilization over the large-scale system. Furthermore, the hierarchical overlay is resilient to any single point of failure at any cluster. A tie-in process is able to link up the broken paths automatically. Therefore, our effort results in a robust, efficient hierarchical overlay in dynamic peer-to-peer networks. By simulation results, the proposed scheme can react to above issues without compromise of prominent performance.
    顯示於類別:[通訊工程研究所] 博碩士論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML668檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 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 ©   - 隱私權政策聲明