English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 78852/78852 (100%)
造訪人次 : 37835852      線上人數 : 2994
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


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


    題名: 軟體定義網路超檔案系統;An SDN-Based Hyper File System
    作者: 郭正屏;Guo,Zheng-Ping
    貢獻者: 資訊工程學系
    關鍵詞: 軟體定義網路;分散式檔案系統;糾刪碼;剩餘網路;平均端到端延遲;可靠性;Software Defined Networking;Distributed File System;Erasure Code;Residual Network;Average End to End Delay;Reliability
    日期: 2016-07-27
    上傳時間: 2016-10-13 14:27:29 (UTC+8)
    出版者: 國立中央大學
    摘要: 本論文提出一個稱為Reef的超檔案系統(Hyper File System)。Reef 結合軟體定義網路(Software-Defined Networking, SDN)及分散式檔案系統(Distributed File System, DFS) 技術。使用軟體定義網路的控制器(Controller)集中式管理網路通信量,可以更有效率的分配網路資源解決網路壅塞、降低延遲時間及減少頻寬消耗;使用分散式檔案系統當作儲存空間,則具有高度的可擴展性,營運商可以根據需求增加或減少儲存資源,使得檔案系統的使用更佳靈活。Reef也整合糾刪碼(Erasure code, EC)提高資料可靠性。糾刪碼是一種數據容錯方法,它將數據分割成不同片段,將其擴展、編碼,並存儲在不同的位置。相比多副本複製容錯方法而言,糾刪碼能夠以更小的數據冗餘獲得更高數據可靠性。本論文也提出Residual-Network Multiple Shortest Path (RNMSP)演算法找出路徑以到達平均端點至端點延遲(Average end to end delay)最低的儲存節點,並將經過糾刪編碼後的檔案存在各個節點,達到異地備源的功能。本論文並針對RNMSP演算法及其他儲存節點路徑尋找演算法在不同網路拓樸上進行模擬,以比較其執行時間及平均端點至端點延遲。;In this study, we propose a hyper file system, named Reef, which is a combination of the technologies of Software Defined Networking (SDN) and the Distributed File System (DFS). Reef uses the SDN controller to manage network traffic in a centralized way so that the network resources can be allocated more efficiently to reduce network latency, congestion, and bandwidth consumption. Furthermore, Reef uses DFS storage nodes to store data to keep high scalability; operators can increase or decrease storage resources dynamically according to users demands, leading to high utilization of the file system. Reef also integrates the erasure code (EC) to improve data reliability. The EC is a method to make data fault-tolerant; it divides data into different fragments, which are encoded with redundancy to be stored across a set of different locations. Compared with the traditional multi-replica method to make data fault-tolerant, the EC can utilize smaller data redundancy for higher data reliability. We also propose the Residual-Network Multiple Shortest Path (RNMSP) algorithm to find paths to the storage nodes minimizing the average end to end delay for storing EC-encoded data blocks. We simulate the RNMSP algorithm and other related storage node path-finding algorithms under different network topologies for comparing algorithms in terms of the execution time and the average end to end delay.
    顯示於類別:[資訊工程研究所] 博碩士論文

    文件中的檔案:

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


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