端到端时延上限确定的服务链部署算法

doi:10.11959/j.issn.1000-436x.2021189

通信学报 ›› 2021, Vol. 42 ›› Issue (11): 66-78.doi: 10.11959/j.issn.1000-436x.2021189

端到端时延上限确定的服务链部署算法

王泽南¹^,², 张娇²^,¹, 汪硕¹^,², 黄韬¹^,², F.RichardYu³

¹ 网络通信与安全紫金山实验室，江苏南京 211111
² 北京邮电大学网络与交换技术国家重点实验室，北京 100876
³ 加拿大卡尔顿大学，渥太华 K1S 5B6

修回日期:2021-09-11 出版日期:2021-11-25 发布日期:2021-11-01
作者简介:王泽南（1994− ），男，浙江湖州人，网络通信与安全紫金山实验室在站博士后，主要研究方向为网络功能虚拟化、网络智能等
张娇（1986− ），女，河北保定人，博士，北京邮电大学副教授，主要研究方向为数据中心网络、网络功能虚拟化、软件定义网络、未来网络体系架构等
汪硕（1991− ），男，河南灵宝人，博士，北京邮电大学讲师，主要研究方向为数据中心网络、软件定义网络、网络流量调度等
黄韬（1980− ），男，重庆人，博士，北京邮电大学教授，主要研究方向为网络体系架构、软件定义网络、云网融合等
F.Richard Yu（1974− ），男，加拿大卡尔顿大学教授、加拿大工程院院士，主要研究方向为互联网自主智能、自动驾驶、网络空间安全等
基金资助:
国家重点研发计划基金资助项目(2020YFB1805200);国家自然科学基金资助项目(61872401);国家自然科学基金资助项目(62132022);霍英东青年教师基金资助项目(171059)

Service chain deployment algorithms for deterministic end-to-end delay upper bound

Ze’nan WANG¹^,², Jiao ZHANG²^,¹, Shuo WANG¹^,², Tao HUANG¹^,², F.Richard Yu³

¹ Purple Mountain Laboratories, Nanjing 211111, China
² State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
³ Carleton University, Ottawa K1S 5B6, Canada

Revised:2021-09-11 Online:2021-11-25 Published:2021-11-01
Supported by:
The National Key Research and Development Program of China(2020YFB1805200);The National Natural Science Foundation of China(61872401);The National Natural Science Foundation of China(62132022);Fok Ying-Tong Education Foundation(171059)

摘要/Abstract

摘要：

针对现有服务链部署算法无法保证通过服务链的每一个数据包的端到端时延问题，提出端到端时延上限确定的服务链部署算法。首先，基于网络演算得到服务链的端到端时延上限；然后，通过协同优化服务链路由与虚拟网络功能节点资源分配，实现确定的服务链端到端时延上限。实验结果表明，所提算法能在提高服务链接收数量的同时，保证通过服务链的每一个数据包的端到端时延均满足业务需求。

关键词: 端到端时延, 服务链, 网络功能虚拟化, 网络演算

Abstract:

To solve the problem that the current service chain deployment algorithms cannot guarantee the delay of each packet passing through the service chain (SC), a SC deployment algorithm for deterministic end-to-end delay upper bound was proposed.First, the end-to-end delay bound of the SC was derived based on network calculus.Then, the deterministic end-to-end delay bound of the SC was achieved by collaboratively optimizing the routing of SC and the resource allocation of the virtual network function nodes in the SC.The experimental results show that the proposed algorithm can effectively improve the volume of accepted SC while guaranteeing that the end-to-end delay of each packet satisfies the delay requirements.

Key words: end-to-end delay, service chain, network function virtualization, network calculus

中图分类号:

TN91

王泽南, 张娇, 汪硕, 黄韬, F.RichardYu. 端到端时延上限确定的服务链部署算法[J]. 通信学报, 2021, 42(11): 66-78.

Ze’nan WANG, Jiao ZHANG, Shuo WANG, Tao HUANG, F.Richard Yu. Service chain deployment algorithms for deterministic end-to-end delay upper bound[J]. Journal on Communications, 2021, 42(11): 66-78.

图/表 15

图1

图2

图3

图4

图5

图6

图7

图8

图9

图10

图11

图12

图13

图14

图15

参考文献 20

[1]	SAMII S , ZINNER H . Level 5 by layer 2:time-sensitive networking for autonomous vehicles[J]. IEEE Communications Standards Magazine, 2018,2(2): 62-68.
[2]	HUAWEI. Immersive VR and AR experiences with mobile broadband[EB]. 2021.
[3]	SHERRY J , RATNASAMY S . A survey of enterprise middlebox deployments[R]. 2012.
[4]	MIJUMBI R , SERRAT J , GORRICHO J L ,et al. Network function virtualization:state-of-the-art and research challenges[J]. IEEE Communications Surveys ＆ Tutorials, 2016,18(1): 236-262.
[5]	MCKEOWN N , ANDERSON T , BALAKRISHNAN H ,et al. OpenFlow[J]. ACM SIGCOMM Computer Communication Review, 2008,38(2): 69-74.
[6]	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.
[7]	QU L , ASSI C , SHABAN K ,et al. A reliability-aware network service chain provisioning with delay guarantees in NFV-enabled enterprise datacenter networks[J]. IEEE Transactions on Network and Service Management, 2017,14(3): 554-568.
[8]	GOUAREB R , FRIDERIKOS V , AGHVAMI A H . Virtual network functions routing and placement for edge cloud latency minimization[J]. IEEE Journal on Selected Areas in Communications, 2018,36(10): 2346-2357.
[9]	BHAMARE D , SAMAKA M , ERBAD A ,et al. Optimal virtual network function placement in multi-cloud service function chaining architecture[J]. Computer Communications, 2017,102: 1-16.
[10]	DUAN Q , . Modeling and performance analysis for service function chaining in the SDN/NFV architecture[C]// Proceedings of 2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft). Piscataway:IEEE Press, 2018: 476-481.
[11]	MIAO W , MIN G Y , WU Y L ,et al. Stochastic performance analysis of network function virtualization in future Internet[J]. IEEE Journal on Selected Areas in Communications, 2019,37(3): 613-626.
[12]	PAXSON V , FLOYD S . Wide area traffic:the failure of Poisson modeling[J]. IEEE/ACM Transactions on Networking, 1995,3(3): 226-244.
[13]	LOCKWOOD J W , MONGA M . Implementing ultra low latency data center services with programmable logic[C]// Proceedings of 2015 IEEE 23rd Annual Symposium on High-Performance Interconnects. Piscataway:IEEE Press, 2015: 68-77.
[14]	FIDLER M . Survey of deterministic and stochastic service curve models in the network calculus[J]. IEEE Communications Surveys ＆Tutorials, 2010,12(1): 59-86.
[15]	LE BOUDEC J-Y , THIRAN P . Network calculus:a theory of deterministic queuing systems for the Internet[EB]. 2004.
[16]	INTEL. Data plane development kit (DPDK)[EB]. 2021.
[17]	JOHNSON D B . A note on Dijkstra’s shortest path algorithm[J]. Journal of the ACM, 1973,20(3): 385-388.
[18]	DWARAKI A , WOLF T . Adaptive service-chain routing for virtual network functions in software-defined networks[C]// Proceedings of the 2016 workshop on Hot topics in Middleboxes and Network Function Virtualization. New York:ACM Press, 2016: 32-37.
[19]	MILTENBERGER M . An interface from Python to the SCIP Optimization Suite[EB]. .
[20]	KNIGHT S , NGUYEN H X , FALKNER N ,et al. The Internet topology zoo[J]. IEEE Journal on Selected Areas in Communications, 2011,29(9): 1765-1775.

端到端时延上限确定的服务链部署算法

Service chain deployment algorithms for deterministic end-to-end delay upper bound

在线阅读

PDF下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 15

参考文献 20

相关文章 15

Metrics

推荐阅读 0

[1]	陈浩, 杨芫, 徐明伟, 裴丹, 尤艺霖. 支持多模态网络的可扩展异构服务功能链并行编排部署系统[J]. 通信学报, 2022, 43(9): 1-11.
[2]	徐泽汐, 庄雷, 张坤丽, 桂明宇. 基于知识图谱的服务功能链在线部署算法[J]. 通信学报, 2022, 43(8): 41-51.
[3]	杨力, 潘成胜, 孔相广, 黄琦龙, 戚耀文. 5G融合卫星网络研究综述[J]. 通信学报, 2022, 43(4): 202-215.
[4]	邱航, 汤红波, 游伟, 赵宇, 柏溢. NFV中基于量子遗传算法的网络服务扩展算法[J]. 通信学报, 2022, 43(11): 44-52.
[5]	王侃,赵楠,李军怀,王怀军. 移动边缘计算网络中联合无线多播的服务功能链部署算法[J]. 通信学报, 2020, 41(10): 37-47.
[6]	孙晨,毕军,郑智隆,王舒鹤,胡宏新. MicroNF：基于微服务的异构网络功能虚拟化框架[J]. 通信学报, 2019, 40(8): 54-59.
[7]	钱红燕,薛昊,陈鸣. UDM：基于NFV的防止DDoS攻击SDN控制器的机制[J]. 通信学报, 2019, 40(3): 116-124.
[8]	兰巨龙,金子晋,孙鹏浩,江逸茗,王月. 基于可靠性的服务功能链构建算法[J]. 通信学报, 2019, 40(1): 64-70.
[9]	张红旗,黄睿,杨英杰,常德显,张连成. 基于Q-learning的跨域服务链映射机制[J]. 通信学报, 2018, 39(12): 102-112.
[10]	魏亮,黄韬,张娇,王泽南,刘江,刘韵洁. 基于强化学习的服务链映射算法[J]. 通信学报, 2018, 39(1): 90-100.
[11]	马丁,庄雷,兰巨龙. 基于离散粒子群优化的多目标服务路径构建算法[J]. 通信学报, 2017, 38(2): 94-105.
[12]	习宁,马建峰,孙聪,卢笛,张涛. 基于模型检测的服务链信息流安全可组合验证方法[J]. 通信学报, 2014, 35(11): 23-31.
[13]	习宁，马建峰，孙聪，卢笛，张涛. 基于模型检测的服务链信息流安全可组合验证方法[J]. 通信学报, 2014, 35(11): 3-22.
[14]	陈艳平,王慧强,冯光升,高玉龙. 面向统计QoS保障的多时间尺度接纳控制算法[J]. 通信学报, 2011, 32(11): 140-146.
[15]	陈志刚,曾锋,李庆华. 无线mesh网中时延约束抖动优化的多路径流量分配算法[J]. 通信学报, 2011, 32(1): 1-8.