• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

以新的信賴模型提昇分散計算環境之整體計算品質 / Improving Overall Computation Quality of the Grid&P2P Computing Environment with a New Trust Model

彭士爵, Peng,Shih-Chueh Unknown Date (has links)
在龐大且開放的分散式計算環境中,傳統的信賴模型由於缺乏完善的信賴程度更新機制,很容易出現節點間推薦優良服務的效能低落、服務熱點產生、甚至是無法有效排擠詐欺服務的問題,因而導致額外成本的付出。本論文利用社會學行動理論與人際環境關係理論,設計的一個新的信賴模型。在此信賴模型中,發展節點間的 「合作」、 「競爭」 以及 「同業公會」 等橫向關係,提升節點間信賴程度的更新效率,進而增進信賴模型的穩定性。我們設計了一個有視覺化介面的分散式計算環境動態模擬器,以測試信賴模型在面對動態環境中無法預期的計算節點 「上線」、 「離線」、 「無預警當機」 甚至 「出現詐欺服務」 時的應變能力。模擬實驗證實,我們的信賴模型在整體服務滿意度、計算成本等指標上,均有較佳的表現。 / In a large open distributed computing environment, due to the lack of a good mechanism for trust update among computing nodes, traditional trust model often encounters problems such as low quality of service recommendation, occurrence of hot spots, and no effective mechanism to exclude deceptive nodes. In this thesis, we use the action theory and inter-person relation theory in social science to design a new trust model with relations between nodes such as cooperation, competition, and guild to improve the efficiency and stability of trust update. We have designed a dynamic simulator with a visual interface for distributed computing to test the abilities of the trust model under scenarios such as bringing nodes on-line, taking nodes off-line, unexpectedly service outage, and occurrence of deceptive nodes. Our experiments revealed that our trust model has superior performance in various indices such as service satisfaction and computational cost.

Page generated in 0.024 seconds