請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/76558
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 廖婉君(Wanjiun Liao) | |
dc.contributor.author | Po-Wen Hsiao | en |
dc.contributor.author | 蕭博文 | zh_TW |
dc.date.accessioned | 2021-07-10T21:32:53Z | - |
dc.date.available | 2021-07-10T21:32:53Z | - |
dc.date.copyright | 2017-08-29 | |
dc.date.issued | 2017 | |
dc.date.submitted | 2017-07-28 | |
dc.identifier.citation | [1] R. Mijumbi, J. Serrat, J. L. Gorricho, N. Bouten, F. D. Turck, and R. Boutaba, “Network function virtualization: State-of-the-art and research challenges,” IEEE Communications Surveys Tutorials, vol. 18, no. 1, pp. 236–262, Firstquarter 2016.
[2] M. Chiosi, D. Clarke, P. Willis, A. Reid, J. Feger, M. Bugenhagen, W. Khan, M. Fargano, C. Cui, H. Deng, et al., “Network functions virtualisation: An introduction, benefits, enablers, challenges and call for action,” in SDN and OpenFlow World Congress, Oct. 2012. [3] J. Halpern and C. Pignataro, “Service function chaining (sfc) architecture,” 2015. [Online]. Available: https://www.rfc-editor.org/rfc/rfc7665.txt. [4] “Network Functions Virtualisation (NFV); Use Cases,” ETSI GS NFV 001 V1.1.1, Oct. 2013. [Online]. Available: http://www.etsi.org/deliver/etsi_gs/NFV/001_099/001/01.01.01_60/gs_NFV001v010101p.pdf. [5] P. Quinn and T. Nadeau, “Problem statement for service function chaining,” 2015. [Online]. Available: https://www.rfc-editor.org/rfc/rfc7498.txt. [6] K. Gray and T. D. Nadeau, Network Function Virtualization. Morgan Kaufmann, 2016. [7] T. Wen, H. Yu, G. Sun, and L. Liu, “Network function consolidation in service function chaining orchestration,” in 2016 IEEE International Conference on Communications (ICC), Kuala Lumpur, Malaysia, May 2016. [8] “Network Functions Virtualisation (NFV); Architectural Framework,” ETSI GS NFV 002 V1.1.1, Oct. 2013. [Online]. Available: http://www.etsi.org/deliver/etsi_gs/nfv/001_099/002/01.01.01_60/gs_nfv002v010101p.pdf. [9] L. Yang, D. V. Tung, M. Kim, and Y. Kim, “Alarm-based monitoring for high availability in service function chain,” in 2016 International Conference on Cloud Computing Research and Innovations (ICCCRI), May 2016, pp. 86–91. [10] R. Mijumbi, J. Serrat, J. l. Gorricho, S. Latre, M. Charalambides, and D. Lopez, “Management and orchestration challenges in network functions virtualization,” IEEE Communications Magazine, vol. 54, no. 1, pp. 98–105, Jan. 2016. [11] “Network Functions Virtualisation (NFV); Resiliency Requirements,” ETSI GS NFV-REL 001 V1.1.1, Jan. 2015. [Online]. Available: http://www.etsi.org/deliver/etsi_gs/NFVREL/001_099/001/01.01.01_60/gs_nfv-rel001v010101p.pdf. [12] A. Leivadeas, M. Falkner, I. Lambadaris, and G. Kesidis, “Resource Management and Orchestration for a Dynamic Service Chain Steering Model,” in IEEE Global Communications Conference (GLOBECOM), Dec. 2016. [13] Z. Ye, X. Cao, J. Wang, H. Yu, and C. Qiao, “Joint topology design and mapping of service function chains for efficient, scalable, and reliable network functions virtualization,” IEEE Network, vol. 30, no. 3, pp. 81–87, May 2016. [14] K. Yang, H. Zhang, and P. Hong, “Energy-Aware Service Function Placement for Service Function Chaining in Data Centers,” in IEEE Global Communications Conference (GLOBECOM), Washington DC, USA, Dec 2016. [15] S. V. N. Vishwanathan, N. N. Schraudolph, R. Kondor, and K. M. Borgwardt, “Graph kernels,” Journal of Machine Learning Research, vol. 11, no. Apr, pp. 1201–1242, 2010. [16] Kashima, Hisashi and Tsuda, Koji and Inokuchi, Akihiro, “Kernels for graphs,” Kernel methods in computational biology, vol. 39, no. 1, pp. 101–113, 2004. [17] Mininet, [Online]. Available: http://mininet.org. [18] Floodlight, [Online]. Available: http://www.projectfloodlight.org/floodlight/. [19] A. Gember-Jacobson, R. Viswanathan, C. Prakash, R. Grandl, J. Khalid, S. Das, and A. Akella, “Opennf: Enabling innovation in network function control,” in Proceedings of the 2014 ACM Conference on SIGCOMM, Chicago, Illinois, USA, Aug. 2014. [20] W. Liu, et al, “Service Function Chaining (SFC) General Use Cases,” IETF-Network Working Group, Aug. 2014. [Online]. Available: https://tools.ietf.org/html/draft-liu-sfc-usecases-01. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/76558 | - |
dc.description.abstract | 近年來,網路功能虛擬化(Network Functions Virtualization,NFV)已經是一項非常有潛力的概念,其主要是將傳統高度整合在硬體設備中的網路功能給獨立出來,並且透過虛擬化的技術,以軟體的方式將其實現在虛擬環境上。而網路功能虛擬化也改變服務功能鏈(Service Function
Chaining,SFC)的佈建方式,使之達到更靈活的配置。然而卻有可能會需要大量的具體服務(Service Instance)來應對大量的服務功能鏈請求,因而降低資源利用率,服務覆蓋(Service Overlay)是目前被提出有效的解決這個問題的方式。進而我們探討網路功能虛擬化的分散式管理架構,並且考慮此架構下的佈建限制。因此,在本論文中,我們提出考慮分散式管理架構佈建限制下的服務覆蓋問題,此問題的目標為追求最小化系統資源消耗。透過對問題的分析,我們證明此問題的複雜度為NP-hard並且推導了特定服務覆蓋的方式傾向於滿足分散式管理架構之下佈建限制。接著,我們提出了一個線上兩階段演算法來面對服務功能鏈請求並以有服務覆蓋策略之方式配置服務功能鏈,第一階段為轉發圖(Forwarding Graph,FG)匹配,第二階段為服務功能鏈映射,其中轉發圖匹配為在現有的虛擬層中搜尋並建立與服務功能鏈請求圖形相似性高的轉發圖候選表,並依據相似性由高而低排列,而服務功能鏈映射則是在轉發圖候選表中依序挑選轉發圖並將服務功能鏈請求給映射到該轉發圖上以尋求最大化服務覆蓋的可行解。我們根據ETSI提出的網路功能虛擬化結構框架建置一個Mininet模擬環境,並實現網路功能虛擬化編排器與開源的虛擬網路功能管理器合作,完整實現結構框架的各功能區塊,也可以於遠端接收服務功能鏈請求並即時編排具體服務。在此環境下,模擬結果顯示與過去的服務覆蓋策略以及無服務覆蓋策略的演算法相比,我們所提出的演算法可以在相同服務功能鏈請求下有最少的資源消耗,以及能在更分散式的管理架構下有一樣好的資源消耗效能,並且我們也發現在現實環境有規律的服務功能鏈存在的環境中,我們的演算法所得到的資源消耗效能也較佳。 | zh_TW |
dc.description.abstract | Network Function Virtualization (NFV) has now become a salient concept which virtualizes hardware based application to commodity servers. It also expands the concept of Service Function Chaining (SFC). The flexible deployment of SFC brings the benefit to network operator but instantiates a significant amount of service instances which decreasing resource utilization. Service overlay is a promising solution to eliminate this problem. However, after service overlay, more service instances are interconnected which piling up the burden on managers in distributed management system. Therefore, the strategy of service overlay must consider the oversubscription constraints in managers. To address this challenge, we propose service overlay with oversubscription constraints (SOWOC) problem in this thesis, which aims at minimizing resource consumption in SFC provisioning while guaranteeing the oversubscription constraints. We prove the NP-hardness for the problem and propose an efficient online Matching-then-Mapping (MtM) algorithm. We simulate ETSI NFV architecture framework in our environment by designing NFV Orchestrator cooperating with an open-source VNF Manager. The simulation results show that MtM can reach the least resource consumption among the other service overlay algorithm and the baseline algorithm which is without service overlay. In the more distributed management system, MtM can reach even better performance in resource consumption. Moreover, MtM performs great under a regular policy order of service functions in reality. | en |
dc.description.provenance | Made available in DSpace on 2021-07-10T21:32:53Z (GMT). No. of bitstreams: 1 ntu-106-R04942126-1.pdf: 1200421 bytes, checksum: 23629287783894841dc06352386e81b2 (MD5) Previous issue date: 2017 | en |
dc.description.tableofcontents | Chapter 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.1 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.1.1 Service Function Chaining . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.1.2 Management System for NFV. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.2 Motivation and Contribution. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 1.3 Thesis Organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 Chapter 2 System Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.1 Substrate Network. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 2.2 SFC Requests . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 2.3 Service Overlay with Oversubscription Constraints . . . . . . . . . . . . . . . . . . . . . . . . 13 2.3.1 Overlay Constraints . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 2.3.2 Allocation Constraints . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 2.3.3 Capacity Constraints . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 2.3.4 Oversubscription Constraints. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 2.3.5 Resource Consumption . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 Chapter 3 Problem Analysis. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 3.1 Complexity Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 3.1.1 NP-hardnss . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 3.1.2 Online Solution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 3.2 Oversubscription Limit . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 3.2.1 Forwarding Graph . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 Chapter 4 Matching-then-Mapping Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 4.1 FG Matching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 4.1.1 Random Walk Kernel . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 4.2 SFC Mapping . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 4.2.1 Strongest Mapping. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 Chapter 5 Performance Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 5.1 Environment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 5.2 Simulation Setup . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 5.3 Simulation Result . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 5.3.1 Resource Consumption and Acceptance Rate. . . . . . . . . . . . . . . . . . . . . . . 35 5.3.2 Different Oversubscription Limit. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 5.3.3 Different SF policy order. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 Chapter 6 Conclusion and Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40 REFERENCE. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 | |
dc.language.iso | en | |
dc.title | 具服務覆蓋之線上服務功能鏈配置 | zh_TW |
dc.title | Online Service Function Chaining Placement with Service Overlay | en |
dc.type | Thesis | |
dc.date.schoolyear | 105-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 郭耀煌,陳俊良,林宗男,周承復 | |
dc.subject.keyword | 網路功能虛擬化,服務功能鏈,服務覆蓋,資源編排,虛擬網路功能管理, | zh_TW |
dc.subject.keyword | Network Function Virtualization,Service Function Chaining,Service Overlay,NFV Orchestrator,VNF Manager, | en |
dc.relation.page | 44 | |
dc.identifier.doi | 10.6342/NTU201701892 | |
dc.rights.note | 未授權 | |
dc.date.accepted | 2017-07-28 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電信工程學研究所 | zh_TW |
顯示於系所單位: | 電信工程學研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-106-R04942126-1.pdf 目前未授權公開取用 | 1.17 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。