English  |  正體中文  |  简体中文  |  Items with full text/Total items : 886/886 (100%)
Visitors : 7623506      Online Users : 85
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://ccur.lib.ccu.edu.tw/handle/A095B0000Q/800


    Title: 軟體定義網路之動態負載平衡路由規劃;Dynamic Traffic Reroute for Network Load Balancing in OpenFlow Networks
    Authors: 方浩任;Fang, How-Jen
    Contributors: 通訊工程研究所
    Keywords: sFlow;動態負載平衡;軟體定義網路;資料流管理;sFlow;Traffic Flows Management;Dynamic Load Balance;SDN
    Date: 2017
    Issue Date: 2019-07-17 10:47:54 (UTC+8)
    Publisher: 通訊工程研究所
    Abstract: 本論文主要研究資料流負載平衡機制,使資料流達到更佳的網路頻寬使用率及吞吐量。在網路傳輸的過程中,決定如何進行資料流的路由時間點通常在於新的連線進入網路時,但網路的流量是會隨時變化的,所以較好的負載平衡,應依據網路現況,將較壅塞的link中的資料流動態重新路由,來提高網路效能。 透過OpenFlow及交換機中sFlow的功能,運用軟體定義網路的特性,以中控的方式控制網路路由,並由sFlow來取樣網路封包,透過取樣的方法,分析網路中各資料流之頻寬,接著偵測出較壅塞的link,獲取網路頻寬使用資訊,再依據本論文所提出之對TCP資料流進行動態負載平衡的演算法,找出網路環境中,目前最壅塞的link並選出需進行重新路由的資料流,將資料流路由至網路環境中最佳的路徑,經過不斷的偵測壅塞的link及重新路由的動作,將網路中的資料流,切換至更佳的路徑。本論文也提出最大化網路TCP資料流傳輸頻寬的數學模型,計算實際實驗組所能達到的整體網路之吞吐量最大極限值,以此驗證我們的方法。經實驗發現,此資料流負載平衡機制可以提升整體網路的吞吐量,本論文提出之路由機制可比一般路由方法更接近最佳化模型所算出的結果,達到比傳統網路更佳且更公平的網路頻寬使用率。
    The purpose of this thesis is to survey elephant flows dynamic load balancing mechanism, and increasing throughput of elephant flows in network. The connections setup and leaving are usually behaving randomly by time and transferred file size. Therefore, a perfect load balancing mechanism should aim to setup the path by considering the network link utilization and all traffics throughput at the same time when any traffic come in or leave the network. We use SDN and sFlow to implement this system. We route all traffics in the network by OpenFlow which is feature as a central control system. In the same time, we analyze flows bandwidth on each link by sFlow sample packet module. Next we will detect the congestion links, and use the mechanism that we present in this paper to reroute the flow choose from the congestion link. What’s more, this paper includes an optimal model to proof how large is the effect that caused by this mechanism. The results of experiment revealed that our mechanism could increase the throughput of traffics and reduce the file transfer time in most of cases. Traffic routed by this dynamic load balancing mechanism could be more effective and fair.
    Appears in Collections:[通訊工程研究所] 學位論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML31View/Open


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


    版權聲明 © 國立中正大學圖書館網頁內容著作權屬國立中正大學圖書館

    隱私權及資訊安全政策

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback