CN115767325A - Service function chain profit maximization mapping method and system - Google Patents
Service function chain profit maximization mapping method and system Download PDFInfo
- Publication number
- CN115767325A CN115767325A CN202211365986.3A CN202211365986A CN115767325A CN 115767325 A CN115767325 A CN 115767325A CN 202211365986 A CN202211365986 A CN 202211365986A CN 115767325 A CN115767325 A CN 115767325A
- Authority
- CN
- China
- Prior art keywords
- mapping
- network
- service function
- virtual
- link
- 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.)
- Pending
Links
- 238000013507 mapping Methods 0.000 title claims abstract description 244
- 238000000034 method Methods 0.000 title claims abstract description 53
- 230000003287 optical effect Effects 0.000 claims abstract description 122
- 230000006870 function Effects 0.000 claims description 251
- 238000004364 calculation method Methods 0.000 claims description 32
- 230000005540 biological transmission Effects 0.000 claims description 12
- 238000010276 construction Methods 0.000 claims description 7
- 238000001228 spectrum Methods 0.000 claims description 7
- 238000012544 monitoring process Methods 0.000 claims description 6
- 239000000126 substance Substances 0.000 claims description 6
- 238000004422 calculation algorithm Methods 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 14
- 238000004590 computer program Methods 0.000 description 7
- 230000008901 benefit Effects 0.000 description 4
- 238000011161 development Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 238000003860 storage Methods 0.000 description 4
- 239000013307 optical fiber Substances 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000009826 distribution Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
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/0894—Policy-based network configuration management
-
- 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/0895—Configuration of virtualised networks or elements, e.g. virtualised network function or OpenFlow elements
-
- 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/0896—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
-
- 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/0896—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
- H04L41/0897—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities by horizontal or vertical scaling of resources, or by migrating entities, e.g. virtual resources or entities
-
- 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
- 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
- H04L41/122—Discovery or management of network topologies of virtualised topologies, e.g. software-defined networks [SDN] or network function virtualisation [NFV]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/04—Processing captured monitoring data, e.g. for logfile generation
-
- 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
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Mining & Analysis (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a service function chain profit maximization mapping method and a system, wherein the method comprises the steps of calculating the importance of a virtual link and the importance of a network link, and determining the mapping sequence of the virtual link; pre-configuring working paths and protection paths of all node pairs in a data center optical network, and constructing a mapping auxiliary graph through network link importance; mapping the virtual link and the virtual network function into a mapping auxiliary graph, selecting the bandwidth requirement of the virtual link on a line rate and modulation format bearing service function chain, and configuring the quantity of optical regenerators required to be configured by using the line rate; after the mapping of all the functional service chains is completed, calculating the mapping profit of the functional service chains; otherwise the mapping service function chain fails. The invention comprehensively considers the bandwidth requirement of the virtual link and the resource requirement of the virtual network function, controls the load balance of the network node as much as possible while controlling the mapping cost, and improves the success rate of the service function chain mapping.
Description
Technical Field
The invention relates to the technical field of communication, in particular to a service function chain profit maximization mapping method and system.
Background
The rapid development of the internet of things in today's society has become an unobtrusive trend, with billions of devices expected to connect to the internet. Therefore, a large amount of data needs to be collected at the device side. Traditional cloud computing architectures consist of several large data centers interconnected by long distance networks. A large amount of data is transmitted from the device side to the cloud side, which brings unacceptable data storage cost and transmission delay. To address these challenges, edge computations are introduced to reduce network transmission latency.
The data center optical network is an important basis for supporting the rapid development of cloud computing, and the elastic optical network has become an inevitable development trend of the data center optical network by virtue of the capability of better utilizing frequency spectrum resources and effectively bearing the communication bandwidth requirement of the ultra-wavelength data center. Although edge computing has advantages in reducing latency, high network cost can still be an important factor that limits the development of sustainable edge computing ecosystems. Therefore, in order to effectively control the cost, an emerging technology called a service function chain is provided, the service function chain depends on a network virtualization technology, network resources can be more flexibly scheduled and distributed, and the key of the problem is about which mapping method is adopted to deploy the service function chain to the edge cloud elastic optical network. Currently, the main mapping methods for service function chains are of the following two types: (1) The method comprises the steps of firstly determining the mapping sequence of the virtual network function according to the computing resource requirement of the virtual network function, and preferentially mapping nodes with high computing resource requirement; secondly, mapping the virtual network functions with the maximum computing resource requirement to the network nodes with the maximum available computing resources one by one; then, according to the connection relation among the virtual network functions, a shortest path algorithm is used for establishing a transmission path for each virtual link; and finally, distributing corresponding bandwidth resources in the mapped path according to the bandwidth requirement of each virtual link. The mapping method is beneficial to fully utilizing the computing resources of the network nodes and improving the success rate of the service function chain mapping; however, this mapping method ignores the mapping of the virtual link, and the cost of the mapping is high. (2) The method comprises the steps of firstly determining a virtual link mapping sequence in a service function chain according to the bandwidth requirement of a virtual link; secondly, mapping the virtual links to an optical transmission path with short data center optical network distance one by one based on the mapping sequence of the virtual links until all the virtual links are mapped to the data center optical network; and finally, distributing corresponding bandwidth resources on the mapped optical transmission paths according to the bandwidth requirement of each virtual link. Although the mapping method reduces the network cost of mapping, the network load distribution is uneven, thereby causing the problem of wasting the computing resources of the data center optical network and reducing the success rate of the service function chain mapping.
Both of the above methods are mapping methods designed with priority only for virtual network functions or virtual links, wherein the mapping method with priority for virtual network functions ensures that the maximum number of service function chains are mapped successfully, but ignores the mapping cost; the mapping method of virtual link priority is to reduce the mapping cost, but neglects the mapping success rate. Therefore, it is desirable to provide a mapping method and system for maximizing profit of a service function chain, so as to achieve the goal of maximizing profit obtained by reducing mapping cost while ensuring the number of service function chain mappings.
Disclosure of Invention
Therefore, the technical problem to be solved by the present invention is to overcome the technical defect of the prior art that the balance between the mapping number of the service function chain and the mapping cost cannot be obtained.
In order to solve the technical problem, the invention provides a service function chain profit maximization mapping method, which comprises the following steps:
s1: reading a data center optical network topology, initializing network parameters, generating a group of service function chains, and setting parameter information of the service function chains;
s2: calculating the importance of the virtual link and the importance of the network link according to the network initialization parameter and the service function chain, and determining the mapping sequence of the virtual link according to the importance of the virtual link;
s3: working paths and protection paths of all node pairs are configured in advance in the data center optical network, and for a mapping request of each service function chain, a data center optical network mapping auxiliary graph is constructed through network link importance;
s4: judging whether the virtual link and the virtual network function meet the mapping condition, if so, mapping the virtual link and the virtual network function to the constructed data center optical network mapping auxiliary graph, and executing S5, otherwise, mapping the service function chain failure;
s5: selecting the line rate and the bandwidth requirement of a virtual link on a modulation format bearing service function chain, and calculating the number of optical regenerators required to be configured for using the line rate;
s6: judging whether the data center optical network meets the requirements of bandwidth and virtual network function resources, if so, configuring a corresponding number of optical regenerators, mapping a service function chain into the data center optical network, and executing S7; otherwise, mapping the service function chain fails;
s7: and after the mapping of all the functional service chains is completed, calculating the mapping profit of the functional service chains.
In an embodiment of the present invention, in S2, the calculation formula of the virtual link importance is:
wherein the content of the first and second substances,
representing a set of virtual links on the nth service function chain,
representing the bandwidth resources required by the virtual link (i, j) on the nth chain of service functions,
represents the computational resources required by the virtual network function at the start of the virtual link (i, j),
representing the computational resources required by the virtual network function at the end of the virtual link (i, j).
In an embodiment of the present invention, in S2, the calculation formula of the network link importance is:
wherein the content of the first and second substances,
indicating the importance of the network link, E p Representing a set of network links, D (k,l) Representing the sum of the distances of the working path and the protection path established between network nodes k and l,
representing the remaining computational resources of node k,
representing the remaining computational resources of the node/,
representing the number of available spectrum slots, D, on a network link (k, l) max And D min Respectively representing the maximum path distance and the minimum path distance between all network node pairs, the path distance being the sum of the working path distance and the protection path distance,
and
respectively representing the maximum and minimum number of available spectrum slots on the configured path for all network node pairs.
In an embodiment of the present invention, in S4, the method for mapping the virtual links and the virtual network functions into the constructed data center optical network mapping assistance map includes:
for each group of virtual links, when the virtual network functions at the two ends of the virtual link are not mapped, mapping the virtual link into the network link according to a link mapping rule, and mapping the virtual network function with high computing resource demand onto the network node with more residual computing resources; when only one virtual network function at two ends of the virtual link is not mapped, searching unmapped network nodes according to the mapped network nodes, and ensuring that the importance of the network links among the nodes is the highest, wherein the link mapping rule is to map the virtual link with high importance of the virtual link into the network link with high importance of the network link.
In one embodiment of the present invention, in S5, the method for calculating the number of optical regenerators required to be configured to use the line rate includes:
and based on the source node and the destination node in the mapped working path, reestablishing an auxiliary topology for calculating the number of the optical regenerators, calculating a path with the shortest weight in the formed auxiliary topology by utilizing a shortest path algorithm, wherein the number of the nodes of the path minus the source node and the destination node is the number of the optical regenerators.
In one embodiment of the present invention, a method of establishing an auxiliary topology for counting the number of optical regenerators comprises:
and traversing any two node pairs on the working path on the basis of the source node and the destination node in the mapped working path, if the transmission distance between the network nodes is less than the maximum transmission distance of the line rate adopted by the connection request, establishing a connection link between the node pairs, and setting the weight of the connection link as 1 unit length, thereby forming the auxiliary topology for calculating the number of the optical regenerators.
In one embodiment of the present invention, in S7, the mapping profit of the functional service chain is equal to the total mapping profit minus the total mapping cost, wherein the total mapping cost of the functional service chain is calculated by the following formula:
wherein, C (G) s ) Represents the service function chain mapping Total cost, G s A set of service function chains is represented,
represents a set of links on the nth service function chain, TC represents the unit price of the optical repeater at a given line rate, RC represents the unit price of the optical regenerator at a given line rate,
representing a virtual link at a given line rate
The number of optical transponders required.
In one embodiment of the present invention, in S7, the mapping profit of the functional service chain is equal to the total mapping profit minus the total mapping cost, wherein the total mapping profit of the functional service chain is calculated by the following formula:
wherein G is s A set of service function chains is represented,
and
respectively representing a set of virtual network functions and a set of virtual links in the nth service function chain,
representing the computational resources required by the mth virtual network function in the nth service function chain,
indicating the bandwidth resources required by the virtual link (i, j) in the nth virtual network.
In addition, the present invention also provides a service function chain profit maximization mapping system, comprising:
the network initialization module is used for reading the data center optical network topology and initializing network parameters;
the service function chain generating module is used for generating a group of service function chains and setting parameter information of the service function chains;
the virtual link importance degree calculation module is used for calculating the importance degree of a virtual link according to the network initialization parameters and the service function chain and determining the mapping sequence of the virtual link according to the importance degree of the virtual link;
the network link importance calculating module is used for calculating the importance of the network link according to the network initialization parameter and the service function chain;
the mapping auxiliary graph building module is used for pre-configuring working paths and protection paths of all node pairs in the data center optical network and building a mapping auxiliary graph of the data center optical network through network link importance for a mapping request of each service function chain;
the service function chain mapping module is used for judging whether the virtual link and the virtual network function meet the mapping condition, if so, mapping the virtual link and the virtual network function into the constructed data center optical network mapping auxiliary graph, otherwise, mapping the service function chain fails;
the optical regenerator configuration module is used for selecting the line rate and the bandwidth requirement of a virtual link on a modulation format bearing service function chain, calculating the number of optical regenerators required to be configured by using the line rate, judging whether the data center optical network meets the requirements of the bandwidth and the virtual network function resources, if so, configuring the corresponding number of optical regenerators and mapping the service function chain into the data center optical network; otherwise, mapping the service function chain fails;
and the mapping profit calculation module is used for calculating the mapping profit of the functional service chain after the mapping of all the functional service chains is completed.
In one embodiment of the present invention, further comprising:
the network state monitoring module is used for monitoring the network states of the network initialization module, the service function chain generation module, the virtual link importance calculation module, the network link importance calculation module, the mapping auxiliary graph construction module, the service function chain mapping module, the optical regenerator configuration module and the mapping profit calculation module;
a judgment and early warning module: the system is used for executing coordination functions among a network initialization module, a service function chain generation module, a virtual link importance calculation module, a network link importance calculation module, a mapping auxiliary graph construction module, a service function chain mapping module, an optical regenerator configuration module and a mapping profit calculation module, and judging and early warning functions of whether each module is established successfully.
Compared with the prior art, the technical scheme of the invention has the following advantages:
according to the service function chain profit maximization mapping method and system, bandwidth requirements of a virtual link and resource requirements of a virtual network function are comprehensively considered, the mapping cost is controlled, load balance of network nodes is controlled to the greatest extent, and the success rate of service function chain mapping is improved.
Drawings
In order that the present disclosure may be more readily and clearly understood, reference is now made to the following detailed description of the embodiments of the present disclosure taken in conjunction with the accompanying drawings, in which
Fig. 1 is a flow chart of a service function chain profit maximization mapping method according to the present invention.
Fig. 2 is a schematic structural diagram of a service function chain profit maximization mapping system according to the present invention.
FIG. 3 is a schematic diagram of a service function chain of the present invention.
Fig. 4 is a data center optical network topology structure diagram of 6 nodes and 8 optical fiber links according to the present invention.
Fig. 5 is a mapping assistance diagram for a data center optical network according to the present invention.
Fig. 6 is a diagram illustrating a service function chain mapping process according to the present invention.
Wherein the reference numerals are as follows: 1. a network initialization module; 2. a service function chain generation module; 3. a virtual link importance calculation module; 4. a network link importance calculation module; 5. a mapping assistance map construction module; 6. a service function chain mapping module; 7. an optical regenerator configuration module; 8. a mapped profit calculation module; 9. a network state monitoring module; 10. and a judgment and early warning module.
Detailed Description
The present invention is further described below in conjunction with the following figures and specific examples so that those skilled in the art may better understand the present invention and practice it, but the examples are not intended to limit the present invention.
Referring to fig. 1, an embodiment of the present invention provides a service function chain profit maximization mapping method, including the following steps:
s1: reading a data center optical network topology, initializing network parameters, generating a group of service function chains, and setting parameter information of the service function chains;
s2: calculating the importance of a virtual link and the importance of a network link according to the network initialization parameters and the service function chain;
s3: working paths and protection paths of all node pairs are configured in advance in the data center optical network, and for a mapping request of each service function chain, a mapping auxiliary graph of the data center optical network is constructed through link importance;
s4: judging whether the virtual link and the virtual network function meet the mapping condition, if so, mapping the virtual link and the virtual network function to the constructed data center optical network mapping auxiliary graph, and executing S5, otherwise, mapping the service function chain fails;
s5: selecting the line rate and the bandwidth requirement of a virtual link on a modulation format bearing service function chain, and calculating the number of optical regenerators required to be configured for using the line rate;
s6: judging whether the data center optical network meets the requirements of bandwidth and virtual network function resources, if so, configuring a corresponding number of optical regenerators, mapping a service function chain into the data center optical network, and executing S7; otherwise, mapping the service function chain fails;
s7: and after the mapping of all the functional service chains is completed, calculating the mapping profit of the functional service chains.
The profit maximization mapping method for the service function chain comprehensively considers the bandwidth requirement of the virtual link and the resource requirement of the virtual network function, controls the load balance of the network node as much as possible while controlling the mapping cost, and improves the success rate of the service function chain mapping.
Preferably, the service function chain profit maximization mapping method provided by the invention specifically comprises the following detailed steps:
s1: given a data center optical network G P (V P ,E P ,C P )，Wherein V P Representing a group of network nodes providing computing, storage and conversion resources, E P Representing a group of network links providing bandwidth resources, C P Computing resources provided on behalf of each network node; a set of service function chains G S (M S ,V S ,E S ,C S ,B S ) Wherein M is S Representing a set of virtual network function classes, V, for the user's needs S Representing a set of virtual network functions, E S Representing a set of virtual links, C S Representing the computational resources required by a set of virtual network functions, B S Representing bandwidth resources required for a set of virtual links; a set of different linear rate R = { R = 1 ,r 2 ,···,r N Where N is the total number of line rates; maximum reachability of a set of optical signals corresponding to different line rates, RB = { RB = { (RB) } 1 ,RB 2 ,···,RB N }; set of modulation formats M = { M 1 ,m 2 ,···,m N }; unit network cost of a set of optical repeaters corresponding to different line rates, TC = { TC = { (TC) 1 ,TC 2 ,···,TC N }; unit network cost for a set of optical regenerators corresponding to different line rates, RC = { RC = { (RC) 1 ,RC 2 ,···RC N }。
S2: and calculating the importance of the virtual link and the importance of the network link according to the formula (1) and the formula (2), and determining the mapping sequence of the virtual link according to the importance of the virtual link, wherein the virtual link with the high importance is mapped preferentially.
Wherein the content of the first and second substances,
representing a set of virtual links on the nth service function chain,
represents the bandwidth resources required by the virtual link (i, j) on the nth service function chain,
represents the computational resources required by the virtual network function at the start of the virtual link (i, j),
representing the computational resources required by the virtual network function at the end of the virtual link (i, j);
wherein the content of the first and second substances,
indicating the importance of the network link, E p Representing a set of network links, D (k,l) Representing the sum of the distances of the working path and the protection path established between network nodes k and l,
representing the remaining computational resources of node k,
representing the remaining computational resources of the node/,
representing the number of available spectrum slots, D, on a network link (k, l) max And D min Respectively representing the maximum path distance and the minimum path distance between all network node pairs, the path distance being the sum of the working path distance and the protection path distance,
and
respectively representing the maximum and minimum number of available spectrum slots on the configured path for all network node pairs.
S3: according to the target requirement of the service function chain, the process of mapping the service function chain to the data center optical network is simplified, and working paths and protection paths of all node pairs are configured in advance in the data center optical network. And configuring the shortest distance between each network node pair as the weight of a link between the data center optical network auxiliary graph node pair, and constructing a data center optical network mapping auxiliary graph which accords with service function chain mapping according to the importance of the network link.
S4: for each group of virtual link sequences, if the virtual network functions at the two ends of the virtual link are not mapped, mapping the virtual link into the network link according to a link mapping rule (the virtual link with high virtual link importance is mapped into the network link with high network link importance), and mapping the virtual network function with high computing resource demand onto the network node with more residual computing resources. When only one virtual network function at two ends of the virtual link is not mapped, searching unmapped network nodes according to the mapped network nodes, and ensuring that the importance of the network link between the nodes is highest. And judging whether the virtual network function and the virtual link meet the mapping condition, if so, mapping the virtual network function and the virtual link into the constructed data center optical network mapping auxiliary graph, otherwise, failing to map the virtual network function and the virtual link. And if the mapping fails, selecting the next link according to the link importance, and repeating the step S4 until all the virtual network functions and the virtual links are mapped into the data center optical network.
S5: the line rate and modulation format are selected to carry the bandwidth requirements of the virtual link over the service function chain, and the number of optical regenerators that need to be configured to use that line rate is calculated. An auxiliary topology for calculating the number of optical regenerators is reestablished based on the source node and the destination node in the mapped working path. And traversing any two node pairs on the working path, if the transmission distance between the network nodes is less than the maximum transmission distance of the line rate adopted by the connection request, establishing a connection link between the node pairs, and setting the weight of the connection link as 1 unit length, thereby forming an auxiliary topology for calculating the number of the optical regenerators. And calculating a path with the shortest weight in the formed auxiliary topology by using a shortest path algorithm. The node number of this path is denoted as H, and the nodes (excluding the source node and the destination node) passed by the path are the points where the optical regenerators are placed, that is, the number of the optical regenerators configured is R = (H-2).
S6: for the mapping requests of the remaining service function chains, the above steps S2 to S6 are repeated, and the number of successfully mapped service function chains is recorded. After all mapping is completed, according to the number of optical repeaters and optical regenerators required by each service function chain, respectively calculating the total mapping cost and the total mapping profit by the formulas (3) and (4), wherein the total mapping profit minus the total mapping cost of the function service chain is equal to the mapping profit:
wherein, C (G) s ) Represents the service function chain mapping Total cost, G s A set of service function chains is represented,
represents a set of links on the nth service function chain, TC represents the unit price of the optical repeater at a given line rate, RC represents the unit price of the optical regenerator at a given line rate,
representing a virtual link at a given line rate
Number of optical repeaters required, G s A set of service function chains is represented,
and
respectively representing a set of virtual network functions and a set of virtual links in the nth service function chain,
representing the computational resources required by the mth virtual network function in the nth service function chain,
indicating the bandwidth resources required by the virtual link (i, j) in the nth virtual network.
By way of example, fig. 3 is a schematic diagram of a service function chain, in fig. 3, virtual network functions are represented by regular hexagons, A, B, C represents the virtual network function types of the service function chain, respectively, numbers in a dashed circle represent the number of computing resources required by the virtual network function (including computing resources required to instantiate the function), each virtual link is represented by a dashed line, and numbers on the dashed line represent bandwidth requirements between two different virtual network functions. Fig. 4 is a data center optical network topology with 6 nodes and 8 fiber links. In fig. 4, the network nodes of the optical network are represented by circles and the network node numbers are represented by 0, 1, 2, 3, 4, 5; the number on the dashed circle adjacent to a network node represents the number of computing resources provided by the network node; the solid links between network nodes represent optical fiber links, and the numbers beside them represent the transmission distance between two network nodes, in kilometers (km), where each optical fiber link can provide sufficient bandwidth resources.
Firstly, calculating the importance of the virtual link according to the bandwidth requirement of the virtual link in the service function chain and the calculation resource requirement of the virtual network function, and determining the mapping sequence of the virtual link. For example, in fig. 3, the mapping order of the virtual links is determined according to the importance of the virtual links, and the mapping order is (B, C) and (a, B). While the computational resource requirements of virtual network function C are greater than the computational resource requirements of virtual network function B. Thus, it may be determined that virtual network function C is mapped in preference to virtual network function B.
Second, the network link importance between all pairs of network nodes is calculated and a mapping assistance graph is constructed. For example, in fig. 5, the network link of any node pair represents the working path and the protection path corresponding to the node pair in the data center optical network, and when the virtual link is mapped to any network link of the data center optical network mapping auxiliary map, at least one preconfigured working path and protection path in the data center optical network corresponds to the virtual link.
Thirdly, in fig. 5, all the virtual links and the virtual network functions are mapped to the data center optical network mapping auxiliary map according to the mapping order of the virtual links and the virtual network functions, which is specifically described as follows:
(1) The virtual links (B, C) are mapped first, and the links 3-4 with the highest network link importance degree are searched on the mapping auxiliary graph. The computing resource requirement of the virtual network function must be less than the computing resource provided by the network node, and the virtual network function C and the virtual network function B can be mapped to the network nodes 3 and 4 respectively by adopting the mapping principle that the virtual network function with larger computing resource requirement is mapped to the network node with more computing resources, so that the virtual links (B, C) can be mapped to the network link (4,3).
(2) The virtual links (a, B) are then mapped, and since virtual network function B has been mapped onto network node 4, the network nodes to which virtual network function a can map are left with only 0, 1, 2 and 5. The most important of network links 0-4, 1-4, 2-4, 5-4 is 2-4. Since the computing resources (119 units) provided by network node 2 are larger than the computing resources (10 units) required by virtual network function a, virtual network function a can be mapped onto network node 2, thus mapping virtual links (a, B) onto network links (2,4).
Fourthly, according to the bandwidth requirement of the virtual links, available bandwidth resources are searched and distributed on the pre-configured paths corresponding to the data center optical network mapped by all the virtual links. If the bandwidth resources of all the virtual links are successfully allocated, the service function chain mapping is successful, otherwise, the mapping fails.
And finally, calculating the optical repeater and the optical regenerator required by mapping, calculating the cost and the benefit of the mapping according to the formulas (3) and (4), and subtracting the cost from the benefit to obtain the final profit.
The invention mainly aims at the profit problem in the mapping of the service function chain, defines the importance of the virtual link according to the bandwidth requirement of the virtual link and the computing resource requirement of the virtual network function, and provides a method and a system for mapping the profit maximization of the service function chain. For each virtual link in the service function chain, calculating the importance of the corresponding virtual link, and sequencing according to the descending order to determine the mapping order. In a data center optical network, a working path and a protection path with a link not intersected with the working path are established in two network node pairs, and then the importance of the network link is calculated according to the total distance between the working path and the protection path and the calculation resources provided by the nodes. In order to simplify the mapping process, an auxiliary graph is constructed by using the importance of the network links, and the virtual links with high importance of the virtual links are mapped to the paths with high importance of the network links in the auxiliary graph according to the topology information of the service function chain under the condition of meeting the computing resource requirement of the virtual network function and the bandwidth requirement of the virtual links. Therefore, a balance is obtained between the mapping cost of the service function chain and the number of the successfully mapped service function chains, the mapping cost is reduced, the mapping income is improved, and finally, a larger mapping profit is obtained.
The invention combines the method of virtual network function priority mapping and the method of virtual link priority mapping, and considers that the data center optical network path required by the virtual link mapping is shortened while the network node computing resources are fully utilized. This achieves both an even distribution of network load and a reduction in the number of optical regenerators required, thereby achieving a balance between the number of service function chain mappings and the cost.
In the following, a profit maximization mapping system of a service function chain disclosed in an embodiment of the present invention is introduced, and a profit maximization mapping system of a service function chain described below and a profit maximization mapping method of a service function chain described above may be referred to correspondingly.
Referring to fig. 2, an embodiment of the present invention further provides a service function chain profit maximization mapping system, including:
the network initialization module 1 is used for reading the data center optical network topology and initializing network parameters;
a service function chain generating module 2, configured to generate a set of service function chains and set parameter information of the service function chains;
the virtual link importance calculating module 3 is used for calculating the importance of a virtual link according to the network initialization parameters and the service function chain, and determining the mapping sequence of the virtual link according to the importance of the virtual link;
a network link importance calculating module 4, configured to calculate a network link importance according to the network initialization parameter and the service function chain;
the mapping auxiliary graph constructing module 5 is configured to pre-configure working paths and protection paths of all node pairs in the data center optical network, and construct a mapping auxiliary graph of the data center optical network through network link importance for a mapping request of each service function chain;
the service function chain mapping module 6 is used for judging whether the virtual link and the virtual network function meet the mapping condition, if so, mapping the virtual link and the virtual network function into the constructed data center optical network mapping auxiliary graph, otherwise, mapping the service function chain fails;
the optical regenerator configuration module 7 is configured to select a line rate and a modulation format to carry bandwidth requirements of a virtual link on a service function chain, calculate the number of optical regenerators required to be configured to use the line rate, determine whether a data center optical network meets requirements of bandwidth and virtual network function resources, if so, configure a corresponding number of optical regenerators, and map the service function chain into the data center optical network; otherwise, mapping the service function chain fails;
and the mapping profit calculation module 8 is used for calculating the mapping profit of the functional service chain after the mapping of all the functional service chains is completed.
The profit maximization mapping system of the service function chain comprehensively considers the bandwidth requirement of the virtual link and the resource requirement of the virtual network function, controls the load balance of the network node as much as possible while controlling the mapping cost, and improves the success rate of the service function chain mapping.
In one embodiment of the present invention, further comprising:
a network state monitoring module 9, configured to monitor network states of the network initialization module 1, the service function chain generation module 2, the virtual link importance calculation module 3, the network link importance calculation module 4, the mapping auxiliary graph construction module 5, the service function chain mapping module 6, the optical regenerator configuration module 7, and the mapping profit calculation module 8;
the decision and early warning module 10: the system is used for executing coordination functions among a network initialization module 1, a service function chain generation module 2, a virtual link importance calculation module 3, a network link importance calculation module 4, a mapping auxiliary graph construction module 5, a service function chain mapping module 6, an optical regenerator configuration module 7 and a mapping profit calculation module 8, and judging and early warning functions of whether each module is established successfully.
The profit maximization mapping system of the service function chain of the present embodiment is used for implementing the profit maximization mapping method of the service function chain, and therefore, the detailed implementation of the system can be seen from the foregoing embodiment section of the profit maximization mapping method of the service function chain, and therefore, the detailed implementation of the system can refer to the description of the corresponding embodiment of each section, and will not be further described herein.
In addition, since the profit maximization mapping system of the service function chain of this embodiment is used for implementing the profit maximization mapping method of the service function chain, its role corresponds to that of the foregoing method, and is not described herein again.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It should be understood that the above examples are only for clarity of illustration and are not intended to limit the embodiments. Various other modifications and alterations will occur to those skilled in the art upon reading the foregoing description. And are neither required nor exhaustive of all embodiments. And obvious variations or modifications of the invention may be made without departing from the spirit or scope of the invention.
Claims (10)
1. A service function chain profit maximization mapping method is characterized in that: the method comprises the following steps:
s1: reading a data center optical network topology, initializing network parameters, generating a group of service function chains, and setting parameter information of the service function chains;
s2: calculating the importance of the virtual link and the importance of the network link according to the network initialization parameter and the service function chain, and determining the mapping sequence of the virtual link according to the importance of the virtual link;
s3: working paths and protection paths of all node pairs are configured in advance in the data center optical network, and for a mapping request of each service function chain, a data center optical network mapping auxiliary graph is constructed through network link importance;
s4: judging whether the virtual link and the virtual network function meet the mapping condition, if so, mapping the virtual link and the virtual network function to the constructed data center optical network mapping auxiliary graph, and executing S5, otherwise, mapping the service function chain failure;
s5: selecting the line rate and the bandwidth requirement of a virtual link on a modulation format bearing service function chain, and calculating the number of optical regenerators required to be configured for using the line rate;
s6: judging whether the data center optical network meets the requirements of bandwidth and virtual network function resources, if so, configuring a corresponding number of optical regenerators, mapping a service function chain into the data center optical network, and executing S7; otherwise, mapping the service function chain fails;
s7: and after the mapping of all the functional service chains is completed, calculating the mapping profit of the functional service chains.
2. The mapping method for service function chain profit maximization according to claim 1, wherein: in S2, the calculation formula of the virtual link importance degree is:
wherein the content of the first and second substances,
representing a set of virtual links on the nth service function chain,
representing the bandwidth resources required by the virtual link (i, j) on the nth chain of service functions,
represents the computational resources required by the virtual network function at the start of the virtual link (i, j),
representing the computational resources required by the virtual network function at the end of the virtual link (i, j).
3. The mapping method for service function chain profit maximization according to claim 1, characterized in that: in S2, the calculation formula of the network link importance is:
wherein the content of the first and second substances,
indicating network link importance, E p Representing a set of network links, D (k,l) Representing the sum of the distances of the working path and the protection path established between network nodes k and l,
representing the remaining computational resources of node k,
representing the remaining computational resources of the node/,
representing the number of available spectrum slots, D, on a network link (k, l) max And D min Respectively representing the maximum path distance and the minimum path distance between all network node pairs, the path distance being the sum of the working path distance and the protection path distance,
and
respectively representing the maximum and minimum number of available spectrum slots on the configured path for all network node pairs.
4. The mapping method for service function chain profit maximization according to claim 1, wherein: in S4, the method for mapping the virtual links and the virtual network functions into the constructed auxiliary map of the data center optical network mapping includes:
for each group of virtual links, when the virtual network functions at the two ends of the virtual link are not mapped, mapping the virtual link into the network link according to a link mapping rule, and mapping the virtual network function with high computing resource demand onto the network node with more residual computing resources; when only one virtual network function at two ends of the virtual link is not mapped, searching unmapped network nodes according to the mapped network nodes, and ensuring that the importance of the network links among the nodes is the highest, wherein the link mapping rule is to map the virtual link with high importance of the virtual link into the network link with high importance of the network link.
5. The mapping method for service function chain profit maximization according to claim 1, wherein: in S5, the method for calculating the number of optical regenerators to be configured to use the line rate includes:
and based on the source node and the destination node in the mapped working path, reestablishing an auxiliary topology for calculating the number of the optical regenerators, calculating a path with the shortest weight in the formed auxiliary topology by utilizing a shortest path algorithm, wherein the number of the nodes of the path minus the source node and the destination node is the number of the optical regenerators.
6. The mapping method for service function chain profit maximization according to claim 5, wherein: the method for establishing an auxiliary topology for counting the number of optical regenerators comprises the following steps:
and traversing any two node pairs on the working path on the basis of the source node and the destination node in the mapped working path, if the transmission distance between the network nodes is less than the maximum transmission distance of the line rate adopted by the connection request, establishing a connection link between the node pairs, and setting the weight of the connection link as 1 unit length, thereby forming the auxiliary topology for calculating the number of the optical regenerators.
7. The mapping method for service function chain profit maximization according to claim 1, wherein: in S7, the mapping profit of the functional service chain is equal to the total mapping profit minus the total mapping cost, where the total mapping cost of the functional service chain is calculated by the following formula:
wherein, C (G) s ) Represents the service function chain mapping Total cost, G s A set of service function chains is represented,
represented in the nth service function chainA set of links above, TC represents the unit price of the optical repeater at a given line rate, RC represents the unit price of the optical regenerator at a given line rate,
representing a virtual link at a given line rate
The number of optical transponders required.
8. The mapping method for service function chain profit maximization according to claim 1, wherein: in S7, the mapping profit of the functional service chain is equal to the total mapping profit minus the total mapping cost, wherein the total mapping profit of the functional service chain is calculated by the following formula:
wherein G is s A set of service function chains is represented,
and
respectively representing a set of virtual network functions and a set of virtual links in the nth service function chain,
representing the computational resources required by the mth virtual network function in the nth service function chain,
indicating the bandwidth resources required by the virtual link (i, j) in the nth virtual network.
9. A service function chain profit maximization mapping system, characterized by: the method comprises the following steps:
the network initialization module is used for reading the data center optical network topology and initializing network parameters;
the service function chain generating module is used for generating a group of service function chains and setting parameter information of the service function chains;
the virtual link importance degree calculation module is used for calculating the importance degree of a virtual link according to the network initialization parameters and the service function chain and determining the mapping sequence of the virtual link according to the importance degree of the virtual link;
the network link importance calculating module is used for calculating the importance of the network link according to the network initialization parameter and the service function chain;
the mapping auxiliary graph building module is used for pre-configuring working paths and protection paths of all node pairs in the data center optical network and building a mapping auxiliary graph of the data center optical network through network link importance for a mapping request of each service function chain;
the service function chain mapping module is used for judging whether the virtual link and the virtual network function meet the mapping condition, if so, mapping the virtual link and the virtual network function to the constructed data center optical network mapping auxiliary graph, otherwise, mapping the service function chain fails;
the optical regenerator configuration module is used for selecting the line rate and the bandwidth requirement of a virtual link on a modulation format bearing service function chain, calculating the number of optical regenerators required to be configured by using the line rate, judging whether the data center optical network meets the requirements of the bandwidth and the virtual network function resources, if so, configuring the corresponding number of optical regenerators and mapping the service function chain into the data center optical network; otherwise, mapping the service function chain fails;
and the mapping profit calculation module is used for calculating the mapping profit of the functional service chain after the mapping of all the functional service chains is completed.
10. The service function chain profit maximization mapping system of claim 9, wherein: further comprising:
the network state monitoring module is used for monitoring the network states of the network initialization module, the service function chain generation module, the virtual link importance calculation module, the network link importance calculation module, the mapping auxiliary graph construction module, the service function chain mapping module, the optical regenerator configuration module and the mapping profit calculation module;
a judgment and early warning module: the system is used for executing coordination functions among a network initialization module, a service function chain generation module, a virtual link importance calculation module, a network link importance calculation module, a mapping auxiliary graph construction module, a service function chain mapping module, an optical regenerator configuration module and a mapping profit calculation module, and judging and early warning functions of whether each module is established successfully.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211365986.3A CN115767325A (en) | 2022-10-31 | 2022-10-31 | Service function chain profit maximization mapping method and system |
| PCT/CN2022/142165 WO2024092993A1 (en) | 2022-10-31 | 2022-12-27 | Service function chain profit maximization mapping method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211365986.3A CN115767325A (en) | 2022-10-31 | 2022-10-31 | Service function chain profit maximization mapping method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115767325A true CN115767325A (en) | 2023-03-07 |
Family
ID=85356070
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211365986.3A Pending CN115767325A (en) | 2022-10-31 | 2022-10-31 | Service function chain profit maximization mapping method and system |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN115767325A (en) |
| WO (1) | WO2024092993A1 (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117082008A (en) * | 2023-10-17 | 2023-11-17 | 深圳云天畅想信息科技有限公司 | Virtual elastic network data transmission scheduling method, computer device and storage medium |
| CN117220905A (en) * | 2023-08-09 | 2023-12-12 | 苏州大学 | Mapping method and system of safety perception service function chain |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105338435A (en) * | 2015-10-21 | 2016-02-17 | 苏州大学 | Virtual optical network cooperation mapping method and apparatus |
| CN107332913A (en) * | 2017-07-04 | 2017-11-07 | 电子科技大学 | A kind of Optimization deployment method of service function chain in 5G mobile networks |
| CN109889930A (en) * | 2019-03-26 | 2019-06-14 | 重庆邮电大学 | A kind of virtual optical network mapping method and device for combining energy consumption and load balancing |
| CN110636394A (en) * | 2019-10-17 | 2019-12-31 | 中天通信技术有限公司 | Virtual optical network mapping method, device, equipment and medium |
| CN113630328A (en) * | 2021-07-09 | 2021-11-09 | 西安电子科技大学 | Data center virtual network mapping method and system |
| CN113794748A (en) * | 2021-08-03 | 2021-12-14 | 华中科技大学 | Performance-aware service function chain intelligent deployment method and device |
| CN114827273A (en) * | 2022-03-30 | 2022-07-29 | 南京邮电大学 | Virtual network mapping algorithm based on time delay optimization |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104468803B (en) * | 2014-12-12 | 2018-02-09 | 华为技术有限公司 | A kind of virtual data center method for mapping resource and equipment |
| CN110505539B (en) * | 2018-05-17 | 2021-10-26 | 中兴通讯股份有限公司 | Physical optical network virtualization mapping method, device, controller and storage medium |
-
2022
- 2022-10-31 CN CN202211365986.3A patent/CN115767325A/en active Pending
- 2022-12-27 WO PCT/CN2022/142165 patent/WO2024092993A1/en unknown
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105338435A (en) * | 2015-10-21 | 2016-02-17 | 苏州大学 | Virtual optical network cooperation mapping method and apparatus |
| CN107332913A (en) * | 2017-07-04 | 2017-11-07 | 电子科技大学 | A kind of Optimization deployment method of service function chain in 5G mobile networks |
| CN109889930A (en) * | 2019-03-26 | 2019-06-14 | 重庆邮电大学 | A kind of virtual optical network mapping method and device for combining energy consumption and load balancing |
| CN110636394A (en) * | 2019-10-17 | 2019-12-31 | 中天通信技术有限公司 | Virtual optical network mapping method, device, equipment and medium |
| CN113630328A (en) * | 2021-07-09 | 2021-11-09 | 西安电子科技大学 | Data center virtual network mapping method and system |
| CN113794748A (en) * | 2021-08-03 | 2021-12-14 | 华中科技大学 | Performance-aware service function chain intelligent deployment method and device |
| CN114827273A (en) * | 2022-03-30 | 2022-07-29 | 南京邮电大学 | Virtual network mapping algorithm based on time delay optimization |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117220905A (en) * | 2023-08-09 | 2023-12-12 | 苏州大学 | Mapping method and system of safety perception service function chain |
| CN117082008A (en) * | 2023-10-17 | 2023-11-17 | 深圳云天畅想信息科技有限公司 | Virtual elastic network data transmission scheduling method, computer device and storage medium |
| CN117082008B (en) * | 2023-10-17 | 2023-12-15 | 深圳云天畅想信息科技有限公司 | Virtual elastic network data transmission scheduling method, computer device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2024092993A1 (en) | 2024-05-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN115767325A (en) | Service function chain profit maximization mapping method and system | |
| CN113708972B (en) | Service function chain deployment method and device, electronic equipment and storage medium | |
| US10129101B2 (en) | Application driven and adaptive unified resource management for data centers with Multi-Resource Schedulable Unit (MRSU) | |
| CN109358971B (en) | Rapid and load-balancing service function chain deployment method in dynamic network environment | |
| CN109995435B (en) | Virtual network mapping method and system based on multi-fiber core optical network | |
| US9197350B2 (en) | Systems and methods for routing and wavelength assignment for network virtualization | |
| CN102664814B (en) | Grey-prediction-based adaptive dynamic resource allocation method for virtual network | |
| EP3793206B1 (en) | Physical optical network virtualization mapping method and apparatus, and controller and storage medium | |
| US20180279261A1 (en) | Resource allocation device and resource allocation method | |
| WO2012158718A1 (en) | Extensible centralized dynamic resource distribution in a clustered data grid | |
| CN108965014A (en) | The service chaining backup method and system of QoS perception | |
| CN111586502A (en) | Resource allocation method and system in elastic optical network | |
| CN111130858A (en) | Dynamic multi-target virtual network mapping method under SD-WAN scene | |
| CN112350935B (en) | Path calculation method and device for path with stack depth constraint | |
| CN105245307A (en) | Method of determining communication path in communication network and equipment | |
| CN111698114B (en) | Determining and implementing optimized traffic plans with constrained optimization of egress peer-to-peer engineering | |
| Takeda et al. | Multipath provisioning scheme for fault tolerance to minimize required spectrum resources in elastic optical networks | |
| CN113316039A (en) | Virtual network survival mapping method based on reliability and time-frequency resource perception | |
| CN113422726A (en) | Service chain deployment method and device, storage medium and electronic device | |
| CN114466059B (en) | Method for providing reliable service function chain for mobile edge computing system | |
| CN114614899B (en) | Data center virtual optical network mapping method and device and electronic equipment | |
| CN116016307A (en) | Method and device for transmitting calculation network parameters and electronic equipment | |
| JPWO2014102996A1 (en) | Information processing system | |
| CN114615269B (en) | Data center network mapping system and method | |
| CN109828829B (en) | Virtual machine rapid evacuation method based on disaster early warning time |
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 |