在OpenFlow交換器中運用軟硬體模擬實現多路徑資料分流派送

The Implementation of Multi-Path Delivery for Data Flow by Software and Hardware Simulations in OpenFlow Switches

詹翔宇(HSIANG-YU CHAN)

指導教授 ： 林傳筆

朝陽科技大學/資訊學院/資訊與通訊系/碩士(2017年)

摘要

在網路世界中，為了符合低傳輸延遲及線路易於管理的需求，一般採取的作法是使用最短路徑(Shortest Path)或單一路徑(Single Path)的傳輸方式。然而，這種傳輸模式卻也使路徑頻寬難以有效利用的問題浮現，造成許多傳輸事件無法獲得所預期的頻寬。為了解決此一問題，許多研究著重於路由優化演算法，目的就是在資料傳輸事件發生時，於多條可達的傳輸路徑中選擇一條最佳狀態的傳輸路徑做資料傳輸。而這種做法依舊難以徹底改善許多路徑頻寬達到妥善使用的目的;不僅於此，易於預測且高風險性的單一路徑傳輸模式也相對存在路由安全的疑慮。因此，本研究的主要目的就是在軟體定義網路(Software-Defined Networking, SDN)架構上，針對OpenFlow交換器(Switch)提出權重式分流(Weight-Based Flow Dividing, WFD)的方法，使數據封包能夠在多路徑傳輸(Multi-Path)模式上依照權重(Weight)的配置，透過多條路徑分流傳輸至目的地，達到高頻寬使用率的主要目的，並也使其進一步的克服單一路徑在網路中的路由安全問題。最後透過軟體及硬體的模擬環境進行封包及真實檔案的傳輸評測，證實本研究所提之方法在網路環境中運行的可能性。

關鍵字

頻寬使用率 ； 路由優化演算法 ； 路由安全 ； 多路徑傳輸 ； 軟體定義網路 ； OpenFlow

並列摘要

In the world of Internet, in order to meet the needs of low transmission latency and easy route management, generally, we adopt the transmission methods of shortest path or single path. However, this the methods make it troublesome since it becomes harder to utilize bandwidth effectively. To solve this problem, some researchers have focused on the route optimization algorithms. The proposed algorithms when transmitting the data select one of routing paths. Nevertheless, the problem of utilization of bandwidth is still existed. Moreover, the routing security risk is high since the transmission of single path is easy to intercept and wiretap. Therefore, in this study, the method called Weight-Based Flow Dividing (WFD) on the OpenFlow switch under the framework of Software-Defined Networking (SDN) is proposed to utilize bandwidth effectively and reduce the routing security risk. The experiment results show the packets are transmitted on Multi-Path instead of single path by WFD. On the other hand, the bandwidth utilization of SDN is easier to adjust than that of traditional network in the implementations of software and hardware because of the programming of SDN.

並列關鍵字

Bandwidth Utilization ； Route Optimization Algorithm ； Routing Security ； Multi-Path ； Software-Defined Networking ； OpenFlow

參考文獻

[1] E. W. Dijkstra, "A note on two problems in connection with graphs", Numer. Math., vol. 1, pp. 269-271, 1959.

[4] K. Magzhan and H. Jani, "A Review And Evaluations Of Shortest Path Algorithms, " Int. J. Sci. Technol. Res., vol. 2, no. 6, pp. 99–104, 2013.

[5] A. V. Goldberg and R. E. Tarjan, "A new approach to the maximum flow problem," J. ACM, vol. 35, no. 4, pp. 921–940, 1988.

[6] S. Chen and K. Nahrstedt, "An overview of quality-of-service routing for the next generation high-speed networks: Problems and solutions," IEEE Trans. Netw., vol. 12, no. 6, pp. 64–79, Dec. 1998.

[9] R. Banner and A. Orda, "Multipath routing algorithms for congestion minimization," IEEE/ACM Transactions on Networking, vol. 15, pp. 413-424, 2007