雲端運算近年來依靠網路虛擬化技術讓大眾得以廣泛且方便地使用，網路虛擬化技術可以讓使用者方便佈署自己虛擬機器在資料中心裡擁有硬體的資源需求。雲端運算環境，有三種"即服務(as a service)"概念，包括硬體設施即服務(IaaS)、平台即服務(PaaS)、軟體即服務(SaaS)。本論文中，我們的研究專注於IaaS概念應用。硬體設施供應商(InP)管理自己資料中心裡的資源，透過虛擬化技術硬體供應商可以管理的範疇例如運算能力，儲存空間，網路架構等。資料中心盡管以虛擬網路的方式提供硬體資源解決效能及網路安全的問題，硬體供應商得面對另一下挑戰也就是虛擬網路映射問題，而所謂虛擬網路映射問題即為如何有效率且靈活的將硬體資源分配給虛擬網路。然而在資料中心的虛擬網路映射問題卻是近幾年才被慢慢重視，雖然兩者問題非常的相似，但其中還是有幾點區隔 : 1)實體網路結構不同，以往傳統的虛擬網路映射問題考慮隨機網路的路由問題，而在資料中心實體網路通常為樹狀結構。2)實體網路設施功能不同，傳統研究考慮實體節點只有處理資料功能，但在資料中心的實體網路中實體節點可以包括交換機、伺服器等不同功能的節點。3)傳統虛擬網路映射問題，對於同一個虛擬網路來說只考慮一個虛擬節點放置入一個實體節點中，但在資料中心同一個虛擬網路，我們認為可以多個虛擬節點同時放置入一個實體節點中。
　　在針對於資料中心的樹型結構，我們提出了啟發式映射演算法將隨意結構的虛擬網路轉換為適合樹型結構映射的星型拓樸，並利用量化虛擬網路的方法在演算法中設計準入控制機制，接著利用裝箱問題的傳統演算法FFD及BFD的優點來將虛擬網路做出分群的效果，並在映射入實體網路中達到最小鏈結成本的考量，最後利用最小成本最大流演算法將虛擬鏈結映射入實體鏈節中。我們透過實驗模擬，驗證我們的想法在成本及收益成本比這幾項目標函數中，確實比傳統的裝箱演算法表現來的較好。

In this thesis, we study the concept of IaaS. Ifrastructure Providers (InP) management data center's resources through virtualization technology. InPs manage areas such as power consumption, storage, network architecture. Although the virtual networks provide hardware resources to tackle the performance and network security issues, InPs have to face another challenge that is virtual network embedding problem. The virtual network embedding problem is how efficient and flexible allocated to the virtual network into hardware resources. However, the virtual network embedding problems in the data center is developed only in recent years. We propose a heuristic algorithm for mapping virtual network of random topology into a form of star topology that is suitable tree structure of data center. We design a scheme to quantify virtual networks and admission control when virtual network request is coming. We exploit the advantages of the traditional bin packing problem algorithm FFD and BFD to make the virtual network dividing into several clusters, and mapping into the substrate network to minimize link cost. Finally, we use the min cost max flow algorithm to map the virtual link into physical links. Through simulation experiments we verified our idea in terms of objective function, e.g. cost, revenue-cost ratio. We find our method indeed better than traditional bin packing algorithms to better performance.

目錄. . . . . . . . . . . . . . . . . . . 1
圖目錄. . . . . . . . . . . . . . . . . . 1
第1章 緒論. . . . . . . . . . . . . . . . 3
1.1 簡介. . . . . . . . . . . . . . . . . 3
1.2 參考文獻探討. . . . . . . . . . . . . 4
1.3 論文架構. . . . . . . . . . . . . . . . 5
第2章 網路虛擬化架構及虛擬網路映射問題. . . . . . . . . . 6
2.1 網路虛擬化架構. . . . . . . . . . . . . . . . . . . 6
2.2 虛擬網路映射問題. . . . . . . . . . . . . . . . . . 7
2.2.1 網路模型 . . . . . . . . . . . . . . . . . . . . 7
2.2.2 虛擬網路映射問題. . . . . . . . . . . . . . . . . 8
第3章 交換機容量機制. . . . . . . . . . . . . . . . . . 11
3.1 星型拓樸VNR : SVNR . . . . . . . . . . . . . . . . 11
3.2 SVNR 准入控制及交換機容量定義 . . . . . . . . . . . . 12
3.3 基於交換機容量啟發式演算法. . . . . . . . . . . . . . 12
3.4 映射演算法說明. . . . . . . . . . . . . . . . . . . 14
3.4.1 步驟 1 : 建立交換機候選名單. . . . . . . . . . . . 14
3.4.2 步驟 2 : 尋找最小鏈結成本星型拓樸. . . . . . . . . . 14
3.4.3 步驟 3 : 放置虛擬網路在最合適的交換機底下. . . . . . 15
3.4.4 步驟 4 : 最小成本最大流配置虛擬鏈結. . . . . . . . 18
第4章 實驗方法與結果. . . . . . . . . . . . . . . . . . 19
4.1 參數設置. . . . . . . . . . . . . . . . . . . . . 19
4.1.1 網路配置 . . . . . . . . . . . . . . . . . . . 19
4.1.2 閾值參數設置. . . . . . . . . . . . . . . . . . . 21
4.2 目標函數. . . . . . . . . . . . . . . . . . . . . 22
4.2.1 虛擬網路接收率. . . . . . . . . . . . . . . . . . 22
4.2.2 資源成本. . . . . . . . . . . . . . . . . . . . . 23
4.2.3 收益成本比. . . . . . . . . . . . . . . . . . . . 25
第5章 結論. . . . . . . . . . . . . . . . . . . . . . . 28
參考文獻. . . . . . . . . . . . . . . . . . . . . . . . 29

