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

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

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

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.