English  |  正體中文  |  简体中文  |  Items with full text/Total items : 69561/69561 (100%)
Visitors : 23043506      Online Users : 287
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://ir.lib.ncu.edu.tw/handle/987654321/79550

    Title: 極端資料流在雲端資料中心之路由方法研究;Study of Routing Algorithm for Extreme Types of Flows in Cloud Data Center
    Authors: 林佳叡;Lin, Chia-Ray
    Contributors: 通訊工程學系
    Keywords: 雲端資料中心;路徑演算法
    Date: 2019-01-17
    Issue Date: 2019-04-02 15:00:17 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 架設雲端資料中心的目的就是要提供多項的服務,而這些服務未來會使用越來越多
    以往最常被使用的 Dijkstra’s 演算法,是使用在普遍的網路拓樸,但是雲端資料中心的
    我們設計出了 pairing 演算法,將以往大部分是從一個節點開始尋找路徑,變成從
    而且滿足率超過 80% 但不包括完全滿足的資料流比例也比較多。這是因為我們有效的
    有更高的滿足率。;The purpose of deploying cloud data center is to provide different kinds of services.
    However, these services would require more and more network resources in the future.
    Therefore, the efficiency of allocating network resources in cloud data center has become an
    important issue. Dijkstra’s algorithm is one of the most used routing algorithm for general
    networks. But the topology and traffic pattern in cloud data center are different from the
    general networks, so it’s essential to design a routing algorithm for cloud data center to
    provide a solution for allocating the network resources.
    We designed the pairing algorithm, which searches a path from two nodes instead of
    one. In order to transfer data among massive servers with guaranteed speed and reliability, the
    network topology is especially designed with multiple path. It’s able to search a path
    according to the pattern of the topology from two nodes and don’t need to concern that these
    two nodes will not be able to meet to provide the path. This makes pairing algorithm allowed
    to discover a path from two aspects simultaneously as well. Besides routing algorithm, we
    also proposed two method of splitting flows, which allows the flows to use more network
    resources and reduces the chance of a flow to be blocked.
    According to the simulation result, the pairing algorithm and split with allocation
    constraint is able to reduce the ratio of complete blocking effectively. Also, the ratio of flows
    satisfied over 80% without fully satisfied is higher. Therefore, we allocate the network
    resource more efficiently, not only more flows can be established, but also more flows
    achieve over 80% of satisfaction rate.
    Appears in Collections:[通訊工程研究所] 博碩士論文

    Files in This Item:

    File Description SizeFormat

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

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