English  |  正體中文  |  简体中文  |  Items with full text/Total items : 888/888 (100%)
Visitors : 11987471      Online Users : 59
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/9


    Title: 軟體定義網路資料中心中 具負載公平性之群播路由機制;Multicast Routing with Fairness Consideration in Software Defined Networks
    Authors: 吳芃嬅;Wu, Peng-Hua
    Contributors: 資訊工程研究所
    Keywords: 群播路由機制;軟體定義網路;負載平衡;Multicast;Software Defined Network;Load Balancing
    Date: 2018
    Issue Date: 2019-05-23 10:30:08 (UTC+8)
    Publisher: 資訊工程研究所
    Abstract: 在現在雲端服務快速擴展的趨勢下,數據中心被廣泛的使用在生活上。而由一些終端設備產生的群播樹內,群組內的溝通技術已是必要的工具且越來越普遍的使用在資料中心中。由於傳統網路的IP Multicast群播機制的許多缺陷,並無法大量使用在現今的網路上,而軟體定義網路技術的出現提供了一個創新的概念,使得群播機制在資料中心中有了新的運作模式而更完整。 Avalanche在資料中心Fat-Tree架構下,使用了軟體定義網路技術而突顯出了此架構下的路徑多樣性特性,並提出了一個具可擴充性的路由機制解決了Steiner Tree的問題。然而,Avalanche的演算法在某些情況下未能提供最佳解的選擇,因此我們想對此問題進行改良。我們提出了一套新的路由機制LMCTree,此方法必可以尋找到群播樹的最佳解,而將此方法與Avalanche進行效能的比較後,也確實得到了可靠的數據結果。再者,希望我們的方法可以提供負載平衡服務以及避免Flow entry的overflow,因此將負載公平性及Flow entry公平性也列入考量選出最佳的群播樹。
    With the rapid development for cloud computing, data centers are widely deployed worldwide. In data centers, many applications rely on group communication which is usually implemented via IP multicast mechanism. However, previous research on IP multicast does not take the special structure of data centers’ network topology into consideration. As a consequence, solutions from previous research works do not fit well into data centers. On the other hand, the Software Defined Networking (SDN) technique provides programmatic access to the network devices which make network control, such as multicast routing, much more flexible. Thus, it becomes very promising to use SDN to provide innovative multicast routing in data centers. Avalanche is a recent work which proposed a multicast routing solution, referred to as AvRA, in data centers using SDN. AvRA highlights the feature of path diversity in the data center and was able to build a near optimal multicast tree under the Fat Tree topology. However, it is not guaranteed to find the minimum cost Steiner Tree. Therefore, in this thesis, a new routing algorithm, referred to as LMCTree, is proposed. By utilizing special designed location-aware logical MAC address, LMCTree is able to find minimum cost Steiner Tree if the cost of each link is unity. We then further extend LMCTree to consider load balancing of link utilization and size of flow table. Our simulation results show that LMCTree is able to achieve better performance as compared to Avalanche.
    Appears in Collections:[資訊工程學系] 學位論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML378View/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