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 ba...

Full description

Saved in:
Bibliographic Details
Main Authors: Ze’nan WANG, Jiao ZHANG, Shuo WANG, Tao HUANG, F.Richard Yu
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2021-11-01
Series:Tongxin xuebao
Subjects:
Online Access:http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2021189/
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1841539225883770880
author Ze’nan WANG
Jiao ZHANG
Shuo WANG
Tao HUANG
F.Richard Yu
author_facet Ze’nan WANG
Jiao ZHANG
Shuo WANG
Tao HUANG
F.Richard Yu
author_sort Ze’nan WANG
collection DOAJ
description 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.
format Article
id doaj-art-b5af8e56543041dba084c33d120181a7
institution Kabale University
issn 1000-436X
language zho
publishDate 2021-11-01
publisher Editorial Department of Journal on Communications
record_format Article
series Tongxin xuebao
spelling doaj-art-b5af8e56543041dba084c33d120181a72025-01-14T07:23:05ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2021-11-0142667859745873Service chain deployment algorithms for deterministic end-to-end delay upper boundZe’nan WANGJiao ZHANGShuo WANGTao HUANGF.Richard YuTo 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.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2021189/end-to-end delayservice chainnetwork function virtualizationnetwork calculus
spellingShingle Ze’nan WANG
Jiao ZHANG
Shuo WANG
Tao HUANG
F.Richard Yu
Service chain deployment algorithms for deterministic end-to-end delay upper bound
Tongxin xuebao
end-to-end delay
service chain
network function virtualization
network calculus
title Service chain deployment algorithms for deterministic end-to-end delay upper bound
title_full Service chain deployment algorithms for deterministic end-to-end delay upper bound
title_fullStr Service chain deployment algorithms for deterministic end-to-end delay upper bound
title_full_unstemmed Service chain deployment algorithms for deterministic end-to-end delay upper bound
title_short Service chain deployment algorithms for deterministic end-to-end delay upper bound
title_sort service chain deployment algorithms for deterministic end to end delay upper bound
topic end-to-end delay
service chain
network function virtualization
network calculus
url http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2021189/
work_keys_str_mv AT zenanwang servicechaindeploymentalgorithmsfordeterministicendtoenddelayupperbound
AT jiaozhang servicechaindeploymentalgorithmsfordeterministicendtoenddelayupperbound
AT shuowang servicechaindeploymentalgorithmsfordeterministicendtoenddelayupperbound
AT taohuang servicechaindeploymentalgorithmsfordeterministicendtoenddelayupperbound
AT frichardyu servicechaindeploymentalgorithmsfordeterministicendtoenddelayupperbound