[1] M. Al-Fares, A. Loukissas, and A. Vahdat,􀄀A scalable, commodity data center network
architecture,􀄁in SIGCOMM 􀃿08: Proceedings of the ACM SIGCOMM 2008
conference on Data communication. vol. 38, no. 4. ACM, 2008, pp. 63-74.
[2] R. Niranjan Mysore, A. Pamboris, N. Farrington, N. Huang, P. Miri, S. Radhakrishnan,
V. Subramanya, and A. Vahdat,”Portland: a scalable fault tolerant layer 2 data
center network fabric,” in ACM SIGCOMM Computer Communication Review, vol.
39, no. 4. ACM, 2009, pp. 39-50.
[3] A. Greenberg, J. R. Hamilton, N. Jain, S. Kandula, C. Kim, P. Lahiri, D. A. Maltz,
P. Patel, and S. Sengupta,􀄀VL2: A scalable and flexible data center network,􀄁in
SIGCOMM 􀃿09: Proceedings of the ACM SIGCOMM 2009 conference on Data
communication, vol. 39, no. 4. ACM, 2009, pp. 51-62.
[4] 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, no. 2, pp. 17-29, 2008.
[5] N. Chowdhury, M. R. Rahman, and R. Boutaba,”Virtual network embedding with
coordinated node and link mapping,” in INFOCOM 2009, IEEE. IEEE, 2009, pp.
783-791.
[6] J. Lischka and H. Karl, ”A virtual network mapping algorithm based on subgraph
isomorphism detection,” in Proceedings of the 1st ACM workshop on Virtualized infrastructure
systems and architectures. ACM, 2009, pp. 81-88.
[7] M. Chowdhury, M. R. Rahman, and R. Boutaba,”Vineyard: Virtual network embedding
algorithms with coordinated node and link mapping,”IEEE/ACM Transactions
on Networking (TON), vol. 20, no. 1, pp. 206-219, 2012.
[8] R. Mijumbi, J. Serrat, J.-L. Gorricho, and R. Boutaba,”A path generation approach
to embedding of virtual networks,”Network and Service Management, IEEE Transactions
on, vol. 12, no. 3, pp. 334-348, 2015.
[9] A. Fischer, J. F. Botero, M. Till Beck, H. De Meer, and X. Hesselbach,”Virtual
network embedding: A survey,”Communications Surveys & Tutorials,IEEE vol. 15,
no. 4, pp. 1888-1906, 2013.
[10] X. Meng, V. Pappas, and L. Zhang,”Improving the scalability of data center networks
with traffic-aware virtual machine placement,” in INFOCOM, 2010 Proceedings IEEE.
IEEE, 2010, pp. 1-9.
[11] L. Zhang, X. Yin, Z. Li, and C. Wu,”Hierarchical virtual machine placement in modular
data centers,” in 2015 IEEE 8th International Conference on Cloud Computing.
IEEE, 2015, pp. 171-178.
[12] L. Shi, D. Katramatos, and D. Yu,”Virtual data center allocation with dynamic
clustering in clouds,” in 2014 IEEE 33rd International Performance Computing and
Communications Conference (IPCCC). IEEE, 2014, pp. 1-10.
[13] X. Wen, Y. Han, H. Yuan, X. Zhou, and Z. Xu,”An efficient resource embedding
algorithm in software de
ned virtualized data center,” in 2015 IEEE Global Communications Conference
(GLOBECOM). IEEE, 2015, pp. 1-7.
[14] M. G. Rabbani, R. P. Esteves, M. Podlesny, G. Simon, L. Z. Granville, and R.
Boutaba,”On tackling virtual data center embedding problem,”2013 IFIP/IEEE International
Symposium on Integrated Network Management (IM2013). IEEE, 2013,
pp. 177-184.
[15] C. Guo, G. Lu, H. J. Wang, S. Yang, C. Kong, P. Sun, W. Wu, and Y.
Zhang,”Secondnet: a data center network virtualization architecture with bandwidth
guarantees,” in Proceedings of the 6th International COnference. ACM, 2010,p. 15.
[16] H. Ballani, P. Costa, T. Karagiannis, and A. Rowstron,”Towards predictable datacenter
networks,” in ACM SIGCOMM Computer Communication Review, vol. 41,
no. 4. ACM, 2011, pp. 242-253.
[17] M. Rost, C. Fuerst, and S. Schmid,”Beyond the stars: Revisiting virtual cluster
embeddings,”ACM SIGCOMM Computer Communication Review, vol. 45, no. 3, pp.
12-18, 2015.