CN112968794B - Network function chain deployment method, device, terminal device and storage medium - Google Patents
Network function chain deployment method, device, terminal device and storage medium Download PDFInfo
- Publication number
- CN112968794B CN112968794B CN202110116356.1A CN202110116356A CN112968794B CN 112968794 B CN112968794 B CN 112968794B CN 202110116356 A CN202110116356 A CN 202110116356A CN 112968794 B CN112968794 B CN 112968794B
- Authority
- CN
- China
- Prior art keywords
- node
- network function
- virtual network
- nodes
- reliability
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0893—Assignment of logical groups to network elements
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
- G06F9/45533—Hypervisors; Virtual machine monitors
- G06F9/45558—Hypervisor-specific management and integration aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
- G06F9/45533—Hypervisors; Virtual machine monitors
- G06F9/45558—Hypervisor-specific management and integration aspects
- G06F2009/45595—Network integration; Enabling network access in virtual machine instances
Abstract
The embodiment of the invention discloses a network function chain deployment method, which comprises the steps of receiving a deployment request of a network function chain, obtaining topology information of a plurality of nodes for deploying the virtual network function, establishing an objective function with the shortest end-to-end time delay, wherein the objective function meets the reliability constraint of the nodes, the resource capacity constraint of the nodes and the reliability constraint of links when the virtual network function is deployed, and when the network function chain is deployed, the nodes meeting the objective function are searched for deployment according to the deployment information carried by the virtual network function and the topology information of the plurality of nodes, so that the reliability of transmission can be effectively guaranteed while the low-time delay network service request is met. The embodiment of the invention also correspondingly provides a network function chain deployment device, terminal equipment and a storage medium.
Description
Technical Field
The present invention relates to the field of network technologies, and in particular, to a network function chain deployment method, apparatus, terminal device, and storage medium.
Background
With the development of Network Function Virtualization (NFV) and software defined networking technologies, networks become more open and flexible. The NFV can virtualize a conventional dedicated hardware device into a Virtual Network Function (VNF), and operate the conventional dedicated hardware device on a general-purpose device, so as to implement Network efficiency, flexibility and extensibility, and effectively reduce the dependency of an operator on a dedicated device.
The network service request is usually composed of a certain sequence of virtual network functions, and also becomes a service function chain request. Different requirements for each service request cause different combinations of virtual network functions on each service function chain, and how to deploy the virtual network functions so as to meet the delay requirement of the network service becomes a key point of research.
At present, related technologies research end-to-end delay of network services, but mostly only storage and load balancing of nodes are taken as important consideration factors, reliability of the nodes and reliability of links are not considered, and thus, transmission reliability cannot be effectively guaranteed while a low-delay network service request is met.
Disclosure of Invention
The embodiment of the invention provides a network function chain deployment method, a network function chain deployment device, terminal equipment and a storage medium, which can solve the problem that in the prior art, virtual network function deployment is difficult to ensure the reliability of virtual network function deployment while time delay is optimized.
The first aspect of the embodiments of the present invention provides a network function chain deployment method, including the following steps:
receiving a deployment request of a network function chain, wherein the network function chain comprises at least one virtual network function, and each virtual network function carries deployment information;
acquiring topology information of a plurality of nodes for deploying the virtual network function;
an objective function with the shortest end-to-end delay is established, the objective function meets the reliability constraint of the node, the resource capacity constraint of the node and the reliability constraint of the link when the virtual network function is deployed;
and when the network function chain is deployed, searching the nodes meeting the objective function for deployment according to deployment information carried by the virtual network function and the topology information of the nodes.
Preferably, the objective function satisfies reliability constraints on the node, resource capacity constraints of the node, and reliability constraints on the link when performing virtual network function deployment, and specifically includes:
the reliability constraint on the nodes when the virtual network function deployment is carried out is represented as: for each of the nodes, each virtual network function deployed on the node requires a node minimum reliability that does not exceed the reliability of the node;
when the virtual network function is deployed, the constraint on the resource capacity of the node includes the constraints on the computing resource of the node, the storage resource of the node and the broadband resource of the node, which is specifically represented as:
for each of the nodes, the sum of the computing resources of all virtual network functions deployed on the node does not exceed the maximum computing resource of the node;
for each of the nodes, the sum of the storage resources of all virtual network functions deployed on the node does not exceed the maximum storage resource of the node;
for each of the nodes, the sum of the broadband resources of all virtual network functions deployed on the node does not exceed the maximum broadband resource of the node;
the reliability constraint on the link when the virtual network function is deployed is represented as: for each of the nodes, a minimum link reliability requirement of a virtual network function deployed on the node does not exceed a link reliability communicated by the node to a next node.
Preferably, the reliability of the node includes consideration of the centrality of the node, the validity of the node, and the availability of the node, wherein the centrality of the node includes consideration of the centrality of the neighbor topology of the node and the centrality of the node self betweenness.
Preferably, the centrality of the node includes the centrality of a neighbor topology structure of the node and the centrality of the node betweenness, and specifically includes:
(1) The centrality of the neighbor topology of the node is considered, which is specifically represented as follows:
when a node directly transfers information to the next node, the transfer of the node invests energy as follows:
Q(i)＝∑ q∈Γ(i) k(q)
wherein j is a neighbor node of node i, C ij Indicating the amount of effort, p, that node i transfers to neighbor node j ij Represents the effort, Σ, of node i directly assigned to neighbor node j q∈Γ(i) Q (Q) represents all neighbor nodes of node iQ (j) represents the adjacency of the neighbor node j; q (i) represents the adjacency of the node i, Γ (i) represents the set of all neighbor nodes of the node i, and k (Q) represents the degree of the neighbor node Q;
when the node transmits information to the next node through the common neighbor node, the transmission of the node invests energy as follows:
C ij ＝∑ j∈Γ(i) (p ij +∑ q p iq p qj )
wherein j is a neighbor node of the node i, q is a common neighbor node of the node i and the node j, C ij Indicating the effort, p, of node i to transmit to neighbor node j iq Representing the effort, p, of a node i directly delivering to a co-neighboring node q qj The energy of the common neighbor node q directly transmitted to the neighbor node j is represented;
(2) The node centrality considering node betweenness is represented as follows:
wherein, B i Denotes the betweenness of node i, n ik Indicates the number of shortest paths between node j and node k, n jk(i) Representing the number of the nodes i passing through in the shortest path between the node j and the node k, wherein N is all the nodes in the network;
(3) The centrality of the node is obtained by comprehensively considering the centrality of the neighbor topological structure of the node and the node centrality of the betweenness of the node:
S i ＝αC ij +βB i
wherein S is i The centrality of the node i is shown, alpha and beta are set according to the actual condition of the network, and the sum of the alpha and the beta is 1.
Preferably, the validity of the node is calculated by the following formula:
where E (i) represents the validity of node i, D (i, N) represents the number of hops passed by node i to the next node N, and N represents all nodes in the network.
Preferably, the availability of the node is calculated by the following formula:
O(i)＝H(i)·A(i)
H(i)＝1-U(i)
wherein, O (i) represents the availability of the node i, H (i) represents the resource availability of the node i, U (i) represents the occupation condition of the node i, the sum of w1, w2 and w3 is 1, which is determined according to the configuration condition of the node i, C i 、M i 、B i Respectively representing the maximum computing resource of the node i, the maximum storage resource of the node i and the maximum bandwidth resource of the node i, j representing a virtual network function, v representing a set of virtual network functions, c j 、m j 、b j Respectively representing the computing resource occupied by the virtual network function j of the node i, the storage resource occupied by the virtual network function j of the node i and the bandwidth resource occupied by the virtual network function j of the node i, A (i) representing the normal working probability of the node i, MTT representing the fault interval time, and MTTR representing the downtime.
Preferably, the reliability of the link is calculated by the following formula:
where K (i) represents the reliability of the link passed by node i to the next node,
represents node i delivery toEfficiency of failure of the link of the next node, λ in The parameters set for the system are set for the system,
the transmission delay passed to the next node for node i.
A second aspect of an embodiment of the present invention provides a network function chain deployment apparatus, including:
a deployment request receiving module, configured to receive a deployment request of a network function chain, where the network function chain includes at least one virtual network function, and each virtual network function carries deployment information;
a node topology acquisition module, configured to acquire topology information of a plurality of nodes for deploying the virtual network function;
the target function establishing module is used for establishing a target function with the shortest end-to-end time delay, and the target function meets the reliability constraint of the node, the resource capacity constraint of the node and the reliability constraint of the link when the virtual network function is deployed;
and the deployment module is used for searching the nodes meeting the objective function for deployment according to the deployment information carried by the virtual network function and the topology information of the nodes when the network function chain is deployed.
A third aspect of the embodiments of the present invention provides a terminal device, which includes a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, where the processor executes the computer program to implement the network functional chain deployment method as described above.
A fourth aspect of the embodiments of the present invention provides a storage medium, where the storage medium includes a stored computer program, and when the computer program runs, a device in which the storage medium is located is controlled to execute the above-mentioned network function chain deployment method.
Compared with the prior art, the network function chain deployment method provided by the embodiment of the invention comprises the steps of receiving a deployment request of a network function chain, wherein the network function chain comprises at least one virtual network function, each virtual network function carries deployment information, acquiring topology information of a plurality of nodes for deploying the virtual network function, and establishing an objective function with the shortest end-to-end time delay, wherein the objective function meets the reliability constraint of the nodes, the resource capacity constraint of the nodes and the reliability constraint of the links when the virtual network function is deployed, and when the network function chain is deployed, the nodes meeting the objective function are searched for deployment according to the deployment information carried by the virtual network function and the topology information of the nodes, so that the low-time-delay network service request can be met, and the transmission reliability can be effectively guaranteed. In addition, the reliability of the nodes is measured according to the occupation condition of resources when the network function is deployed, so that the method and the system reflect strong dynamic property in the actual deployment process. The embodiment of the invention also correspondingly provides a network function chain deployment device, terminal equipment and a storage medium.
Drawings
Fig. 1 is a flowchart of a network function chain deployment method according to an embodiment of the present invention;
fig. 2 is a block diagram of a network function chain deployment apparatus according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be obtained by a person skilled in the art without inventive step based on the embodiments of the present invention, are within the scope of protection of the present invention.
Fig. 1 is a flowchart of a network function chain deployment method according to an embodiment of the present invention.
The network function chain deployment method provided by the embodiment of the invention comprises the following steps S1 to S4:
step S1, receiving a deployment request of a network function chain, wherein the network function chain comprises at least one virtual network function, and each virtual network function carries deployment information.
It should be noted that when a service request is received, a network function chain corresponding to the service request is found, and according to different requirements, the corresponding network function chains are different, that is, the network function chains composed of virtual network functions are different. The deployment information corresponding to each virtual network function is received while receiving the deployment request, and the deployment information includes the resource requirement required by each virtual network function, (i.e. the size of the node resource that the virtual network function is required to map on the bottom node, where the resource may include a computing resource, a broadband resource, and a storage resource), the minimum reliability requirement of the node required by each virtual network function to map on the bottom node, and the minimum link reliability requirement of the virtual link requirement of each virtual network function to the next virtual network function.
And S2, acquiring topology information of a plurality of nodes for deploying the virtual network function.
In the embodiment of the present invention, the topology information of the plurality of nodes should be understood as topology information of a plurality of physical devices for deploying the virtual network function, where the topology information should include a maximum resource capacity that each physical device can provide for the virtual network function, and a physical link relationship between the plurality of physical devices.
And S3, establishing an objective function with the shortest end-to-end time delay, wherein the objective function meets the reliability constraint of the node, the resource capacity constraint of the node and the reliability constraint of the link when the virtual network function is deployed.
It is understood that each virtual network instance is implemented by a virtual network mapping, multiple virtual network functions can be mapped to one node, and multiple virtual links can share one physical link of the underlying network. When a virtual network request occurs, the request is mapped to an underlying network for service according to functional requirements. In the mapping process, the lowest end-to-end delay is taken as an optimization target, meanwhile, the reliability requirement is considered, and the node which enables the virtual network function to be deployed to the bottom network and has the lowest end-to-end delay and can meet the reliability requirement of the function requirement is searched for mapping.
In order to meet the requirement of reliability of service requests, the embodiment of the invention executes the allocation process of the mapping requests of the virtual network functions from the two parts of node allocation and link allocation, and provides the constraint condition of mapping the virtual network functions to the underlying network based on the node allocation and the link allocation. Specifically, the objective function satisfies reliability constraints on nodes, resource capacity constraints on nodes, and reliability constraints on links when performing virtual network function deployment, and includes:
the reliability constraint on the nodes when the virtual network function deployment is carried out is represented as: for each of the nodes, each virtual network function deployed on the node requires a node minimum reliability that does not exceed the reliability of the node;
when the virtual network function is deployed, the constraint on the resource capacity of the node includes the constraints on the computing resource of the node, the storage resource of the node and the broadband resource of the node, which is specifically represented as:
for each of the nodes, the sum of the computing resources of all virtual network functions deployed on the node does not exceed the maximum computing resource of the node;
for each of the nodes, the sum of the storage resources of all virtual network functions deployed on the node does not exceed the maximum storage resource of the node;
for each of the nodes, the sum of the broadband resources of all virtual network functions deployed on the node does not exceed the maximum broadband resource of the node;
the reliability constraint on the link when the virtual network function is deployed is represented as: for each of the nodes, a minimum link reliability requirement of a virtual network function deployed on the node does not exceed a link reliability communicated by the node to a next node.
It should be noted that the minimum link reliability requirement of the virtual network function is to be understood as the minimum link reliability required for mapping the virtual link of the virtual network function to the next virtual network function onto the underlying link.
It can be understood that the above process is actually a virtual network dynamic deployment model proposed for the target and the requirement, and according to the above objective function and the constraint condition, the virtual network dynamic deployment model is established as follows:
s.t.
wherein l uv Being a virtual link, L v Being a set of virtual links, d uv For a virtual link l uv Mapping a delay to a bottom link; f (i) represents the reliability of node i,
representing virtual network functions v i Required node reliability, K (i) representing link reliability;
representing virtual network functions v i Is the lowest link ofReliability requirement, C i 、M i 、B i Respectively representing the maximum computing resource of the node i, the maximum storage resource of the node i and the maximum bandwidth resource of the node i, j representing a virtual network function, v representing a set of virtual network functions, c j 、m j 、b j Respectively representing the computing resources of the node i occupied by the virtual network function j, the storage resources of the node i occupied by the virtual network function j and the bandwidth resources of the node i occupied by the virtual network function j,
and
respectively representing virtual network functions v i Required computing resources, virtual network functions v i Required storage resources and virtual network functions v i The required broadband resources.
In an optional embodiment, the reliability of the node includes a centrality of the node, an availability of the node, and an availability of the node, where the centrality of the node includes a centrality considering a neighbor topology of the node and a centrality considering betweenness of the node.
In the embodiment of the present invention, the centrality of the node includes the centrality of a neighbor topology structure of the node and the centrality of the node betweenness, which specifically includes:
(1) The centrality of the neighbor topology of the node is considered, which is specifically represented as follows:
when a node directly transfers information to the next node, the transfer of the node invests energy as follows:
Q(i)＝∑ q∈Γ(i) k(q)
wherein j is a neighbor node of node i, C ij Indicating the amount of effort, p, that node i transfers to neighbor node j ij Indicating node i direct assignmentGive the neighbor node j energy, Σ q∈Γ(i) Q (Q) represents the sum of the adjacency degrees of all the neighbor nodes of the node i, and Q (j) represents the adjacency degree of the neighbor node j; q (i) represents the adjacency of the node i, Γ (i) represents the set of all neighbor nodes of the node i, and k (Q) represents the degree of the neighbor node Q;
when the node transmits information to the next node through the common neighbor node, the transmission of the node invests energy as follows:
C ij ＝∑ j∈Γ(i) (p ij +∑ q p iq p qj )
wherein j is a neighbor node of the node i, q is a common neighbor node of the node i and the node j, C ij Indicating the amount of effort, p, that node i transfers to neighbor node j iq Representing the effort, p, of a node i directly transferring to a common neighbor node q qj The energy of the common neighbor node q directly transmitted to the neighbor node j is represented;
(2) The node centrality considering node betweenness is represented as follows:
wherein, B i Denotes the betweenness of the node i, n ik Indicates the number of shortest paths between node j and node k, n jk(i) Representing the number of the nodes i passing through in the shortest path between the node j and the node k, wherein N is all the nodes in the network;
(3) The centrality of the node is obtained by comprehensively considering the centrality of the neighbor topological structure of the node and the centrality of the betweenness of the node:
S i ＝αC ij +βB i
wherein S is i The centrality of the node i is shown, alpha and beta are set according to the actual condition of the network, and the sum of the alpha and the beta is 1.
In the embodiment of the invention, the availability of the node represents the data transmission efficiency of the node, and is measured by the hop count between the nodes mapped by the virtual network function, and if the hop count is more, the uncertainty of the data in the transmission process is higher.
Thus, in an alternative embodiment, the validity of the node is determined by the following equation:
where E (i) represents the validity of node i, D (i, N) represents the number of hops passed by node i to the next node N, and N represents all nodes in the network.
In the embodiment of the present invention, the availability of a node mainly considers the probability of normal operation of the node and the current resource availability of the node, and generally, it is considered that the resource availability is inversely proportional to the resource utilization, that is, the more occupied resources of the node, the poorer the availability of the node is. Thus, in an optional implementation, the availability of the node is specifically:
O(i)＝H(i)·A(i)
H(i)＝1-U(i)
wherein, O (i) represents the availability of the node i, H (i) represents the resource availability of the node i, U (i) represents the occupation condition of the node i, the sum of w1, w2 and w3 is 1, which is determined according to the configuration condition of the node i, C i 、M i 、B i Respectively representing the maximum computing resource of the node i, the maximum storage resource of the node i and the maximum bandwidth resource of the node i, j representing a virtual network function, v representing a set of virtual network functions, c j 、m j 、b j Respectively representing the computing resources of the node i occupied by the virtual network function j, the storage resources of the node i occupied by the virtual network function j, and the storage resources of the node i occupied by the virtual network function jBandwidth resources, a (i) represents the probability of normal operation of node i, MTT represents the time between failures, and MTTR represents the down time.
Through the calculation of the centrality of the node, the usefulness of the node and the effectiveness of the node, the reliability of the node is further obtained as F (i) = a 1 S i +a 2 E i +a 3 O (i), where F (i) represents the reliability of node i, a 1 、a 2 And a 3 Are all preset parameters.
In an optional implementation manner, the reliability of the link is specifically:
the reliability of the link is obtained by the following formula:
where K (i) represents the reliability of the link passed by node i to the next node,
efficiency, λ, representing the failure of the link passed by node i to the next node in The parameters set for the system are set for the system,
the transmission delay passed to the next node for node i.
And S4, when the network function chain is deployed, searching nodes meeting the objective function for deployment according to deployment information carried by a virtual network function and topology information of the nodes.
The network function chain deployment method provided by the embodiment of the invention comprises the steps of receiving a deployment request of a network function chain, wherein the network function chain comprises at least one virtual network function, each virtual network function carries deployment information, topology information of a plurality of nodes for deploying the virtual network function is obtained, an objective function with the shortest end-to-end time delay is established, the objective function meets the reliability constraint on the nodes, the resource capacity constraint of the nodes and the reliability constraint of the links when the virtual network function is deployed, and when the network function chain is deployed, the nodes meeting the objective function are searched for deployment according to the deployment information carried by the virtual network function and the topology information of the nodes, so that the reliability of transmission can be effectively ensured while the low-delay network service request is met. In addition, the reliability of the nodes is measured according to the resource occupation condition when the virtual network function is deployed, so that the method and the system have strong dynamic performance in the actual deployment process.
Referring to fig. 2, fig. 2 is a network function chain deployment apparatus provided in an embodiment of the present invention, where the apparatus includes:
a deployment request receiving module 100, configured to receive a deployment request of a network function chain, where the network function chain includes at least one virtual network function, and each virtual network function carries deployment information;
a node topology obtaining module 110, configured to obtain topology information of a plurality of nodes for deploying the virtual network function;
an objective function establishing module 120, configured to establish an objective function with a shortest end-to-end delay, where the objective function meets reliability constraints on nodes, resource capacity constraints on nodes, and reliability constraints on links when performing virtual network function deployment;
the deployment module 130 is configured to, when the network function chain is deployed, find a node that satisfies the objective function for deployment according to deployment information carried by a virtual network function and topology information of the plurality of nodes.
It should be noted that the above-described device embodiments are merely illustrative, where the units described as separate parts may or may not be physically separate, and the parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. In addition, in the drawings of the embodiment of the apparatus provided by the present invention, the connection relationship between the modules indicates that there is a communication connection between them, and may be specifically implemented as one or more communication buses or signal lines. One of ordinary skill in the art can understand and implement it without inventive effort. In addition, the network function chain deployment apparatus provided in the foregoing embodiment and the network function chain deployment method provided in the foregoing embodiment belong to the same concept, and specific implementation processes and specific technical solutions thereof are described in the foregoing method embodiment and are not described herein again.
The terminal device of the embodiment further includes a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, and when the processor executes the computer program, the processor implements steps S1 to S4 of the network function chain deployment method described above. Or, the processor implements the functions of the modules in the foregoing apparatus embodiments when executing the computer program, for example, the deployment request receiving module, the node topology obtaining module, the objective function establishing module, and the deployment module.
Illustratively, the computer program may be partitioned into one or more modules that are stored in the memory and executed by the processor to implement the invention. The one or more modules may be a series of computer program instruction segments capable of performing specific functions, which are used to describe the execution of the computer program in the network function chain deployment apparatus/terminal device.
The network function chain deployment device/terminal device may be a desktop computer, a notebook, a palm top computer, a cloud server, or other computing devices. The network function chain deployment apparatus/terminal device may include, but is not limited to, a processor, a memory. It will be understood by those skilled in the art that the schematic diagrams are merely examples of the network function chain deployment apparatus/terminal device, and do not constitute a limitation of the network function chain deployment apparatus/terminal device, and may include more or less components than those shown, or combine some components, or different components, for example, the network function chain deployment apparatus/terminal device may further include an input-output device, a network access device, a bus, etc.
The Processor may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic, discrete hardware components, etc. The general purpose processor may be a microprocessor or the processor may be any conventional processor or the like, which is the control center for the device/terminal equipment, and which is connected to various parts of the overall network function chain deployment device/terminal equipment using various interfaces and lines.
The memory may be used to store the computer programs and/or modules, and the processor may implement the various functions of the network function chain deployment apparatus/terminal device by executing or executing the computer programs and/or modules stored in the memory, as well as invoking the data stored in the memory. The memory may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required by at least one function (such as a sound playing function, an image playing function, etc.), and the like; the storage data area may store data (such as audio data, a phonebook, etc.) created according to the use of the cellular phone, and the like. In addition, the memory may include high speed random access memory, and may also include non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), at least one magnetic disk storage device, a Flash memory device, or other volatile solid state storage device.
Wherein, the network function chain deployment apparatus/terminal device integrated module/unit, if implemented in the form of software function unit and sold or used as a stand-alone product, can be stored in a computer readable storage medium. Based on such understanding, all or part of the flow of the method according to the embodiments of the present invention may also be implemented by a computer program, which may be stored in a computer-readable storage medium, and when the computer program is executed by a processor, the steps of the method embodiments may be implemented. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. Correspondingly, the embodiment of the present invention further provides a storage medium, where the storage medium includes a stored computer program, and when the computer program runs, the apparatus where the storage medium is located is controlled to execute steps S1 to S4 of the network function chain deployment method.
The storage medium may include: any entity or device capable of carrying the computer program code, recording medium, usb disk, removable hard disk, magnetic disk, optical disk, computer Memory, read-Only Memory (ROM), random Access Memory (RAM), electrical carrier wave signals, telecommunications signals, software distribution medium, and the like.
While the foregoing is directed to the preferred embodiment of the present invention, it will be understood by those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention.
Claims (5)
1. A network function chain deployment method is characterized by comprising the following steps:
receiving a deployment request of a network function chain, wherein the network function chain comprises at least one virtual network function, and each virtual network function carries deployment information;
acquiring topology information of a plurality of nodes for deploying the virtual network function;
establishing an objective function with the shortest end-to-end time delay, wherein the objective function meets the reliability constraint of the node, the resource capacity constraint of the node and the reliability constraint of the link when the virtual network function is deployed;
when the network function chain is deployed, searching nodes meeting the objective function for deployment according to deployment information carried by a virtual network function and topology information of the nodes;
the objective function satisfies reliability constraints on nodes, resource capacity constraints of the nodes, and reliability constraints on links when virtual network function deployment is performed, and specifically includes:
the reliability constraint on the nodes when the virtual network function deployment is carried out is as follows: for each of the nodes, each virtual network function deployed on the node requires a node minimum reliability that does not exceed the reliability of the node;
when the virtual network function is deployed, the constraint on the resource capacity of the node includes the constraints on the computing resource of the node, the storage resource of the node and the broadband resource of the node, which is specifically represented as:
for each of the nodes, the sum of the computing resources of all virtual network functions deployed on the node does not exceed the maximum computing resource of the node;
for each of the nodes, the sum of the storage resources of all virtual network functions deployed on the node does not exceed the maximum storage resource of the node;
for each of the nodes, the sum of the broadband resources of all virtual network functions deployed on the node does not exceed the maximum broadband resource of the node;
the reliability constraint on the link when the virtual network function is deployed is represented as: for each of the nodes, the minimum link reliability requirement of the virtual network function deployed on the node does not exceed the link reliability communicated by the node to the next node;
the reliability of the node comprises the centrality of the node, the effectiveness of the node and the availability of the node, wherein the centrality of the node comprises the centrality of a neighbor topological structure of the node and the centrality of the node self betweenness;
the centrality of the node includes the centrality of a neighbor topology structure of the node and the centrality of betweenness of the node, and specifically includes:
(1) The centrality of the neighbor topology of the node is considered, which is specifically represented as follows:
when the node directly transmits the information to the next node, the transmission of the node invests energy as follows:
Q(i)＝∑ q∈Γ(i) k(q)
wherein j is a neighbor node of node i, C ij Indicating the effort, p, of node i to transmit to neighbor node j ij Represents the effort, Σ, of node i directly assigned to neighbor node j q∈Γ(i) Q (Q) represents the sum of the adjacency degrees of all the neighbor nodes of the node i, and Q (j) represents the adjacency degree of the neighbor node j; q (i) represents the adjacency of the node i, Γ (i) represents the set of all neighbor nodes of the node i, and k (Q) represents the degree of the neighbor node Q;
when the node transmits the information to the next node through the common neighbor node, the transmission of the node invests energy as follows:
C ij ＝∑ j∈Γ(i) (p ij +∑ q p iq p qj )
wherein j is a neighbor node of the node i, q is a common neighbor node of the node i and the node j, C ij Indicating the effort, p, of node i to transmit to neighbor node j iq Representing the effort, p, of a node i directly transferring to a common neighbor node q qj The energy of the common neighbor node q directly transmitted to the neighbor node j is represented;
(2) The node centrality considering node betweenness is specifically represented as follows:
wherein, B i Denotes the betweenness of node i, n ik Indicating sectionNumber of shortest paths between point j and node k, n jk(i) Representing the number of the nodes i passing through in the shortest path between the node j and the node k, wherein N is all the nodes in the network;
(3) The centrality of the node is obtained by comprehensively considering the centrality of the neighbor topological structure of the node and the centrality of the betweenness of the node:
S i ＝αC ij +βB i
wherein S is i Representing the centrality of the node i, setting alpha and beta according to the actual condition of the network, wherein the sum of the alpha and the beta is 1;
wherein the validity of the node is calculated by the following formula:
wherein E (i) represents the validity of the node i, D (i, N) represents the hop number passed by the node i to the next node N, and N represents all the nodes in the network;
wherein the availability of the node is calculated by the following formula:
O(i)＝H(i)·A(i)
H(i)＝1-U(i)
wherein O (i) represents the availability of the node i, H (i) represents the resource availability of the node i, U (i) represents the occupation condition of the node i, the sum of w1, w2 and w3 is 1, the node i is determined according to the configuration condition of the node i, and C (i) represents the resource availability of the node i i 、M i 、B i Respectively representing the maximum computing resource of a node i, the maximum storage resource of the node i and the maximum bandwidth resource of the node i, j representing the virtual network function, v representing the virtual networkSet of functions, c j 、m j 、b j Respectively representing the computing resource of a node i occupied by a virtual network function j, the storage resource of the node i occupied by the virtual network function j and the bandwidth resource of the node i occupied by the virtual network function j, A (i) representing the normal working probability of the node i, MTT representing the fault interval time, and MTTR representing the downtime;
and the reliability of the node is F (i) = a 1 S i +a 2 E i +a 3 O (i); wherein, F j Representing the reliability of the node, a 1 、a 2 And a 3 Are all preset parameters.
2. The method of network functional chain deployment according to claim 1, wherein the reliability of the link is calculated by the formula:
where K (i) represents the reliability of the link passed by node i to the next node,
efficiency, λ, representing the failure of the link passed by node i to the next node in The parameters set for the system are set for the system,
the transmission delay passed by a node to the next node.
3. A network function chain deployment apparatus, comprising:
a deployment request receiving module, configured to receive a deployment request of a network function chain, where the network function chain includes at least one virtual network function, and each virtual network function carries deployment information;
a node topology acquisition module, configured to acquire topology information of a plurality of nodes for deploying the virtual network function;
the target function establishing module is used for establishing a target function with the shortest end-to-end time delay, wherein the target function meets the reliability constraint of the node, the resource capacity constraint of the node and the reliability constraint of the link when the virtual network function is deployed;
the deployment module is used for searching the nodes meeting the objective function for deployment according to deployment information carried by a virtual network function and the topology information of the nodes when the network function chain is deployed;
the objective function satisfies reliability constraints on nodes, resource capacity constraints on nodes, and reliability constraints on links when virtual network function deployment is performed, and specifically includes:
the reliability constraint on the nodes when the virtual network function deployment is carried out is represented as: for each of the nodes, each virtual network function deployed on the node requires a minimum reliability of the node that does not exceed the reliability of the node;
when the virtual network function is deployed, the constraint on the resource capacity of the node includes the constraints on the computing resource of the node, the storage resource of the node and the broadband resource of the node, which is specifically represented as:
for each of the nodes, the sum of the computing resources of all virtual network functions deployed on the node does not exceed the maximum computing resource of the node;
for each of the nodes, the sum of the storage resources of all virtual network functions deployed on the node does not exceed the maximum storage resource of the node;
for each of the nodes, the sum of the broadband resources of all virtual network functions deployed on the node does not exceed the maximum broadband resource of the node;
the reliability constraint on the link when the virtual network function is deployed is represented as: for each of the nodes, the minimum link reliability requirement of the virtual network function deployed on the node does not exceed the link reliability communicated by the node to the next node;
the reliability of the node comprises the centrality of the node, the effectiveness of the node and the availability of the node, wherein the centrality of the node comprises the centrality of a neighbor topological structure of the node and the centrality of the node self betweenness;
the centrality of the node includes the centrality of a neighbor topology structure of the node and the centrality of betweenness of the node, and specifically includes:
(1) The centrality of the neighbor topology of the node is considered, which is specifically represented as follows:
when a node directly transfers information to the next node, the transfer of the node invests energy as follows:
Q(i)＝∑ q∈Γ(i) k(q)
wherein j is a neighbor node of node i, C ij Indicating the amount of effort, p, that node i transfers to neighbor node j ij Represents the effort, Σ, of node i directly assigned to neighbor node j q∈Γ(i) Q (Q) represents the sum of the adjacency degrees of all the neighbor nodes of the node i, and Q (j) represents the adjacency degree of the neighbor node j; q (i) represents the adjacency of node i, Γ (i) represents the set of all neighboring nodes of node i, and k (Q) represents the degree of neighboring node Q;
when the node transmits information to the next node through the common neighbor node, the transmission of the node invests energy as follows:
C ij ＝∑ j∈Γ(i) (p ij +∑ q p iq p qj )
wherein j is a neighbor node of the node i, q is a common neighbor node of the node i and the node j, C ij Indicating the amount of effort, p, that node i transfers to neighbor node j iq Representing the effort, p, of a node i directly delivering to a co-neighboring node q qj The energy of the common neighbor node q directly transmitted to the neighbor node j is represented;
(2) The node centrality considering node betweenness is specifically represented as follows:
wherein, B i Denotes the betweenness of node i, n ik Indicates the number of shortest paths between node j and node k, n jk(i) Representing the number of the nodes i passing through in the shortest path between the node j and the node k, wherein N is all the nodes in the network;
(3) The centrality of the node is obtained by comprehensively considering the centrality of the neighbor topological structure of the node and the centrality of the betweenness of the node:
S i ＝αC ij +βB i
wherein S is i Representing the centrality of the node i, setting alpha and beta according to the actual condition of the network, wherein the sum of the alpha and the beta is 1;
wherein the validity of the node is calculated by the following formula:
wherein E (i) represents the validity of the node i, D (i, N) represents the hop number passed by the node i to the next node N, and N represents all nodes in the network;
wherein the availability of the node is calculated by the following formula:
O(i)＝H(i)·A(i)
H(i)＝1-U(i)
where O (i) represents the availability of node i, H (i) tableShowing the resource availability of the node i, U (i) showing the occupation condition of the node i, the sum of w1, w2 and w3 being 1 and determined according to the configuration condition of the node i, C i 、M i 、B i Respectively representing the maximum computing resource of the node i, the maximum storage resource of the node i and the maximum bandwidth resource of the node i, j representing a virtual network function, v representing a set of virtual network functions, c j 、m j 、b j Respectively representing the computing resource occupied by the virtual network function j of the node i, the storage resource occupied by the virtual network function j of the node i and the bandwidth resource occupied by the virtual network function j of the node i, A (i) representing the normal working probability of the node i, MTT representing the fault interval time, and MTTR representing the downtime;
and the reliability of the node is F (i) = a 1 S i +a 2 E i +a 3 O (i); wherein, F j Representing the reliability of the node, a 1 、a 2 And a 3 Are all preset parameters.
4. A terminal device comprising a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, the processor implementing the network function chain deployment method as claimed in claim 1 or 2 when executing the computer program.
5. A storage medium, characterized in that the storage medium comprises a stored computer program, wherein when the computer program runs, the apparatus on which the storage medium is located is controlled to execute the network function chain deployment method according to claim 1 or 2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110116356.1A CN112968794B (en) | 2021-01-28 | 2021-01-28 | Network function chain deployment method, device, terminal device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110116356.1A CN112968794B (en) | 2021-01-28 | 2021-01-28 | Network function chain deployment method, device, terminal device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112968794A CN112968794A (en) | 2021-06-15 |
| CN112968794B true CN112968794B (en) | 2023-01-17 |
Family
ID=76273371
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110116356.1A Active CN112968794B (en) | 2021-01-28 | 2021-01-28 | Network function chain deployment method, device, terminal device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112968794B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113938930B (en) * | 2021-12-16 | 2022-03-25 | 中国船舶重工集团公司第七二二研究所 | Construction method of virtual network function forwarding graph adapting to 5G network multi-service scene |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109586982A (en) * | 2019-01-04 | 2019-04-05 | 北京邮电大学 | A kind of function backup method and device |
| CN110851235A (en) * | 2019-11-04 | 2020-02-28 | 中国人民解放军战略支援部队信息工程大学 | Virtual network function deployment method suitable for multidimensional resource optimization configuration |
| CN111147307A (en) * | 2019-12-30 | 2020-05-12 | 重庆邮电大学 | Service function chain reliable deployment method based on deep reinforcement learning |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108429633B (en) * | 2018-01-18 | 2020-04-03 | 西南交通大学 | Virtual network function deployment method based on wolf algorithm |
| CN111193604B (en) * | 2019-08-23 | 2021-08-17 | 腾讯科技（深圳）有限公司 | Deployment method, device, equipment and storage medium of virtual network function chain |
| CN111901170B (en) * | 2020-07-29 | 2022-12-13 | 中国人民解放军空军工程大学 | Reliability-aware service function chain backup protection method |
| CN112087384B (en) * | 2020-08-03 | 2023-04-28 | 国网甘肃省电力公司信息通信公司 | SDN environment-based data transmission method and system |
| CN112083933B (en) * | 2020-08-27 | 2023-07-04 | 重庆大学 | Service function chain deployment method based on reinforcement learning |
-
2021
- 2021-01-28 CN CN202110116356.1A patent/CN112968794B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109586982A (en) * | 2019-01-04 | 2019-04-05 | 北京邮电大学 | A kind of function backup method and device |
| CN110851235A (en) * | 2019-11-04 | 2020-02-28 | 中国人民解放军战略支援部队信息工程大学 | Virtual network function deployment method suitable for multidimensional resource optimization configuration |
| CN111147307A (en) * | 2019-12-30 | 2020-05-12 | 重庆邮电大学 | Service function chain reliable deployment method based on deep reinforcement learning |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112968794A (en) | 2021-06-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7921251B2 (en) | Globally unique transaction identifiers | |
| CN111787069A (en) | Method, device and equipment for processing service access request and computer storage medium | |
| CN111817869B (en) | Network configuration recovery method and related equipment thereof | |
| US11570043B2 (en) | Method and apparatus for mapping network slices onto network infrastructures with SLA guarantee | |
| CN112532408B (en) | Method, device and storage medium for extracting fault propagation condition | |
| CN109873714B (en) | Cloud computing node configuration updating method and terminal equipment | |
| CN111447143A (en) | Business service data transmission method and device, computer equipment and storage medium | |
| CN112968794B (en) | Network function chain deployment method, device, terminal device and storage medium | |
| CN110224917B (en) | Data transmission method, device and system and server | |
| US10873502B2 (en) | System and method for joint embedding and backup provisioning in virtual networks | |
| CN112714146B (en) | Resource scheduling method, device, equipment and computer readable storage medium | |
| US11595471B1 (en) | Method and system for electing a master in a cloud based distributed system using a serverless framework | |
| CN113886058A (en) | Cross-cluster resource scheduling method and device | |
| CN115473780B (en) | Network target range distributed flow generation method and device | |
| CN115361295B (en) | TOPSIS-based resource backup method, device, equipment and medium | |
| JP2014216012A (en) | Risk mitigation in data center network | |
| US20120023260A1 (en) | Diagonally enhanced concentrated hypercube topology | |
| CN113726638B (en) | Method, device and equipment for managing multi-cloud multi-core container and storage medium | |
| CN111400238B (en) | Data processing method and device | |
| CN105763456A (en) | Path selection method, device and system | |
| CN114461501A (en) | Resource abnormality detection method and device, storage medium, and electronic device | |
| US10785127B1 (en) | Supporting services in distributed networks | |
| CN114816651A (en) | Communication method, device and system | |
| CN107454021B (en) | Communication method and device | |
| CN106936614B (en) | Self-organizing method, device and system of cluster system |
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 |