透過您的圖書館登入
IP:3.144.252.140
  • 學位論文

運用Robust Optimization設計擁有頻寬保證的OpenFlow虛擬網路

Design of Bandwidth Guaranteed OpenFlow Virtual Networks Using Robust Optimization

指導教授 : 李詩偉
若您是本文的作者,可授權文章由華藝線上圖書館中協助推廣。

摘要


在本論文中,我們討論了如何設計和實現運用OpenFlow來配置虛擬網路(Virtual Network)的問題。跟大多數現有直接在實體網路對頻寬進行分割的方法不同的地方是,我們將流量的不確定性和統計多工(Statistical Multiplexing)一起加入考慮。在我們的系統中,使用者可以指定自己所需的虛擬網路拓撲結構(Topology)和各個不同大小流量的虛擬鏈結(Virtual Link) 。其中每個virtual link都有包含相對的頻寬,分別為保證頻寬(Guaranteed Bandwidth)和上限頻寬(Upper Limit Bandwidth)。每個使用者會被保證任何時候只要在自己的guaranteed bandwidth下就不會被其它使用者的頻寬使用率所干擾。此外,使用者可以在一段短時間內將使用頻寬達至其上限頻寬,而且封包遺失率(Packet Loss Probability)不會超過一個預定的值。此功能使OpenFlow網路在一段時間內用戶的傳輸速度有大幅變動的時候還能為用戶的網路提供QoS(Quality of service)保證。 我們運用Robust Optimization來為這個問題建模,用來連帶的確定允入控制和virtual link的路由(Routing)。我們進一步提出一個使用市售OpenFlow的交換機(Switch)來實踐我們的設計,透過模擬和實驗來證明和表現我們的方法。而實驗的結果表明,我們這個設計能成功容忍OpenFlow網路流量下的不確定性。由於提出的方法可以高效率的使用頻寬,它比不考慮statistical multiplexing的方法下,可以容納更多的virtual network。

並列摘要


In this paper, we address the OpenFlow virtual network (VN) design problem. Unlike most of the existing approaches that directly performing bandwidth slicing on the physical networks, we take traffic uncertainty and statistical multiplexing into consideration. In our system, a user can specify the desired VN topology and the capacity for each virtual link (VL). The bandwidth descriptor for a VL consists of a pair of values for guaranteed bandwidth and upper limit bandwidth. Each user is guaranteed to own the guaranteed bandwidth at any moment without interferences from the bandwidth usages of the other users. Moreover, a user can successfully uses bandwidth up to its upper limit in short time with packet loss probability no more than a pre-defined value. This feature enables OpenFlow networks to provide QoS for network services with bursty traffic. We model this problem as a robust optimization program to jointly determine admission control and VL routing. We further present an approach for implementing the proposed design using commercial available OpenFlow switches. The performance of the proposed approach is evaluated through simulations and experiments. The results indicate that the proposed design can successfully tolerate traffic uncertainty in OpenFlow networks. Since the proposed approach can use bandwidth with high efficiency, it can admit more VNs than the one without taking statistical multiplexing into consideration.

參考文獻


[3] E. Salvadori, R. D. Corin, A. Broglio, and M. Gerola, “Generalizing virtual network topologies in OpenFlow-based networks,” IEEE GLOBECOM 2011, Houston, USA, Dec. 2011.
[4] P. N. Tran, and A. Timm-Giel, “Reconfiguration of Virtual Network Mapping Considering Service Disruption,” in Proc. IEEE ICC, 2013.
[7] M. Yu, Y. Yi, J. Rexford, and M. Chiang, “Rethinking Virtual Network Embedding: Substrate Support for Path Splitting and Migration,” ACM SIGCOMM Computer Communication Review, vol. 38, pp. 17-29, 2008.
[8] N. Chowdhury, M. R. Rahman, and R. Boutaba, “Virtual Network Embedding with Coordinated Node and Link Mapping,” in Proc. IEEE INFOCOM, 2009.
[9] I. Fajjari, N. Aitsaadi, G. Pujolle, and H. Zimmermann, “VNE-AC: Virtual Network Embedding Algorithm based on Ant Colony Metaheuristic,” in Proc. IEEE ICC, 2011.

延伸閱讀