Low-latency and Resource-efficient Service Function Chaining Orchestration in Network Function Virtualization
Document identifier: oai:DiVA.org:ltu-75825
Access full text here:
10.1109/JIOT.2019.2937110Keyword: Natural Sciences,
Computer and Information Sciences,
Media and Communication Technology,
Naturvetenskap,
Data- och informationsvetenskap,
Medieteknik,
Network function virtualization,
Service function chain,
End-to-end delay,
Resource consumption,
Pervasive Mobile Computing,
Distribuerade datorsystemPublication year: 2020Relevant Sustainable Development Goals (SDGs):
The SDG label(s) above have been assigned by OSDG.aiAbstract: Recently, network function virtualization (NFV) has been proposed to solve the dilemma faced by traditional networks and to improve network performance through hardware and software decoupling. The deployment of the service function chain (SFC) is a key technology that affects the performance of virtual network function (VNF). The key issue in the deployment of SFCs is proposing effective algorithms to achieve efficient use of resources. In this paper, we propose a service function chain deployment optimization (SFCDO) algorithm based on a breadth-first search (BFS). The algorithm first uses a BFS based algorithm to find the shortest path between the source node and the destination node. Then, based on the shortest path, the path with the fewest hops is preferentially chosen to implement the SFC deployment. Finally, we compare the performances with the greedy and simulated annealing (G-SA) algorithm. The experiment results show that the proposed algorithm is optimized in terms of end-to-end delay and bandwidth resource consumption. In addition, we also consider the load rate of the nodes to achieve network load balancing.
Authors
Gang Sun
Key Lab of Optical Fiber Sensing and Communications (Ministry of Education), University of Electronic Science and Technology of China, Chengdu, China
Other publications
>>
Zhu Xu
Key Lab of Optical Fiber Sensing and Communications (Ministry of Education), University of Electronic Science and Technology of China, Chengdu, China
Other publications
>>
Hongfang Yu
Key Lab of Optical Fiber Sensing and Communications (Ministry of Education), University of Electronic Science and Technology of China, Chengdu, China
Other publications
>>
Xi Chen
School of Computer Science and Technology, Southwest Minzu University, Chengdu, China
Other publications
>>
Victor Chang
School of Computing & Digital Technologies, Teesside University, Middlesbrough, UK
Other publications
>>
Athanasios Vasilakos
Luleå tekniska universitet; Datavetenskap
Other publications
>>
Record metadata
Click to view metadata
header:
identifier: oai:DiVA.org:ltu-75825
datestamp: 2021-04-19T12:51:18Z
setSpec: SwePub-ltu
metadata:
mods:
@attributes:
version: 3.7
recordInfo:
recordContentSource: ltu
recordCreationDate: 2019-09-03
identifier:
http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-75825
10.1109/JIOT.2019.2937110
2-s2.0-85087562958
titleInfo:
@attributes:
lang: eng
title: Low-latency and Resource-efficient Service Function Chaining Orchestration in Network Function Virtualization
abstract: Recently network function virtualization (NFV) has been proposed to solve the dilemma faced by traditional networks and to improve network performance through hardware and software decoupling. The deployment of the service function chain (SFC) is a key technology that affects the performance of virtual network function (VNF). The key issue in the deployment of SFCs is proposing effective algorithms to achieve efficient use of resources. In this paper we propose a service function chain deployment optimization (SFCDO) algorithm based on a breadth-first search (BFS). The algorithm first uses a BFS based algorithm to find the shortest path between the source node and the destination node. Then based on the shortest path the path with the fewest hops is preferentially chosen to implement the SFC deployment. Finally we compare the performances with the greedy and simulated annealing (G-SA) algorithm. The experiment results show that the proposed algorithm is optimized in terms of end-to-end delay and bandwidth resource consumption. In addition we also consider the load rate of the nodes to achieve network load balancing.
subject:
@attributes:
lang: eng
authority: uka.se
topic:
Natural Sciences
Computer and Information Sciences
Media and Communication Technology
@attributes:
lang: swe
authority: uka.se
topic:
Naturvetenskap
Data- och informationsvetenskap
Medieteknik
@attributes:
lang: eng
topic: Network function virtualization
@attributes:
lang: eng
topic: Service function chain
@attributes:
lang: eng
topic: End-to-end delay
@attributes:
lang: eng
topic: Resource consumption
@attributes:
lang: eng
authority: ltu
topic: Pervasive Mobile Computing
genre: Research subject
@attributes:
lang: swe
authority: ltu
topic: Distribuerade datorsystem
genre: Research subject
language:
languageTerm: eng
genre:
publication/journal-article
ref
note:
Published
6
Validerad;2020;Nivå 2;2020-08-18 (johcin)
name:
@attributes:
type: personal
namePart:
Sun
Gang
role:
roleTerm: aut
affiliation: Key Lab of Optical Fiber Sensing and Communications (Ministry of Education) University of Electronic Science and Technology of China Chengdu China
@attributes:
type: personal
namePart:
Xu
Zhu
role:
roleTerm: aut
affiliation: Key Lab of Optical Fiber Sensing and Communications (Ministry of Education) University of Electronic Science and Technology of China Chengdu China
@attributes:
type: personal
namePart:
Yu
Hongfang
role:
roleTerm: aut
affiliation: Key Lab of Optical Fiber Sensing and Communications (Ministry of Education) University of Electronic Science and Technology of China Chengdu China
@attributes:
type: personal
namePart:
Chen
Xi
role:
roleTerm: aut
affiliation: School of Computer Science and Technology Southwest Minzu University Chengdu China
@attributes:
type: personal
namePart:
Chang
Victor
role:
roleTerm: aut
affiliation: School of Computing & Digital Technologies Teesside University Middlesbrough UK
@attributes:
type: personal
authority: ltu
namePart:
Vasilakos
Athanasios
role:
roleTerm: aut
affiliation:
Luleå tekniska universitet
Datavetenskap
nameIdentifier:
thanos
0000-0003-1902-9877
originInfo:
dateIssued: 2020
publisher: IEEE
relatedItem:
@attributes:
type: host
titleInfo:
title: IEEE Internet of Things Journal
identifier: 2327-4662
part:
detail:
@attributes:
type: volume
number: 7
@attributes:
type: issue
number: 7
extent:
start: 5760
end: 5772
physicalDescription:
form: print
typeOfResource: text