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

王泽南; 张娇; 汪硕; 黄韬; F.RichardYu

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

您当前的位置：

首页 >

文章列表页 >

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

学术论文 | 更新时间：2024-06-05

- 端到端时延上限确定的服务链部署算法
- Service chain deployment algorithms for deterministic end-to-end delay upper bound
- 通信学报 2021年42卷第11期页码：66-78
- 作者机构：
  
  1. 网络通信与安全紫金山实验室，江苏南京 211111
  2. 北京邮电大学网络与交换技术国家重点实验室，北京 100876
  3. 加拿大卡尔顿大学，渥太华 K1S 5B6
- 作者简介：
  
  [ "王泽南（1994− ），男，浙江湖州人，网络通信与安全紫金山实验室在站博士后，主要研究方向为网络功能虚拟化、网络智能等" ]
  [ "张娇（1986− ），女，河北保定人，博士，北京邮电大学副教授，主要研究方向为数据中心网络、网络功能虚拟化、软件定义网络、未来网络体系架构等" ]
  [ "汪硕（1991− ），男，河南灵宝人，博士，北京邮电大学讲师，主要研究方向为数据中心网络、软件定义网络、网络流量调度等" ]
  [ "黄韬（1980− ），男，重庆人，博士，北京邮电大学教授，主要研究方向为网络体系架构、软件定义网络、云网融合等" ]
  [ "F.Richard Yu（1974− ），男，加拿大卡尔顿大学教授、加拿大工程院院士，主要研究方向为互联网自主智能、自动驾驶、网络空间安全等" ]
- 基金信息：
  
  国家重点研发计划基金资助项目(2020YFB1805200);国家自然科学基金资助项目(61872401);国家自然科学基金资助项目(62132022);霍英东青年教师基金资助项目(171059)
- DOI：10.11959/j.issn.1000-436x.2021189
  中图分类号： TN91
- 网络出版日期：2021-11，
  
  纸质出版日期：2021-11-25
- 稿件说明：
移动端阅览
王泽南, 张娇, 汪硕, 等. 端到端时延上限确定的服务链部署算法[J]. 通信学报, 2021,42(11):66-78.

Ze’nan WANG, Jiao ZHANG, Shuo WANG, et al. Service chain deployment algorithms for deterministic end-to-end delay upper bound[J]. Journal on communications, 2021, 42(11): 66-78.
王泽南, 张娇, 汪硕, 等. 端到端时延上限确定的服务链部署算法[J]. 通信学报, 2021,42(11):66-78. DOI： 10.11959/j.issn.1000-436x.2021189.

Ze’nan WANG, Jiao ZHANG, Shuo WANG, et al. Service chain deployment algorithms for deterministic end-to-end delay upper bound[J]. Journal on communications, 2021, 42(11): 66-78. DOI： 10.11959/j.issn.1000-436x.2021189.

摘要

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

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.

关键词

Keywords

references

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 .

HUAWEI . Immersive VR and AR experiences with mobile broadband [EB ] . 2021 .

SHERRY J , RATNASAMY S . A survey of enterprise middlebox deployments [R ] . 2012 .

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 .

MCKEOWN N , ANDERSON T , BALAKRISHNAN H , et al . OpenFlow [J ] . ACM SIGCOMM Computer Communication Review , 2008 , 38 ( 2 ): 69 - 74 .

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 .

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 .

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 .

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 .

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 .

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 .

PAXSON V , FLOYD S . Wide area traffic:the failure of Poisson modeling [J ] . IEEE/ACM Transactions on Networking , 1995 , 3 ( 3 ): 226 - 244 .

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 .

FIDLER M . Survey of deterministic and stochastic service curve models in the network calculus [J ] . IEEE Communications Surveys ＆Tutorials , 2010 , 12 ( 1 ): 59 - 86 .

LE BOUDEC J-Y , THIRAN P . Network calculus:a theory of deterministic queuing systems for the Internet [EB ] . 2004 .

INTEL . Data plane development kit (DPDK) [EB ] . 2021 .

JOHNSON D B . A note on Dijkstra’s shortest path algorithm [J ] . Journal of the ACM , 1973 , 20 ( 3 ): 385 - 388 .

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 .

MILTENBERGER M . An interface from Python to the SCIP Optimization Suite [EB ] . 2021 2021 .

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 .

浏览量

460

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

MicroNF：基于微服务的异构网络功能虚拟化框架

基于Q-learning的跨域服务链映射机制

基于强化学习的服务链映射算法

基于离散粒子群优化的多目标服务路径构建算法

NFV中基于量子遗传算法的网络服务扩展算法