CN109586982B - Function backup method and device - Google Patents

Function backup method and device Download PDF

Info

Publication number
CN109586982B
CN109586982B CN201910007445.5A CN201910007445A CN109586982B CN 109586982 B CN109586982 B CN 109586982B CN 201910007445 A CN201910007445 A CN 201910007445A CN 109586982 B CN109586982 B CN 109586982B
Authority
CN
China
Prior art keywords
node
backed
function
service
functional
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
Application number
CN201910007445.5A
Other languages
Chinese (zh)
Other versions
CN109586982A (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.)
Beijing University of Posts and Telecommunications
Original Assignee
Beijing University of Posts and Telecommunications
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 Beijing University of Posts and Telecommunications filed Critical Beijing University of Posts and Telecommunications
Priority to CN201910007445.5A priority Critical patent/CN109586982B/en
Publication of CN109586982A publication Critical patent/CN109586982A/en
Application granted granted Critical
Publication of CN109586982B publication Critical patent/CN109586982B/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/0803Configuration setting
    • H04L41/0823Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability
    • H04L41/0836Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability to enhance reliability, e.g. reduce downtime
    • 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
    • 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/12Discovery or management of network topologies
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/08Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/08Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0876Network utilisation, e.g. volume of load or congestion level
    • H04L43/0894Packet rate

Abstract

The embodiment of the invention provides a function backup method and a function backup device, relates to the technical field of communication, and can realize that corresponding service functions can be realized even if physical equipment with any network function is failed. The embodiment of the application comprises the following steps: determining the evaluation value of each function node in the service function chain to be backed up, and determining the function node to be backed up according to the evaluation value of each function node, wherein each function node is respectively deployed in one physical node, and the evaluation value is used for evaluating the backup requirement of the function node. And then selecting a physical node to be backed up from the topological graph where the service function chain to be backed up is located, wherein the physical node to be backed up is used for backing up the network function of the functional node to be backed up.

Description

Function backup method and device
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method and an apparatus for function backup.
Background
Network Function Virtualization (NFV) aims to achieve software and hardware decoupling by means of Virtualization technology, abstract Network functions (firewalls, content caching, multimedia transcoding, and the like) into independent applications, and deploy the applications to a general standard server, a memory, or a switch. A Service Function Chain (SFC) is an ordered set of network functions, and connects the network functions through a virtual link to implement various Service functions. The service function is realized by planning data flow through each network function according to service requirements.
The NFV realizes the dynamic deployment of network functions, so that the SFC is more convenient and faster to create. Since each network function is deployed in the NFV to a physical device, once a physical device (for example, a memory or a switch in which the network function is deployed) deploying any network function in the SFC to which the NFV is applied fails, a service function corresponding to the SFC where the failed physical device is located cannot be implemented, resulting in service interruption.
Disclosure of Invention
The embodiment of the invention aims to provide a function backup method and a function backup device, so that even if physical equipment with any network function is failed, the corresponding service function can still be realized. The specific technical scheme is as follows:
in a first aspect, a method for function backup is provided, where the method includes:
determining the evaluation value of each function node in the service function chain to be backed up, and determining the function node to be backed up according to the evaluation value of each function node; each functional node is respectively deployed in one physical node; the evaluation value is used for representing the backup requirement of the functional node;
selecting a physical node to be backed up from a topological graph where the service function chain to be backed up is located; and the physical node to be backed up is used for backing up the network function of the functional node to be backed up.
Optionally, the determining the evaluation value of each function node in the service function chain to be backed up includes:
determining the centrality of the function node according to the sharing degree and the flow condition of the function node aiming at each function node in the service function chain to be backed up; the sharing degree comprises: the number of service requests flowing out of the functional node and the number of service requests flowing into the functional node; the traffic conditions include: the bandwidth sum of the outflow function node and the bandwidth sum of the inflow function node;
and respectively determining the evaluation value of each function node in the service function chain to be backed up according to the lowest reliability of the service request corresponding to the service function chain to be backed up and the centrality of each function node.
Optionally, the determining, for each functional node in the service functional chain to be backed up, the centrality of the functional node according to the sharing degree and the traffic condition of the functional node includes:
determining the centrality of each functional node according to the following formula:
Figure BDA0001936006340000021
wherein C (i, j) is the centrality of the jth function node of the ith service function chain,
Figure BDA0001936006340000022
for the number of service requests flowing into the jth function node of the ith service function chain,
Figure BDA0001936006340000023
for the bandwidth sum flowing into the jth function node of the ith service function chain,
Figure BDA0001936006340000024
for the number of service requests flowing out of the jth function node of the ith service function chain,
Figure BDA0001936006340000025
α is a preset weight factor for the sum of the bandwidths of the jth function node flowing out of the ith service function chain;
the determining, according to the lowest reliability of the service request corresponding to the service function chain to be backed up and the centrality of each function node, the evaluation value of each function node in the service function chain to be backed up, respectively, includes:
the evaluation value of each functional node is determined according to the following formula:
Figure BDA0001936006340000026
wherein V (i, j) is the evaluation value of the jth function node of the ith service function chainC (i, j) is the centrality of the jth function node of the ith service function chain, ri,jFor the reliability of the jth function node of the ith service function chain,
Figure BDA0001936006340000027
for the lowest reliability of the service request corresponding to the ith service function chain, rmaxThe highest reliability of the service request.
Optionally, the selecting a physical node to be backed up from the topology map where the service function chain to be backed up is located includes:
if one functional node adjacent to the functional node to be backed up in the service functional chain to be backed up is provided, determining a physical node corresponding to the functional node adjacent to the functional node to be backed up as an initial node, and selecting the physical node to be backed up by using a breadth-first search algorithm;
if two functional nodes adjacent to the functional node to be backed up in the service functional chain to be backed up are respectively a front node and a rear node of the functional node to be backed up, traversing each physical node in a topological graph where the service functional chain to be backed up is located, and selecting a physical node meeting a preset condition;
respectively calculating a first distance between each physical node meeting the preset condition and the front node, a second distance between each physical node meeting the preset condition and the rear node, and calculating the sum of the first distance and the second distance corresponding to each physical node meeting the preset condition;
and determining the physical node with the minimum sum of the first distance and the second distance in the physical nodes meeting the preset conditions as the physical node to be backed up.
Optionally, after selecting a physical node to be backed up from the topology map where the service function chain to be backed up is located, the method further includes:
determining the reliability of the functional node to be backed up if the network function of the functional node to be backed up is backed up to the physical node to be backed up;
according to the reliability of the functional node to be backed up, determining the reliability of the service functional chain to be backed up if the network function of the functional node to be backed up is backed up to the physical node to be backed up;
if the reliability of the service function chain to be backed up is less than the lowest reliability of the service request corresponding to the service function chain to be backed up, returning the evaluation value of each function node in the service function chain to be backed up, and determining the function node to be backed up according to the evaluation value of each function node;
and if the reliability of the service function chain to be backed up is greater than or equal to the lowest reliability of the service request corresponding to the service function chain to be backed up, re-determining the service function chain to be backed up, returning the evaluation value of each function node in the determined service function chain to be backed up, and determining the function node to be backed up according to the evaluation value of each function node.
In a second aspect, a functional backup apparatus is provided, the apparatus comprising:
the determining module is used for determining the evaluation value of each function node in the service function chain to be backed up and determining the function node to be backed up according to the evaluation value of each function node; each functional node is respectively deployed in one physical node; the evaluation value is used for representing the backup requirement of the functional node;
the selection module is used for selecting a physical node to be backed up from the topological graph where the service function chain to be backed up is located; the physical node to be backed up is used for backing up the network function of the functional node to be backed up determined by the determining module.
Optionally, the determining module is specifically configured to:
determining the centrality of the function node according to the sharing degree and the flow condition of the function node aiming at each function node in the service function chain to be backed up; the sharing degree comprises: the number of service requests flowing out of the functional node and the number of service requests flowing into the functional node; the traffic conditions include: the bandwidth sum of the outflow function node and the bandwidth sum of the inflow function node; and respectively determining the evaluation value of each function node in the service function chain to be backed up according to the lowest reliability of the service request corresponding to the service function chain to be backed up and the centrality of each function node.
Optionally, the determining module is specifically configured to:
determining the centrality of each functional node according to the following formula:
Figure BDA0001936006340000041
wherein C (i, j) is the centrality of the jth function node of the ith service function chain,
Figure BDA0001936006340000042
for the number of service requests flowing into the jth function node of the ith service function chain,
Figure BDA0001936006340000043
for the bandwidth sum flowing into the jth function node of the ith service function chain,
Figure BDA0001936006340000044
for the number of service requests flowing out of the jth function node of the ith service function chain,
Figure BDA0001936006340000045
α is a preset weight factor for the sum of the bandwidths of the jth function node flowing out of the ith service function chain;
the evaluation value of each functional node is determined according to the following formula:
Figure BDA0001936006340000046
wherein V (i, j) is the evaluation value of the jth function node of the ith service function chain, C (i, j) is the centrality of the jth function node of the ith service function chain, and ri,jFor the reliability of the jth function node of the ith service function chain,
Figure BDA0001936006340000047
for the lowest reliability of the service request corresponding to the ith service function chain, rmaxThe highest reliability of the service request.
Optionally, the selecting module is specifically configured to:
if one functional node adjacent to the functional node to be backed up in the service functional chain to be backed up is provided, determining a physical node corresponding to the functional node adjacent to the functional node to be backed up as an initial node, and selecting the physical node to be backed up by using a breadth-first search algorithm;
if two functional nodes adjacent to the functional node to be backed up in the service functional chain to be backed up are respectively a front node and a rear node of the functional node to be backed up, traversing each physical node in a topological graph where the service functional chain to be backed up is located, and selecting a physical node meeting a preset condition; respectively calculating a first distance between each physical node meeting the preset condition and the front node, a second distance between each physical node meeting the preset condition and the rear node, and calculating the sum of the first distance and the second distance corresponding to each physical node meeting the preset condition; and determining the physical node with the minimum sum of the first distance and the second distance in the physical nodes meeting the preset conditions as the physical node to be backed up.
Optionally, the determining module is further configured to determine the reliability of the functional node to be backed up if the network function of the functional node to be backed up is backed up to the physical node to be backed up; according to the reliability of the functional node to be backed up, determining the reliability of the service functional chain to be backed up if the network function of the functional node to be backed up is backed up to the physical node to be backed up;
the determining module is further configured to determine an evaluation value of each function node in the service function chain to be backed up if the reliability of the service function chain to be backed up determined by the determining module is less than the lowest reliability of the service request corresponding to the service function chain to be backed up, and determine the function node to be backed up according to the evaluation value of each function node;
the determining module is further configured to, if the reliability of the service function chain to be backed up determined by the determining module is greater than or equal to the lowest reliability of the service request corresponding to the service function chain to be backed up, re-determine the service function chain to be backed up, determine the evaluation value of each function node in the service function chain to be backed up, and determine the function node to be backed up according to the evaluation value of each function node.
In a third aspect, an electronic device is provided, which includes a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory complete communication with each other through the communication bus;
a memory for storing a computer program;
and the processor is used for realizing any one of the steps of the function backup method when executing the program stored in the memory.
In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored in the computer-readable storage medium, and when the computer program is executed by a processor, the computer program implements any of the above-mentioned steps of the function backup method.
In a fifth aspect, embodiments of the present invention further provide a computer program product including instructions, which when run on a computer, cause the computer to perform any of the steps of the functional backup method described above.
The function backup method and device provided by the embodiment of the invention can determine the functional node to be backed up according to the evaluation value of each functional node, and select the physical node to be backed up for the functional node to be backed up, and because the physical node to be backed up is used for backing up the network function of the functional node to be backed up, under the condition that the physical node to be backed up backs up the network function of the functional node to be backed up, if the physical node corresponding to the functional node to be backed up fails, the network function backed up in the physical node to be backed up can be started, so as to avoid the interruption of the service carried by the failed physical node.
Of course, not all of the advantages described above need to be achieved at the same time in the practice of any one product or method of the invention.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a flowchart of a function backup method according to an embodiment of the present invention;
fig. 2 is an exemplary network function forwarding diagram provided by an embodiment of the present invention;
fig. 3 is another exemplary network function forwarding diagram provided by an embodiment of the present invention;
fig. 4 is a diagram illustrating further exemplary network function forwarding according to an embodiment of the present invention;
FIG. 5 is a flowchart of another function backup method provided by an embodiment of the present invention;
FIG. 6 is a histogram of backup bandwidth consumed under different reliability requirements according to an embodiment of the present invention;
FIG. 7 is a line graph illustrating the number of network functions backed up as a function of reliability requirements according to an embodiment of the present invention;
FIG. 8 is a bar chart of the acceptance rate of service function chains for different service request quantities according to an embodiment of the present invention;
fig. 9 is a schematic structural diagram of a function backup device according to an embodiment of the present invention;
fig. 10 is a schematic structural diagram of an electronic device 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 derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1, fig. 1 is a flowchart of a function backup method according to an embodiment of the present invention, and the function backup method is applied to a server. The method comprises the following steps:
step 101, determining the evaluation value of each function node in the service function chain to be backed up, and determining the function node to be backed up according to the evaluation value of each function node.
Each functional node is respectively deployed in one physical node; the evaluation value is used to represent the backup requirement of the functional node. The larger the evaluation value of the functional node is, the more backup the functional node is required.
Step 102, selecting a physical node to be backed up from a topological graph where the service function chain to be backed up is located.
The physical node to be backed up is used for backing up the network function of the functional node to be backed up.
The function backup method provided by the embodiment of the invention can determine the functional node to be backed up according to the evaluation value of each functional node, and select the physical node to be backed up for the functional node to be backed up, and because the physical node to be backed up is used for backing up the network function of the functional node to be backed up, under the condition that the physical node to be backed up backs up the network function of the functional node to be backed up, if the physical node corresponding to the functional node to be backed up fails, the network function backed up in the physical node to be backed up can be started, so as to avoid the interruption of the service carried by the failed physical node.
The two steps involved in the embodiment of fig. 1 are explained in detail below.
Optionally, the process of determining the functional node to be backed up in step 101 may include the following two steps:
the method comprises the following steps: and determining the centrality of the functional node according to the sharing degree and the flow condition of the functional node aiming at each functional node in the service functional chain to be backed up.
Wherein, the sharing degree comprises: the number of service requests flowing out of the functional node and the number of service requests flowing into the functional node. The flow conditions include: the sum of the bandwidths of the egress functional nodes and the sum of the bandwidths of the ingress functional nodes.
Optionally, the centrality of each functional node is determined according to formula (1):
Figure BDA0001936006340000081
wherein C (i, j) is the centrality of the jth function node of the ith service function chain,
Figure BDA0001936006340000082
for the number of service requests flowing into the jth function node of the ith service function chain,
Figure BDA0001936006340000083
for the bandwidth sum flowing into the jth function node of the ith service function chain,
Figure BDA0001936006340000084
for the number of service requests flowing out of the jth function node of the ith service function chain,
Figure BDA0001936006340000085
α is a preset weighting factor for the sum of the bandwidths of the jth function node flowing out of the ith service function chain.
The higher the centrality of the function node is, the higher the sharing degree of the function node is and the smaller the incoming and outgoing bandwidths are. The lower the centrality of a functional node, the lower the degree of sharing of the functional node and the larger the incoming and outgoing bandwidth.
If the service function chains corresponding to a function node are more, the sharing degree of the function node is higher. For example: the function node a is located in both the service function chain 1 and the service function chain 2; the functional node B is located in functional node 1. The functional node a is shared by the service function chain 1 and the service function chain 2, while the functional node B is not shared, so the functional node a is shared to a higher degree than the functional node B.
Step two: and respectively determining the evaluation value of each function node in the service function chain to be backed up according to the lowest reliability of the service request corresponding to the service function chain to be backed up and the centrality of each function node.
Optionally, the evaluation value of each functional node is determined according to formula (2):
Figure BDA0001936006340000086
wherein V (i, j) is the evaluation value of the jth function node of the ith service function chain, C (i, j) is the centrality of the jth function node of the ith service function chain, and ri,jFor the reliability of the jth function node of the ith service function chain,
Figure BDA0001936006340000087
for the lowest reliability of the service request corresponding to the ith service function chain, rmaxThe highest reliability of the service request.
In the embodiment of the invention, the reliability of the physical node corresponding to the functional node is the reliability of the functional node. The reliability of the physical node can be obtained from the test.
It can be understood that, in the backup process, if only the reliability of each function node is considered, performing backup on the function node with the lowest reliability may cause that, in order to improve the reliability of the service function chain to be backed up, the function node of the service function chain to be backed up is subjected to multiple backups, thereby causing resource waste. Therefore, in the function backup method provided by the embodiment of the present invention, in addition to considering the reliability of each function node, the sharing degree and the traffic condition of each function node are also considered. The backup of the function node with large sharing degree can enhance the reliability of the function node, and further enhance the reliability of each service function chain comprising the function node, thereby enhancing the reliability of a plurality of service function chains. The backup of the nodes with small inflow and outflow bandwidths can reduce the consumption of backup bandwidth resources due to the additional increase of the backup. Therefore, the embodiment of the invention can reduce the waste of resources caused by the function backup method.
The embodiment of the invention also provides an example of a method for determining the functional node to be backed up, which comprises the following steps:
with reference to fig. 2, 8 functional nodes in the exemplary network function forwarding diagram shown in fig. 2 are respectively a functional node a to a functional node h, and numbers in the functional nodes are used to identify network functions corresponding to the functional nodes, for example, the functional node a has a network function 7. The position relationship of each functional node in the graph represents the position relationship of a physical node corresponding to each functional node. The connections between the functional nodes represent virtual links, and the numbers on the virtual links represent the incoming/outgoing bandwidth. For example, functional node a has a bandwidth of 80 to functional node b.
Referring to fig. 2, the service function chain includes each function node and a virtual link between each function node. For example: the service function chain may be a link comprising a function node f, a function node g and a function node d. Each service function chain corresponds to a service request, and the network function required for responding to a service request is each function node in the service function chain corresponding to the service request. Wherein the network functions required to respond to a service request are preset.
The function node of the service request corresponding to the network function for responding to the service request is shown in table one:
watch 1
Figure BDA0001936006340000091
Figure BDA0001936006340000101
Assuming that the service function chain corresponding to the service request 5 is a service function chain to be backed up, as can be seen from fig. 2, the service function chain to be backed up includes a function node c and a function node h. The functional node to be backed up may be selected from the functional node c and the functional node h.
Assuming that α is 0.5, the reliability of the physical node corresponding to the functional node c is 0.5, the reliability of the physical node corresponding to the functional node h is 0.3, the minimum reliability of the service request 5 is 0.1, and the maximum reliability of the service request is 0.9.
The centrality of the functional node c is:
C(5,1)=(3)1-0.5·(150)0.5+(2)1-0.5·(140)0.5≈24
the centrality of the functional node h is:
C(5,2)=(1)1-0.5·(70)0.5+(0)1-0.5·(0)0.5≈8
the evaluation value of the functional node c is:
Figure BDA0001936006340000102
the evaluation value of the functional node h is:
Figure BDA0001936006340000103
since the evaluation value 20 of the functional node c > the evaluation value 7 of the functional node h indicates that the backup requirement of the functional node c is higher than that of the functional node h, the functional node c is determined as a functional node to be backed up.
After the functional node to be backed up is determined, the physical node to be backed up for backing up the functional node to be backed up can be determined. Optionally, the selecting the physical node to be backed up in step 102 has the following two modes:
the first method is as follows: and if one functional node adjacent to the functional node to be backed up in the service functional chain to be backed up is provided, determining a physical node corresponding to the functional node adjacent to the functional node to be backed up as an initial node, and selecting the physical node to be backed up by using a breadth-first search algorithm.
In the embodiment of the invention, the physical node to be backed up needs to meet the preset condition. The preset conditions may be: the physical node to be backed up can realize the network function of the functional node to be backed up, the available resource of the physical node to be backed up can support the network function of the functional node to be backed up, and the physical node to be backed up does not deploy the same network function as the functional node to be backed up.
Illustratively, in conjunction with fig. 3, if the service function chain to be backed up includes a function node a, a function node B, and a function node C. The function node A is the first node of the service function chain to be backed up, the function node B is the post node of the function node A, and the function node C is the last node of the service function chain to be backed up.
Assuming that the functional node A is a functional node to be backed up, determining the functional node B as an initial node, and searching the searched functional node B meeting the preset conditions by using a breadth-first search algorithmAAnd determining the corresponding physical node as a physical node to be backed up. In order to ensure that the structure of the service function chain to be backed up is not changed, the network function backed up to the physical node to be backed up may be merged into the functional node to be backed up. E.g. node b will function in fig. 3AThe backed up network functions (i.e. the network functions of the functional node a) are merged into the functional node a, and the merged functional node is denoted as functional node a'.
Assuming that the functional node C is a functional node to be backed up, determining the functional node B as an initial node, and searching the searched functional node B meeting the preset conditions by using a breadth-first search algorithmCAnd determining the corresponding physical node as a physical node to be backed up. In order to ensure that the structure of the service function chain to be backed up is not changed, the network function backed up to the physical node to be backed up may be merged into the functional node to be backed up. E.g. node b will function in fig. 3CThe backed-up network functions (i.e., the network functions of the functional node C) are merged into the functional node C, and the merged functional node is denoted as a functional node C'.
In the embodiment of the invention, by using the breadth-first search algorithm, after the physical node meeting the preset condition is searched, the physical node is not searched continuously. And determining the found physical node meeting the preset conditions as a physical node to be backed up.
The second mode comprises the following three steps:
the method comprises the following steps: if two functional nodes adjacent to the functional node to be backed up in the service functional chain to be backed up are respectively a front node and a rear node of the functional node to be backed up, traversing each physical node in a topological graph where the service functional chain to be backed up is located, and selecting the physical node meeting the preset condition.
Step two: respectively calculating a first distance between each physical node meeting the preset condition and the front node, a second distance between each physical node meeting the preset condition and the rear node, and calculating the sum of the first distance and the second distance corresponding to each physical node meeting the preset condition.
Step three: and determining the physical node with the minimum sum of the first distance and the second distance in the physical nodes meeting the preset conditions as the physical node to be backed up.
Illustratively, the above-mentioned steps one to three are explained with reference to fig. 4, if the service function chain to be backed up includes a function node a and a front node of a function node B (e.g. B in fig. 4)pre) Functional node B, and a back node of the functional node B (e.g. B in FIG. 4)post) And a functional node C. Assuming that the functional node B is a functional node to be backed up, traversing each physical node in the topology map where the service functional chain to be backed up is located to obtain each physical node satisfying the preset condition (for example, as the functional node B in fig. 4)BCorresponding physical node and physical node (not shown in fig. 4)) corresponding to functional node D, compute functional node bBFirst distance between corresponding physical node and physical node corresponding to front node of functional node B, and functional node BBCalculating the second distance between the corresponding physical node and the physical node corresponding to the post node of the functional node B, and calculating the functional node BBThe sum of the corresponding first and second distances. And calculating a first distance between a physical node corresponding to the functional node D and a physical node corresponding to a front node of the functional node B and a second distance between a physical node corresponding to the functional node D and a physical node corresponding to a rear node of the functional node B, and then calculating the sum of the first distance and the second distance corresponding to the functional node D. Comparison function node bBThe sum of the first distance and the second distance corresponding to the functional node D. A shorter functional node b that sums the first distance and the second distanceBThe corresponding physical node is determined as the physical node to be backed up. In order to ensure that the structure of the service function chain to be backed up is not changed, the network function backed up to the physical node to be backed up may be merged into the functional node to be backed up. As in figure 4 with functional node bBThe backup network functions, i.e. the network functions of the functional node B, are merged into the functional node B, and the merged functional node is denoted as functional node B'.
It can be understood that, in the backup process, if the reliability requirement corresponding to each service function chain is not considered (the reliability of a service function chain is greater than or equal to the minimum reliability of a service request corresponding to the service function chain, which indicates that the service function chain satisfies the reliability requirement corresponding to the service function chain), it may be caused that after the backup scheme is determined, part of the service function chains do not reach the reliability requirement corresponding to the service function chain, so that when the reliability requirement corresponding to each service function chain is not considered, the acceptance rate of the service function chains of the obtained backup scheme (the number of service function chains satisfying the reliability requirement/the total number of service requests) is low. Therefore, in the function backup method provided by the embodiment of the present invention, in consideration of the reliability requirement corresponding to each service function chain, the backup process is repeated until each service function chain meets the reliability requirement corresponding to each service function chain, and the acceptance rate of the service function chain can be improved when there are multiple service function chains.
Fig. 5 is a flowchart of another function backup method provided in the embodiment of the present invention, which includes the following steps:
step 501, judging whether a service function chain which does not meet the reliability requirement exists. If not, go to step 502; if so, go to step 503.
And comparing each service function chain with the lowest reliability of the service request corresponding to the service function chain, and judging whether each service function chain is smaller than the lowest reliability of the service request corresponding to the service function chain. If the service function chain is smaller than the lowest reliability of the service request corresponding to the service function chain, the service function chain does not meet the reliability requirement; if the service function chain is greater than or equal to the minimum reliability of the service request corresponding to the service function chain, the service function chain meets the reliability requirement.
Step 502, if there is no service function chain that does not meet the reliability requirement, a backup scheme is output.
In one embodiment, if each service function chain meets its corresponding reliability requirement, a backup plan is output.
In another embodiment, if each service function chain cannot determine the physical node to be backed up, the backup scheme is output. It can be understood that if the physical nodes meeting the preset condition cannot be acquired (for example, each physical node cannot provide sufficient resources for supporting the network function of the functional node to be backed up), the functional node to be backed up cannot be backed up, and a backup scheme needs to be output.
Step 503, determining a service function chain to be backed up.
In one embodiment, a service function chain that does not meet the reliability requirement is determined as the service function chain to be backed up.
Step 504, determining a functional node to be backed up.
The method for determining the functional node to be backed up in step 504 is the same as the method for determining the functional node to be backed up in step 101, and reference may be made to the description in step 101, which is not described herein again.
And step 505, determining a physical node to be backed up.
The method for determining the physical node to be backed up in step 505 is the same as the method for determining the physical node to be backed up in step 102, and reference may be made to the description in step 102, which is not described herein again.
Step 506, updating the reliability of each service function chain.
In one embodiment, the method for updating the reliability of each service function chain comprises the following two steps:
the method comprises the following steps: and determining the reliability of the functional node to be backed up if the network function of the functional node to be backed up is backed up to the physical node to be backed up.
In one embodiment, after combining the functional node to be backed up and the network function backed up to the physical node to be backed up, the reliability of the functional node to be backed up is calculated by using the formula (3):
ri,j′=1-(1-ri,j)(1-rb) (3)
wherein r isi,jIf the network function of the functional node to be backed up is backed up to the physical node to be backed up, the reliability of the functional node to be backed up is ensured; r isi,jBefore backing up the network function of the functional node to be backed up to the physical node to be backed up, the reliability of the functional node to be backed up is ensured; r isbThe reliability of the physical node to be backed up.
Step two: and determining the reliability of each service function chain if the network function of the functional node to be backed up is backed up to the physical node to be backed up according to the reliability of the functional node to be backed up.
In one embodiment, the product of the reliabilities of the various function nodes in the service function chain may be determined as the reliability of the service function chain.
For example: one service function chain comprises a function node 1, a function node 2 and a function node 3; the reliability of the functional node 1 is 0.5, the reliability of the functional node 2 is 0.2, and the reliability of the functional node 3 is 0.6. The reliability of this service function chain is then: 0.5 × 0.2 × 0.6 ═ 0.06.
And step 507, judging whether the updated service function chain to be backed up meets the reliability requirement. If yes, go to step 501; if not, go to step 504.
In the embodiment of the present invention, if the reliability of the service function chain to be backed up is less than the lowest reliability of the service request corresponding to the service function chain to be backed up, the function node to be backed up and the physical node to be backed up are continuously determined in the service function chain to be backed up. If the reliability of the service function chain to be backed up is greater than or equal to the lowest reliability of the service request corresponding to the service function chain to be backed up, whether a service function chain which does not meet the reliability requirement exists can be judged again, if yes, the service function chain to be backed up is determined again from the service function chains which do not meet the reliability requirement, and the backup scheme is determined continuously according to the determined service function chain to be backed up.
It should be noted that, if there is a shared function node in each function node of the service function chain to be backed up, after one shared function node is backed up, the reliability of multiple service function chains may change, so that it is necessary to serially determine the function node to be backed up corresponding to each service function chain and the physical node to be backed up corresponding to the function node to be backed up.
In order to better embody the beneficial effects of the present invention compared with the prior art, the embodiment of the present invention further provides a set of data obtained by performing backup by using the backup scheme determined by the embodiment of the present invention, including: consumed backup bandwidth resources, the number of network functions backed up, and the acceptance rate of the service function chain.
Wherein, the consumed backup bandwidth resources are: after each service Function chain is backed up, compared with the prior backup, the new bandwidth resource is added in a virtual Network Function Forwarding Graph (VNF-FG) formed by each service Function chain.
The number of network functions backed up is: the number of network functions that need to be backed up in the backup scheme.
The acceptance rate of the service function chain is: and after each service function chain is backed up, the number of service function chains/the total number of service requests meeting the reliability requirement.
In the embodiment of the present invention, it is assumed that each physical node has 300 units of capability to provide various resources (e.g., storage resources and computing resources), and when one unit of capability is used for providing one resource, no other resource is provided. The failure probability of each functional node is randomly distributed between [0.9, 0.999], and the failure probability of the functional node is equal to that of the physical node where the functional node is deployed. For deploying multiple service function chains, it is assumed that each physical node can implement three types of network functions, but for simplifying the backup scheme, when one type of network function is deployed by one node, it is no longer used for deploying other types of network functions. The reliability requirements of each service function chain are as follows: 0.95, 0.98, 0.99, 0.995 and 0.999. And setting a physical node to realize three network functions at most, wherein the value range of the node capacity required by one network function is [76, 100 ].
In the bar chart shown in fig. 6, the backup bandwidths consumed by applying the method provided by the embodiment of the present invention (as shown in a in fig. 6), the method for applying the reliability increment-based maximization (as shown in B in fig. 6), and the method for applying the backup node resource minimization (as shown in C in fig. 6) are represented respectively under five reliability requirements. Therefore, under the five conditions, the backup bandwidth consumed by the method provided by the embodiment of the invention is the least, so that the embodiment of the invention can reduce the consumed backup bandwidth resource.
The line graph shown in fig. 7 represents the number of network functions backed up by applying the method provided by the embodiment of the present invention (as shown in a in fig. 7) and the method based on the resource minimization of the backup node and the breadth-first search algorithm (as shown in C in fig. 7) under five reliability requirements, respectively. Therefore, in five cases, the number of network functions backed up by the method provided by the embodiment of the invention is the least, so that the embodiment of the invention can reduce consumed backup resources.
In the histogram shown in fig. 8, the bar charts respectively represent the acceptance rate of the service function chain of the method (as shown in fig. 8 a) provided by the embodiment of the present invention and the method (as shown in fig. 8D) applied to enhance protection in Network Function Virtualization (NFV) to ensure reliability (guardingreliability with improved protection in NFV). As can be seen, in four cases, the acceptance rate of the service function chain of the method provided by the embodiment of the present invention is the highest, so that the embodiment of the present invention can improve the acceptance rate of the service function chain when multiple service function chains are deployed.
Corresponding to the above method embodiment, as shown in fig. 9, an embodiment of the present invention provides a function backup apparatus, applied to a server, where the apparatus includes: a determining module 901 and a selecting module 902;
a determining module 901, configured to determine an evaluation value of each function node in a service function chain to be backed up, and determine a function node to be backed up according to the evaluation value of each function node; each functional node is respectively deployed in one physical node; the evaluation value is used for representing the backup requirement of the functional node;
a selecting module 902, configured to select a physical node to be backed up from a topology map in which a service function chain to be backed up is located; and the physical node to be backed up is used for backing up the network function of the functional node to be backed up determined by the determining module.
Optionally, the determining module 901 may be specifically configured to:
determining the centrality of the function node according to the sharing degree and the flow condition of the function node aiming at each function node in the service function chain to be backed up; the sharing degree comprises: the number of service requests flowing out of the functional node and the number of service requests flowing into the functional node; the flow conditions include: the bandwidth sum of the outflow function node and the bandwidth sum of the inflow function node; and respectively determining the evaluation value of each function node in the service function chain to be backed up according to the lowest reliability of the service request corresponding to the service function chain to be backed up and the centrality of each function node.
Optionally, the determining module 901 may be specifically configured to:
determining the centrality of each functional node according to the following formula:
Figure BDA0001936006340000161
wherein C (i, j) is the centrality of the jth function node of the ith service function chain,
Figure BDA0001936006340000162
for the number of service requests flowing into the jth function node of the ith service function chain,
Figure BDA0001936006340000163
for the bandwidth sum flowing into the jth function node of the ith service function chain,
Figure BDA0001936006340000164
for the number of service requests flowing out of the jth function node of the ith service function chain,
Figure BDA0001936006340000165
for the sum of bandwidths of the jth function node of the ith service function chain, α is a preset weightA factor;
the evaluation value of each functional node is determined according to the following formula:
Figure BDA0001936006340000171
wherein V (i, j) is the evaluation value of the jth function node of the ith service function chain, C (i, j) is the centrality of the jth function node of the ith service function chain, and ri,jFor the reliability of the jth function node of the ith service function chain,
Figure BDA0001936006340000172
for the lowest reliability of the service request corresponding to the ith service function chain, rmaxThe highest reliability of the service request.
Optionally, the selecting module 902 may be specifically configured to:
if one functional node adjacent to the functional node to be backed up in the service functional chain to be backed up is provided, determining a physical node corresponding to the functional node adjacent to the functional node to be backed up as an initial node, and selecting the physical node to be backed up by using a width-first search algorithm;
if two functional nodes adjacent to the functional node to be backed up in the service functional chain to be backed up are respectively a front node and a rear node of the functional node to be backed up, traversing each physical node in a topological graph where the service functional chain to be backed up is located, and selecting the physical node meeting a preset condition; respectively calculating a first distance between each physical node meeting the preset condition and the front node and a second distance between each physical node meeting the preset condition and the rear node, and calculating the sum of the first distance and the second distance corresponding to each physical node meeting the preset condition; and determining the physical node with the minimum sum of the first distance and the second distance in the physical nodes meeting the preset conditions as the physical node to be backed up.
Optionally, the determining module 901 is further configured to determine the reliability of the functional node to be backed up if the network function of the functional node to be backed up is backed up to the physical node to be backed up; according to the reliability of the functional node to be backed up, determining the reliability of the service functional chain to be backed up if the network function of the functional node to be backed up is backed up to the physical node to be backed up;
the determining module 901 is further configured to determine an evaluation value of each function node in the service function chain to be backed up if the reliability of the service function chain to be backed up determined by the determining module is less than the lowest reliability of the service request corresponding to the service function chain to be backed up, and determine the function node to be backed up according to the evaluation value of each function node;
the determining module 901 is further configured to, if the reliability of the service function chain to be backed up determined by the determining module is greater than or equal to the lowest reliability of the service request corresponding to the service function chain to be backed up, re-determine the service function chain to be backed up, determine the evaluation value of each function node in the service function chain to be backed up, and determine the function node to be backed up according to the evaluation value of each function node.
The embodiment of the present invention further provides an electronic device, as shown in fig. 10, which includes a processor 1001, a communication interface 1002, a memory 1003 and a communication bus 1004, wherein the processor 1001, the communication interface 1002 and the memory 1003 complete mutual communication through the communication bus 1004,
a memory 1003 for storing a computer program;
the processor 1001 is configured to implement the steps executed by the server in the above method embodiment when executing the program stored in the memory 1003.
The communication bus mentioned in the electronic device may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The communication bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown, but this does not mean that there is only one bus or one type of bus.
The communication interface is used for communication between the electronic equipment and other equipment.
The Memory may include a Random Access Memory (RAM) or a Non-Volatile Memory (NVM), such as at least one disk Memory. Optionally, the memory may also be at least one memory device located remotely from the processor.
The Processor may be a general-purpose Processor, including a Central Processing Unit (CPU), a Network Processor (NP), and the like; but also Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components.
In another embodiment of the present invention, a computer-readable storage medium is further provided, in which a computer program is stored, and the computer program, when executed by a processor, implements the steps of any of the above-mentioned functional backup methods.
In yet another embodiment, a computer program product containing instructions is provided, which when run on a computer, causes the computer to perform any of the above-described functional backup methods.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website site, computer, server, or data center to another website site, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.
It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, as for the apparatus embodiment, since it is substantially similar to the method embodiment, the description is relatively simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
The above description is only for the preferred embodiment of the present invention, and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention shall fall within the protection scope of the present invention.

Claims (8)

1. A method for backup of functions, the method comprising:
determining the evaluation value of each function node in the service function chain to be backed up, and determining the function node to be backed up according to the evaluation value of each function node; each functional node is respectively deployed in one physical node; the evaluation value is used for representing the backup requirement of the functional node;
selecting a physical node to be backed up from a topological graph where the service function chain to be backed up is located; the physical node to be backed up is used for backing up the network function of the functional node to be backed up;
the determining the evaluation value of each function node in the service function chain to be backed up includes:
determining the centrality of the function node according to the sharing degree and the flow condition of the function node aiming at each function node in the service function chain to be backed up; the sharing degree comprises: the number of service requests flowing out of the functional node and the number of service requests flowing into the functional node; the traffic conditions include: the bandwidth sum of the outflow function node and the bandwidth sum of the inflow function node;
and respectively determining the evaluation value of each function node in the service function chain to be backed up according to the lowest reliability of the service request corresponding to the service function chain to be backed up and the centrality of each function node.
2. The method according to claim 1, wherein the determining the centrality of the function node according to the sharing degree and the traffic condition of the function node for each function node in the service function chain to be backed up comprises:
determining the centrality of each functional node according to the following formula:
Figure FDA0002465000270000011
wherein C (i, j) is the centrality of the jth function node of the ith service function chain,
Figure FDA0002465000270000012
for the number of service requests flowing into the jth function node of the ith service function chain,
Figure FDA0002465000270000013
for the bandwidth sum flowing into the jth function node of the ith service function chain,
Figure FDA0002465000270000014
for the number of service requests flowing out of the jth function node of the ith service function chain,
Figure FDA0002465000270000015
α is a preset weight factor for the sum of the bandwidths of the jth function node flowing out of the ith service function chain;
the determining, according to the lowest reliability of the service request corresponding to the service function chain to be backed up and the centrality of each function node, the evaluation value of each function node in the service function chain to be backed up, respectively, includes:
the evaluation value of each functional node is determined according to the following formula:
Figure FDA0002465000270000021
wherein V (i, j) is the evaluation value of the jth function node of the ith service function chain, C (i, j) is the centrality of the jth function node of the ith service function chain, and ri,jFor the reliability of the jth function node of the ith service function chain,
Figure FDA0002465000270000022
for the lowest reliability of the service request corresponding to the ith service function chain, rmaxThe highest reliability of the service request.
3. The method according to claim 1, wherein the selecting a physical node to be backed up from a topology map in which the service function chain to be backed up is located comprises:
if one functional node adjacent to the functional node to be backed up in the service functional chain to be backed up is provided, determining a physical node corresponding to the functional node adjacent to the functional node to be backed up as an initial node, and selecting the physical node to be backed up by using a breadth-first search algorithm;
if two functional nodes adjacent to the functional node to be backed up in the service functional chain to be backed up are respectively a front node and a rear node of the functional node to be backed up, traversing each physical node in a topological graph where the service functional chain to be backed up is located, and selecting a physical node meeting a preset condition;
respectively calculating a first distance between each physical node meeting the preset condition and the front node, a second distance between each physical node meeting the preset condition and the rear node, and calculating the sum of the first distance and the second distance corresponding to each physical node meeting the preset condition;
and determining the physical node with the minimum sum of the first distance and the second distance in the physical nodes meeting the preset conditions as the physical node to be backed up.
4. The method according to claim 1, further comprising, after selecting a physical node to be backed up from a topology map in which the service function chain to be backed up is located:
determining the reliability of the functional node to be backed up if the network function of the functional node to be backed up is backed up to the physical node to be backed up;
according to the reliability of the functional node to be backed up, determining the reliability of the service functional chain to be backed up if the network function of the functional node to be backed up is backed up to the physical node to be backed up;
if the reliability of the service function chain to be backed up is less than the lowest reliability of the service request corresponding to the service function chain to be backed up, returning the evaluation value of each function node in the service function chain to be backed up, and determining the function node to be backed up according to the evaluation value of each function node;
and if the reliability of the service function chain to be backed up is greater than or equal to the lowest reliability of the service request corresponding to the service function chain to be backed up, re-determining the service function chain to be backed up, returning the evaluation value of each function node in the determined service function chain to be backed up, and determining the function node to be backed up according to the evaluation value of each function node.
5. A functional backup apparatus, characterized in that the apparatus comprises:
the determining module is used for determining the evaluation value of each function node in the service function chain to be backed up and determining the function node to be backed up according to the evaluation value of each function node; each functional node is respectively deployed in one physical node; the evaluation value is used for representing the backup requirement of the functional node;
the selection module is used for selecting a physical node to be backed up from the topological graph where the service function chain to be backed up is located; the physical node to be backed up is used for backing up the network function of the functional node to be backed up determined by the determining module;
the determining module is specifically configured to:
determining the centrality of the function node according to the sharing degree and the flow condition of the function node aiming at each function node in the service function chain to be backed up; the sharing degree comprises: the number of service requests flowing out of the functional node and the number of service requests flowing into the functional node; the traffic conditions include: the bandwidth sum of the outflow function node and the bandwidth sum of the inflow function node; and respectively determining the evaluation value of each function node in the service function chain to be backed up according to the lowest reliability of the service request corresponding to the service function chain to be backed up and the centrality of each function node.
6. The apparatus of claim 5, wherein the determining module is specifically configured to:
determining the centrality of each functional node according to the following formula:
Figure FDA0002465000270000031
wherein C (i, j) is the centrality of the jth function node of the ith service function chain,
Figure FDA0002465000270000032
for the number of service requests flowing into the jth function node of the ith service function chain,
Figure FDA0002465000270000033
for the bandwidth sum flowing into the jth function node of the ith service function chain,
Figure FDA0002465000270000034
for the number of service requests flowing out of the jth function node of the ith service function chain,
Figure FDA0002465000270000035
α is a preset weight factor for the sum of the bandwidths of the jth function node flowing out of the ith service function chain;
the evaluation value of each functional node is determined according to the following formula:
Figure FDA0002465000270000041
wherein V (i, j) is the evaluation value of the jth function node of the ith service function chain, C (i, j) is the centrality of the jth function node of the ith service function chain, and ri,jFor the reliability of the jth function node of the ith service function chain,
Figure FDA0002465000270000042
for the lowest reliability of the service request corresponding to the ith service function chain, rmaxThe highest reliability of the service request.
7. The apparatus of claim 5, wherein the selection module is specifically configured to:
if one functional node adjacent to the functional node to be backed up in the service functional chain to be backed up is provided, determining a physical node corresponding to the functional node adjacent to the functional node to be backed up as an initial node, and selecting the physical node to be backed up by using a breadth-first search algorithm;
if two functional nodes adjacent to the functional node to be backed up in the service functional chain to be backed up are respectively a front node and a rear node of the functional node to be backed up, traversing each physical node in a topological graph where the service functional chain to be backed up is located, and selecting a physical node meeting a preset condition; respectively calculating a first distance between each physical node meeting the preset condition and the front node, a second distance between each physical node meeting the preset condition and the rear node, and calculating the sum of the first distance and the second distance corresponding to each physical node meeting the preset condition; and determining the physical node with the minimum sum of the first distance and the second distance in the physical nodes meeting the preset conditions as the physical node to be backed up.
8. The apparatus of claim 5,
the determining module is further configured to determine the reliability of the functional node to be backed up if the network function of the functional node to be backed up is backed up to the physical node to be backed up; according to the reliability of the functional node to be backed up, determining the reliability of the service functional chain to be backed up if the network function of the functional node to be backed up is backed up to the physical node to be backed up;
the determining module is further configured to determine an evaluation value of each function node in the service function chain to be backed up if the reliability of the service function chain to be backed up determined by the determining module is less than the lowest reliability of the service request corresponding to the service function chain to be backed up, and determine the function node to be backed up according to the evaluation value of each function node;
the determining module is further configured to, if the reliability of the service function chain to be backed up determined by the determining module is greater than or equal to the lowest reliability of the service request corresponding to the service function chain to be backed up, re-determine the service function chain to be backed up, determine the evaluation value of each function node in the service function chain to be backed up, and determine the function node to be backed up according to the evaluation value of each function node.
CN201910007445.5A 2019-01-04 2019-01-04 Function backup method and device Active CN109586982B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910007445.5A CN109586982B (en) 2019-01-04 2019-01-04 Function backup method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910007445.5A CN109586982B (en) 2019-01-04 2019-01-04 Function backup method and device

Publications (2)

Publication Number Publication Date
CN109586982A CN109586982A (en) 2019-04-05
CN109586982B true CN109586982B (en) 2020-08-21

Family

ID=65915610

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910007445.5A Active CN109586982B (en) 2019-01-04 2019-01-04 Function backup method and device

Country Status (1)

Country Link
CN (1) CN109586982B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111901170B (en) * 2020-07-29 2022-12-13 中国人民解放军空军工程大学 Reliability-aware service function chain backup protection method
CN114374608B (en) * 2020-10-15 2023-08-15 中国移动通信集团浙江有限公司 Slice instance backup task scheduling method and device and electronic equipment
CN112968794B (en) * 2021-01-28 2023-01-17 广州杰赛科技股份有限公司 Network function chain deployment method, device, terminal device and storage medium
CN114244713B (en) * 2021-10-29 2024-04-09 国网浙江省电力有限公司桐乡市供电公司 Resource backup method and device for electric power 5G network slice

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3379771A1 (en) * 2015-12-16 2018-09-26 Huawei Technologies Co., Ltd. Message processing method, device and system
CN108965014A (en) * 2018-07-25 2018-12-07 北京智芯微电子科技有限公司 The service chaining backup method and system of QoS perception

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11157422B2 (en) * 2017-03-31 2021-10-26 Intel Corporation Shared memory for intelligent network interface cards
CN108768721B (en) * 2018-05-25 2021-02-02 电子科技大学 Primary and standby VNF switching technology based on temporary packet storage

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3379771A1 (en) * 2015-12-16 2018-09-26 Huawei Technologies Co., Ltd. Message processing method, device and system
CN108965014A (en) * 2018-07-25 2018-12-07 北京智芯微电子科技有限公司 The service chaining backup method and system of QoS perception

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
Enhancing the reliability of Services in NFV with the Cost-Efficient Redundancy Scheme;Weiran Ding等;《2017 IEEE International Conference on Communications》;IEEE;20170731;1-6 *
Redundancy mechanism of Service Function Chain with Node-Ranking Algorithm;Leyi Zhang等;《2019 IFIP/IEEE Symposium on Integrated Network and Service Management (IM)》;20190520;全文 *
网络服务功能链拓扑设计及映射研究;吕晨;《中国优秀硕士学位论文全文数据库(电子期刊)》;20170215;全文 *

Also Published As

Publication number Publication date
CN109586982A (en) 2019-04-05

Similar Documents

Publication Publication Date Title
CN109586982B (en) Function backup method and device
US11604667B2 (en) Optimized deployment based upon customer locality
US10642704B2 (en) Storage controller failover system
US11626972B2 (en) Data processing method and apparatus
US7000141B1 (en) Data placement for fault tolerance
US11206173B2 (en) High availability on a distributed networking platform
US9448824B1 (en) Capacity availability aware auto scaling
US11249867B2 (en) Automating the failover of a relational database in a cloud computing environment
US9390156B2 (en) Distributed directory environment using clustered LDAP servers
KR100872247B1 (en) Method of using feature flags to determine compatibility between bios revisions and installed hardware during flash update
CN112948120A (en) Load balancing method, system, device and storage medium
CN108829738B (en) Data storage method and device in ceph
CN110896344B (en) Redundant service deployment method and device
EP4324173A1 (en) Convergence function to avoid micro-loops
US20210281441A1 (en) San access system
CN109660458B (en) Routing method and device
CN110311862B (en) Service chain mapping method and device
CN115914404A (en) Cluster flow management method and device, computer equipment and storage medium
CN108804568B (en) Method and device for storing copy data in Openstack in ceph
CN113157549A (en) Software code testing system
CN111555918B (en) Return source optimization method and device and electronic equipment
CN115361295A (en) Resource backup method, device, equipment and medium based on TOPSIS
CN111884932B (en) Link determining method, device, equipment and computer readable storage medium
US20080125878A1 (en) Method and system to detect application non-conformance
CN112783673A (en) Method and device for determining call chain, computer equipment and storage medium

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