CN109361547B - Network slice link deployment method and device - Google Patents
Network slice link deployment method and device Download PDFInfo
- Publication number
- CN109361547B CN109361547B CN201811377898.9A CN201811377898A CN109361547B CN 109361547 B CN109361547 B CN 109361547B CN 201811377898 A CN201811377898 A CN 201811377898A CN 109361547 B CN109361547 B CN 109361547B
- Authority
- CN
- China
- Prior art keywords
- network slice
- network
- vnfs
- max
- physical infrastructure
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
Abstract
The invention discloses a network slice link deployment method and a device, wherein the method comprises the steps of acquiring a topological structure of a physical infrastructure network; obtaining attributes of VNFs in the network slices on the physical infrastructure; and selecting VNFs which need to be connected with each other in the network slice according to the attributes of the VNFs, and calculating connection paths among the VNFs based on the maximum forwarding times of routing equipment. In the process of completing the deployment of the network slice link, the invention not only considers the path transmission, but also considers the load conditions of the link and the routing equipment, realizes the overall load balance and reasonably improves the technical effect of the service reliability of the network slice.
Description
Technical Field
The present invention relates to the field of communications, and in particular, to a network slice link deployment method and apparatus.
Background
With the rapid development of communication technology, in order to meet the demands of a plurality of application differentiation, a network slice is used as a new solution, so that a plurality of mutually isolated end-to-end logic networks can be cut off in a physical infrastructure, customized services are provided for different service scenes, and the network slice has an important position in a 5G network technology due to the technical advantages.
In a 5G communication Network based on Software Defined Networking (SDN)/Network Functions Virtualization (NFV), how to effectively deploy Network slices is a problem that must be solved before large-scale commercialization of the 5G Network. In the process of network slice deployment, a mapping relationship between a virtual network and a physical network needs to be realized, so that the deployment of the network slice meets various challenges, and on one hand, in the face of the increasing demand of future mass data traffic, the capacity limit of bottom-layer physical resources needs to be considered to ensure the service quality. On the other hand, 5G requires that the end-to-end delay reaches ms level, breaks through space-time limitation, and brings excellent experience to users, so that a new network slice deployment method is urgently needed to meet the service reliability of network slices.
The network slice deployment problem is mainly divided into mapping of Virtual Network Functions (VNFs) and mapping of Virtual links. The current solution for deployment of network slices mainly aims at mapping VNFs in network slices to physical resource nodes, and after determining a node mapping relationship, a shortest path algorithm is used to determine the use of a physical link. However, such a deployment manner easily brings excessive load to some forwarding devices, and data packets may jam at some key locations, thereby increasing the time delay of data transmission and increasing the probability of packet loss.
Disclosure of Invention
The invention provides a network slice link deployment method, a network slice link deployment device, electronic equipment and a computer readable storage medium.
In a first aspect, the present invention provides a network slice link deployment method.
Specifically, the network slice link deployment method includes:
acquiring a topological structure of a physical infrastructure network;
obtaining attributes of VNFs in the network slices on the physical infrastructure;
and selecting VNFs which need to be connected with each other in the network slice according to the attributes of the VNFs, and calculating connection paths among the VNFs based on the maximum forwarding times of routing equipment.
In a second aspect, an embodiment of the present invention provides a network slice link deployment apparatus.
Specifically, the network slice link deployment device includes:
a first acquisition module configured to acquire a topology of a physical infrastructure network;
a second obtaining module configured to obtain attributes of VNFs in a network slice on the physical infrastructure;
and the calculation module is configured to select VNFs needing to be connected with each other in the network slice according to the attributes of the VNFs, and calculate a connection path between the VNFs based on the maximum forwarding times of the routing equipment.
In a third aspect, an embodiment of the present invention provides an electronic device, including a memory and a processor; the memory is configured to store one or more computer instructions, wherein the one or more computer instructions are configured to be executed by the processor to perform the network slice link deployment method of the first aspect.
In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium for storing computer instructions for a network slice link deployment apparatus, where the computer instructions include computer instructions for executing the network slice link deployment method in the first aspect to the network slice link deployment apparatus.
Based on the simulated annealing algorithm, on the premise that the shortest path algorithm is used as the initial solution, reasonable random disturbance is set, when a more optimal solution appears, the solution is received as a new solution, and a solution worse than the current solution is received as a new solution with a certain probability to avoid falling into local optimization, so that a global optimal deployment scheme is achieved. In the process of completing the deployment of the network slice link, the invention not only considers the path transmission, but also considers the load conditions of the link and the routing equipment, realizes the overall load balance and reasonably improves the technical effect of the service reliability of the network slice.
Drawings
FIG. 1 illustrates a flow diagram of a method for network slice link deployment in accordance with an embodiment of the present invention;
fig. 2 is a schematic diagram illustrating an application scenario of a network slice link deployment method according to an embodiment of the present invention;
FIG. 3 shows a schematic diagram of a network slice link deployment apparatus according to an embodiment of the invention;
FIG. 4 shows a block diagram of an electronic device according to an embodiment of the invention;
fig. 5 is a schematic block diagram of a computer system suitable for use in implementing a network slice link deployment method according to an embodiment of the invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to specific embodiments and the accompanying drawings. It should be understood that the described embodiments of the present invention are only the link deployment process in the network slice deployment, and not the entire deployment process of the network slice, and the premise of the link deployment is the deployment result of the known node. All other embodiments of the present invention that can be realized by a person skilled in the art without inventive work according to the embodiments of the present invention belong to the scope of protection of the present invention. In the following description, a technical explanation of a technique irrelevant to the present invention will be made briefly or will be directly skipped.
In the network slice link deployment strategy in the prior art, the shortest path between VNFs having a connection relationship is mainly calculated through a shortest path algorithm, but directly taking this as a result, the situation that the load of a key node is too high is brought, and the overall load is unbalanced. Aiming at the problems, the invention is based on the simulated annealing algorithm, sets reasonable random disturbance on the premise of taking the shortest path algorithm as the initial solution, receives the optimal solution as a new solution when a better solution appears, and receives a solution worse than the current solution as the new solution with a certain probability to avoid falling into the local optimum, thereby achieving the global optimum deployment scheme. The invention realizes the integral load balance and improves the network performance in the process of completing the deployment of the network slice link.
According to an aspect of the present invention, a network slice link deployment method is provided, where fig. 1 shows a flowchart of the network slice link deployment method according to an embodiment of the present disclosure, and fig. 2 shows a schematic diagram of an application scenario of the network slice link deployment method according to an embodiment of the present disclosure, and as shown in fig. 1 and fig. 2, the method for allocating multi-domain resources in a network slice includes:
step S1: a topology of a physical infrastructure network is obtained.
Because the 5G introduces network function virtualization, the generalization of hardware and the virtualization of functions are realized, the processing unit of the network slice can run in a virtual machine, and each virtual machine needs a universal server as a bearer.
In an embodiment of the present invention, the underlying physical infrastructure includes, but is not limited to, a general-purpose server, a network forwarding device, a physical link, and a special-purpose device, wherein the general-purpose server is used to deploy a functional module supporting virtualization, the special-purpose physical device is used to deploy some components not supporting virtualization, the network forwarding device is used for routing data, and the physical link is used to undertake transmission of data.
In an embodiment of the present invention, the obtained result of the physical infrastructure network topology may be represented by an adjacency matrix.
In an embodiment of the present invention, the step S1, after the step of obtaining the topology of the physical infrastructure network, may further include, but is not limited to, obtaining information of the device represented by each node, a remaining bandwidth of each physical link, and a forwarding frequency per unit time of each network forwarding device.
Step S2: obtaining the attributes of the VNFs in the network slice on the physical infrastructure, where the attributes of the VNFs include, but are not limited to, the type of the VNF, the number of the VNFs, the connection relationship between the VNFs, and the location of the physical node where the VNF is located.
The network slice on the physical infrastructure can be abstracted into a virtual network or a series of service function chains, and the technology can be adopted to provide customized and flexible services for users according to the requirements of the customers. Multiple different mutually independent network slices can be deployed in the same physical infrastructure network, being mutually independent on virtual resources, but they can share the same physical infrastructure. In this embodiment, the network slices are composed of VNFs, which are deployed on different physical nodes and constitute a complete virtual network. In order to develop the deployment work of the network slice link, it is necessary to acquire relevant attributes of the basic component units VNF in the network slice on the physical infrastructure, where the attributes of the VNF include, but are not limited to, the type of the VNF, the number of the VNFs, the connection relationship between the VNFs, and the location of the physical node where the VNF is located. In addition, the location of the physical node in the physical infrastructure network where each network element in the network slice is located may be obtained.
Step S3: and selecting VNFs which need to be connected with each other in the network slice according to the attributes of the VNFs, and calculating connection paths among the VNFs based on the maximum forwarding times of routing equipment.
In the network slice link deployment strategy in the prior art, the shortest path between VNFs having a connection relationship is mainly calculated through a shortest path algorithm, but directly taking this as a result, the situation that the load of a key node is too high is brought, and the overall load is unbalanced. In view of the above problems, the present invention may calculate the connection path between the VNFs based on the maximum forwarding number of the routing device.
In an embodiment of the present invention, the step S3, selecting VNFs that need to be connected to each other in the network slice according to the attributes of the VNFs, and calculating a connection path between the VNFs based on the maximum forwarding number of the routing device, includes steps S31-S34:
step 31, setting the initial state of the network as that VNFs in the network slice that need to be connected to each other are all connected through the shortest path, and in this case, obtaining the usage frequency C of the routing device with the maximum forwarding frequency in the physical infrastructure network in unit timemaxAnd the iteration number K is 0;
in the invention, the network slice link deployment is completed based on the simulated annealing algorithm, the initial solution is very important for the final solution of the simulated annealing algorithm, and the improper selection of the initial solution can cause the need of a large number of iterations to obtain the optimal solution. In this embodiment, a shortest physical path of VNFs that need to be connected to each other in each set of network slices is calculated by using a shortest path algorithm, and the shortest physical path of the VNF is used as an initial solution of a simulated annealing algorithm, because the shortest physical path of the VNF is directly used as a final solution under other deployment strategies, the shortest physical path of the VNF that need to be connected to each other in each set of network slices is selected as the initial solution of the simulated annealing algorithm, so that iteration times can be reduced, an optimal solution can be obtained quickly, and a network slice link can be deployed more efficiently.
Specifically, a shortest path between VNFs having a connection relationship in each network slice is calculated by using a shortest path algorithm, and a path result is stored, where the algorithm needs to determine whether a link to a node currently has sufficient bandwidth in a node traversing process, and if the bandwidth is sufficient, the path is updated, which is specifically expressed as follows:
S0＝{t1，t2，...，ti，...，tn)
ti＝{v11，v12，...，v1k，...，vj1，...，vjk，...，vk1，vk2，...，，vkk}
vjk＝{nj，wl1，wl2，...，nk}
in the above formula, t1，t2，...，ti，...，tnThe index i in (a) represents the network slice i, t that needs to be deployed in the physical infrastructure networkiLink deployment solution, t, representing network slice iiConstituent element v ofjkRepresenting VNFjTo VNFkThe path between, i.e. VNFjTo VNFkThe routing device, n, to be passed betweenjRepresenting VNFj，nkRepresenting VNFk，wl1,wl2,.. representing a VNFjTo VNFkThe forwarding device, S, that needs to pass through0Then representing the set of all network slice link deployment solutions, and using the shortest path algorithm to obtain S0Then, S is added0As an initial solution to the simulated annealing algorithm.
In one embodiment of the present invention, when it is assumed that each network slice randomly generates the same amount of data in a unit time, the usage frequency C of the routing device with the largest forwarding number in the physical infrastructure network in the unit time is obtainedmaxAnd assign a value Cmax＝C0The number of iterations k is noted as 0.
Step 32: randomly selecting a certain network slice i, randomly selecting a plurality of pairs of VNFs with the shortest paths established in the network slice i, and randomly changingTheir paths, a set S of network slice link deployment current solutions in the network is obtainedtAnd obtaining the use frequency C of the routing equipment with the maximum forwarding frequency in the physical infrastructure network in unit timet；
On the premise that the shortest path algorithm is used as an initial solution, in order to obtain a globally optimal deployment scheme, reasonable random disturbance needs to be further set. In an embodiment of the present invention, in the step S32, a certain network slice i is randomly selected, a plurality of pairs of VNFs with the shortest path established therein are randomly selected in the network slice i, and their paths are randomly changed to obtain a set S of current solutions for network slice link deployment in the networktAnd obtaining the use frequency C of the routing equipment with the maximum forwarding frequency in the physical infrastructure network in unit timetIncludes steps S321-S324:
step S321: randomly selecting a certain network slice i, and then at tiIn the method, r pairs of VNFs with connection relations are randomly selected and expressed as
Calculating the Path Length { D ] between each pair of VNFs1，D2，…Di…，DrDi represents the path between the ith pair of VNFs, and the paths obtained in this step are all the shortest paths between VNFs;
step S322: for the ith pair VNF, i, of the randomly selected r pairs of VNFs having a connection relationship, from 1 to r, randomly selecting q routing devices to exchange for its neighbor node, i.e. changing the path between the pair of VNFs, and making a new path pass through the q routing devices, in which case the path length D between the pair of VNFs is calculatedt；
Step S323: according to DtAnd 1.5DiObtaining the set S of the current solution of the network slice link deploymentt；
In particular, if Dt≤1.5DiThen, receiving the Dt, will
Is written into S0In (1), the path between the ith pair of VNFs is updated, and the set of current solutions for the network slice link deployment is recorded as St；
If D ist＞1.5DiAnd then the q routing devices are randomly selected again to continuously change DtThat is, steps S322 and S323 are repeated until condition D is satisfiedt≤1.5DiThen will be
Is written into S0In (1), the current solution set of the network slice link deployment is recorded as St。
The above steps S322 and S323 traverse each of the r pairs of VNFs, so that the resulting StAnd S0In contrast, the path between the r pairs of VNFs is updated and is no longer the shortest path.
In this example, DtAnd DiThe multiple relation is 1.5, which is only exemplary here, and other multiple relations, such as 1.3 or 2, etc., may also be selected according to actual needs, but the path between the selected VNFs is not easily too long, otherwise the service quality is affected. Step S324: obtaining the use frequency C of the routing device with the maximum forwarding frequency in the physical infrastructure network in unit timet。
Specifically, assuming that each network slice randomly generates the same data amount in a unit time, the usage frequency C of the routing device with the largest forwarding number in the physical infrastructure network in the unit time is obtainedt。
In the simulated annealing algorithm, when reasonable random disturbance is set on an initial solution, a more optimal solution appears, the more optimal solution can be accepted as a new solution, and a solution worse than the current solution is accepted as the new solution with a certain probability to avoid falling into local optimum, so that a global optimum deployment scheme is achieved. The shortest physical path of the VNFs needing to be connected with each other in the network slice is calculated by using a shortest path algorithm, and when the shortest physical path of the VNFs is used as an initial solution of a simulated annealing algorithm, physical basic settings in unit time are obtainedFrequency number C of route equipment with maximum forwarding times in networkmax(ii) a After reasonable random disturbance is set for the initial solution, the use frequency C of the routing equipment with the maximum forwarding frequency in the physical infrastructure network in unit time is obtainedtComparing the two values CtAnd CmaxThe magnitude relationship of (1).
Step S33: if Ct<CmaxThen accept the StAnd then C istIs given to Cmax(ii) a If Ct≥CmaxThen with probability e-Δ/TAccepting the StWherein Δ ═ Ct-CmaxWhere T can be sized according to the actual situation, the choice of T will influence StThe accepted probability, T, ranges between 10 and 50, and may include 10 and 50;
step S34: let K be K +1, when a preset condition is satisfied, take the network slice link deployment solution accepted in step S33 as a final solution, otherwise return to step S32.
In this embodiment, the predetermined condition is C within N1 timesmaxNo changes and/or iterations K ≧ N2, where N1 and N2 are fixed values. Specific values of N1 and N2 are not limited in the embodiments of the present invention, for example, N1 is 5000, and N1 is 20000, which means that if C is within 5000 consecutive times, C is not limited to N1 and N2maxNo change or k is more than or equal to 20000, stopping iteration and adding the current StAnd as a final solution, completing the network slice link deployment process.
Based on the simulated annealing algorithm, on the premise that the shortest path algorithm is used as the initial solution, reasonable random disturbance is set, when a more optimal solution appears, the solution is received as a new solution, and a solution worse than the current solution is received as a new solution with a certain probability to avoid falling into local optimization, so that a global optimal deployment scheme is achieved. In the process of completing the deployment of the network slice link, the invention not only considers the path transmission, but also considers the load conditions of the link and the routing equipment, realizes the overall load balance and reasonably improves the technical effect of the service reliability of the network slice.
The following are embodiments of the apparatus of the present invention that may be used to perform embodiments of the method of the present invention.
Fig. 3 shows a block diagram of a network slice link deployment apparatus according to an embodiment of the present disclosure, which may be implemented as part or all of an electronic device by software, hardware, or a combination of both. As shown in fig. 3, the multi-domain resource allocation apparatus in a network slice includes:
a first obtaining module 301 configured to obtain a topology of a physical infrastructure network.
Because the 5G introduces network function virtualization, the generalization of hardware and the virtualization of functions are realized, the processing unit of the network slice can run in a virtual machine, and each virtual machine needs a universal server as a bearer.
In an embodiment of the present invention, the underlying physical infrastructure includes, but is not limited to, a general-purpose server, a network forwarding device, a physical link, and a special-purpose device, wherein the general-purpose server is used to deploy a functional module supporting virtualization, the special-purpose physical device is used to deploy some components not supporting virtualization, the network forwarding device is used for routing data, and the physical link is used to undertake transmission of data.
In an embodiment of the present invention, the obtained result of the physical infrastructure network topology may be represented by an adjacency matrix.
In an embodiment of the present invention, the first obtaining module 301 may further include, but is not limited to, a module configured to obtain device information represented by each node, a remaining bandwidth of each physical link, and a forwarding frequency per unit time of each network forwarding device.
A second obtaining module 302 configured to obtain attributes of VNFs in the network slice on the physical infrastructure, where the attributes of VNFs include, but are not limited to, a category of VNFs, a number of VNFs, a connection relationship between VNFs, and a location of a physical node where the VNF is located.
The network slice on the physical infrastructure can be abstracted into a virtual network or a series of service function chains, and the technology can be adopted to provide customized and flexible services for users according to the requirements of the customers. Multiple different mutually independent network slices can be deployed in the same physical infrastructure network, being mutually independent on virtual resources, but they can share the same physical infrastructure. In this embodiment, the network slices are composed of VNFs, which are deployed on different physical nodes and constitute a complete virtual network. In order to develop the deployment work of the network slice link, it is necessary to acquire relevant attributes of the basic component units VNF in the network slice on the physical infrastructure, where the attributes of the VNF include, but are not limited to, the type of the VNF, the number of the VNFs, the connection relationship between the VNFs, and the location of the physical node where the VNF is located. In addition, the location of the physical node in which each network element in the network slice is located in the physical infrastructure network may be obtained.
A calculating module 303, configured to select VNFs that need to be connected to each other in the network slice according to the attributes of the VNFs, and calculate a connection path between the VNFs based on the maximum forwarding number of the routing device.
In the network slice link deployment strategy in the prior art, the shortest path between VNFs having a connection relationship is mainly calculated through a shortest path algorithm, but directly taking this as a result, the situation that the load of a key node is too high is brought, and the overall load is unbalanced. In view of the above problems, the present invention may calculate the connection path between the VNFs based on the maximum forwarding number of the routing device.
In one embodiment of the present invention, the calculation module includes the steps of:
a first obtaining sub-module configured to set a network initial state as that VNFs required to be connected to each other in the network slice are all connected through a shortest path, in which case, a usage frequency C of a routing device with a maximum forwarding number in the physical infrastructure network is obtained in a unit timemaxAnd the iteration number K is 0;
in the invention, the network slice link deployment is completed based on the simulated annealing algorithm, the initial solution is very important for the final solution of the simulated annealing algorithm, and the improper selection of the initial solution can cause the need of a large number of iterations to obtain the optimal solution. In this embodiment, a shortest physical path of VNFs that need to be connected to each other in each set of network slices is calculated by using a shortest path algorithm, and the shortest physical path of the VNF is used as an initial solution of a simulated annealing algorithm, because the shortest physical path of the VNF is directly used as a final solution under other deployment strategies, the shortest physical path of the VNF that need to be connected to each other in each set of network slices is selected as the initial solution of the simulated annealing algorithm, so that iteration times can be reduced, an optimal solution can be obtained quickly, and a network slice link can be deployed more efficiently.
Specifically, a shortest path between VNFs having a connection relationship in each network slice is calculated by using a shortest path algorithm, and a path result is stored, where the algorithm needs to determine whether a link to a node currently has sufficient bandwidth in a node traversing process, and if the bandwidth is sufficient, the path is updated, which is specifically expressed as follows:
S0＝{t1，t2，…，ti，…，tn}
ti＝{v11，v12，...，v1k，...，vj1，...，vjk，...，vk1，vk2，...，vkk}
vjk＝{nj，wl1，wl2，…，nk}
in the above formula, t1，t2，...，ti，...，tnThe index i in (a) represents the network slice i, t that needs to be deployed in the physical infrastructure networkiLink deployment solution, t, representing network slice iiConstituent element v ofjkRepresenting VNFjTo VNFkThe path between, i.e. VNFjTo VNFkThe routing device, n, to be passed betweenjRepresenting VNFj，nkRepresenting VNFk，wl1,wl2,.. representing a VNFjTo VNFkThe forwarding device, S, that needs to pass through0Then representing the set of all network slice link deployment solutions, and using the shortest path algorithm to obtain S0Then, S is added0As an initial solution to the simulated annealing algorithm.
In one embodiment of the present invention, when it is assumed that each network slice randomly generates the same amount of data in a unit time, the usage frequency C of the routing device with the largest forwarding number in the physical infrastructure network in the unit time is obtainedmaxAnd assign a value Cmax＝C0The number of iterations k is noted as 0.
A second obtaining submodule configured to randomly select a certain network slice i, randomly select a plurality of pairs of VNFs with established shortest paths in the network slice i, randomly change the paths of the VNFs, and obtain a set S of network slice link deployment current solutions in the networktAnd obtaining the use frequency C of the routing equipment with the maximum forwarding frequency in the physical infrastructure network in unit timet。
The process of randomly changing the path between VNFs has been described in detail in the above description of the method and is not described in detail here.
In the simulated annealing algorithm, when reasonable random disturbance is set on an initial solution, a more optimal solution appears, the more optimal solution can be accepted as a new solution, and a solution worse than the current solution is accepted as the new solution with a certain probability to avoid falling into local optimum, so that a global optimum deployment scheme is achieved. Calculating the shortest physical path of VNFs (virtual network nodes) required to be connected with each other in a network slice by using a shortest path algorithm, and when the shortest physical path of the VNFs is used as an initial solution of a simulated annealing algorithm, acquiring the use frequency C of the routing equipment with the maximum forwarding frequency in the physical infrastructure network in unit timemax(ii) a After reasonable random disturbance is set for the initial solution, the use frequency C of the routing equipment with the maximum forwarding frequency in the physical infrastructure network in unit time is obtainedtComparing the two values CtAnd CmaxThe magnitude relationship of (1).
An acceptance submodule configured to accept if Ct<CmaxThen accept the StAnd then C istIs given to Cmax(ii) a If Ct≥CmaxThen with probability e-Δ/TReceiving said St, wherein Δ ═ Ct-CmaxT is a parameter;
and the solving submodule is configured to make K equal to K +1, and when a preset condition is met, the network slice link deployment solution received in the step S33 is used as a final solution, otherwise, the step S32 is returned.
In this embodiment, the predetermined condition is C within N1 timesmaxNo changes and/or iterations K ≧ N2, where N1 and N2 are fixed values. Specific values of N1 and N2 are not limited in the embodiments of the present invention, for example, N1 is 5000, and N1 is 20000, which means that if C is within 5000 consecutive times, C is not limited to N1 and N2maxNo change or k is more than or equal to 20000, stopping iteration and adding the current StAnd as a final solution, completing the network slice link deployment process.
Fig. 4 is a block diagram illustrating a structure of an electronic device according to an embodiment of the present invention, and as shown in fig. 4, the electronic device 400 includes a memory 401 and a processor 402; wherein the content of the first and second substances,
the memory 401 is used to store one or more computer instructions, which are executed by the processor 402 to implement any of the method steps described above.
FIG. 5 is a schematic block diagram of a computer system suitable for use in implementing a network slice link deployment method according to an embodiment of the present invention.
As shown in fig. 5, the computer system 500 includes a Central Processing Unit (CPU)501 that can execute various processes in the above-described embodiments according to a program stored in a Read Only Memory (ROM)502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. In the RAM503, various programs and data necessary for the operation of the system 500 are also stored. The CPU501, ROM502, and RAM503 are connected to each other via a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
The following components are connected to the I/O interface 505: an input portion 506 including a keyboard, a mouse, and the like; an output portion 507 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The driver 510 is also connected to the I/O interface 505 as necessary. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as necessary, so that a computer program read out therefrom is mounted into the storage section 508 as necessary.
In particular, the above described method may be implemented as a computer software program according to an embodiment of the present invention. For example, embodiments of the present invention include a computer program product comprising a computer program tangibly embodied on a medium readable thereby, the computer program comprising program code for performing the data monitoring method. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 509, and/or installed from the removable medium 511.
The above-mentioned embodiments are intended to illustrate the objects, technical solutions and advantages of the present invention in further detail, and it should be understood that the above-mentioned embodiments are only exemplary embodiments of the present invention, and are not intended to limit the present invention, and any modifications, equivalents, improvements and the like made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. A network slice link deployment method is characterized by comprising the following steps:
step 1, acquiring a topological structure of a physical infrastructure network;
step 2, acquiring the attribute of the VNF in the network slice on the physical infrastructure based on the topological structure;
and step 3: and selecting VNFs which need to be connected with each other in the network slice according to the attributes of the VNFs, and calculating connection paths among the VNFs based on the maximum forwarding times of routing equipment.
2. The network slice link deployment method of claim 1, wherein the step 3 comprises:
step 31, setting the initial state of the network as that VNFs in the network slice that need to be connected to each other are all connected through the shortest path, and in this case, obtaining the usage frequency C of the routing device with the maximum forwarding frequency in the physical infrastructure network in unit timemaxAnd the iteration number K is 0;
step 32: randomly selecting a certain network slice i, randomly selecting a plurality of pairs of VNFs with established shortest paths in the network slice i, and randomly changing the paths of the VNFs to obtain a set S of network slice link deployment current solutions in the networktAnd obtaining the use frequency C of the routing equipment with the maximum forwarding frequency in the physical infrastructure network in unit timet；
Step S33: if Ct<CmaxThen accept the StAnd C istIs given to Cmax(ii) a If Ct≥CmaxThen with probability e-Δ/TAccepting the StWherein △ ═ ct-cmaxT is 50 or less and 10 or more;
step S34: let K be K +1, when a preset condition is satisfied, take the network slice link deployment solution accepted in step S33 as a final solution, otherwise return to step S32.
3. The method as claimed in claim 2, wherein the preset condition is that C is within N1 timesmaxNo changes and/or the number of iterations K ≧ N2, where N1 and N2 are predetermined fixed values.
4. The method as claimed in claims 1 to 3, wherein the physical infrastructure includes a general server, a network forwarding device, a physical link and a dedicated device.
5. A network slice link deployment apparatus, comprising:
a first acquisition module configured to acquire a topology of a physical infrastructure network;
a second obtaining module configured to obtain attributes of VNFs in a network slice on the physical infrastructure according to the topology;
and the calculation module is configured to select VNFs needing to be connected with each other in the network slice according to the attributes of the VNFs, and calculate a connection path between the VNFs based on the maximum forwarding times of the routing equipment.
6. The device for network slice link deployment according to claim 5, wherein the computing module comprises:
a first obtaining sub-module configured to set a network initial state as that VNFs required to be connected to each other in the network slice are all connected through a shortest path, in which case, a usage frequency C of a routing device with a maximum forwarding number in the physical infrastructure network is obtained in a unit timemaxAnd the iteration number K is 0;
a second obtaining submodule configured to randomly select a certain network slice i, randomly select a plurality of pairs of VNFs with established shortest paths in the network slice i, randomly change the paths of the VNFs, and obtain a set S of network slice link deployment current solutions in the networktAnd obtaining the use frequency C of the routing equipment with the maximum forwarding frequency in the physical infrastructure network in unit timet；
An acceptance submodule configured to accept if Ct<CmaxThen accept the StAnd C istIs given to Cmax(ii) a If Ct≥CmaxThen with probability e-Δ/TAccepting the StWherein Δ ═ Ct-CmaxT is a parameter;
and the solving submodule is configured to enable K to be K +1, when a preset condition is met, the accepting submodule is executed, and otherwise, the second obtaining submodule is executed.
7. The device according to claim 6, wherein the predetermined condition is C within N1 timesmaxNo changes and/or the number of iterations K ≧ N2, where N1 and N2 are preset fixed values.
8. The device according to claims 5-7, wherein the physical infrastructure comprises a general purpose server, a network forwarding device, a physical link, and a dedicated device.
9. An electronic device comprising a memory and a processor; wherein the content of the first and second substances,
the memory is configured to store one or more computer instructions, wherein the one or more computer instructions are executed by the processor to implement the method steps of any of claims 1-5.
10. A computer-readable storage medium having stored thereon computer instructions, characterized in that the computer instructions, when executed by a processor, carry out the method steps of any of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811377898.9A CN109361547B (en) | 2018-11-19 | 2018-11-19 | Network slice link deployment method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811377898.9A CN109361547B (en) | 2018-11-19 | 2018-11-19 | Network slice link deployment method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109361547A CN109361547A (en) | 2019-02-19 |
| CN109361547B true CN109361547B (en) | 2020-06-30 |
Family
ID=65332372
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811377898.9A Active CN109361547B (en) | 2018-11-19 | 2018-11-19 | Network slice link deployment method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109361547B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111343027B (en) * | 2020-03-11 | 2022-08-26 | 中国电子科技集团公司第五十四研究所 | Network slice deployment method and device based on genetic algorithm |
| CN112822050B (en) * | 2021-01-05 | 2023-05-02 | 北京信息科技大学 | Method and apparatus for deploying network slices |
| CN114938328A (en) * | 2021-02-04 | 2022-08-23 | 中兴通讯股份有限公司 | Path determining method, network element and computer readable storage medium |
| CN114172820B (en) * | 2021-11-26 | 2024-03-05 | 广东技术师范大学 | Cross-domain SFC dynamic deployment method, device, computer equipment and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108173761A (en) * | 2017-12-22 | 2018-06-15 | 南京邮电大学 | A kind of method for optimizing resources of SDN and NFV fusions |
| CN108833181A (en) * | 2018-06-25 | 2018-11-16 | 北京邮电大学 | NG-CN network slice systems and network are sliced selection method |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103188148B (en) * | 2011-12-28 | 2015-12-16 | 清华大学 | The distribution method of a kind of upper wireless link and system |
| US20170289791A1 (en) * | 2016-04-05 | 2017-10-05 | Electronics And Telecommunications Research Institute | Communication method and apparatus using network slice |
| CN107888425B (en) * | 2017-11-27 | 2019-12-06 | 北京邮电大学 | network slice deployment method and device for mobile communication system |
| CN108260169B (en) * | 2018-01-26 | 2021-04-02 | 重庆邮电大学 | QoS guarantee-based dynamic service function chain deployment method |
-
2018
- 2018-11-19 CN CN201811377898.9A patent/CN109361547B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108173761A (en) * | 2017-12-22 | 2018-06-15 | 南京邮电大学 | A kind of method for optimizing resources of SDN and NFV fusions |
| CN108833181A (en) * | 2018-06-25 | 2018-11-16 | 北京邮电大学 | NG-CN network slice systems and network are sliced selection method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109361547A (en) | 2019-02-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109361547B (en) | Network slice link deployment method and device | |
| EP2453612B1 (en) | Bus control device | |
| CN111787069A (en) | Method, device and equipment for processing service access request and computer storage medium | |
| CN112738820A (en) | Dynamic deployment method and device of service function chain and computer equipment | |
| CN109451540B (en) | Resource allocation method and equipment for network slices | |
| US20160147548A1 (en) | Virtual machine arrangement design apparatus and method , system, and program | |
| US10356185B2 (en) | Optimal dynamic cloud network control | |
| US10831630B2 (en) | Fault analysis method and apparatus based on data center | |
| CN113348651A (en) | Dynamic inter-cloud placement of sliced virtual network functions | |
| US20230146912A1 (en) | Method, Apparatus, and Computing Device for Constructing Prediction Model, and Storage Medium | |
| WO2021052380A1 (en) | Method and apparatus for extracting fault propagation condition, and storage medium | |
| CN111343097B (en) | Link load balancing method and device, electronic equipment and storage medium | |
| WO2018166249A1 (en) | Network service transmission method and system | |
| CN113328953A (en) | Method, device and storage medium for network congestion adjustment | |
| CN113300861B (en) | Network slice configuration method, device and storage medium | |
| EP3585013B1 (en) | Data transmission method and apparatus | |
| CN108923961B (en) | Multi-entry network service function chain optimization method | |
| Nishanbayev et al. | Evaluating the effectiveness of a software-defined cloud data center with a distributed structure | |
| CN113472591B (en) | Method and device for determining service performance | |
| CN113422726B (en) | Service chain deployment method and device, storage medium and electronic equipment | |
| EP3247077A1 (en) | Path selection method, device and system | |
| CN112783673A (en) | Method and device for determining call chain, computer equipment and storage medium | |
| WO2023233471A1 (en) | Cause inference of abnormality of network | |
| CN115297047B (en) | Networking method, electronic device and computer-readable storage medium | |
| WO2024047775A1 (en) | Determination of machine learning model to be used for given predictive purpose for communication system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |