軟體定義網路負載平衡演算法效能比較

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：146

、訪客IP：3.135.201.190

姓名

韋地亞(Widhi Yahya) 查詢紙本館藏

畢業系所

資訊工程學系

論文名稱

軟體定義網路負載平衡演算法效能比較
(Performance Comparisons of Load Balancing Algorithms for Software Defined Networking)

相關論文

★ 以IEEE 802.11為基礎行動隨意無線網路之混合式省電通訊協定	★ 以范諾圖為基礎的對等式網路虛擬環境相鄰節點一致性研究
★ 行動隨意網路可調適及可延展之位置服務協定	★ 同儕式網路虛擬環境高效率互動範圍群播
★ 巨量多人線上遊戲之同儕網路互動範圍語音交談	★ 基於范諾圖之同儕式網路虛擬環境狀態管理
★ 利用多變量分析之多人線上遊戲信任使用者選擇	★ 無位置資訊無線感測網路之覆蓋及連通維持
★ 同儕網路虛擬環境3D串流同儕選擇策略	★ 一個使用802.11與RFID技術的無所不在導覽系統U-Guide之設計與實作
★ 同儕式三維資料串流	★ IM Finder: 透過即時通訊網路線上使用者找尋解答
★ 無位置資訊無線感測網路自走車有向天線導航與協調演算法	★ 多匯點無線感測網路省能及流量分散事件輪廓追蹤
★ 頻寬感知同儕式3D串流	★ 無線感測網路旋轉指向天線定位法

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

軟體定義網路(Software Defined Networking, SDN) 的概念是將網路設備中的控制層(control plane)與資料層(data plane)分開。在SDN中，有一個集中管理的控制器(controller)可以設置交換器上的封包轉送表(forwarding table)(也稱為流表(flow table))，負責各種通訊間的封包轉發。SDN的使用者可以在控制器上撰寫應用程式來監控和維護整個網路。負載平衡(load balancing)就是其中一個應用的例子，可以用SDN的概念來達到廣域網路中，分散各處伺服器(server)間負載量的平衡。本論文提出一個負載平衡演算法，利用延伸Dijkstra最短路徑演算法(extended Dijkstra’s shortest path algorithm)，考慮節點權重與邊權重的好處，來找到離客戶端(client)最近的伺服器。我們使用Pyretic 語言來實作演算法，並使用Mininet 模擬工具在Abilene 拓樸下來評估演算法的效能。我們也比較了循環演算法(round-robin algorithm)和隨機演算法(randomized algoithm)的模擬結果。實驗結果顯示本論文提出的演算法比起其他演算法，在控制器上多花費一點點的計算負擔和記憶體使用量，即可達到更短的端到端的延遲(end-to-end latency)，更大的網路吞吐量(throughput)以及更短的反應時間(response time)。

關鍵字: 軟體定義網路(SDN), 負載平衡, 循環演算法, 隨機演算法, Dijkstra最短路徑演算法

摘要(英)

Software Defined Networking (SDN) is a concept that is used to decouple the control plane and data plane of network devices. In SDN, a logically centralized controller configures the forwarding tables (also called flow tables) of switches that are responsible for forwarding the packets of communication flows. SDN users can composite application programs run on top of the controller to monitor and manage the whole network. Load balancing is an example of applications that can be achieved by using the SDN concept for balancing the loads of servers that are located and spread in wide area networks. In this thesis, we propose a load balancing algorithm that takes advantage of the extended Dijkstra’s shortest path algorithm considering both the edge weights and node weights to find the nearest server for a requesting client. We implement the proposed algorithm in Pyretic and simulate it under the Abilene topology with Mininet tools. We also compare the simulation results with those of the naive load balancing schemes, namely the round-robin algorithm and the randomized algorithm. As shown by the comparisons, the proposed algorithm outperforms the others in term of the network end-to-end latency, throughput and response time at the expense of a little heavier computation load and more memory usage of the SDN controller.

Keywords: Software Defined Networking (SDN), Load Balancing, Round Robin Algorithm, Randomized Algorithm, Dijkstra’s Shortest Path Algorithm

關鍵字(中)

★ 軟體定義網路(SDN)
★ 負載平衡
★ 循環演算法
★ 隨機演算法
★ Dijkstra最短路徑演算法

關鍵字(英)

★ Software Defined Networking (SDN)
★ Load Balancing
★ Round Robin Algorithm
★ Randomized Algorithm
★ Dijkstra’s Shortest Path Algorithm

論文目次

TABLE OF CONTENTS

中文摘要 i
ABSTRACT ii
ACKNOWLEDGEMENT iii
TABLE OF CONTENTS iv
LIST OF FIGURES vi
LIST OF TABLES viii
1. INTRODUCTION 1
2. PRELIMINARIES 4
2.1. Software Defined Networking 4
2.2. Pyretic 8
2.3. Extended Dijkstra’s Algorithm 11
2.5. Abilene Topology 13
2.4. Mininet 14
3. LOAD BALANCING ALGORITHMS 16
3.1. Overview 16
3.2. Round Robin Algorithm 17
3.3. Randomized Algorithm 18
4. PROPOSED ALGORITHM 20
5. SIMULATION 24
5.1. Simulation settings 24
5.2. Simulation results 25
5.2.1. Mapping 26
5.2.2. End-to-end Latency 26
5.2.3. Response time 27
5.2.4. Throughput 28
5.2.5. Variation load on server 31
5.2.6. Resource usage 32
6. CONCLUSION 34
7. FUTURE WORK 36
REFERENCES 37

參考文獻

[AKL13] S. Agarwal, M. Kodialam, and T. V. Lakshman, “Traffic Engineering in Software Defined Networks”, Proceedings IEEE INFOCOM, 2013.
[CFSV+89] Cieslak, A. Fawaz, S. Sack, P. Varaiya, J. Walrand,and A. Li, “The Programmable Network Prototyping System,” INFOCOM ′89. Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies. Technology: Emerging or Converging, 1989.
[DTS13] S. Das, D. Talayco, and R. Sherwood, “Software-Defined Networking and OpenFlow,” 13-Handbook of Fiber Optic Data Communication a Practical Guide to Optical Networking, 4th edition, 2013.
[FHFM+13] N. Foster, R. Harrison, M. J. Freedman, C. Monsanto, J. Rexford, A. Story, and D. WalkerFoster, “Frenetic: A Network Programming Language”, ACM, 2013.
[FYFA12] S. Fang, Y. Yu, C. H. Foh, and K. M. Aung, “A Loss-free Multipathing Solution for Data Center Network: using Software-defined Networking Approach”, APMRC, 2012.
[HSFM+09] N. Handigol, S. Seetharaman, M. Flajslik, N. McKeown, and R. Johari, “Plug-n-Serve: Load-balancing web traffic using OpenFlow,” Demo at ACM SIGCOMM, Aug. 2009.
[JHLC14] J.R. Jiang, H.W. Huang, J.H. Liao, and S.Y. Chen, "Extending Dijkstra’s Shortest Path Algorithm for Software Defined Networking," Technical Report, National Central University, 2014.
[KK12] M. Koerner and O. Kao, “Multiple Service Load-Balancing with OpenFlow”, IEEE 13th International Conference on High Performance Switching and Routing, 2012.
[LSGT13] H. Long, Y. Shen, M. Guo, and F. Tang, “LABERIO: Dynamic load-balanced routing in OpenFlow-enabled networks,” IEEE 27th International Conference on Advanced Information Networking and Applications, 2013.
[MABP+08] N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford, S. Shenker, and J. Turner, “OpenFlow: Enabling Innovation in Campus Networks,” ACM SIGCOMM Computer Communication, 2008.
[NMNO+14] B. A. Nunes, M. Mendonça, X. N. Nguyen, K. Obraczk, and T. Turletti, "A survey of software-defined networking: Past, present, and future of programmable networks," To appear in IEEE Communications Surveys & Tutorials, 2014.
[R89] Ross, F.L. Ross, “An Architecture for Programmable Network Elements.” IEEE Global Telecommunications Conference and Exhibition ′Communications Technology for the 1990s and Beyond′ (GLOBECOM), 1989.
[RMFR+13] J. Reich, C. Monsanto, N. Foster, J. Rexford, and D. WalkerReich, “Modular SDN Programming with Pyretic”, www.usenix.org. 2013
[S04] A. Stone, “Internet2’s Breakthroughs for Academic Research”, IEEE Distributed Systems Online 1541-4922, 2004.
[AN14] Abilene Network. http://en.wikipedia.org/wiki/Abilene_Network-#cite_note-line-1, last accessed on March 4, 2014.
[DOW14] Doc Oracle Website, http://docs.oracle.com/cd/E11035_01/wls100/cluster/load_balancing.html, last accessed on June 2014.
[DWC14] Doc Wiki Cisco, http://docwiki.cisco.com/wiki/Cisco_ACE_4700_Series_Appliance_Quick_Start_Guide,_Release_A3(1.0)_--_Configuring_Server_Load_Balancing, last accessed on June 2014.
[HPC96] Information Network Division Hewlet-Packard Company, “Netperf: A Network Performance Benchmark” , 1996.
[Internet2] Internet2. http://cs.stanford.edu/people/eroberts/courses/soco/projects-/2003-04/internet-2/architecture.html, last accessed on March 4, 2014.
[IW14] Iperf Website, http://iperf.fr/, last accessed on June 2014.
[MW14] Mininet Website, http://mininet.org/, last accessed on May 2014.
[ONF12] Open Network Foundation, “Software-Defined Networking: The New Norm for Networks,” White paper, 2012.
[ONF13] Open Network Foundation, “OpenFlow Switch Specification”, 2013.
[PRW14] Pyretic Website, http://frenetic-lang.org/pyretic/, last accessed on June 2014.
[PW14] Python Website, www. docs.python.org, last accessed on June 2014.
[RHI07] Red Hat, Inc., “Linux Virtual Server Administration: RHEL5: Linux Virtual Server (LVS)”, 2007.
[Stryper] Historical Abilene Connection Traffic Statistics. http://stryper.uits.iu.edu/abilene/, last accessed on March 4, 2014
[WBR13] R. Wang, D. Butnariu, and J. Rexford, “OpenFlow-Based Server Load Balancing Gone Wild”, USENIX, 2013.
[YSW02] Yeung, K.H. Yeung, Suen, K.W. Suen, Wong, K.Y. Wong, “Least load dispatching algorithm server nodes”. IEEE Proceedings Communication. 2002.
[YY03] Y. Li-Hui, Y. sheng-sheng. “A Variable Weighted Least-Connection Algorithm for Multimedia Transmission”. Journal of Shanghai University. 2003.
[FW14] Fping Website, http://fping.sourceforge.net/, last accessed on June 2014.

指導教授

江振瑞
(Jehn-Ruey Jiang、Achmad Basuki)

審核日期

2014-7-30

推文