IEICE TRANSACTIONS on Information
Joint Optimization of Delay Guarantees and Resource Allocation for Service Function Chaining
Summary :
A Service Function Chain (SFC) is an ordered sequence of virtual network functions (VNFs) to provide network service. Most existing SFC orchestration schemes, however, cannot optimize the resources allocation while guaranteeing the service delay constraint. To fulfill this goal, we propose a Layered Graph based SFC Orchestration Scheme (LGOS). LGOS converts both the cost of resource and the related delay into the link weights in the layered graph, which helps abstract the SFC orchestration problem as a shortest path problem. Then a simulated annealing based batch processing algorithm is designed for SFC requests set. Through extensive evaluations, we demonstrated that our scheme can reduce the end-to-end delay and the operational expenditure by 21.6% and 13.7% at least, and the acceptance ratio of requests set can be improved by 22.3%, compared with other algorithms.
- Publication
- IEICE TRANSACTIONS on Information Vol.E102-D No.12 pp.2611-2614
- Publication Date
- 2019/12/01
- Publicized
- 2019/09/19
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2019EDL8116
- Type of Manuscript
- LETTER
- Category
- Information Network
Authors
Yunjie GU
National Digital Switching System Engineering and Technological R&D Center
Yuehang DING
National Digital Switching System Engineering and Technological R&D Center
Yuxiang HU
National Digital Switching System Engineering and Technological R&D Center
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yunjie GU, Yuehang DING, Yuxiang HU, "Joint Optimization of Delay Guarantees and Resource Allocation for Service Function Chaining" in IEICE TRANSACTIONS on Information,
vol. E102-D, no. 12, pp. 2611-2614, December 2019, doi: 10.1587/transinf.2019EDL8116.
Abstract: A Service Function Chain (SFC) is an ordered sequence of virtual network functions (VNFs) to provide network service. Most existing SFC orchestration schemes, however, cannot optimize the resources allocation while guaranteeing the service delay constraint. To fulfill this goal, we propose a Layered Graph based SFC Orchestration Scheme (LGOS). LGOS converts both the cost of resource and the related delay into the link weights in the layered graph, which helps abstract the SFC orchestration problem as a shortest path problem. Then a simulated annealing based batch processing algorithm is designed for SFC requests set. Through extensive evaluations, we demonstrated that our scheme can reduce the end-to-end delay and the operational expenditure by 21.6% and 13.7% at least, and the acceptance ratio of requests set can be improved by 22.3%, compared with other algorithms.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2019EDL8116/_p
Copy
@ARTICLE{e102-d_12_2611,
author={Yunjie GU, Yuehang DING, Yuxiang HU, },
journal={IEICE TRANSACTIONS on Information},
title={Joint Optimization of Delay Guarantees and Resource Allocation for Service Function Chaining},
year={2019},
volume={E102-D},
number={12},
pages={2611-2614},
abstract={A Service Function Chain (SFC) is an ordered sequence of virtual network functions (VNFs) to provide network service. Most existing SFC orchestration schemes, however, cannot optimize the resources allocation while guaranteeing the service delay constraint. To fulfill this goal, we propose a Layered Graph based SFC Orchestration Scheme (LGOS). LGOS converts both the cost of resource and the related delay into the link weights in the layered graph, which helps abstract the SFC orchestration problem as a shortest path problem. Then a simulated annealing based batch processing algorithm is designed for SFC requests set. Through extensive evaluations, we demonstrated that our scheme can reduce the end-to-end delay and the operational expenditure by 21.6% and 13.7% at least, and the acceptance ratio of requests set can be improved by 22.3%, compared with other algorithms.},
keywords={},
doi={10.1587/transinf.2019EDL8116},
ISSN={1745-1361},
month={December},}
Copy
TY - JOUR
TI - Joint Optimization of Delay Guarantees and Resource Allocation for Service Function Chaining
T2 - IEICE TRANSACTIONS on Information
SP - 2611
EP - 2614
AU - Yunjie GU
AU - Yuehang DING
AU - Yuxiang HU
PY - 2019
DO - 10.1587/transinf.2019EDL8116
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E102-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2019
AB - A Service Function Chain (SFC) is an ordered sequence of virtual network functions (VNFs) to provide network service. Most existing SFC orchestration schemes, however, cannot optimize the resources allocation while guaranteeing the service delay constraint. To fulfill this goal, we propose a Layered Graph based SFC Orchestration Scheme (LGOS). LGOS converts both the cost of resource and the related delay into the link weights in the layered graph, which helps abstract the SFC orchestration problem as a shortest path problem. Then a simulated annealing based batch processing algorithm is designed for SFC requests set. Through extensive evaluations, we demonstrated that our scheme can reduce the end-to-end delay and the operational expenditure by 21.6% and 13.7% at least, and the acceptance ratio of requests set can be improved by 22.3%, compared with other algorithms.
ER -
English
