Network-aware Service Function Chaining Placement in a Data Center
檔案
本條目沒有附加檔案。
日期
2016
類型
期刊名稱
2016 18TH ASIA-PACIFIC NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM (APNOMS)
ISBN
978-4-8855-2304-5
語言
英文
摘要
Network function virtualization (NFV) has drawn much attention in recent years, where some network functions that used to be deployed on specific hardware have become virtualized instances on general servers to achieve more scalability and flexibility. In a data center, service function chaining (SFC) makes a workflow traverse different network functions in a specific order to provide different levels of service for its customer. Because the distance between any adjacent network functions in a service chain will decide the total bandwidth consumption for that chain, the placement of the virtualized network functions in a data center becomes an important problem. In this study, this placement problem is treated as a multi-layer bin packing problem. Two greedy algorithms are proposed for the treelike network topology: Multi-layer Worst-Fit (MWF) and Multi-layer Best Fit (MBF). Furthermore, the placement problem is formulated as an integer linear programming. The experimental results show that MWF can reduce bandwidth consumption by 15% while only increasing the number of used servers by 1% compared to the traditional Best-fit algorithm.
所屬典藏
會議論文引用此條目
Hsieh, C.-H., Chang, J.-W., Chen, C., & Lug, S.-H. (2016). Network-aware Service Function Chaining Placement in a Data Center. 2016 18TH ASIA-PACIFIC NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM (APNOMS). https://ir.lib.nycu.edu.tw/handle/11536/134604
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/134604