CN113259189A - VNF deployment method and device based on non-uniform service and electronic equipment - Google Patents
VNF deployment method and device based on non-uniform service and electronic equipment Download PDFInfo
- Publication number
- CN113259189A CN113259189A CN202110798409.2A CN202110798409A CN113259189A CN 113259189 A CN113259189 A CN 113259189A CN 202110798409 A CN202110798409 A CN 202110798409A CN 113259189 A CN113259189 A CN 113259189A
- Authority
- CN
- China
- Prior art keywords
- link
- server node
- deployment
- network
- weighted
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
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
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a VNF deployment method, a VNF deployment device and electronic equipment based on non-uniform services, which relate to the technical field of communication and comprise the steps of obtaining network topology information and SFC strategy information of a network to be optimized; determining the service strength of each link and the weighted intermediate centrality of each server node based on the flow packet length of the link and the average packet arrival rate of the link; determining all selectable deployment schemes of the SFC strategy set based on preset constraint conditions; and performing priority ranking on all the optional deployment schemes based on the time delay information of the link, the service strength of the link and the weighted intermediary centrality of the server node, and performing VNF deployment on the network to be optimized based on the deployment scheme corresponding to the highest priority. The method introduces the service strength of the link and the weighted intermediary centrality of the server node into a deployment decision, avoids the influence of uneven service distribution of different links on the effectiveness of a deployment result, and improves the universality of the VNF deployment method on different network environments.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a VNF deployment method and apparatus based on non-uniform services, and an electronic device.
Background
Deployment of Virtual Network Functions (VNFs) is a key field of Network Function Virtualization (NFV) technology research. Under the conditions of limited network resources and known network topology, how to design a flexible and efficient deployment strategy is to place different VNFs in appropriate server nodes in a network according to the requirements of network service functions, so as to reduce the complexity of network transmission, improve the utilization rate of network resources and optimize the overall performance of the network, which is a major challenge in the NFV technical development.
In the prior art, methods such as deploying VNFs based on shortest paths or deploying VNFs based on node physical properties are commonly used, but the existing methods are all designed on the premise that user service distribution is uniform, and in a scene where link service traffic is not uniformly distributed, the effectiveness of a deployment result is seriously affected by dynamic changes of network loads.
Disclosure of Invention
The invention aims to provide a VNF deployment method, a VNF deployment device and electronic equipment based on non-uniform services, so that adverse effects of non-uniform distribution of services of different links on the effectiveness of a deployment result are avoided, and the universality of the VNF deployment method on different network environments is improved.
In a first aspect, the present invention provides a VNF deployment method based on non-uniform services, including: acquiring network topology information and SFC strategy information of a network to be optimized; wherein the network topology information includes: the total resource amount of each server node, the time delay information of each link, the flow packet length of each link and the average packet arrival rate of each link; the SFC policy information includes: the resource demand of any VNF instance in the SFC strategy set and each SFC strategy; determining a traffic strength of each of the links and a weighted intermediary centrality of each of the server nodes based on a traffic packet length of the links and an average packet arrival rate of the links; determining all selectable deployment schemes of the SFC strategy set based on preset constraint conditions; wherein the preset constraint condition comprises: the VNF instances in all the SFC policies deploy corresponding server nodes, and the total amount of resources of any server node is larger than or equal to the sum of the resource demands of the VNF instances deployed on the server node; and performing priority ranking on all the optional deployment schemes based on the time delay information of the link, the service strength of the link and the weighted intermediary centrality of the server node, and performing VNF deployment on the network to be optimized based on the deployment scheme corresponding to the highest priority.
In an alternative embodiment, determining the traffic strength of each of the links and the weighted mediation level of each of the server nodes based on the traffic packet lengths of the links and the average packet arrival rates of the links comprises: based on the formula
Determining the service intensity of each link; wherein the content of the first and second substances,
indicating the length of the traffic packet for link r,
representing the average packet arrival rate of the link r,
represents the traffic strength of the link r; and determining the weighted mediation degree of each server node based on the service intensity of the link and the network topology structure of the network to be optimized.
In an optional embodiment, determining the weighted mediation degree of each server node based on the traffic intensity of the link and the network topology of the network to be optimized includes: determining a shortest path set between a first server node and a second server node based on a network topology structure of the network to be optimized, and a target path subset in the shortest path set; the first server node is any one server node in the network to be optimized; the target path subset is a path set passing through a target server node; determining link traffic strength sums for the shortest path set and link traffic strength sums for the target path subset based on traffic strengths for the links; determining a weighted mediation level of the target server node based on the link traffic strengths of the target subset of paths and the link traffic strengths of the set of shortest paths.
In an alternative embodiment, determining the weighted mediation degree of the target server node based on the link traffic strengths of the target path subset and the link traffic strengths of the shortest path set comprises: based on the formula
Determining a weighted intermediary centrality of the target server node; wherein the content of the first and second substances,
representing the weighted broker centrality of the target server node p,
，
o represents a set of all server nodes in the network to be optimized, F represents a shortest path set between a first server node i and a second server node j, F represents a target path subset in the shortest path set F,
representing the traffic intensity of link e;
represents a sum of link traffic strengths of a set of shortest paths between the first server node i and the second server node j,
representing the sum of link traffic strengths of the target path subset f.
In an optional embodiment, prioritizing all the optional deployment schemes based on the latency information of the link, the traffic strength of the link, and the weighted broker centrality of the server node includes: acquiring a time period of statistical average of link flow; determining a network topology equivalence factor of each link based on the time period and the service intensity of each link; determining the path delay of each link after network topology weighted conversion based on the network topology equivalent factor of each link and the delay information of each link; and performing priority sequencing on all the optional deployment schemes based on the path delay of each link after the network topology weighted conversion and the weighted intermediary centrality of each server node.
In an optional embodiment, determining a network topology equivalence factor of each link based on the time period and the traffic intensity of each link includes: based on the formula
Determining a network topology structure equivalent factor of each link; wherein the content of the first and second substances,
representing neighbor server node n1And n2The network topology equivalence factor of the links between,
representing a neighbor server node n at time t1And n2The strength of the traffic of the link between them,
represents t0Time neighbor server node n1And n2Traffic strength of the link between, t1Time starting point, t, representing statistical link traffic intensity2Time end point representing statistical link traffic intensity, T = T2-t1Representing a time period over which the link traffic is statistically averaged.
In an optional embodiment, the path delay after performing network topology weighted transformation based on each link and each link are used for determining the path delayPrioritizing all of the alternative deployment scenarios by the weighted intermediary centrality of the server nodes comprises: based on the formula
Determining a deployment score for the target alternative deployment scenario; wherein C represents the total number of SFC policies in the SFC policy set,
indicating the number of VNF instances in the kth SFC policy,
representing a server node deployed by an ith VNF instance in a kth SFC policy
Server node deployed with i +1 th VNF instance
The path delay of the link between the two nodes after the weighted conversion of the network topology,
representing a server node deployed by an ith VNF instance in a kth SFC policy
The weighted mean centrality of the network system,
a deployment score representing the target alternative deployment scenario; prioritizing all of the alternative deployment scenarios based on their deployment scores.
In a second aspect, the present invention provides a non-uniform service-based VNF deployment apparatus, including: the acquisition module is used for acquiring network topology information and SFC strategy information of a network to be optimized; wherein the network topology information includes: the total resource amount of each server node, the time delay information of each link, the flow packet length of each link and the average packet arrival rate of each link; the SFC policy information includes: the resource demand of any VNF instance in the SFC strategy set and each SFC strategy; a first determining module, configured to determine a traffic strength of each of the links and a weighted broker centrality of each of the server nodes based on a traffic packet length of the links and an average packet arrival rate of the links; a second determining module, configured to determine all selectable deployment schemes of the SFC policy set based on preset constraints; wherein the preset constraint condition comprises: the VNF instances in all the SFC policies deploy corresponding server nodes, and the total amount of resources of any server node is larger than or equal to the sum of the resource demands of the VNF instances deployed on the server node; and the sequencing deployment module is used for carrying out priority sequencing on all the optional deployment schemes based on the time delay information of the link, the service strength of the link and the weighted intermediary centrality of the server node, and carrying out VNF deployment on the network to be optimized based on the deployment scheme corresponding to the highest priority.
In a third aspect, the present invention provides an electronic device, comprising a memory and a processor, wherein the memory stores a computer program operable on the processor, and the processor executes the computer program to implement the steps of the method according to any of the foregoing embodiments.
In a fourth aspect, the invention provides a computer readable medium having non-volatile program code executable by a processor, the program code causing the processor to perform the method of any of the preceding embodiments.
The invention provides a VNF deployment method based on non-uniform services, which comprises the following steps: acquiring network topology information and SFC strategy information of a network to be optimized; wherein the network topology information includes: the total resource amount of each server node, the time delay information of each link, the flow packet length of each link and the average packet arrival rate of each link; the SFC policy information includes: the resource demand of any VNF instance in the SFC strategy set and each SFC strategy; determining the service strength of each link and the weighted intermediate centrality of each server node based on the flow packet length of the link and the average packet arrival rate of the link; determining all selectable deployment schemes of the SFC strategy set based on preset constraint conditions; wherein the preset constraint condition comprises: the VNF instances in all the SFC policies deploy corresponding server nodes, and the total amount of resources of any server node is larger than or equal to the sum of the resource demands of the VNF instances deployed on the server node; and performing priority ranking on all the optional deployment schemes based on the time delay information of the link, the service strength of the link and the weighted intermediary centrality of the server node, and performing VNF deployment on the network to be optimized based on the deployment scheme corresponding to the highest priority.
According to the VNF deployment method based on the non-uniform service, after the network topology information and the SFC strategy information of a network to be optimized are obtained, and all selectable deployment schemes of the SFC strategy set are determined according to the preset constraint conditions, aiming at the characteristic of dynamic change of network loads, under the scene that link service distribution is non-uniform, besides link time delay, the service strength of a link and the weighted intermediary centrality of a server node are introduced into a deployment decision, so that the adverse effect of non-uniform distribution of different link services on the effectiveness of a deployment result is avoided, and the universality of the VNF deployment method to different network environments is improved.
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, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a flowchart of a VNF deployment method based on non-uniform services according to an embodiment of the present invention;
fig. 2 is a flowchart for determining a weighted intermediary centrality of each server node based on a service strength of a link and a network topology of a network to be optimized according to an embodiment of the present invention;
fig. 3 is a flowchart of prioritizing all the optional deployment schemes based on the delay information of the link, the service strength of the link, and the weighted intermediary centrality of the server node according to the embodiment of the present invention;
fig. 4 is a functional block diagram of a non-uniform service based VNF deployment apparatus according to an embodiment of the present invention;
fig. 5 is a schematic diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, 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 some, but not all, embodiments of the present invention. The components of embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations.
Thus, the following detailed description of the embodiments of the present invention, presented in the figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of selected embodiments of the invention. 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.
Some embodiments of the invention are described in detail below with reference to the accompanying drawings. The embodiments described below and the features of the embodiments can be combined with each other without conflict.
Network Function Virtualization (NFV) technology plays an important role in modern networks. Modern networks are large in scale, complex in function, diverse in application mode and explosive in user number, while traditional network services are provided through dedicated hardware, and are expensive and difficult to manage and maintain. The NFV technology decouples software functions and special hardware equipment, uses a general server as a bottom layer physical resource, reduces the cost of network services, and simultaneously, the realization based on software also enables the deployment of the network functions to be more flexible, the management to be more convenient and faster, and the optimization of a transmission mode to be possible.
Deployment of Virtual Network Functions (VNFs) is a key area of NFV technology research. Deployment of VNFs requires that the manager collect network state information from nodes in the network and base the deployment decision on this. The network state information is mainly the service distribution of various network services on the network topology and the links. The main influencing factors for VNF deployment are therefore the network topology and the traffic distribution of the users. In order to facilitate processing, an existing VNF deployment algorithm generally assumes that traffic distribution of users is uniform, so that a VNF deployment problem can be converted into a VNF problem based on a network topology without considering the traffic distribution problem, and VNF node positions are designed and deployed based on the topology.
In the prior art, a VNF deployment method is commonly used for deploying VNFs based on a shortest path, or for deploying VNFs based on node physical performance, and the like, wherein when a VNF is deployed based on a shortest path in a large network, if traffic suddenly increases in the network, the deployment manner of local optimization may cause a local network to be paralyzed and affect the overall performance of the network, resulting in a large amount of link transmission and VNF processing delay; if the method of deploying VNFs based on node physical performance is used when the physical resources of the nodes are abundant, VNFs may be concentrated on a small portion of server nodes, so that a portion of traffic flow has to pass through a long path to be routed to a high-performance server node in the VNF set for processing, resulting in a high transmission delay.
As can be seen from the above description, the existing VNF deployment algorithm generally assumes that user traffic distribution in a network is uniform, and the method of selecting a deployment location based on a shortest path and the method of selecting a deployment location based on a physical property of a node also have a local effectiveness problem and a deployment centralization problem, respectively, and cannot fully utilize network resources. In view of the above, embodiments of the present invention provide a VNF deployment method based on non-uniform services, so as to alleviate the technical problems mentioned above.
Example one
Fig. 1 is a flowchart of a VNF deployment method based on non-uniform services according to an embodiment of the present invention, and as shown in fig. 1, the method specifically includes the following steps:
and step S102, acquiring network topology information and SFC strategy information of a network to be optimized.
Specifically, in order to guide an SDN (Software Defined Network) controller to make a reasonable resource management scheme and meet the requirements of modern Network users, in the embodiment of the present invention, when VNF deployment is performed, Network topology information and SFC policy information of a Network to be optimized need to be obtained first, where the Network topology information includes: the total resource amount of each server node, the time delay information of each link, the flow packet length of each link and the average packet arrival rate of each link.
When determining network topology information, an SDN controller firstly sends query requests to all nodes in a network to be optimized, and then the SDN controller can acquire the state (available state or unavailable state) of each server node, the available port of each server node, the total resource amount of each server node, the delay information of each link, the flow packet length of each link and the average packet arrival rate of each link according to the response information of the server nodes; the packet length is the data packet length, and for a data stream, the packet length is generally fixed and can be directly obtained from a receiving end server node; the packet arrival rate, i.e., the number of data packets arriving per unit time, may be the number of data packet arrivals in a period of time divided by the length of time.
The SFC (Service Function Chain) is a VNF sequence (traversal policy) customized according to a user traffic demand, and the SFC policy information of the network to be optimized represents demand information of a user for performing VNF deployment on the network to be optimized, that is, the user traffic needs to traverse a series of VNF instances in the network to be optimized in a predefined order to be processed, and then reaches a destination port.
In the embodiment of the present invention, the SFC policy information includes: the set of SFC policies and the resource requirements of any VNF instance in each SFC policy. The SFC policy set is a set representing all SFC policies, each SFC policy is a VNF sequence having a predefined traversal order, the detailed information of each SFC policy can be obtained from response information returned by a source server node of the SFC policy, the detailed information of the SFC policy includes the resource demand of each VNF instance in the SFC policy besides the VNF traversal order, and the SFC policy information can be obtained by integrating the response information of the source server nodes of all the SFC policies.
And step S104, determining the service intensity of each link and the weighted intermediate centrality of each server node based on the flow packet length of the link and the average packet arrival rate of the link.
The Betweeness Centricity (BC) is an index commonly used for measuring centricity, and refers to a ratio of the number of paths passing through a server node (hereinafter referred to as a node) in the shortest paths between any two points in a network to the total number of the shortest paths between any two points. The larger the intermediary centrality of the server node is, the higher the service coverage of the node in the network is, that is, most of the data stream needs to propagate through the node, and the larger the influence of the node in the whole network is, that is, the network service deployed here will affect the performance of a large number of other server nodes in the network.
After the network topology information of the network to be optimized is obtained, the service strength of each link and the weighted intermediary centrality of each server node can be determined according to the flow packet length of the link and the average packet arrival rate of the link. In the embodiment of the invention, the service strength of the link is related to the flow packet length and the average packet arrival rate of the link; the weighted intermediary centrality of the server node is used for reflecting the network service coverage degree of the server node, and on the basis of the intermediary centrality of the server node, the service strength of the server node and the link is added as the weight of each link state, so that the influence of the difference of the load data flow among different links on VNF deployment is avoided, and the VNF deployment is guided by the more accurate network service coverage degree of the server node, so that the method has stronger universality on a network environment.
And step S106, determining all selectable deployment schemes of the SFC strategy set based on preset constraint conditions.
After obtaining the SFC policy information and the network topology information of the network to be optimized, the embodiment of the present invention further needs to determine all selectable deployment schemes of the SFC policy set according to a preset constraint condition, where each deployment scheme corresponds to a VNF deployment mode of each SFC policy in the SFC policy set, and the VNF deployment mode includes selection of a server node and all link information of a path; wherein the preset constraint condition comprises: the VNF instances in all the SFC policies deploy corresponding server nodes, and the total amount of resources of any server node is greater than or equal to the sum of the resource demands of the VNF instances deployed thereon.
Generally, SFC strategy information, network topology information and preset constraint conditions are simulated through matlab, and all feasible solutions obtained represent all selectable deployment schemes. The embodiment of the invention does not specifically limit the method for determining the selectable deployment scheme, and the user can select the selectable deployment scheme according to the actual situation.
And S108, performing priority ordering on all the selectable deployment schemes based on the time delay information of the link, the service strength of the link and the weighted intermediary centrality of the server node, and performing VNF deployment on the network to be optimized based on the deployment scheme corresponding to the highest priority.
After all the optional deployment schemes are obtained, priority ranking is performed on all the optional deployment schemes by combining the delay information of the links, the service strength of the links and the weighted intermediary centrality of the server nodes, for example, ranking can be performed by means of scoring on each optional deployment scheme, the advantages and the disadvantages of the deployment schemes are determined according to the scores, the priorities of the deployment schemes are further obtained, and finally VNF deployment is performed on the network to be optimized according to the deployment scheme corresponding to the highest priority.
According to the VNF deployment method based on the non-uniform service, after the network topology information and the SFC strategy information of a network to be optimized are obtained, and all selectable deployment schemes of the SFC strategy set are determined according to the preset constraint conditions, aiming at the characteristic of dynamic change of network loads, under the scene that link service distribution is non-uniform, besides link time delay, the service strength of a link and the weighted intermediary centrality of a server node are introduced into a deployment decision, so that the adverse effect of non-uniform distribution of different link services on the effectiveness of a deployment result is avoided, and the universality of the VNF deployment method to different network environments is improved.
The VNF deployment method based on non-uniform services provided in the embodiment of the present invention is briefly described above, and related method steps involved in the VNF deployment method are specifically described below.
In an optional implementation manner, in the step S104, determining the service strength of each link and the weighted intermediary centrality of each server node based on the traffic packet length of the link and the average packet arrival rate of the link specifically includes the following steps:
step S1041, based on the formula
The traffic strength of each link is determined.
Specifically, as can be seen from the foregoing description, the traffic strength of each link is related to the traffic packet length and average packet arrival rate of the link, and in the embodiment of the present invention, the formula is specifically used
Calculating the traffic intensity of the link; wherein the content of the first and second substances,
indicating the length of the traffic packet for link r,
to representThe average packet arrival rate of the link r,
indicating the traffic strength of link r.
Step S1042, determining the weighted intermediary centrality of each server node based on the service intensity of the link and the network topology of the network to be optimized.
After the service strengths of all links in the network to be optimized are calculated by using the formula provided in step S1041, the weighted intermediary centrality of each server node can be further determined according to the network topology of the network to be optimized and the service strengths of all links.
Optionally, as shown in fig. 2, in the step S1042, the determining the weighted intermediary centrality of each server node based on the service strength of the link and the network topology of the network to be optimized specifically includes the following steps:
step S10421, determining a shortest path set between the first server node and the second server node and a target path subset in the shortest path set based on the network topology of the network to be optimized.
The weighted mediation level is an improvement based on the mediation level, and the mediation level of any server node can be expressed as
Wherein, in the step (A),
representing the degree of mediation of the target server node p,
，
representing the number of shortest paths between a first server node i and a second server node j;
representing the number of shortest paths between a first server node i and a second server node j through a target server node p, wherein the first server node is any one server node in the network to be optimized; the second server node is a server node different from the first server node in the network to be optimized.
In order to calculate the weighted intermediary centrality of each server node, the shortest path set between a first server node and a second server node and a target path subset in the shortest path set need to be determined according to the network topology structure of the network to be optimized; the target path subset is a path set passing through a target server node; for a first server node i and a second server node j,
the set of paths is the shortest path set,
the set of paths is the target path subset.
Step S10422, determining a link traffic intensity sum of the shortest path set and a link traffic intensity sum of the target path subset based on the traffic intensity of the link.
After the shortest path set and the target path subset are determined, according to the traffic intensities of all links in the network to be optimized calculated in step S1041, the sum of the link traffic intensities of the shortest path set and the sum of the link traffic intensities of the target path subset, which is the sum of the traffic intensities of all links in the set, may be calculated, for example, if the target path subset includes 3 links and the traffic intensities of the 3 links are { a1, a2, a3} respectively, the sum of the link traffic intensities of the target path subset is a1+ a2+ a 3.
Step S10423, determining a weighted mediation degree of the target server node based on the link traffic intensity of the target path subset and the link traffic intensity of the shortest path set.
Specifically, in order to enable the weighted intermediary centrality of the server node to reflect the network service coverage of the server node, the embodiment of the present invention replaces the parameter representing the number of shortest paths in the formula of the intermediary centrality of the server node with the service strength sum of the corresponding path set, and further introduces the link service strength into the calculation to obtain the weighted intermediary centrality of the target server node.
Optionally, in step S10423, determining the weighted intermediary centrality of the target server node based on the link traffic strength of the target path subset and the link traffic strength of the shortest path set, specifically includes the following contents:
based on the formula
Determining a weighted intermediary centrality of the target server node; wherein the content of the first and second substances,
representing the weighted broker centrality of the target server node p,
，
，
o represents the set of all server nodes in the network to be optimized, F represents the shortest path set between the first server node i and the second server node j, F represents the target path subset in the shortest path set F,
representing the traffic intensity of link e;
represents the sum of link traffic strengths of the set of shortest paths between the first server node i and the second server node j,
representing the sum of link traffic strengths of the target path subset f.
The method provided in the foregoing can be used to calculate the weighted intermediary centrality of all server nodes in the network to be optimized and the traffic intensity of each link, and in order to select the optimal deployment method from the selectable deployment schemes, it is also necessary to prioritize all the selectable deployment schemes using the above parameters.
In an optional implementation, as shown in fig. 3, in the step S108, the prioritizing all the optional deployment schemes based on the delay information of the link, the service strength of the link, and the weighted intermediary centrality of the server node specifically includes the following steps:
step S1081, obtaining a time period of the link flow statistics average.
Step S1082, determining a network topology equivalence factor of each link based on the time period and the traffic intensity of each link.
Because the information quantity of the link service intensity in the network is huge and is independent of the network topology, the processing difficulty is high, and in order to reduce the processing complexity, the embodiment of the invention normalizes the link service intensity into the average link service intensity to obtain the equivalent factor of the network topology structure of the uneven service, and weights the existing network topology by using the equivalent factor to convert the difference of the service intensity into the weighting property of the network topology model.
In order to calculate the network topology equivalent factor of each link, firstly, a time period of statistical average of link flow is acquired, and then the network topology equivalent factor of a target link is calculated according to the time period and the service intensity of the target link, wherein the target link represents any link in a network to be optimized.
In an optional embodiment, the determining the network topology equivalence factor of each link based on the time period and the traffic intensity of each link specifically includes the following:
based on the formula
Determining a network topology structure equivalent factor of each link; wherein the content of the first and second substances,
representing neighbor server node n1And n2The network topology equivalence factor of the links between,
representing a neighbor server node n at time t1And n2The strength of the traffic of the link between them,
represents t0Time neighbor server node n1And n2Traffic strength of the link between, t1Time starting point, t, representing statistical link traffic intensity2Time end point representing statistical link traffic intensity, T = T2-t1Representing the time period over which the link traffic is statistically averaged.
The embodiment of the invention does not specifically limit the value of T, and a user can set T according to actual requirements0The method includes that the time when an SDN controller receives an instruction for VNF deployment of a network to be optimized is represented, and if a time factor is introduced into the service strength of a link and the flow packet length of the link is a fixed value, the average packet arrival rate of the link should also take a value under the corresponding time factor.
Step S1083, determining the path delay of each link after the network topology weighted conversion is performed on the link based on the network topology equivalent factor of each link and the delay information of each link.
Network topology in obtaining each linkAfter the structural equivalence factor is captured, the embodiment of the invention utilizes the formula
Calculating the path time delay of each link after network topology weighted conversion; wherein the content of the first and second substances,
representing neighbor server node n1And n2The path delay of the link between the two nodes after the weighted conversion of the network topology,
representing neighbor server node n1And n2The path delay of the link between without network topology weighted translation,
representing the network topology equivalence factor of the link between the neighbor server nodes n1 and n 2.
By using the methods provided in the above steps S1081 to S1083, the path delay after performing network topology weighted transformation on each link in the network to be optimized can be calculated.
Step S1084, all the selectable deployment schemes are prioritized based on the path delay after the weighted conversion of the network topology is performed on each link and the weighted intermediary centrality of each server node.
According to the definitions of the path delay and the weighted intermediary centrality, the smaller the path delay, the better the deployment scheme, and the higher the weighted intermediary centrality of the server node used in the scheme, the better. Therefore, after the path delay of each link in the network to be optimized after the network topology weighted conversion is performed and the weighted intermediary centrality of each server node in the network to be optimized are obtained, the quality of each optional deployment scheme can be quantified through the data, and the priorities of all the optional deployment schemes can be sorted. The embodiment of the invention does not specifically limit the quality quantification means, and a user can set according to actual requirements as long as the method can meet the influence trend (forward influence and reverse influence) of the path delay and the weighted intermediary centrality on the quality of the deployment scheme.
In an optional embodiment, in step S1084, the priority ranking is performed on all the optional deployment schemes based on the path delay after the weighted conversion of the network topology is performed on each link and the weighted intermediary centrality of each server node, which specifically includes the following steps:
step S10841, based on the formula
A deployment score for the target alternative deployment scenario is determined.
Specifically, the embodiment of the present invention calculates the deployment score of the target alternative deployment scenario by using the above formula, where C represents the total number of SFC policies in the SFC policy set,
indicating the number of VNF instances in the kth SFC policy,
representing a server node deployed by an ith VNF instance in a kth SFC policy
Server node deployed with i +1 th VNF instance
The path delay of the link between the two nodes after the weighted conversion of the network topology,
representing a server node deployed by an ith VNF instance in a kth SFC policy
The weighted mean centrality of the network system,
a deployment score representing a target alternative deployment scenario.
The deployment scores of all the selectable deployment schemes can be calculated by using the above formula, and the expression of the deployment scores shows that the smaller the path delay is, the fewer the deployment scores are when the weighted intermediaries of the server nodes used in the deployment schemes are the same; under the condition of the same path delay, the larger the weighted mediation degree of the server nodes used in the deployment scheme is, the less the deployment score is. From the above analysis, it can be seen that alternative deployment scenarios with lower deployment scores are superior.
Step S10842, prioritizing all of the alternative deployment scenarios based on their deployment scores.
The lower the deployment score is, the better the deployment score is, when all the optional deployment schemes are prioritized, the lower the deployment score is, the highest the deployment scheme priority is, and so on, all the optional deployment schemes are prioritized, and VNF deployment is performed on the network to be optimized according to the deployment scheme corresponding to the highest priority, thereby completing VNF deployment optimization of the network to be optimized.
The existing VNF deployment method is limited by the assumption of uniform network user service distribution, and the effectiveness of the deployment result is seriously influenced by the dynamic change of network load under the scene of uneven link service flow distribution. According to the VNF deployment method based on the non-uniform service, provided by the embodiment of the invention, aiming at the characteristic of dynamic change of network load, under the scene of non-uniform distribution of link service, the service intensity of a link and the weighted intermediary center degree of a server node are introduced into a deployment decision, so that the adverse effect of non-uniform distribution of different link service on the effectiveness of a deployment result is avoided, and the universality of the VNF deployment method on different network environments is improved. In addition, the method of the invention also introduces the equivalent factor of the network topology structure of the uneven service, converts the uneven distribution of the user service into the weighting of the network topology model, decouples the mutually coupled network static topology and the link dynamic service distribution, decomposes and converts the problems into the mutually independent flow service distribution conversion problem and the network topology analysis problem, simplifies the analysis difficulty of the network model and reduces the processing complexity of the algorithm.
Example two
The embodiment of the present invention further provides a non-uniform service-based VNF deployment apparatus, which is mainly used for executing the non-uniform service-based VNF deployment method provided in the first embodiment of the present invention, and the non-uniform service-based VNF deployment apparatus provided in the embodiment of the present invention is specifically described below.
Fig. 4 is a functional block diagram of a non-uniform service based VNF deployment apparatus according to an embodiment of the present invention, and as shown in fig. 4, the apparatus mainly includes: an obtaining module 10, a first determining module 20, a second determining module 30, and a ranking deployment module 40, wherein:
an obtaining module 10, configured to obtain network topology information and SFC policy information of a network to be optimized; wherein the network topology information includes: the total resource amount of each server node, the time delay information of each link, the flow packet length of each link and the average packet arrival rate of each link; the SFC policy information includes: the set of SFC policies and the resource requirements of any VNF instance in each SFC policy.
A first determining module 20, configured to determine the traffic strength of each link and the weighted intermediary centrality of each server node based on the traffic packet length of the link and the average packet arrival rate of the link.
A second determining module 30, configured to determine all selectable deployment scenarios of the SFC policy set based on preset constraints; wherein the preset constraint condition comprises: the VNF instances in all the SFC policies deploy corresponding server nodes, and the total amount of resources of any server node is greater than or equal to the sum of the resource demands of the VNF instances deployed thereon.
And the sequencing deployment module 40 is configured to perform priority sequencing on all the selectable deployment schemes based on the delay information of the link, the service strength of the link, and the weighted intermediary centrality of the server node, and perform VNF deployment on the to-be-optimized network based on the deployment scheme corresponding to the highest priority.
According to the VNF deployment device based on the non-uniform service, provided by the embodiment of the invention, after the network topology information and the SFC strategy information of the network to be optimized are obtained, and all selectable deployment schemes of the SFC strategy set are determined according to the preset constraint conditions, aiming at the characteristic of dynamic change of network load, under the scene of non-uniform distribution of link services, besides link time delay, the service strength of a link and the weighted intermediary centrality of a server node are introduced into a deployment decision, so that the adverse effect of non-uniform distribution of different link services on the effectiveness of a deployment result is avoided, and the universality of the VNF deployment method on different network environments is improved.
Optionally, the first determining module 20 includes:
a first determination unit for determining whether the first determination unit is based on an equation
Determining the service intensity of each link; wherein the content of the first and second substances,
indicating the length of the traffic packet for link r,
representing the average packet arrival rate of the link r,
indicating the traffic strength of link r.
And the second determining unit is used for determining the weighted mediation degree of each server node based on the service intensity of the link and the network topology structure of the network to be optimized.
Optionally, the second determining unit includes:
the first determining subunit is used for determining a shortest path set between the first server node and the second server node and a target path subset in the shortest path set based on the network topology structure of the network to be optimized; the first server node is any one server node in the network to be optimized; the target path subset is a set of paths through the target server node.
And the second determining subunit is used for determining the link traffic intensity sum of the shortest path set and the link traffic intensity sum of the target path subset based on the traffic intensity of the link.
And a third determining subunit, configured to determine a weighted intermediary centrality of the target server node based on the link traffic strengths of the target path subset and the link traffic strengths of the shortest path set.
Optionally, the third determining subunit is specifically configured to:
based on the formula
Determining a weighted intermediary centrality of the target server node; wherein the content of the first and second substances,
representing the weighted broker centrality of the target server node p,
，
o represents the set of all server nodes in the network to be optimized, F represents the shortest path set between the first server node i and the second server node j, F represents the target path subset in the shortest path set F,
representing the traffic intensity of link e;
represents the sum of link traffic strengths of the set of shortest paths between the first server node i and the second server node j,
representing the sum of link traffic strengths of the target path subset f.
Optionally, the sequencing deployment module 40 includes:
and the obtaining unit is used for obtaining the time period of the statistical average of the link flow.
And a third determining unit, configured to determine a network topology equivalence factor of each link based on the time period and the traffic intensity of each link.
And the fourth determining unit is used for determining the path delay of each link after the network topology weighted conversion is carried out on each link based on the network topology equivalent factor of each link and the delay information of each link.
And the sequencing unit is used for carrying out priority sequencing on all the selectable deployment schemes based on the path delay after the weighted conversion of the network topology is carried out on each link and the weighted intermediary centrality of each server node.
Optionally, the third determining unit is specifically configured to:
based on the formula
Determining a network topology structure equivalent factor of each link; wherein the content of the first and second substances,
representing neighbor server node n1And n2The network topology equivalence factor of the links between,
representing a neighbor server node n at time t1And n2The strength of the traffic of the link between them,
represents t0Time neighbor server node n1And n2Traffic strength of the link between, t1Time starting point, t, representing statistical link traffic intensity2Time end point representing statistical link traffic intensity, T = T2-t1Representing the time period over which the link traffic is statistically averaged.
Optionally, the sorting unit is specifically configured to:
all of the alternative deployment scenarios are prioritized based on their deployment scores.
Based on the formula
Determining a deployment score for the target alternative deployment scenario; wherein C represents the total number of SFC policies in the SFC policy set,
indicating the number of VNF instances in the kth SFC policy,
representing a server node deployed by an ith VNF instance in a kth SFC policy
Server node deployed with i +1 th VNF instance
The path delay of the link between the two nodes after the weighted conversion of the network topology,
representing a server node deployed by an ith VNF instance in a kth SFC policy
The weighted mean centrality of the network system,
a deployment score representing a target alternative deployment scenario.
All of the alternative deployment scenarios are prioritized based on their deployment scores.
EXAMPLE III
Referring to fig. 5, an embodiment of the present invention provides an electronic device, including: a processor 60, a memory 61, a bus 62 and a communication interface 63, wherein the processor 60, the communication interface 63 and the memory 61 are connected through the bus 62; the processor 60 is arranged to execute executable modules, such as computer programs, stored in the memory 61.
The Memory 61 may include a high-speed Random Access Memory (RAM) and may also include a non-volatile Memory (non-volatile Memory), such as at least one disk Memory. The communication connection between the network element of the system and at least one other network element is realized through at least one communication interface 63 (which may be wired or wireless), and the internet, a wide area network, a local network, a metropolitan area network, and the like can be used.
The bus 62 may be an ISA bus, PCI bus, EISA bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one double-headed arrow is shown in FIG. 5, but this does not indicate only one bus or one type of bus.
The memory 61 is used for storing a program, the processor 60 executes the program after receiving an execution instruction, and the method executed by the apparatus defined by the flow process disclosed in any of the foregoing embodiments of the present invention may be applied to the processor 60, or implemented by the processor 60.
The processor 60 may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware or instructions in the form of software in the processor 60. The Processor 60 may be a general-purpose Processor, and includes a Central Processing Unit (CPU), a Network Processor (NP), and the like; the device can also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field-Programmable Gate Array (FPGA), or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components. The various methods, steps and logic blocks disclosed in the embodiments of the present invention may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of the method disclosed in connection with the embodiments of the present invention may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor. The software module may be located in ram, flash memory, rom, prom, or eprom, registers, etc. storage media as is well known in the art. The storage medium is located in a memory 61, and the processor 60 reads the information in the memory 61 and, in combination with its hardware, performs the steps of the above method.
The VNF deployment method, apparatus, and computer program product of an electronic device based on non-uniform services provided in the embodiments of the present invention include a computer-readable storage medium storing a non-volatile program code executable by a processor, where instructions included in the program code may be used to execute the method described in the foregoing method embodiments, and specific implementation may refer to the method embodiments, and will not be described herein again.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a non-volatile computer-readable storage medium executable by a processor. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures.
In the description of the present invention, it should be noted that the terms "center", "upper", "lower", "left", "right", "vertical", "horizontal", "inner", "outer", etc. indicate orientations or positional relationships based on the orientations or positional relationships shown in the drawings or the orientations or positional relationships that the products of the present invention are conventionally placed in use, and are only used for convenience in describing the present invention and simplifying the description, but do not indicate or imply that the devices or elements referred to must have a specific orientation, be constructed and operated in a specific orientation, and thus, should not be construed as limiting the present invention. Furthermore, the terms "first," "second," "third," and the like are used solely to distinguish one from another and are not to be construed as indicating or implying relative importance.
Furthermore, the terms "horizontal", "vertical", "overhang" and the like do not imply that the components are required to be absolutely horizontal or overhang, but may be slightly inclined. For example, "horizontal" merely means that the direction is more horizontal than "vertical" and does not mean that the structure must be perfectly horizontal, but may be slightly inclined.
In the description of the present invention, it should also be noted that, unless otherwise explicitly specified or limited, the terms "disposed," "mounted," "connected," and "connected" are to be construed broadly and may, for example, be fixedly connected, detachably connected, or integrally connected; can be mechanically or electrically connected; they may be connected directly or indirectly through intervening media, or they may be interconnected between two elements. The specific meanings of the above terms in the present invention can be understood in specific cases to those skilled in the art.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.
Claims (10)
1. A VNF deployment method based on non-uniform services is characterized by comprising the following steps:
acquiring network topology information and SFC strategy information of a network to be optimized; wherein the network topology information includes: the total resource amount of each server node, the time delay information of each link, the flow packet length of each link and the average packet arrival rate of each link; the SFC policy information includes: the resource demand of any VNF instance in the SFC strategy set and each SFC strategy;
determining a traffic strength of each of the links and a weighted intermediary centrality of each of the server nodes based on a traffic packet length of the links and an average packet arrival rate of the links;
determining all selectable deployment schemes of the SFC strategy set based on preset constraint conditions; wherein the preset constraint condition comprises: the VNF instances in all the SFC policies deploy corresponding server nodes, and the total amount of resources of any server node is larger than or equal to the sum of the resource demands of the VNF instances deployed on the server node;
and performing priority ranking on all the optional deployment schemes based on the time delay information of the link, the service strength of the link and the weighted intermediary centrality of the server node, and performing VNF deployment on the network to be optimized based on the deployment scheme corresponding to the highest priority.
2. The method of claim 1, wherein determining the traffic strength of each of the links and the weighted intermediary centrality of each of the server nodes based on the traffic packet lengths of the links and the average packet arrival rates of the links comprises:
based on the formula
Determining the service intensity of each link; wherein the content of the first and second substances,
indicating the length of the traffic packet for link r,
representing the average packet arrival rate of the link r,
represents the traffic strength of the link r;
and determining the weighted mediation degree of each server node based on the service intensity of the link and the network topology structure of the network to be optimized.
3. The method of claim 2, wherein determining the weighted mediation level for each of the server nodes based on the traffic strength of the links and the network topology of the network to be optimized comprises:
determining a shortest path set between a first server node and a second server node based on a network topology structure of the network to be optimized, and a target path subset in the shortest path set; the first server node is any one server node in the network to be optimized; the target path subset is a path set passing through a target server node;
determining link traffic strength sums for the shortest path set and link traffic strength sums for the target path subset based on traffic strengths for the links;
determining a weighted mediation level of the target server node based on the link traffic strengths of the target subset of paths and the link traffic strengths of the set of shortest paths.
4. The method of claim 3, wherein determining a weighted mediation level of the target server node based on the link traffic strengths of the target subset of paths and the link traffic strengths of the set of shortest paths, comprises:
based on the formula
Determining a weighted intermediary centrality of the target server node; wherein the content of the first and second substances,
representing the weighted broker centrality of the target server node p,
，
o represents a set of all server nodes in the network to be optimized, F represents a shortest path set between a first server node i and a second server node j, F represents a target path subset in the shortest path set F,
representing the traffic intensity of link e;
represents a sum of link traffic strengths of a set of shortest paths between the first server node i and the second server node j,
representing the sum of link traffic strengths of the target path subset f.
5. The method of claim 1, wherein prioritizing all of the alternative deployment scenarios based on latency information of the links, traffic strength of the links, and weighted broker centrality of the server nodes comprises:
acquiring a time period of statistical average of link flow;
determining a network topology equivalence factor of each link based on the time period and the service intensity of each link;
determining the path delay of each link after network topology weighted conversion based on the network topology equivalent factor of each link and the delay information of each link;
and performing priority sequencing on all the optional deployment schemes based on the path delay of each link after the network topology weighted conversion and the weighted intermediary centrality of each server node.
6. The method of claim 5, wherein determining the network topology equivalence factor for each link based on the time period and the traffic strength of each link comprises:
based on the formula
Determining a network topology structure equivalent factor of each link; wherein the content of the first and second substances,
representing neighbor server node n1And n2The network topology equivalence factor of the links between,
representing a neighbor server node n at time t1And n2The strength of the traffic of the link between them,
represents t0Time neighbor server node n1And n2Traffic strength of the link between, t1Time starting point, t, representing statistical link traffic intensity2Time end point representing statistical link traffic intensity, T = T2-t1Representing a time period over which the link traffic is statistically averaged.
7. The method of claim 5, wherein prioritizing all of the alternative deployment scenarios based on the path delays after weighted network topology translation for each of the links and the weighted intermediary centrality for each of the server nodes comprises:
based on the formula
Determining a deployment score for the target alternative deployment scenario; wherein C represents the total number of SFC policies in the SFC policy set,
indicating the number of VNF instances in the kth SFC policy,
representing a server node deployed by an ith VNF instance in a kth SFC policy
Server node deployed with i +1 th VNF instance
The path delay of the link between the two nodes after the weighted conversion of the network topology,
representing a server node deployed by an ith VNF instance in a kth SFC policy
The weighted mean centrality of the network system,
a deployment score representing the target alternative deployment scenario;
prioritizing all of the alternative deployment scenarios based on their deployment scores.
8. A non-uniform service based VNF deployment apparatus, comprising:
the acquisition module is used for acquiring network topology information and SFC strategy information of a network to be optimized; wherein the network topology information includes: the total resource amount of each server node, the time delay information of each link, the flow packet length of each link and the average packet arrival rate of each link; the SFC policy information includes: the resource demand of any VNF instance in the SFC strategy set and each SFC strategy;
a first determining module, configured to determine a traffic strength of each of the links and a weighted broker centrality of each of the server nodes based on a traffic packet length of the links and an average packet arrival rate of the links;
a second determining module, configured to determine all selectable deployment schemes of the SFC policy set based on preset constraints; wherein the preset constraint condition comprises: the VNF instances in all the SFC policies deploy corresponding server nodes, and the total amount of resources of any server node is larger than or equal to the sum of the resource demands of the VNF instances deployed on the server node;
and the sequencing deployment module is used for carrying out priority sequencing on all the optional deployment schemes based on the time delay information of the link, the service strength of the link and the weighted intermediary centrality of the server node, and carrying out VNF deployment on the network to be optimized based on the deployment scheme corresponding to the highest priority.
9. An electronic device comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor implements the steps of the method of any of claims 1 to 7 when executing the computer program.
10. A computer-readable medium having non-volatile program code executable by a processor, the program code causing the processor to perform the method of any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110798409.2A CN113259189B (en) | 2021-07-15 | 2021-07-15 | VNF deployment method and device based on non-uniform service and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110798409.2A CN113259189B (en) | 2021-07-15 | 2021-07-15 | VNF deployment method and device based on non-uniform service and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113259189A true CN113259189A (en) | 2021-08-13 |
| CN113259189B CN113259189B (en) | 2021-10-15 |
Family
ID=77180366
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110798409.2A Active CN113259189B (en) | 2021-07-15 | 2021-07-15 | VNF deployment method and device based on non-uniform service and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113259189B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108429633A (en) * | 2018-01-18 | 2018-08-21 | 西南交通大学 | Virtual network function dispositions method based on grey wolf algorithm |
| US20190166039A1 (en) * | 2017-11-27 | 2019-05-30 | Beijing University Of Posts & Telecommunications | Method and apparatus for network slice deployment in mobile communication system |
| CN112636991A (en) * | 2021-03-05 | 2021-04-09 | 北京航空航天大学 | Multi-class VNF deployment method based on intermediary centrality |
-
2021
- 2021-07-15 CN CN202110798409.2A patent/CN113259189B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190166039A1 (en) * | 2017-11-27 | 2019-05-30 | Beijing University Of Posts & Telecommunications | Method and apparatus for network slice deployment in mobile communication system |
| CN108429633A (en) * | 2018-01-18 | 2018-08-21 | 西南交通大学 | Virtual network function dispositions method based on grey wolf algorithm |
| CN112636991A (en) * | 2021-03-05 | 2021-04-09 | 北京航空航天大学 | Multi-class VNF deployment method based on intermediary centrality |
Non-Patent Citations (2)
| Title |
|---|
| LIU MINGYUE等: "Research on Optimized Deployment of Virtual Network Functions in", 《JOURNAL OF PHYSICS: CONFERENCE SERIES》 * |
| 唐伦等: "基于改进深度强化学习的虚拟网络功能部署优化算法", 《电子与信息学报》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113259189B (en) | 2021-10-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108121512B (en) | Edge computing service caching method, system and device and readable storage medium | |
| CN108260169B (en) | QoS guarantee-based dynamic service function chain deployment method | |
| Agarwal et al. | Joint VNF placement and CPU allocation in 5G | |
| CN109150627B (en) | Virtual network mapping construction method based on dynamic resource demand and topology perception | |
| Li et al. | Efficient online coflow routing and scheduling | |
| CN108243044B (en) | Service deployment method and device | |
| WO2015101237A1 (en) | Methods, devices, and systems for allocating service nodes in a network | |
| CN112738820A (en) | Dynamic deployment method and device of service function chain and computer equipment | |
| CN109802997B (en) | Node equipment selection method and related equipment thereof | |
| CN109547358B (en) | Method for constructing time-sensitive network slice | |
| CN112039965A (en) | Multitask unloading method and system in time-sensitive network | |
| US20150363240A1 (en) | System for controlling resources, control pattern generation apparatus, control apparatus, method for controlling resources and program | |
| CN109412963B (en) | Service function chain deployment method based on stream splitting | |
| CN114071582A (en) | Service chain deployment method and device for cloud-edge collaborative Internet of things | |
| CN112738812A (en) | Wireless network automatic adjustment method and device, terminal equipment and storage medium | |
| Abreu et al. | A rank scheduling mechanism for fog environments | |
| CN110198332A (en) | Dispatching method, device and the storage medium of content delivery network node | |
| CN109005126A (en) | The processing method and equipment of data flow | |
| Lin et al. | Hierarchical CORD for NFV datacenters: resource allocation with cost-latency tradeoff | |
| CN113300861B (en) | Network slice configuration method, device and storage medium | |
| CN110535705B (en) | Service function chain construction method capable of adapting to user time delay requirement | |
| CN113259189B (en) | VNF deployment method and device based on non-uniform service and electronic equipment | |
| CN109041236B (en) | Wireless resource allocation method and device for services with different weights | |
| Luo et al. | Customizable network update planning in SDN | |
| CN116582493A (en) | Data center network link selection method and device and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |