跳到主要內容

臺灣博碩士論文加值系統

(44.210.99.209) 您好!臺灣時間:2024/04/15 14:08
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:許俊淵
研究生(外文):Chun-Yuan Hsu
論文名稱:利用工作分配來提升數據中心網路中服務鏈的部署
論文名稱(外文):On Improving Service-chain Deployment with Job Dispatching in the Data Center Networks
指導教授:周承復
口試日期:2017-07-27
學位類別:碩士
校院名稱:國立臺灣大學
系所名稱:資訊工程學研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2017
畢業學年度:105
語文別:英文
論文頁數:45
中文關鍵詞:Middlebox網路功能虛擬化服務鏈
外文關鍵詞:MiddleboxNetwork function virtualizationservice chain.
相關次數:
  • 被引用被引用:0
  • 點閱點閱:182
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
Middlebox在現今網路中扮演著非常重要的角色,像是防火牆(firewall)、代理伺服器(Proxy)、網路地址轉換(Network Address Translation)等。然而往往我們需要封包依序經過這些middlebox,這樣的需求我們稱為服務鏈。傳統的middlebox大多是高成本並且位置固定的硬體設備,這使得在部署上有所限制,並且導致浪費許多頻寬。網路功能虛擬化能夠將這些middlebox轉換成軟體並且能在一般伺服器上執行,這使得在部署上更有彈性。問題在於如何去部署服務鏈才會更好。由於在資料中心網路或是企業網路中往往有許多的job,我們應該同時分配這些job來做服務鏈的部署才能得到最佳解。並且過去的研究皆並未考慮到使用的伺服器數目,這可能導致電力耗費提高,因此我們尋找出頻寬與運算資源以及使用的伺服器數目之間的關聯性,並且將整個問題公式化成最佳化問題,因為這個最佳化問題十分困難,因此我們提出一個rack aware的演算法有效率地解決此問題。經由模擬實驗的結果證明加入job分配能有效提升服務鏈部署的表現,並且我們提出的演算法能大幅減少運算時間,同時也能有效地找到接近最佳解的解。
Middlebox, such as firewall, proxy and NAT, play an important role in the existing network. However, we usually need traffic go through these middlebox in specific order. We call these requests to Service chain. Most of middleboxes are expensive hardware-based appliances with fixed placement. It is not flexible to deploy and might cause we waste lots of bandwidth. Network function virtualization transforms these middlebox to software to be executed on general-purpose servers. It helps us do deployment more flexible. The question is how to do service chain deployment would be better. Due to there have many jobs in the data center networks and enterprise networks, we should do service chain deployment and job dispatching together so as to find the global optimal solution. Moreover, most prior works do not aware the number of used servers and cause the higher electricity cost. Therefore, we discover the relation among the bandwidth, CPU resource and number of used servers. And we formulate the service chain deployment and job dispatching problem as an integer linear programming model. However, it is very difficult to solve this optimization model. Hence, we propose a Rack-aware Service-chain deployment and Job dispatching (RSJ) algorithm to find the solution effectively and efficiently. The simulation result shows that we can improve the service chain deployment by doing job dispatching together. Our proposed algorithm significantly reduces the processing time and also can find a solution close to the optimal solution.
口試委員會審定書 i
誌謝 ii
摘要 iii
Abstract iv
1 Introduction 1
1.1 Middleboxes ................................ 1
1.2 NetworkFunctionVirtualization ...................... 3
1.3 Motivation.................................. 3
2 Related Work 5
2.1 ServiceChainRouting ........................... 5
2.2 VNFPlacement............................... 6
2.3 ServiceChainDeployment ......................... 6
3 Design 8
3.1 RelationbetweenMultipleResources ................... 8
3.2 Overview .................................. 10
3.3 ProblemFormulation ............................ 11
3.3.1 ProblemDefinition......................... 11
3.3.2 IntegerLinearProgrammingModel ................ 14
3.4 Rack-Aware Service-chain Deployment and Job Dispatching . . . . . . . 21
3.5 ComplexityAnalysis ............................ 31
4 Evaluation 32
4.1 SimulationSetup .............................. 32
4.1.1 Configurations ........................... 32
4.1.2 TrafficPatterns........................... 33
4.1.3 Methods .............................. 34
4.2 ImpactofWeigthedFactorα ........................ 34
4.3 ImpactofJobRatio............................. 37
4.4 ImpactofNumberoftheDemands..................... 39
4.5 ProcessingTime............................... 41
5 Conclusion 43
Bibliography 44
[1] Vyas Sekar, Sylvia Ratnasamy, Michael K Reiter, Norbert Egi, and Guangyu Shi. The middlebox manifesto: enabling innovation in middlebox deployment. In Proceedings of the 10th ACM Workshop on Hot Topics in Networks, page 21. ACM, 2011.
[2] Paul Quinn and Tom Nadeau. Problem statement for service function chaining. 2015.
[3] Margaret Chiosi, Don Clarke, Peter Willis, Andy Reid, James Feger, Michael Bu- genhagen, Waqar Khan, Michael Fargano, Chunfeng Cui, Hui Deng, et al. Network functions virtualisation: An introduction, benefits, enablers, challenges and call for action. In SDN and OpenFlow World Congress, pages 22–24, 2012.
[4] Zafar Ayyub Qazi, Cheng-Chun Tu, Luis Chiang, Rui Miao, Vyas Sekar, and Min- lan Yu. Simplefying middlebox policy enforcement using sdn. ACM SIGCOMM computer communication review, 43(4):27–38, 2013.
[5] Abhishek Dwaraki and Tilman Wolf. Adaptive service-chain routing for virtual net- work functions in software-defined networks. In Proceedings of the 2016 workshop on Hot topics in Middleboxes and Network Function Virtualization, pages 32–37. ACM, 2016.
[6] Milad Ghaznavi, Aimal Khan, Nashid Shahriar, Khalid Alsubhi, Reaz Ahmed, and Raouf Boutaba. Elastic virtual network function placement. In Cloud Networking (CloudNet), 2015 IEEE 4th International Conference on, pages 255–260. IEEE, 2015.
[7] Sevil Mehraghdam, Matthias Keller, and Holger Karl. Specifying and placing chains of virtual network functions. In Cloud Networking (CloudNet), 2014 IEEE 3rd In- ternational Conference on, pages 7–13. IEEE, 2014.
[8] Marcelo Caggiani Luizelli, Leonardo Richter Bays, Luciana Salete Buriol, Mar- inho Pilla Barcellos, and Luciano Paschoal Gaspary. Piecing together the nfv provisioning puzzle: Efficient placement and chaining of virtual network functions. In Integrated Network Management (IM), 2015 IFIP/IEEE International Symposium on, pages 98–106. IEEE, 2015.
[9] Tung-Wei Kuo, Bang-Heng Liou, Kate Ching-Ju Lin, and Ming-Jer Tsai. Deploying chains of virtual network functions: On the relation between link and server usage. In Computer Communications, IEEE INFOCOM 2016-The 35th Annual IEEE International Conference on, pages 1–9. IEEE, 2016.
[10] Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, and Lisa Zhang. Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. Combinatorica, 30(5):485–520, 2010.
[11] MohammadAl-Fares, Alexander Loukissas, and Amin Vahdat. A scalable, commodity data center network architecture. In ACM SIGCOMM Computer Communication Review, volume 38, pages 63–74. ACM, 2008.
[12] CPLEX Optimization Studio 12.7. https://www.ibm.com/bs-en/marketplace/ ibm-ilog-cplex.
[13] Xin Li and Chen Qian. Low-complexity multi-resource packet scheduling for network function virtualization. In Computer Communications (INFOCOM), 2015 IEEE Conference on, pages 1400–1408. IEEE, 2015.
[14] Theophilus Benson, Aditya Akella, and David A Maltz. Network traffic characteristics of data centers in the wild. In Proceedings of the 10th ACM SIGCOMM conference on Internet measurement, pages 267–280. ACM, 2010.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top