A Spatial and Temporal Optimal Method of Service Function Chain Orchestration Based on Overlay Network Structure

Yunjie GU; Yuxiang HU; Jichao XIE

doi:10.11999/JEIT190145

Volume 41 Issue 11

Nov. 2019

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2019 > 41(11): 2675-2683

Yunjie GU, Yuxiang HU, Jichao XIE. A Spatial and Temporal Optimal Method of Service Function Chain Orchestration Based on Overlay Network Structure[J]. Journal of Electronics & Information Technology, 2019, 41(11): 2675-2683. doi: 10.11999/JEIT190145

Citation:

Yunjie GU, Yuxiang HU, Jichao XIE. A Spatial and Temporal Optimal Method of Service Function Chain Orchestration Based on Overlay Network Structure[J]. Journal of Electronics & Information Technology, 2019, 41(11): 2675-2683. doi: 10.11999/JEIT190145

Citation:

PDF( 2117 KB)

A Spatial and Temporal Optimal Method of Service Function Chain Orchestration Based on Overlay Network Structure

doi: 10.11999/JEIT190145

National Digital Switching System Engineering and Technological R&D Center, Zhengzhou 450002, China

Funds: The National Key Research and Development Project(2017YFB0803204), The National Natural Science Foundation of China (61521003, 61872382), The Research and Development Program in Key Areas of Guangdong Province (2018B010113001)

Received Date: 2019-03-13
Rev Recd Date: 2019-06-18

Available Online: 2019-06-25

Publish Date: 2019-11-01

Abstract

Abstract

With the introduction of Network Function Virtualization (NFV), the operating costs of operators can be greatly reduced. However, most existing Service Function Chain (SFC) orchestration researches can not optimize the resources utilization while guaranteeing the performance of service delay. A spatial and temporal optimal method of Service Function Chain (SFC) orchestration based on an overlay network structure is proposed. Based on the consideration of the restrictions such as computing resource, network resource and fine-grained end to end delay, this method separates the computing resource and network resource. The resources cost and related delay of SFC can be abstracted into the links weight of overlay network, which can help to convert the SFC orchestration problem into the shortest path problem that can be easily solved. As for the SFC requests set requiring batch processing, an Overlay Network based Simulated Annealing iterative optimal orchestration algorithm(ONSA) is designed. The simulation results demonstrate that the proposed orchestration scheme can reduce the end-to-end delay, the utilization ratio of link bandwidth resource and the operational expenditure by 29.5%, 12.4% and 15.2%, and the acceptance ratio of requests set can be improved by 22.3%. The performance of Virtual Network Function (VNF) load balancing can be significantly improved.
- Network Function Virtualization (NFV),
- Spatial and temporal optimization,
- Overlay network,
- Iterative optimization

FullText(HTML)

References(16)

References

邬江兴. 新型网络技术发展思考[J]. 中国科学: 信息科学, 2018, 48(8): 1102–1111. doi: 10.1360/N112018-00062

WU Jiangxing. Thoughts on the development of novel network technology[J]. CIENTIA SINICA Informationis, 2018, 48(8): 1102–1111. doi: 10.1360/N112018-00062

HAN Bo, GOPALAKRISHNAN V, JI Lusheng, et al. Network function virtualization: Challenges and opportunities for innovations[J]. IEEE Communications Magazine, 2015, 53(2): 90–97. doi: 10.1109/mcom.2015.7045396

QUINN E and NADEAU T. Problem statement for service function chaining[R]. IETF RFC-Informational, 2015.

MOENS H and DE TURCK F. VNF-P: A model for efficient placement of virtualized network functions[C]. Proceedings of the 10th International Conference on Network and Service Management and Workshop, Rio de Janeiro, Brazil, 2014: 418–423.

BARI F, CHOWDHURY S R, AHMED R, et al. Orchestrating virtualized network functions[J]. IEEE Transactions on Network and Service Management, 2016, 13(4): 725–739. doi: 10.1109/TNSM.2016.2569020

JANG I, SUH D, PACK S, et al. Joint optimization of service function placement and flow distribution for service function chaining[J]. IEEE Journal on Selected Areas in Communications, 2017, 35(11): 2532–2541. doi: 10.1109/JSAC.2017.2760162

史久根, 张径, 徐皓, 等. 一种面向运营成本优化的虚拟网络功能部署和路由分配策略[J]. 电子与信息学报, 2019, 41(4): 973–979. doi: 10.11999/JEIT180522

SHI Jiugen, ZHANG Jing, XU Hao, et al. Joint optimization of virtualized network function placement and routing allocation for operational expenditure[J]. Journal of Electronics &Information Technology, 2019, 41(4): 973–979. doi: 10.11999/JEIT180522

陈卓, 冯钢, 刘蓓, 等. 运营商网络中面向资源碎片优化的网络服务链构建策略[J]. 电子与信息学报, 2018, 40(4): 763–769. doi: 10.11999/JEIT170641

CHEN Zhuo, FENG Gang, LIU Bei, et al. Construction policy of network service chain oriented to resource fragmentation optimization in operator network[J]. Journal of Electronics &Information Technology, 2018, 40(4): 763–769. doi: 10.11999/JEIT170641

WEN Tao, YU Hongfang, SUN Gang, et al. Network function consolidation in service function chaining orchestration[C]. Proceedings of 2016 IEEE International Conference on Communications, Kuala Lumpur, Malaysia, 2016: 512–519.

PEI Jianing, HONG Peilin, XUE Kaiping, et al. Efficiently embedding service function chains with dynamic virtual network function placement in geo-distributed cloud system[J]. IEEE Transactions on Parallel and Distributed Systems, 2018, 11(8): 367–379. doi: 10.1109/TPDS.2018.2880992

陈卓, 冯钢, 刘蓓, 等. 运营商网络中面向时延优化的服务功能链迁移重配置策略[J]. 电子学报, 2018, 46(9): 2229–2237. doi: 10.3969/j.issn.0372-2112.2018.09.026

CHEN Zhuo, FENG Gang, LIU Bei, et al. Delay optimization oriented service function chain migration and re-deployment in operator network[J]. Acta Electronica Sinica, 2018, 46(9): 2229–2237. doi: 10.3969/j.issn.0372-2112.2018.09.026

ARTEAGA C H T, RISSOI F, and RENDON O M C. An adaptive scaling mechanism for managing performance variations in network functions virtualization: A case study in an NFV-based EPC[C]. Proceedings of the 13th International Conference on Network and Service Management, Tokyo, Japan, 2017: 1–7.

LI Tong, BAUMBERGER D, HAHN S, et al. Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin[C]. Proceedings of the 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Raleigh, USA, 2009: 65–74.

AGARWAL S, MALANDRINO F, CHIASSERINI C F, et al. VNF placement and resource allocation for the support of vertical services in 5G networks[J]. IEEE/ACM Transactions on Networking, 2019, 27(1): 433–446. doi: 10.1109/TNET.2018.2890631

LANGE S, GRIGORJEW A, ZINNER T, et al. A multi-objective heuristic for the optimization of virtual network function chain placement[C]. Proceedings of the 29th International Teletraffic Congress, Genoa, Italy, 2017: 152–161.

WANG Xiaoke, WU Chuan, LE F, et al. Online VNF scaling in datacenters[C]. Proceedings of the IEEE 9th International Conference on Cloud Computing, San Francisco, USA, 2016: 140–147.

Relative Articles

Supplements(0)

Cited By

Proportional views