CN113300861A - Network slice configuration method, device and storage medium - Google Patents

Network slice configuration method, device and storage medium Download PDF

Info

Publication number
CN113300861A
CN113300861A CN202010111423.6A CN202010111423A CN113300861A CN 113300861 A CN113300861 A CN 113300861A CN 202010111423 A CN202010111423 A CN 202010111423A CN 113300861 A CN113300861 A CN 113300861A
Authority
CN
China
Prior art keywords
node
physical
virtual
physical node
candidate
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202010111423.6A
Other languages
Chinese (zh)
Other versions
CN113300861B (en
Inventor
梅承力
张蕾
夏旭
赵一荣
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Telecom Corp Ltd
Original Assignee
China Telecom Corp Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China Telecom Corp Ltd filed Critical China Telecom Corp Ltd
Priority to CN202010111423.6A priority Critical patent/CN113300861B/en
Publication of CN113300861A publication Critical patent/CN113300861A/en
Application granted granted Critical
Publication of CN113300861B publication Critical patent/CN113300861B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08Configuration management of networks or network elements
    • H04L41/0893Assignment of logical groups to network elements
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W24/00Supervisory, monitoring or testing arrangements
    • H04W24/02Arrangements for optimising operational condition

Abstract

The present disclosure provides a network slice configuration method, device and storage medium, wherein the method comprises: establishing an SFP path set, determining the mapping sequence of the SFPs according to the path length information and the time delay index information, and sequentially establishing a candidate physical node set for the virtual nodes in each SFP according to the data transmission direction; after each candidate physical node in the candidate physical node set is mapped by the virtual node, calculating the actual time delay of the physical link corresponding to the formed virtual link, and selecting the candidate physical node to perform SFP virtual node mapping. The method, the device and the storage medium provide a scheme for deploying and configuring network slices with an end-to-end data transmission delay constraint service; when the virtual nodes on the path are mapped in sequence according to the data transmission direction, the mapping conditions of the front virtual node and the rear virtual node are analyzed, and meanwhile, the mapping target is selected by combining the topology information of the physical node, so that the utilization efficiency of physical resources is improved.

Description

Network slice configuration method, device and storage medium
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a network slice configuration method, an apparatus, and a storage medium.
Background
And the 5G network slicing technology maps the virtual network corresponding to the service to the physical network of the bottom layer entity. The 5G network supports a plurality of vertical services with different performance requirements, and the network slicing technology enables an operator to cut a plurality of virtual end-to-end networks from a bottom physical network, thereby providing differentiated service guarantee for different services. A class of mainstream services of a mobile network and the like have clear requirements on data transmission delay, such as a video transmission service, a content distribution service and the like. However, in the prior art, a technical solution of how to allocate bottom-layer physical resources for deploying network slices including multiple Service Function Paths (SFPs) with an end-to-end delay requirement so as to meet the delay requirement of a user is not provided.
Disclosure of Invention
In view of the above, an object of the present invention is to provide a method, an apparatus and a storage medium for configuring a network slice.
According to an aspect of the present disclosure, there is provided a network slice configuration method, including: acquiring a Service Function Path (SFP) corresponding to a virtual network request for establishing a network slice and having a transmission delay requirement, and establishing an SFP path set; determining the mapping sequence of the SFPs in the SFP path set according to the path length information and the time delay index information; based on the mapping sequence, sequentially establishing a candidate physical node set for the virtual nodes in each SFP according to the data transmission direction; after each candidate physical node in the candidate physical node set is mapped by a virtual node, calculating the actual time delay of a physical link corresponding to the formed virtual link; and selecting candidate physical nodes from the candidate physical node set based on the actual time delay to perform virtual node mapping and related virtual link mapping of the SFP so as to map the SFP.
Optionally, the determining, according to the path length information and the delay indicator information, a mapping order of the SFPs in the SFP path set includes: sorting the SFPs in the SFP path set in descending order based on path length; wherein if there are multiple SPFs with the same path length, the multiple SPFs are sorted in ascending order based on the delay index.
Optionally, the sequentially establishing a candidate physical node set for the virtual nodes in each SFP according to the data transmission direction includes: acquiring a first virtual node to be mapped currently by the SFP; acquiring a previous virtual node and a next virtual node of the first virtual node in the SFP, wherein the previous virtual node and the next virtual node are respectively a second virtual node and a third virtual node; and judging whether the second virtual node and the third virtual node are mapped or not, and establishing a candidate physical node set of the first virtual node based on a judgment result.
Optionally, the establishing the candidate physical node set of the first virtual node based on the determination result includes: if the second virtual node and the third virtual node are not mapped completely, a first physical node set with the computing resource capacity larger than the computing resource demand of the first virtual node is selected in a physical network, and the first physical node set is used as the candidate physical node set.
Optionally, the establishing the candidate physical node set of the first virtual node based on the determination result includes: if the second virtual node is mapped to a second physical node, acquiring a second physical node set; wherein the second set of physical nodes comprises: other physical nodes with the distance between the other physical nodes and the second physical node smaller than a preset distance threshold; if the third virtual node is mapped to a third physical node, acquiring a third physical node set; wherein the third set of physical nodes comprises: the distance between the first physical node and the second physical node is smaller than a preset distance threshold; and taking the union of the second physical node set and the third physical node set as the candidate physical node set.
Optionally, after each candidate physical node in the candidate physical node set is mapped by a virtual node, calculating an actual time delay of a physical link corresponding to the formed virtual link includes: traversing the candidate physical node set, and when the first virtual node is mapped to one candidate physical node in the candidate physical node set, calculating the actual time delay of the physical links between the candidate physical node and the second physical node and between the candidate physical node and the third physical node respectively; the selecting a candidate physical node from the candidate physical node set for the virtual node mapping of the SFP based on the actual time delay comprises: and selecting the candidate physical node with the minimum actual time delay as the physical node mapped by the first virtual node.
Optionally, the calculating the actual time delay of the physical link between the candidate physical node and the second physical node and the actual time delay of the physical link between the candidate physical node and the third physical node respectively includes: if the second virtual node is mapped to a second physical node and the third virtual node is mapped to a third physical node, acquiring a first delay of a physical link between the candidate physical node and the second physical node and a second delay of a physical link between the candidate physical node and the third physical node, and taking the sum of the first delay and the second delay as the actual delay; determining the actual time delay as the first time delay if only the second virtual node is mapped to a second physical node; determining the actual latency as the second latency if only the third virtual node maps to a third physical node.
According to another aspect of the present disclosure, there is provided a network slice configuration apparatus including: a path acquisition module, configured to acquire a service function path SFP with a transmission delay requirement corresponding to a virtual network request for establishing a network slice and establish an SFP path set; the mapping sequence determining module is used for determining the mapping sequence of the SFPs in the SFP path set according to the path length information and the time delay index information; a candidate node acquisition module, configured to sequentially establish a candidate physical node set for each virtual node in the SFP according to a data transmission direction based on the mapping order; a delay determining module, configured to calculate an actual delay of a physical link corresponding to a formed virtual link after each candidate physical node in the candidate physical node set is mapped by a virtual node; and the node mapping processing module is used for selecting a candidate physical node from the candidate physical node set based on the actual time delay to perform virtual node mapping and related virtual link mapping of the SFP so as to map the SFP.
Optionally, the mapping order determining module is configured to sort the SFPs in the SFP path set in a descending order based on path lengths; wherein if there are multiple SPFs with the same path length, the multiple SPFs are sorted in ascending order based on the delay index.
Optionally, the candidate node obtaining module includes: a virtual node determining unit, configured to obtain a first virtual node to be mapped currently by the SFP; acquiring a previous virtual node and a next virtual node of the first virtual node in the SFP, wherein the previous virtual node and the next virtual node are respectively a second virtual node and a third virtual node; and the physical node determining unit is used for judging whether the second virtual node and the third virtual node are mapped or not and establishing a candidate physical node set of the first virtual node based on a judgment result.
Optionally, the physical node determining unit is configured to select a first physical node set in a physical network, where the computing resource capacity of the first physical node set is greater than the computing resource demand of the first virtual node, and cooperate the first physical node set as the candidate physical node set, if the mapping between the second virtual node and the third virtual node is not completed.
Optionally, the physical node determining unit is further configured to obtain a second physical node set if the second virtual node is mapped to a second physical node; wherein the second set of physical nodes comprises: other physical nodes with the distance to the second physical node smaller than a preset distance threshold; if the third virtual node is mapped to a third physical node, acquiring a third physical node set; wherein the third set of physical nodes comprises: other physical nodes with the distance between the other physical nodes and the third physical node smaller than a preset distance threshold; taking the union of the second set of physical nodes and the third set of physical nodes as the candidate set of physical nodes.
Optionally, the delay determining module is further configured to traverse the candidate physical node set, and when the first virtual node is mapped to one candidate physical node in the candidate physical node set, calculate actual delays of physical links between the candidate physical node and the second physical node and between the candidate physical node and the third physical node, respectively; and the node mapping processing module is configured to select the candidate physical node with the smallest actual time delay as the physical node mapped by the first virtual node.
Optionally, the delay determining module is specifically configured to, if the second virtual node is mapped to a second physical node and the third virtual node is mapped to a third physical node, obtain a first delay of a physical link between the candidate physical node and the second physical node and a second delay of a physical link between the candidate physical node and the third physical node, and use a sum of the first delay and the second delay as the actual delay; determining the actual time delay as the first time delay if only the second virtual node is mapped to a second physical node; determining the actual latency as the second latency if only the third virtual node maps to a third physical node.
According to still another aspect of the present disclosure, there is provided a network slice configuration apparatus including: a memory; and a processor coupled to the memory, the processor configured to perform the method as described above based on instructions stored in the memory.
According to yet another aspect of the present disclosure, a computer-readable storage medium is provided, having stored thereon computer instructions for execution by a processor of a method as described above.
The network slice configuration method, the device and the storage medium provide a network slice deployment and configuration scheme for a service with end-to-end data transmission delay constraint; when the virtual nodes on the path are mapped in sequence according to the data transmission direction, the mapping conditions of the front virtual node and the rear virtual node are analyzed, the mapping target is selected by combining the topology information of the physical node, the position information of the virtual node is considered, the nodes and the link are mapped in a coordinated mode, and the utilization efficiency of physical resources is improved.
Drawings
In order to more clearly illustrate the embodiments of the present disclosure or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only some embodiments of the present disclosure, and other drawings can be obtained according to the drawings without inventive labor for those skilled in the art.
FIG. 1 is an application scenario illustration of one embodiment of a network slice configuration method according to the present disclosure;
fig. 2 is a flow diagram of one embodiment of a network slice configuration method according to the present disclosure;
fig. 3 is a schematic flow chart diagram illustrating establishment of a set of candidate physical nodes in an embodiment of a network slice configuration method according to the present disclosure;
FIG. 4 is a schematic flow chart diagram illustrating the calculation of actual time delay in one embodiment of a network slice configuration method according to the present disclosure;
FIG. 5 is a schematic diagram of establishing a network slice;
fig. 6 is a flow diagram illustration of another embodiment of a network slice configuration method according to the present disclosure;
fig. 7 is a block schematic diagram of one embodiment of a network slice configuration apparatus according to the present disclosure;
fig. 8 is a block diagram of a candidate node acquisition module in an embodiment of a network slice configuration apparatus according to the present disclosure;
fig. 9 is a block schematic diagram of another embodiment of a network slice configuration apparatus according to the present disclosure.
Detailed Description
The present disclosure now will be described more fully hereinafter with reference to the accompanying drawings, in which exemplary embodiments of the disclosure are shown. Technical solutions in the embodiments of the present disclosure will be described clearly and completely with reference to the accompanying drawings in the embodiments of the present disclosure, and it is to be understood that the described embodiments are only a part of the embodiments of the present disclosure, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments disclosed herein without making any creative effort, shall fall within the protection scope of the present disclosure.
The terms "first," "second," and the like, are used hereinafter merely to describe differences, and have no other special meanings.
The CDN service supported by the 5G network is one of the mainstream services of the mobile network, the CDN network mainly faces a network video service with a large flow, a large bandwidth, and a low delay requirement, and the video service is a delay sensitive service, and an excessive delay of data transmission may cause a loss of a user. The data transmission delay refers to the delay consumed by a data transmission path from a user access point to a target CDN server. Different target CDN servers are, different in Service Function Path (SFP) or Service Function Chain (SFC).
A network slice may contain multiple SFPs with transmission delay requirements, and these different SFPs all need to ensure that the transmission delay of data from the target CDN server to the user end meets the delay requirements of the service. The deployment of network slices depends on the resource allocation of the physical network, while the resource allocation problem of network slices is actually the virtual network mapping problem. For a network slice including a plurality of SFPs with end-to-end delay requirements, end-to-end transmission delay is an important index parameter of many services, and in one network slice, a plurality of SFPs may cross-multiplex the same virtual function node.
The network slice configuration method disclosed by the invention aims at the problem of end-to-end network slice resource allocation of services with delay requirements, determines the virtual network mapping of the network slice based on the data transmission delay requirements of the services under the conditions of known network slice requests and underlying physical networks, and can improve the utilization efficiency of network resources under the condition of meeting the delay requirements.
Fig. 1 is an application scenario diagram of an embodiment of a network slice configuration method according to the present disclosure, and for functions such as deployment, management, and orchestration of Virtualized Network Functions (VNFs) in a core network slice, a network function virtualization management and orchestration (NFV MANO) architecture is adopted to implement establishment of a virtualized network slice instance on a dedicated physical device, and deployment and connection of a network service.
The MANO of the network slice in fig. 1 includes virtualization infrastructure management, virtual network function management, and traffic orchestration. Virtualization Infrastructure Management (VIM) is responsible for managing the virtualization platform infrastructure and performing virtual resource allocation of VNF, such as virtualized computing resources, storage resources, and the like.
The virtualized network function management performs the lifecycle management of the VNF according to information such as network slice descriptors generated by slice management and orchestration. The network function virtualization orchestrator executes virtualized network slice instances in coordination with resource management and orchestration. The end-to-end SFC service request is composed of different VNFs according to the data transmission direction and is mapped to a bottom layer physical network for service according to the requirement. In the mapping process, considering that multiple SFCs may multiplex the same VNF, a scheme for efficiently deploying the SFCs to the underlying physical network and simultaneously enabling the end-to-end data transmission delay to meet the service requirement needs to be found.
Fig. 2 is a flowchart illustrating an embodiment of a network slice configuration method according to the present disclosure, as shown in fig. 2:
step 201, obtaining a service function path SFP corresponding to a virtual network request for establishing a network slice and having a transmission delay requirement, and establishing an SFP path set.
And step 202, determining the mapping sequence of the SFPs in the SFP path set according to the path length information and the delay index information.
The path length may be the hop count of the path, the delay index may be the delay requirement level of the SPF, and the like, and various methods may be employed to determine the mapping order of the SFPs in the SFP path set. For example, SFPs in the SFP path set are sorted in descending order based on path length, and if there are multiple SPFs with the same path length, the multiple SPFs are sorted in ascending order based on the delay index.
And step 203, based on the mapping sequence, sequentially establishing a candidate physical node set for the virtual nodes in each SFP according to the data transmission direction.
Step 204, after each candidate physical node in the candidate physical node set is mapped by a virtual node, calculating the actual time delay of the physical link corresponding to the formed virtual link.
Step 205, selecting candidate physical nodes from the candidate physical node set based on the actual time delay to perform SFP virtual node mapping and related virtual link mapping, so as to map the SFP.
As shown in fig. 5, the CDN Service is a video Service and is a delay sensitive Service, the target CDN servers are different, and the SFPs or Service Function Chains (SFCs) are different, where the SFCs and the SFPs refer to transmission paths of data packets when a user requests a certain Service. The data may be sent from a central CDN server or from a MEC CDN server. A network slice may contain multiple SFPs with transmission delay requirements, and these different SFPs are all required to ensure that the transmission delay of data from the target CDN server to the user end meets the delay requirements of the service.
In one embodiment, the physical network model uses an undirected graph GI(NI,EI) Is represented by the formula, wherein NIRepresenting a set of physical network nodes, EIRepresenting physical links between physical nodes. Undirected graph G for virtual network request modelS(NS,ES) Is represented by, wherein, NSRepresenting a set of virtual functional nodes, each node serving
Figure BDA0002390150460000081
Is represented bySRepresenting a set of virtual links between virtual nodes, each link for
Figure BDA0002390150460000082
And (4) showing.
Acquiring a virtual network request corresponding to a network slice, analyzing the virtual network request, marking SFPs with transmission delay requirements, and establishing an SFP path set
Figure BDA0002390150460000083
The paths in set L may be sorted in descending length order using bubble sorting to obtain set L'. In the sorting process, if a plurality of paths have the same length, the paths are sorted in an ascending order according to the delay indexes, and a virtual network can have a plurality of SFPs with end-to-end delay requirements.
Fig. 3 is a schematic flowchart of establishing a candidate physical node set in an embodiment of a network slice configuration method according to the present disclosure, as shown in fig. 3:
step 301, acquiring a first virtual node to be mapped currently by the SFP.
Step 302, acquiring a previous virtual node and a next virtual node of the first virtual node in the SFP, which are the second virtual node and the third virtual node respectively.
Step 303, determining whether the second virtual node and the third virtual node have completed mapping, and establishing a candidate physical node set of the first virtual node based on the determination result.
For example, if the second virtual node and the third virtual node do not complete mapping, a first physical node set with a computing resource capacity larger than that of the first virtual node is selected in the physical network, and the first physical node set is used as a candidate physical node set. The resources comprise hardware resources and the like, and the hardware resources comprise computing hardware, storage hardware, network hardware and the like and are used for running the virtual machine and bearing the virtual network request.
If the second virtual node is mapped to the second physical node, acquiring a second physical node set; wherein the second set of physical nodes comprises: and other physical nodes with the distance to the second physical node smaller than a preset distance threshold value, and the like.
If the third virtual node is mapped to the third physical node, acquiring a third physical node set; wherein the third set of physical nodes comprises: and other physical nodes with the distance to the third physical node smaller than a preset distance threshold value, and the like. And taking the union of the second physical node set and the third physical node set as a candidate physical node set.
In one embodiment, when each SFP in L' is mapped, the first virtual node to be mapped is set as
Figure BDA0002390150460000091
The former virtual node in the path is the second virtual node
Figure BDA0002390150460000092
The latter virtual node is a third virtual node
Figure BDA0002390150460000093
After deployment is completed, the second virtual node
Figure BDA0002390150460000094
Mapping to a second physical node
Figure BDA0002390150460000095
Third virtual node
Figure BDA0002390150460000096
Mapping to a third physical node
Figure BDA0002390150460000097
First virtual node
Figure BDA0002390150460000098
Is targeted to a first physical node
Figure BDA0002390150460000099
If the node to be mapped is a functional node shared by the current SFP and other SFPs, the mapping is not required to be repeated; judgment of
Figure BDA00023901504600000910
And
Figure BDA00023901504600000911
whether it is the current path and the sameDetermining a candidate physical node set C based on the judgment result, wherein the virtual function nodes with repeated paths are crossed and whether the mapping is finished, and the specific steps are as follows: if it is not
Figure BDA00023901504600000912
Figure BDA00023901504600000913
If the first physical node set is not deployed, selecting a first physical node set with the computing resource capacity larger than that of the computing resource requested by the first virtual node in the physical network, and sorting the first physical node set in descending order according to the importance degree NI values of the physical nodes and recording the first physical node set as C1As a first virtual node
Figure BDA00023901504600000914
Is determined.
If it is not
Figure BDA00023901504600000915
Has been mapped to
Figure BDA00023901504600000916
Then the second set of physical nodes C2Included
Figure BDA00023901504600000917
Physical nodes within a peripheral d-hop range; if it is not
Figure BDA00023901504600000918
Has been mapped to
Figure BDA00023901504600000919
Third set of physical nodes C3Included
Figure BDA00023901504600000920
Around physical nodes within d hops. If it is not
Figure BDA00023901504600000921
Has been mapped to
Figure BDA00023901504600000922
And the number of the first and second electrodes,
Figure BDA00023901504600000923
has been mapped to
Figure BDA00023901504600000924
Then set C4=C2∪C3As a first virtual node
Figure BDA00023901504600000925
The candidate physical node set of (2). The distance between the physical nodes can be defined by hop count, d is an adjustable parameter and a positive integer, d is 2, 3, etc.
In one embodiment, the actual latency of the physical link corresponding to the formed virtual link may be calculated in a variety of ways. For example, the candidate physical node set is traversed, and when the first virtual node is mapped to one candidate physical node in the candidate physical node set, the actual time delay of the physical links between the candidate physical node and the second physical node and the third physical node respectively is calculated.
And if the second virtual node is mapped to the second physical node and the third virtual node is mapped to the third physical node, acquiring a first time delay of a physical link between the candidate physical node and the second physical node and a second time delay of a physical link between the candidate physical node and the third physical node, and taking the sum of the first time delay and the second time delay as the actual time delay.
If only the second virtual node is mapped to the second physical node, determining the actual time delay as the first time delay; if only the third virtual node is mapped to the third physical node, the actual latency is determined to be the second latency. And selecting the candidate physical node with the minimum actual time delay as the physical node mapped by the first virtual node.
In one embodiment, each candidate physical node in the candidate physical node set C is traversed, the corresponding physical link time delay is calculated, the physical link with the minimum time delay value is selected, and the virtual link is completedAnd mapping the virtual nodes and the virtual links. For example, traverse candidate set of physical nodes C, assume
Figure BDA0002390150460000101
Mapping to the candidate physical nodes, and respectively calculating the candidate physical nodes to
Figure BDA0002390150460000102
The actual time delay of the physical link between them. If it is not
Figure BDA0002390150460000103
Has been mapped to
Figure BDA0002390150460000104
Figure BDA0002390150460000105
Has been mapped to
Figure BDA0002390150460000106
Let the candidate physical node be
Figure BDA0002390150460000107
Computing the sum of delays of physical links
Figure BDA0002390150460000108
If only have
Figure BDA0002390150460000109
Has been mapped to
Figure BDA00023901504600001010
Calculating physical link delays
Figure BDA00023901504600001011
If only have
Figure BDA00023901504600001012
Has been mapped to
Figure BDA00023901504600001013
Calculating physical link delays
Figure BDA00023901504600001014
And selecting the candidate physical node with the minimum actual time delay value as a mapping target. And finishing the mapping processing on all the SFPs with limited transmission delay, namely finishing the mapping of the network slice request.
Fig. 6 is a flow diagram of another embodiment of a network slice configuration method according to the present disclosure, as shown in fig. 6:
step 601, analyzing the virtual network request, marking the SFP with the end-to-end transmission delay requirement, and adding the SFP into the set L.
Step 602, determining the mapping sequence of the paths in the L, sorting the paths in descending order according to the length, and sorting the paths in ascending order according to the delay requirement if the paths are the same in length.
Step 603, sequentially mapping the SFPs according to the mapping sequence, and sequentially finding a candidate physical node set C for each virtual node according to the data transmission direction. The mapping order of each SFP is according to the direction of data transmission.
Step 6031, judge
Figure BDA00023901504600001015
If it is mapped, step 6033 is entered, and if not, step 6032 is entered.
Step 6033, judge
Figure BDA0002390150460000111
If it is mapped, step 6036 is entered, and if not, step 6034 is entered.
Step 6034, construct physical candidate set C2Wherein, C2Included
Figure BDA0002390150460000112
Physical nodes within the range of the surrounding d-hops.
Step 6032, judge
Figure BDA0002390150460000113
If it is mapped, step 6035 is entered, and if not, step 6037 is entered.
Step 6035, construct physical candidate set C3Wherein, the set C3Included
Figure BDA0002390150460000114
Physical nodes within the range of the surrounding d-hops.
Step 6036, construct candidate physical set C4=C2∪C3
And 6037, selecting a physical node set with the computing resource capacity meeting the requirement in the physical network, and arranging the physical node set in a descending order according to the importance degree NI value of the physical nodes.
Step 604, traversing each candidate physical node in C, calculating the physical link delay related to the current mapping, and selecting the physical node with the minimum delay value as the physical node of the mapping target.
Step 605, completing the mapping of all SFPs, i.e. the network slice requests the mapping to be finished.
The network slice configuration method in the above embodiment considers a complex SFC structure type for a service type having a data transmission end-to-end delay requirement; in the prior art, a network slice mapping scheme for a delay constraint service only considers the shortest path of a one-hop node, while the shortest path of a multi-hop is comprehensively considered in the present disclosure, which is a network slice deployment and configuration scheme for an end-to-end data transmission delay constraint service.
In the network slice configuration method in the above embodiment, a network slice is deployed in a mobile core network in combination with virtual node location information; when the virtual nodes on the path are mapped in sequence according to the data transmission direction, the mapping conditions of the front virtual node and the rear virtual node are analyzed, and meanwhile, a mapping target is selected by combining the topological information of the physical nodes; compared with the resource allocation algorithm in the prior art, the method and the device consider the position information of the virtual node, and simultaneously enable the node and the link to be cooperatively mapped, so that efficient virtual network mapping is realized.
In one embodiment, the present disclosure provides a network slice configuration apparatus, including: a path acquisition module 71, a mapping order determination module 72, a candidate node acquisition module 73, a delay determination module 74, and a node mapping processing module 75. The path obtaining module 71 obtains a service function path SFP having a transmission delay requirement corresponding to a virtual network request for establishing a network slice and establishes an SFP path set. The mapping order determining module 72 determines the mapping order of the SFPs in the SFP path set according to the path length information and the delay indicator information. The candidate node obtaining module 73 sequentially establishes a candidate physical node set for the virtual nodes in each SFP according to the data transmission direction based on the mapping order.
The delay determination module 74 calculates the actual delay of the physical link corresponding to the formed virtual link after each candidate physical node in the set of candidate physical nodes is mapped by the virtual node. The node mapping processing module 75 selects candidate physical nodes from the candidate physical node set based on the actual time delay to perform SFP virtual node mapping and related virtual link mapping, so as to map the SFP.
In one embodiment, the mapping order determination module 72 sorts the SFPs in the SFP path set in descending order based on path length; wherein, if there are multiple SPFs with the same path length, the mapping order determining module 72 performs ascending sorting on the multiple SPFs based on the delay index.
As shown in fig. 8, the candidate node acquisition module 73 includes: a virtual node determining unit 731 and a physical node determining unit 732. The virtual node determination unit 732 acquires a first virtual node to be mapped currently by the SFP. The virtual node determining unit 732 obtains a previous virtual node and a subsequent virtual node of the first virtual node in the SFP, which are the second virtual node and the third virtual node, respectively. The physical node determination unit 732 determines whether the second virtual node and the third virtual node have completed mapping, and establishes a candidate physical node set of the first virtual node based on the determination result.
If the second virtual node and the third virtual node do not complete mapping, the physical node determination unit 732 selects a first physical node set in the physical network, where the computing resource capacity of the first physical node set is greater than the computing resource demand of the first virtual node, and uses the first physical node set as a candidate physical node set.
If the second virtual node has been mapped to the second physical node, the physical node determining unit 732 acquires the second physical node set; wherein the second set of physical nodes comprises: and other physical nodes with the distance to the second physical node smaller than the preset distance threshold value. If the third virtual node has been mapped to the third physical node, the physical node determining unit 732 acquires a third physical node set; wherein the third set of physical nodes comprises: and other physical nodes with the distance to the third physical node being less than the preset distance threshold. The physical node determination unit 732 determines the union of the second physical node set and the third physical node set as a candidate physical node set.
In one embodiment, the latency determination module 74 traverses the set of candidate physical nodes, and when the first virtual node is mapped to one of the candidate physical nodes in the set of candidate physical nodes, calculates the actual latency of the physical links between the candidate physical node and the second physical node and the third physical node, respectively. The node mapping processing module 75 selects the candidate physical node with the smallest actual time delay as the physical node mapped by the first virtual node.
If the second virtual node has been mapped to the second physical node and the third virtual node has been mapped to the third physical node, the delay determination module 74 obtains a first delay of the physical link between the candidate physical node and the second physical node and a second delay of the physical link between the candidate physical node and the third physical node, and takes the sum of the first delay and the second delay as the actual delay.
If only the second virtual node is mapped to the second physical node, the delay determining module 74 determines the actual delay as the first delay; if only the third virtual node maps to the third physical node, the delay determination module 74 determines the actual delay as the second delay.
Fig. 9 is a block schematic diagram of another embodiment of a network slice configuration apparatus according to the present disclosure. As shown in fig. 9, the apparatus may include a memory 91, a processor 92, a communication interface 93, and a bus 94. The memory 91 is used for storing instructions, the processor 92 is coupled to the memory 91, and the processor 92 is configured to execute the network slice configuration method implemented above based on the instructions stored in the memory 91.
The memory 91 may be a high-speed RAM memory, a non-volatile memory (non-volatile memory), or the like, and the memory 91 may be a memory array. The storage 91 may also be partitioned and the blocks may be combined into virtual volumes according to certain rules. The processor 92 may be a central processing unit CPU, or an application Specific Integrated circuit asic, or one or more Integrated circuits configured to implement the network slice configuration method of the present disclosure.
In one embodiment, the present disclosure provides a computer readable storage medium storing computer instructions that, when executed by a processor, implement a method as in any of the above embodiments.
The network slice configuration method, the device and the storage medium in the embodiments provide a network slice deployment and configuration scheme for an end-to-end data transmission delay constraint service by considering a complex SFC structure type and comprehensively considering a multi-hop shortest path for a service type with a data transmission end-to-end delay requirement; network slices are deployed on a mobile core network in combination with virtual node position information, when virtual nodes on a path are mapped in sequence according to a data transmission direction, the mapping conditions of front and rear virtual nodes are analyzed, meanwhile, a mapping target is selected in combination with topology information of physical nodes, the virtual node position information is considered, and meanwhile, the nodes and links are mapped in a coordinated mode, so that efficient virtual network mapping is achieved, the utilization efficiency of physical resources is improved, the income of operators is improved, and the use experience of users can be improved.
The method and system of the present disclosure may be implemented in a number of ways. For example, the methods and systems of the present disclosure may be implemented by software, hardware, firmware, or any combination of software, hardware, and firmware. The above-described order for the steps of the method is for illustration only, and the steps of the method of the present disclosure are not limited to the order specifically described above unless specifically stated otherwise. Further, in some embodiments, the present disclosure may also be implemented as programs recorded in a recording medium, the programs including machine-readable instructions for implementing a method according to the present disclosure. Thus, the present disclosure also covers a recording medium storing a program for executing the method according to the present disclosure.
The description of the present disclosure has been presented for purposes of illustration and description, and is not intended to be exhaustive or limited to the disclosure in the form disclosed. Many modifications and variations will be apparent to practitioners skilled in this art. The embodiment was chosen and described in order to best explain the principles of the disclosure and the practical application, and to enable others of ordinary skill in the art to understand the disclosure for various embodiments with various modifications as are suited to the particular use contemplated.

Claims (16)

1. A network slice configuration method, comprising:
acquiring a Service Function Path (SFP) corresponding to a virtual network request for establishing a network slice and having a transmission delay requirement, and establishing an SFP path set;
determining the mapping sequence of the SFPs in the SFP path set according to the path length information and the time delay index information;
based on the mapping sequence, sequentially establishing a candidate physical node set for the virtual nodes in each SFP according to the data transmission direction;
after each candidate physical node in the candidate physical node set is mapped by a virtual node, calculating the actual time delay of a physical link corresponding to the formed virtual link;
and selecting candidate physical nodes from the candidate physical node set based on the actual time delay to perform virtual node mapping and related virtual link mapping of the SFP so as to map the SFP.
2. The method of claim 1, wherein the determining the mapping order of the SFPs in the SFP path set according to the path length information and the delay indicator information comprises:
sorting the SFPs in the SFP path set in descending order based on path length;
wherein if there are multiple SPFs with the same path length, the multiple SPFs are sorted in ascending order based on the delay index.
3. The method of claim 1, wherein the sequentially establishing a candidate set of physical nodes for the virtual nodes in each SFP according to the direction of data transmission comprises:
acquiring a first virtual node to be mapped currently by the SFP;
acquiring a previous virtual node and a next virtual node of the first virtual node in the SFP, wherein the previous virtual node and the next virtual node are respectively a second virtual node and a third virtual node;
and judging whether the second virtual node and the third virtual node are mapped or not, and establishing a candidate physical node set of the first virtual node based on a judgment result.
4. The method of claim 3, the establishing the set of candidate physical nodes for the first virtual node based on the determination comprising:
if the second virtual node and the third virtual node are not mapped completely, a first physical node set with the computing resource capacity larger than the computing resource requirement of the first virtual node is selected from a physical network, and the first physical node set is used as the candidate physical node set.
5. The method of claim 4, the establishing the set of candidate physical nodes for the first virtual node based on the determination comprising:
if the second virtual node is mapped to a second physical node, acquiring a second physical node set; wherein the second set of physical nodes comprises: other physical nodes with the distance to the second physical node smaller than a preset distance threshold;
if the third virtual node is mapped to a third physical node, acquiring a third physical node set; wherein the third set of physical nodes comprises: other physical nodes with the distance to the third physical node smaller than a preset distance threshold;
and taking the union of the second physical node set and the third physical node set as the candidate physical node set.
6. The method of claim 5, wherein calculating the actual latency of the physical link corresponding to the formed virtual link after each candidate physical node in the set of candidate physical nodes is mapped by a virtual node comprises:
traversing the candidate physical node set, and when the first virtual node is mapped to one candidate physical node in the candidate physical node set, calculating the actual time delay of the physical links between the candidate physical node and the second physical node and between the candidate physical node and the third physical node respectively;
the selecting a candidate physical node from the candidate physical node set for the virtual node mapping of the SFP based on the actual time delay comprises:
and selecting the candidate physical node with the minimum actual time delay as the physical node mapped by the first virtual node.
7. The method of claim 6, wherein calculating the actual latency of the physical link between the candidate physical node and the second and third physical nodes comprises:
if the second virtual node is mapped to a second physical node and the third virtual node is mapped to a third physical node, acquiring a first time delay of a physical link between the candidate physical node and the second physical node and a second time delay of a physical link between the candidate physical node and the third physical node, and taking the sum of the first time delay and the second time delay as the actual time delay;
determining the actual time delay as the first time delay if only the second virtual node is mapped to a second physical node;
determining the actual latency as the second latency if only the third virtual node maps to a third physical node.
8. A network slice configuration apparatus, comprising:
a path acquisition module, configured to acquire a service function path SFP with a transmission delay requirement corresponding to a virtual network request for establishing a network slice, and establish an SFP path set;
a mapping sequence determining module, configured to determine, according to path length information and delay indicator information, a mapping sequence of the SFPs in the SFP path set;
a candidate node acquisition module, configured to sequentially establish a candidate physical node set for each virtual node in the SFP according to a data transmission direction based on the mapping order;
a delay determining module, configured to calculate an actual delay of a physical link corresponding to a formed virtual link after each candidate physical node in the candidate physical node set is mapped by a virtual node;
and the node mapping processing module is used for selecting a candidate physical node from the candidate physical node set based on the actual time delay to perform virtual node mapping and related virtual link mapping of the SFP so as to map the SFP.
9. The apparatus of claim 8, wherein,
the mapping order determining module is used for sorting the SFPs in the SFP path set in a descending order based on the path length; wherein if there are multiple SPFs with the same path length, the multiple SPFs are sorted in ascending order based on the delay index.
10. The apparatus of claim 8, wherein,
the candidate node obtaining module includes:
a virtual node determining unit, configured to obtain a first virtual node to be mapped currently by the SFP; acquiring a previous virtual node and a next virtual node of the first virtual node in the SFP, wherein the previous virtual node and the next virtual node are respectively a second virtual node and a third virtual node;
and the physical node determining unit is used for judging whether the second virtual node and the third virtual node are mapped or not and establishing a candidate physical node set of the first virtual node based on a judgment result.
11. The apparatus of claim 10, wherein,
the physical node determining unit is configured to select a first physical node set in a physical network, where the computing resource capacity of the first physical node set is greater than the computing resource demand of the first virtual node, and use the first physical node set as the candidate physical node set, if the second virtual node and the third virtual node do not complete mapping.
12. The apparatus of claim 11, wherein,
the physical node determining unit is further configured to obtain a second physical node set if the second virtual node is mapped to a second physical node; wherein the second set of physical nodes comprises: other physical nodes with the distance to the second physical node smaller than a preset distance threshold; if the third virtual node is mapped to a third physical node, acquiring a third physical node set; wherein the third set of physical nodes comprises: other physical nodes with the distance to the third physical node smaller than a preset distance threshold; and taking the union of the second physical node set and the third physical node set as the candidate physical node set.
13. The apparatus of claim 12, wherein,
the time delay determining module is further configured to traverse the candidate physical node set, and when the first virtual node is mapped to one candidate physical node in the candidate physical node set, calculate actual time delays of physical links between the candidate physical node and the second physical node and between the candidate physical node and the third physical node, respectively;
and the node mapping processing module is configured to select the candidate physical node with the smallest actual time delay as the physical node mapped by the first virtual node.
14. The apparatus of claim 13, wherein,
the delay determining module is specifically configured to, if the second virtual node has been mapped to a second physical node and the third virtual node has been mapped to a third physical node, obtain a first delay of a physical link between the candidate physical node and the second physical node and a second delay of a physical link between the candidate physical node and the third physical node, and use a sum of the first delay and the second delay as the actual delay; determining the actual time delay as the first time delay if only the second virtual node is mapped to a second physical node; determining the actual latency as the second latency if only the third virtual node maps to a third physical node.
15. A network slice configuration apparatus, comprising:
a memory; and a processor coupled to the memory, the processor configured to perform the method of any of claims 1-7 based on instructions stored in the memory.
16. A computer-readable storage medium having stored thereon computer instructions for execution by a processor of the method of any one of claims 1 to 7.
CN202010111423.6A 2020-02-24 2020-02-24 Network slice configuration method, device and storage medium Active CN113300861B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010111423.6A CN113300861B (en) 2020-02-24 2020-02-24 Network slice configuration method, device and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010111423.6A CN113300861B (en) 2020-02-24 2020-02-24 Network slice configuration method, device and storage medium

Publications (2)

Publication Number Publication Date
CN113300861A true CN113300861A (en) 2021-08-24
CN113300861B CN113300861B (en) 2022-05-03

Family

ID=77317809

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010111423.6A Active CN113300861B (en) 2020-02-24 2020-02-24 Network slice configuration method, device and storage medium

Country Status (1)

Country Link
CN (1) CN113300861B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114090244A (en) * 2021-11-16 2022-02-25 中国联合网络通信集团有限公司 Service arranging method, device, system and storage medium
CN114268548A (en) * 2021-12-24 2022-04-01 国网河南省电力公司信息通信公司 Network slice resource arranging and mapping method based on 5G
CN115190021A (en) * 2022-04-24 2022-10-14 北京中电飞华通信有限公司 Slice deployment method for deterministic delay service and related equipment

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160212017A1 (en) * 2015-01-20 2016-07-21 Huawei Technologies Co., Ltd. Systems and Methods for SDT to Interwork with NFV and SDN
CN106130894A (en) * 2016-06-03 2016-11-16 上海华为技术有限公司 The creation method of a kind of business function chain and system
WO2017117951A1 (en) * 2016-01-08 2017-07-13 中兴通讯股份有限公司 Virtual mapping method and device
CN107819742A (en) * 2017-10-19 2018-03-20 北京交通大学 A kind of system architecture and its method of Dynamical Deployment Network Security Service
US20190014496A1 (en) * 2016-01-29 2019-01-10 Lg Electronics Inc. Method by which network nodes calculate optimum path for virtualized service functions
US20190166039A1 (en) * 2017-11-27 2019-05-30 Beijing University Of Posts & Telecommunications Method and apparatus for network slice deployment in mobile communication system
CN110505101A (en) * 2019-09-05 2019-11-26 无锡北邮感知技术产业研究院有限公司 A kind of network slice method of combination and device
CN110768837A (en) * 2019-10-28 2020-02-07 北京邮电大学 Network slice virtual resource allocation method, system and device

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160212017A1 (en) * 2015-01-20 2016-07-21 Huawei Technologies Co., Ltd. Systems and Methods for SDT to Interwork with NFV and SDN
WO2017117951A1 (en) * 2016-01-08 2017-07-13 中兴通讯股份有限公司 Virtual mapping method and device
US20190014496A1 (en) * 2016-01-29 2019-01-10 Lg Electronics Inc. Method by which network nodes calculate optimum path for virtualized service functions
CN106130894A (en) * 2016-06-03 2016-11-16 上海华为技术有限公司 The creation method of a kind of business function chain and system
CN107819742A (en) * 2017-10-19 2018-03-20 北京交通大学 A kind of system architecture and its method of Dynamical Deployment Network Security Service
US20190166039A1 (en) * 2017-11-27 2019-05-30 Beijing University Of Posts & Telecommunications Method and apparatus for network slice deployment in mobile communication system
CN110505101A (en) * 2019-09-05 2019-11-26 无锡北邮感知技术产业研究院有限公司 A kind of network slice method of combination and device
CN110768837A (en) * 2019-10-28 2020-02-07 北京邮电大学 Network slice virtual resource allocation method, system and device

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
孙士清等: "基于在线实例配置的服务功能链部署方法", 《计算机工程》 *
张蕾等: "基于5G确定化网络的行业应用研究", 《电子技术应用》 *
李红祎等: "基于能力开放的5G网络切片管理研究", 《电子技术应用》 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114090244A (en) * 2021-11-16 2022-02-25 中国联合网络通信集团有限公司 Service arranging method, device, system and storage medium
CN114090244B (en) * 2021-11-16 2024-03-19 中国联合网络通信集团有限公司 Service arrangement method, device, system and storage medium
CN114268548A (en) * 2021-12-24 2022-04-01 国网河南省电力公司信息通信公司 Network slice resource arranging and mapping method based on 5G
CN115190021A (en) * 2022-04-24 2022-10-14 北京中电飞华通信有限公司 Slice deployment method for deterministic delay service and related equipment
CN115190021B (en) * 2022-04-24 2024-04-12 北京中电飞华通信有限公司 Deterministic time delay service oriented slice deployment method and related equipment

Also Published As

Publication number Publication date
CN113300861B (en) 2022-05-03

Similar Documents

Publication Publication Date Title
CN113300861B (en) Network slice configuration method, device and storage medium
CN109150627B (en) Virtual network mapping construction method based on dynamic resource demand and topology perception
CN107566194B (en) Method for realizing cross-domain virtual network mapping
CN112738820B (en) Dynamic deployment method and device of service function chain and computer equipment
CN110505101B (en) Network slice arranging method and device
CN106961343B (en) Virtual mapping method and device
CN108156041B (en) Differentiated virtual optical network mapping method based on security perception
CN108768736B (en) Optimization method of hybrid service function chain embedding cost
CN107979545B (en) Virtual network mapping method based on node attributes
CN109218858B (en) Spectrum allocation method, device and storage medium for space division multiplexing optical network
CN103001892B (en) Based on network resource allocation method and the system of cloud computing
CN109361547B (en) Network slice link deployment method and device
CN112217725B (en) Delay optimization method based on edge calculation
CN111901170A (en) Reliability-aware service function chain backup protection method
CN111182037A (en) Mapping method and device of virtual network
CN114071582A (en) Service chain deployment method and device for cloud-edge collaborative Internet of things
CN105530199A (en) Resource mapping method and device based on SDN (Software Defined Network) multi-domain optical network virtualization technology
CN111629390A (en) Network slice arranging method and device
CN104917677A (en) Data stream forwarding control method and system
CN105917621B (en) Method and system for data routing
CN113965616B (en) SFC mapping method based on VNF resource change matrix
Yu et al. Robust resource provisioning in time-varying edge networks
CN110213149B (en) Virtual network mapping method based on node entropy
CN110062404B (en) Virtual link mapping method with single link failure recovery in core network
JP6894408B2 (en) Linked virtual network allocation method and equipment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant