English  |  正體中文  |  简体中文  |  Items with full text/Total items : 66984/66984 (100%)
Visitors : 22676079      Online Users : 278
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/72175


    Title: 應用於資料中心之負載平衡演算法;Intra Data Center Path Load Balancing
    Authors: 郭哲岳;Kuo,Che-Yueh
    Contributors: 資訊工程學系
    Keywords: 資料中心架構;負載平衡;分散式;Datacenter fabric;Load balancing;Distributed
    Date: 2016-08-02
    Issue Date: 2016-10-13 14:30:24 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 在數據中心中,負載平衡是一個很重要的技術,用來處理動態與不
    可預測的交通需求量。一般而言,負載平衡的目標是分配相等的交通
    量到多重路徑上。然而,大多數的方法都受制於封包亂序或者快速回
    應。近年來,Flare 引進基於flowlet 的分流方法,它達到快速回應且不
    造成封包亂序。但是,資料中心內的高頻寬環境造成產生flowlet 的間
    隔減少。除此之外,分流的細膩度會隨著交通量變大而變粗,在此篇
    論文中,我們提出一個人工flowlet 為基底的負載平衡演算法,其能保
    持好的分流細膩度且避免封包亂序,在實驗中顯示,我們的方法在流
    的完成時間好20%。;Load balancing is an important technique to cope with dynamic and unpredictable
    traffic demands in data center networks. In general, load balancing
    schemes aim to split traffics evenly among multiple paths. However, most
    existing approaches either suffers from packet reordering (which may confuse
    TCP congestion control) or fail to quick response (i.e., coarse slicing
    granularity). Recently, FLARE introduced a burst (called flowlet) based traffic
    splitting, which attains responsiveness without causing packet reordering.
    However, the very high bandwidth of internal datacenter flows suggests that
    the gaps needed for flowlets may be rare. Besides, in Flare, splitting granularity
    increases (i.e., coarse granularity) when flow size increases. In this
    paper, we propose an artificial flowlet-based load balancing algorithm which
    can maintain fine-granularity (even in large flows) and can also avoid packet
    reordering. Our scheme has at least 20% improvement in flow completion
    time under the same incidence of packet reordering.
    Appears in Collections:[資訊工程研究所] 博碩士論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML88View/Open


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