WO2019072162A1 - 虚拟网络映射方法、设备和存储介质 - Google Patents

虚拟网络映射方法、设备和存储介质 Download PDF

Info

Publication number
WO2019072162A1
WO2019072162A1 PCT/CN2018/109432 CN2018109432W WO2019072162A1 WO 2019072162 A1 WO2019072162 A1 WO 2019072162A1 CN 2018109432 W CN2018109432 W CN 2018109432W WO 2019072162 A1 WO2019072162 A1 WO 2019072162A1
Authority
WO
WIPO (PCT)
Prior art keywords
virtual
node
link
physical
mapping
Prior art date
Application number
PCT/CN2018/109432
Other languages
English (en)
French (fr)
Inventor
卢华
王延松
吴少勇
陈立全
王慕阳
陈阳
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2019072162A1 publication Critical patent/WO2019072162A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H04L12/4641—Virtual LANs, VLANs, e.g. virtual private networks [VPN]
    • 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/0803—Configuration setting
    • 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

Definitions

  • the present disclosure relates to, but is not limited to, the field of communication technology.
  • Network virtualization technology is conducive to solving the problems of rigid network structure and poor scalability in the existing Internet architecture, and is the key to the future network structure renewal.
  • the present disclosure provides a virtual network mapping method, including: receiving a virtual network request, where the virtual network request carries resource requirement information of a virtual network; and in the physical network, selecting a physical node that satisfies the resource requirement information and has the lowest occupancy rate The physical link performs virtual network mapping.
  • the present disclosure also provides a virtual network mapping device including a processor and a memory; the processor configured to execute a program stored in the memory to: receive a virtual network request, the virtual network request carrying a virtual The resource requirement information of the network; in the physical network, the physical node and the physical link that meet the resource requirement information and have the lowest occupancy rate are selected for virtual network mapping.
  • the present disclosure provides a storage medium storing one or more programs that can be executed by one or more processors to implement the virtual network mapping methods described herein.
  • FIG. 1 is a flow chart of a virtual network mapping method in accordance with an embodiment of the present disclosure
  • FIG. 2 is a flow diagram of a node mapping phase in accordance with an embodiment of the present disclosure
  • FIG. 3 is a flow diagram of a link mapping phase in accordance with an embodiment of the present disclosure.
  • FIG. 4 is a schematic diagram of a virtual network mapping method in accordance with an embodiment of the present disclosure.
  • FIG. 5 is a structural diagram of a virtual network mapping device according to an embodiment of the present disclosure.
  • Virtual network mapping is involved in network virtualization technologies. The essence of virtual network mapping is to independently operate multiple virtual subnets on a common physical network through abstraction and distribution mechanisms. Each virtual subnet can use independent protocol systems and can be based on the dynamic changes of users.
  • the nodes and link resources in the network are properly configured to enhance the flexibility and diversity of the network, optimize the allocation and scheduling of network resources, improve security and service quality, and reduce operation and maintenance costs.
  • the mapping between the underlying physical hardware and the network may be performed according to the virtual network request sent by the user, and the requirements of the virtual network request for each resource (such as the node computing capability and the link) are also met. Bandwidth, etc.)
  • the efficiency and performance of virtual network mapping will directly affect the application of network virtualization technology.
  • virtual network mapping is performed on all virtual network request orders in a time window in a time window; if the mapping is successful, the underlying physical network state is updated; if the mapping fails, the virtual network request is placed Waiting queue; if the number of mapping failures exceeds the threshold, the virtual network request is directly rejected.
  • the implementation of virtual network mapping can be divided into two steps: node mapping and link mapping.
  • the virtual node mapping is mainly based on the greedy method, and the virtual link mapping is performed using the k shortest path algorithm.
  • the node and link mapping often only consider the requirements of the current virtual network request, and adopt the greedy method as the guiding ideology, and the resource utilization rate and the mapping success rate are optimization targets, regardless of the node, Link load balancing problem, which often causes the core node resources in the physical network to be exhausted prematurely while other nodes have not yet been mapped.
  • the saturated nodes become resource bottlenecks, which increase the burden on some nodes and reduce the resource mapping. Efficiency and success rate.
  • the present disclosure provides a virtual network mapping method, apparatus, and storage medium that avoids one or more of the problems caused by the limitations and disadvantages of the related art.
  • FIG. 1 is a flowchart of a virtual network mapping method in accordance with an embodiment of the present disclosure. As shown in FIG. 1, the method may include step S101 and step S102.
  • a virtual network request is received, and the virtual network request carries resource requirement information of the virtual network.
  • a virtual network request is used to request that a virtual network be mapped to a physical network.
  • a virtual network request is used to request that a virtual node be mapped to a physical node, and a virtual link is mapped to a physical link.
  • the resource requirement information includes resource requirement information of a plurality of virtual nodes and resource requirement information of the plurality of virtual links.
  • the resource requirement information of the virtual node includes but is not limited to: CPU (Central Processing Unit) resource requirement information.
  • the resource requirement information of the virtual link includes but is not limited to: bandwidth resource requirement information.
  • a physical node and a physical link that satisfy the resource requirement information and have the lowest occupancy rate are selected and virtual network mapping is performed.
  • the virtual network mapping includes a node mapping phase and a link mapping phase.
  • the node mapping phase determining the request value of the virtual node according to the resource requirement information of each virtual node and the resource requirement information of the virtual link including the virtual node; sequentially, in descending order of the request value Mapping the plurality of virtual nodes to a physical node that meets the corresponding resource requirement information and has the lowest node occupancy rate; in the link mapping phase, the bandwidth requirement value in the resource requirement information of the multiple virtual links is from a large value In a small order, the plurality of virtual links are sequentially mapped to physical links that meet respective resource requirement information and have the lowest link occupancy rate.
  • the virtual node with the largest request value is determined among the unmapped virtual nodes, and the physical node that meets the resource requirement information of the virtual node with the largest request value is selected; according to the physical node The number of virtual machines, determining the node occupancy rate of the physical node; mapping the virtual node with the largest request value to the physical node with the lowest node occupancy rate; determining whether there is an unmapped virtual node, if there is an unmapped The virtual node continues virtual node mapping until the plurality of virtual nodes are mapped to corresponding physical nodes.
  • the virtual link having the largest bandwidth requirement value is determined in the unmapped virtual link, and the physical link that meets the resource requirement information of the virtual link with the largest bandwidth requirement value is selected; according to the physical Mapping the bandwidth usage of the link and the length of the physical link, determining the link occupancy rate of the physical link; mapping the virtual link with the largest bandwidth requirement value to the physical link with the lowest link occupancy rate Determining whether there is an unmapped virtual link, and if there is an unmapped virtual link, continuing the virtual link mapping until the plurality of virtual links are mapped to the corresponding physical link.
  • the virtual network mapping method based on the occupancy rate feedback provided by the embodiments of the present disclosure can be applied to networks of various underlying physical topologies, including but not limited to tree topology, mesh topology, and hybrid topology network.
  • the underlying physical network carries multiple virtual networks and needs to consume certain network resources, including CPU resources of physical nodes and bandwidth resources of physical links.
  • the physical network of the underlying physical network joins and leaves each virtual network.
  • the resources on the top will be unevenly distributed, and the remaining resources of each physical node and physical link will be different.
  • the current method can efficiently map the virtual network to the physical network.
  • the current virtual network mapping method can improve the resource utilization of the physical network and reduce the cost of the virtual network mapping while satisfying the resource requirements of the virtual network request.
  • the node occupancy parameter is added in the node mapping phase, and the underlying physical node is occupied by other virtual network requests, and the load pressure of the distributed node is balanced as much as possible, thereby effectively reducing the resource bottleneck of the key node. Probability; In the link mapping phase, by adding the link occupancy parameter, the link mapping can be successful in the previous mapping, and the efficiency and success rate of the link mapping are improved.
  • the virtual network mapping method of the present disclosure is further described below.
  • the node mapping phase and the link mapping phase will be separately described below.
  • the node mapping phase may include the following steps S201 to S209.
  • step S201 in the virtual network request queue, a virtual network request is acquired, where the virtual network request carries resource requirement information of multiple virtual nodes and resource requirement information of multiple virtual links.
  • Each virtual network request carries resource requirement information of multiple virtual nodes and resource requirement information of multiple virtual links.
  • the resource requirement information of the virtual node is CPU resource requirement information
  • the resource requirement information of the virtual link is bandwidth resource requirement information.
  • the CPU resource requirement information may be a minimum CPU capacity demand value required by the virtual node.
  • the bandwidth resource requirement information may be a minimum bandwidth requirement value required for the virtual link.
  • the request value of each virtual node is calculated according to the resource requirement information of each virtual node and the resource requirement information of the corresponding virtual link, and the virtual nodes are sorted according to the order of the request values. .
  • the request value (rv) represents the importance of the virtual node in the virtual network request. The more important a virtual node with a request value (rv) is, the more important the virtual node is mapped.
  • BW(l v ) represents the bandwidth requirement value of the virtual link 1 v
  • CPU(n v ) represents the CPU capacity requirement value of the virtual node n v
  • L(n v ) represents the virtual link 1 including the virtual node n v v , that is, the virtual node n v is a node in the virtual link l v
  • ⁇ and ⁇ are weight adjustment parameters for balancing CPU capacity and link bandwidth
  • ⁇ and ⁇ are empirical values or experimentally obtained values.
  • the range of values for ⁇ and ⁇ is usually between 1 and 3. In one embodiment, both alpha and beta are set to one.
  • step S203 it is judged whether or not there is a virtual node that is not mapped, and if so, step S204 is performed, and if not, the node mapping is completed, and a link mapping phase (described later) is entered.
  • Step S204 In the unmapped virtual node, select the virtual node with the largest request value as the current virtual node, and determine whether there is a physical node in the physical network that has a remaining CPU capacity greater than a CPU capacity requirement value of the current virtual node; if yes, Then, step S205 is performed; if not, step S207 is performed.
  • step S205 if there is a physical node that satisfies the CPU resource requirement information required by the virtual node, step S205 is performed; otherwise, the virtual network request mapping fails, and step S207 needs to be performed.
  • Step S205 Calculate the weighted resource value of the physical node in the physical node whose remaining CPU capacity is greater than the required CPU capacity requirement of the current virtual node.
  • the weighted resource value (wrv) is a parameter used to calculate the ability of the underlying physical node to provide resources, and the weighted resource value (wrv) may represent the amount of resources of the physical node.
  • the calculation formula of the weighted resource value wrv(n s ) of the physical node n s is as follows;
  • neigh is the bandwidth coefficient of the physical node ns;
  • index m of the neigh indicates the number of physical nodes that have completed mapping according to the current virtual network request and the physical node n s ;
  • occupy indicates that the physical node n s has been used by other virtual networks
  • the occupied parameter of the requested virtual node mapping; the index n of the occupy is the number of times the physical node n s has been mapped by the virtual node requested by the other virtual network.
  • neigh is a real number greater than one.
  • the neigh m can reflect the bandwidth of the physical node. The higher the neigh m value of the physical node, the better the bandwidth resource between the physical node and the physical node that has been mapped according to the virtual network request.
  • occupy is a real number between 0 and 1, the smaller the value chosen by occupy, the more the feedback of occupy is enhanced.
  • the bearer is represented by the number of virtual machines that already exist on the physical node, because each virtual node is mapped to create a virtual machine on the corresponding physical node to complete the function of the virtual node.
  • the number of selected physical nodes is plural.
  • the weighted resource values (wrv) of each physical node are calculated, and the physical nodes are sorted in descending order of weighted resource values (wrv).
  • step S206 the physical node having the largest weighted resource value is assigned to the current virtual node, the node mapping is completed, and then the flow returns to step S203 to check whether there are still unmapped virtual nodes.
  • step S207 the number of failures of the virtual network request is accumulated, and it is determined whether the number of times the virtual network request fails exceeds a preset number of times; if yes, step S208 is performed; if not, step S209 is performed.
  • step S208 the virtual network request is rejected.
  • the virtual network request is sent to the virtual network request queue for the next mapping.
  • the weighted resource value introduces a parameter occupy. If a physical node has not been mapped by another virtual node, the weighted resource value (wrv) of the physical node is relatively large, then the physical node will Mapped with a higher priority; if a physical node has been mapped by another virtual node, the weighted resource value (wrv) of the physical node is relatively small, then the physical node will be mapped again with a lower priority .
  • the mapping load pressure of each physical node is balanced, the probability of resource bottleneck of the key node is effectively reduced, and the node load balancing is achieved.
  • the link mapping phase may include the following steps S301 to S309.
  • the plurality of virtual links requested by the virtual network request are sorted according to the bandwidth requirement value from largest to smallest.
  • step S302 it is determined whether there is a virtual link that is not mapped; if yes, step S303 is performed; if not, the link mapping is completed.
  • step S303 in the unmapped virtual link, the virtual link with the largest bandwidth requirement value is selected as the current virtual link, and the first K shortest paths are selected in the physical network for the current virtual link according to the K shortest path algorithm. (K is greater than 1).
  • the path lengths of the first K shortest paths are multiplied by the corresponding bandwidth occupancy rates to obtain the link occupancy rate of the first K shortest paths.
  • the bandwidth usage is used to reflect the ratio of the available bandwidth of the physical link to the total bandwidth of the link, or the ratio of the occupied bandwidth to the total bandwidth of the link.
  • the bandwidth usage is the ratio of the occupied bandwidth to the total bandwidth of the link.
  • bandwidth occupancy 1 - (the available bandwidth of the physical link / the total bandwidth of the physical link) + ⁇ ;
  • ⁇ is greater than zero, which is used to prevent the value of the bandwidth occupancy from becoming zero when the physical link is not occupied.
  • ⁇ is the empirical value or the value obtained by the experiment. In one example, ⁇ is taken as 0.5.
  • the lengths of the calculated shortest paths are multiplied by the respective bandwidth occupation rates to obtain the link occupancy rate, which can take into account not only the length of the shortest path but also The current link resource of the shortest path is also referred to.
  • step S305 in the first K shortest paths, it is determined whether there is a shortest path that matches the bandwidth demand value of the current virtual link, and if so, step S306 is performed, and if no, step S307 is performed.
  • step S306 the shortest path that satisfies the bandwidth requirement value of the current virtual link and the minimum link occupancy rate is allocated to the current virtual link, completes the link mapping, and then jumps to step S303 to check if there are other unmapped. Virtual link.
  • step S307 the number of failures of the virtual network request is accumulated, and it is determined whether the number of times the virtual network request fails exceeds a preset number of times; if yes, step S308 is performed; if not, step S309 is performed.
  • step S308 the virtual network request is rejected.
  • the virtual network request is sent to the virtual network request queue for the next mapping.
  • the link resource occupancy is considered in the solution of the shortest path, so that the link mapping can be successfully successful in the previous mapping, which greatly improves the Link mapping efficiency and success rate.
  • the virtual network mapping method of the embodiment of the present disclosure avoids the greedy algorithm based on the node CPU and the link resource, and the node with higher CPU resources and its neighbor nodes in the physical network are preferentially mapped, while other nodes have not yet been mapped.
  • the virtual network mapping method of the embodiment of the present disclosure performs virtual network mapping based on the occupancy rate feedback, overcomes the above-mentioned deficiencies, effectively balances the load pressure of the node, and improves the link mapping efficiency and success rate.
  • G s Weighted undirected graph of physical network resources G s :
  • the parameters in G s are CPU(i), NVM(i), BW(i,j).
  • CPU(i) is the allocatable CPU resource owned by each physical node in the underlying physical network;
  • NVM(i) is the number of virtual machines created by each physical node in the underlying physical network. This parameter represents that the physical node has been How many virtual network requests are mapped, the value of which is the index n in the parameter occupy n ;
  • BW(i, j) which is the bandwidth resource that all physical links in the underlying physical network can provide.
  • G v Weighted undirected graph of virtual network request
  • the parameters in G v are CPU (I) and BW (I, J).
  • the CPU (I) is the CPU capacity demand value requested by each virtual node in the virtual network request;
  • BW (I, J) is the bandwidth demand value requested by each virtual link in the virtual network request.
  • the parameters CPU(i), NVM(i), CPU(I) and BW(I,J) can be obtained from the Nova module of Openstack (cloud computing management platform), and the parameter BW(i,j) can be obtained from Openstack. Obtained in the SDN Management Module.
  • FIG. 4 is a schematic diagram of a virtual network mapping method according to an embodiment of the present disclosure.
  • the physical node 1, the physical node 2, the physical node 3, and the physical node 4 are included in the physical network, and any two nodes are connected to each other.
  • the remaining CPU capacity of the physical node 1 is 60
  • the remaining CPU capacity of the physical node 2 is 80
  • the remaining CPU capacity of the physical node 3 is 70
  • the remaining CPU capacity of the physical node 4 is 39.
  • the bandwidth between the physical node 1 and the physical node 2 is 80
  • the bandwidth between the physical node 1 and the physical node 3 is 70
  • the bandwidth between the physical node 1 and the physical node 4 is 90
  • the physical node 2 and the physical node The bandwidth between 3 is 50
  • the bandwidth between physical node 2 and physical node 4 is 80
  • the bandwidth between physical node 3 and physical node 4 is 80. Since the bandwidth of physical node 1 to physical node 4 is not occupied, the available bandwidth is equal to the total bandwidth.
  • the value of the CPU capacity and the value of the bandwidth are relative values for indicating the relative sizes of the CPU capacity and the bandwidth.
  • the virtual network request queue includes: a virtual network request 1, a virtual network request 2, a virtual network request 3, and a virtual network request 4.
  • the virtual network request 1 is the head of the team, and the virtual network request 4 is the tail of the team.
  • the following steps 11 to 15 and 21 to 25 may be performed.
  • the virtual network request 1 is obtained from the virtual network request queue, and the virtual network mapping process for the virtual network request 1 is performed.
  • the virtual network request 1 is used to request to map the virtual node 1, the virtual node 2, the virtual node 3, and the virtual node 4 to the physical node respectively, and the virtual link 1, the virtual link 2, and the virtual link 3 are mapped to physical links respectively.
  • the virtual link 1 is a virtual node 1 ⁇ a virtual node 2
  • the virtual link 2 is a virtual node 2 ⁇ a virtual node 3
  • the virtual link 3 is a virtual node 1 ⁇ a virtual node 4.
  • the virtual network request includes: CPU capacity requirement values of the virtual node 1, the virtual node 2, the virtual node 3, and the virtual node 4, and bandwidth requirement values of the virtual link 1, the virtual link 2, and the virtual link 3.
  • the CPU capacity requirement value of the virtual node 1 is 40
  • the CPU capacity requirement value of the virtual node 2 is 20
  • the CPU capacity requirement value of the virtual node 3 is 25,
  • the CPU capacity requirement value of the virtual node 4 is 10.
  • the bandwidth requirement value of virtual link 1 is 50
  • the bandwidth requirement value of virtual link 2 is 45
  • the bandwidth requirement value of virtual link 3 is 30.
  • the value of the CPU capacity demand value and the value of the bandwidth demand value are relative values for indicating the relative size of the CPU capacity requirement and the bandwidth requirement.
  • the request values (rv) of the virtual nodes 1 to 4 are respectively calculated, and the virtual nodes 1 to 4 are sorted according to the request value (rv) from largest to smallest. Both ⁇ and ⁇ are 1 in the calculation.
  • the virtual node 1, the virtual node 2, the virtual node 3, and the virtual node 4 can be obtained by sorting the request values of the virtual nodes from large to small.
  • the following steps are described only with the mapping procedure of the virtual node 1 having the largest request value, and the virtual node 2, the virtual node 3, and the virtual node 4 are referred to the mapping step of the virtual node 1.
  • the virtual node 1 having the largest request value is first mapped, and in the physical network, the physical node whose remaining CPU capacity is greater than the CPU capacity requirement value of the virtual node 1 is selected.
  • the virtual node 1 requires a CPU capacity requirement value of 40. Then, the physical node 1 to the physical node 3 meet the virtual node 1 requirement for CPU resources.
  • the weighted resource values (wrv) of physical node 1 to physical node 4 are calculated, respectively.
  • neigh takes 2 and occupy takes 0.5.
  • the weighted resource value of the physical node 2 is the largest.
  • the physical node 2 with the largest weighted resource value is assigned to the current virtual node 1, the virtual node 1 is mapped to the physical node 2, and then the virtual node 2, the virtual node 3, and the virtual node 4 are sequentially mapped, and the completion is completed.
  • the virtual node 2 After mapping the virtual node 1 to the physical node 2, according to the mapping step of the virtual node 1, the virtual node 2 can be finally mapped to the physical node 1, the virtual node 3 is mapped to the physical node 3, and the virtual node 4 is mapped to the physical node. 4. At this point, the node mapping phase is completed and the link mapping phase is entered.
  • the method may further include the steps of: determining whether the number of times the virtual network request mapping fails exceeds a preset number of times, and rejecting the request if it is exceeded, and sending the request to the waiting queue if not exceeded, waiting for the next time. Node mapping.
  • virtual link 1, virtual link 2, and virtual link 3 are ordered in descending order of bandwidth demand values.
  • the sort result is virtual link 1, virtual link 2, and virtual link 3.
  • the first K shortest paths are selected in the physical network for the virtual link 1 having the largest bandwidth demand value.
  • virtual link 1 is virtual node 1 ⁇ virtual node 2, corresponding to the physical network, virtual link 1 corresponds to physical node 1 ⁇ physical node 2, and thus the first 3 pieces are calculated.
  • the shortest path is physical node 1 ⁇ physical node 2, physical node 1 ⁇ physical node 4 ⁇ physical node 2, physical node 1 ⁇ physical node 3 ⁇ physical node 2, and the path lengths are 1, 2, and 2, respectively.
  • the path lengths of the first three shortest paths are respectively multiplied by the corresponding bandwidth occupancy rates, and the path lengths of the first three shortest paths are optimized.
  • ⁇ is taken as 0.5. Since the bandwidth of the physical node 1 to the physical node 4 is not occupied, the bandwidth can be equal to the total bandwidth. Therefore, the bandwidth consumption of the first three shortest paths is 0.5, so that the shortest path 1: physical node 1 ⁇ physical node 2 is optimized.
  • the path length after the path is 0.5
  • the shortest path 2 the physical path 1 ⁇ 4 ⁇ 2 optimized path length is 1
  • the shortest path 3 physical node 1 ⁇ physical node 3 ⁇ physical node 2 optimized path length is 1.
  • the shortest path 1: physical node 1 ⁇ physical node 2 optimized path length is the shortest.
  • the first 3 shortest paths all satisfy the bandwidth requirement value 50 of virtual link 1.
  • Shortest path 1 Physical Node 1 ⁇ Physical Node 2 has an available bandwidth of 80.
  • the available bandwidth of the physical node 1 ⁇ physical node 4 is 90, and the available bandwidth of the physical node 4 ⁇ physical node 2 is 80. Therefore, the available bandwidth of the shortest path 1: physical node 1 ⁇ physical node 4 ⁇ physical node 2 is 80.
  • the available bandwidth of physical node 1 ⁇ physical node 3 is 70, and the available bandwidth of physical node 3 ⁇ physical node 2 is 50. Therefore, the available bandwidth of the shortest path 3: physical node 1 ⁇ physical node 3 ⁇ physical node 2 is 50.
  • the first 3 shortest paths satisfy the bandwidth requirement value 50 of the virtual link 1.
  • the shortest path 1 having the shortest optimized path length is assigned to the virtual link 1.
  • the virtual link 1 is mapped onto the link between the physical node 1 and the physical node 2
  • the virtual link 2 and the virtual link 3 are mapped into the physical network with reference to the mapping step of the virtual link 1.
  • the virtual link 2 is finally mapped onto the link between the physical nodes 1 and 3, and the virtual link 3 is mapped onto the link between the physical nodes 2 and 4, at which point the link mapping phase is completed.
  • Embodiments of the present disclosure provide a network function virtualization resource mapping method based on occupancy rate feedback.
  • the physical node selection is performed based on the remaining CPU resources of the physical node, the link bandwidth, and the node occupancy rate feedback. If a physical node has been mapped by a virtual node in another virtual network request, the physical node will The lower probability is selected; in the link mapping phase, the length of the integrated link path and the bandwidth resource occupancy rate are preferentially mapped to the physical link with a low occupancy rate.
  • the embodiments of the present disclosure are applicable to network function virtualization resource mapping, and have the advantages of uniformity of physical node load bearing, high efficiency of link mapping, and high success rate of virtual network request mapping.
  • the present disclosure also provides a computer program.
  • the computer program when executed by the processor, causes the processor to perform the steps of: receiving a virtual network request, the virtual network request carrying resource requirement information of the virtual network; and selecting, in the physical network, the resource requirement information and the occupancy rate The lowest physical node and physical link are virtual network mapped.
  • the resource requirement information includes resource requirement information of multiple virtual nodes and resource requirement information of multiple virtual links.
  • the virtual network mapping includes a node mapping phase and a link mapping phase.
  • the computer program when executed by the processor, causes the processor to perform the following steps: in the node mapping phase, according to resource requirement information of each virtual node and resources of the virtual link including the virtual node Determining the request value of the virtual node; sequentially, according to the order of the request value, mapping the plurality of virtual nodes to physical nodes that meet respective resource requirement information and have the lowest node occupancy rate;
  • the link mapping phase the multiple virtual links are sequentially mapped to meet the corresponding resource requirement information and chain according to the bandwidth requirement values in the resource requirement information of the multiple virtual links. The physical link with the lowest road occupancy.
  • the computer program when executed by the processor, causes the processor to further perform the steps of: determining a virtual node having the highest requested value among the unmapped virtual nodes, and selecting a virtual node that satisfies the request value the largest The physical node of the resource requirement information; determining the node occupancy rate of the physical node according to the number of virtual machines of the physical node; mapping the virtual node with the largest request value to the physical node with the lowest node occupancy rate; determining whether the existence exists The virtual node that is not mapped, if there is a virtual node that is not mapped, continues the virtual node mapping until the multiple virtual nodes are mapped to the corresponding physical node.
  • the computer program when executed by the processor, causes the processor to perform the step of determining a virtual link having the largest bandwidth demand value in the unmapped virtual link, selecting to meet the bandwidth demand value
  • the physical link of the resource requirement information of the largest virtual link determining the link occupancy rate of the physical link according to the bandwidth occupancy rate of the physical link and the length of the physical link;
  • the virtual link with the largest value is mapped to the physical link with the lowest link occupancy; it is determined whether there is an unmapped virtual link. If there is an unmapped virtual link, the virtual link mapping is continued until the virtual link is mapped.
  • the multiple virtual links are mapped to the corresponding physical links.
  • the present disclosure also provides a storage medium storing the above computer program.
  • the storage medium may be any suitable storage medium as long as the above program can be stored.
  • the storage medium may be a read only memory, a magnetic disk or an optical disk, or the like.
  • FIG. 5 is a schematic diagram of a hardware structure of a virtual network mapping device according to an embodiment of the present disclosure.
  • virtual network mapping device 500 can include one or more (only one shown) processor 510 (processor 510 can include, but is not limited to, processing of a microprocessor MCU or a programmable logic device FPGA, etc.
  • the virtual network mapping device 500 may further include more or less components than those shown in FIG. 5 or may have a different configuration than that shown in FIG. 5 by splitting or merging the above functions.
  • the memory 520 can be configured as a software program and a module for storing application software.
  • the program instructions/modules corresponding to the virtual network mapping method disclosed in the foregoing embodiments can be stored in the memory 520.
  • the virtual network mapping method has been described in detail in the previous embodiment. Therefore, this embodiment will not be repeated in detail.
  • the processor 510 implements the above-described virtual network mapping method by executing (executing) a software program and a module stored in the memory 520, thereby executing various functional applications and data processing.
  • Memory 520 can include high speed random access memory and can also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid state memory.
  • memory 520 can further include a memory (eg, cloud memory) remotely located relative to processor 510 that can be connected to virtual network mapping device 500 over a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.
  • Data transceiver 530 is configured to receive or transmit data via a network. Examples of the network described above may include a wireless network provided by a communication provider of the virtual network mapping device 500.
  • the data transceiver 530 includes a Network Interface Controller (NIC) that can be connected to other network devices through a base station to communicate with the Internet.
  • the data transceiver 530 includes a Radio Frequency (RF) module configured to communicate with the Internet wirelessly.
  • NIC Network Interface Controller
  • RF Radio Frequency

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本申请提供了一种虚拟网络映射方法、设备和存储介质。该方法包括：接收虚拟网络请求，所述虚拟网络请求携带虚拟网络的资源需求信息；在物理网络中，选择满足所述资源需求信息且占用率最低的物理节点和物理链路进行虚拟网络映射。

Description

虚拟网络映射方法、设备和存储介质 技术领域
本公开涉及但不限于通信技术领域。
背景技术
网络虚拟化技术有利于解决现有互联网架构中存在的网络结构僵化、可扩展性差等问题，是未来网络结构更新换代的关键。
发明内容
本公开提供一种虚拟网络映射方法，包括：接收虚拟网络请求，所述虚拟网络请求携带虚拟网络的资源需求信息；在物理网络中，选择满足所述资源需求信息且占用率最低的物理节点和物理链路进行虚拟网络映射。
本公开还提供了一种虚拟网络映射设备，所述虚拟网络映射设备包括处理器、存储器；所述处理器配置为执行存储器中存储的程序以：接收虚拟网络请求，所述虚拟网络请求携带虚拟网络的资源需求信息；在物理网络中，选择满足所述资源需求信息且占用率最低的物理节点和物理链路进行虚拟网络映射。
本公开提供了一种存储介质，所述存储介质存储有一个或者多个程序，所述一个或者多个程序可被一个或者多个处理器执行，以实现本文所述的虚拟网络映射方法。
附图说明
图1是根据本公开实施例的虚拟网络映射方法的流程图；
图2是根据本公开实施例的节点映射阶段的流程图；
图3是根据本公开实施例的链路映射阶段的流程图；
图4是根据本公开实施例的虚拟网络映射方法的示意图；
图5是根据本公开实施例的虚拟网络映射设备的结构图。
具体实施方式
以下结合附图以及实施例，对本公开进行进一步详细说明。应当理解，此处所描述的具体实施例仅仅用以解释本公开，并不限定本公开。
在网络虚拟化技术中涉及虚拟网络映射。虚拟网络映射的本质是通过抽象和分配机制在一个公共物理网络上独立地运营多个虚拟子网，各虚拟子网可以使用相互独立的协议体系，并能够根据用户的动态变化需求，对整个虚拟网络中的节点和链路资源进行合理配置，从而增强网络的灵活性与多样性，最优化网络资源的分配与调度，提高安全和服务质量、降低运营维护成本。
在应用上，在进行虚拟网络映射时，可以根据用户发送的虚拟网络请求，进行底层物理硬件和网络的映射，同时还要满足虚拟网络请求对各个资源的限制要求(如节点计算能力、链路带宽等)，虚拟网络映射的效率和性能将直接影响到网络虚拟化技术的应用。
在相关技术中，以时间窗为单位，对一个时间窗内的所有虚拟网络请求顺序进行虚拟网络映射；若映射成功，则更新底层物理网络状态；若映射失败，则将该虚拟网络请求放入等待队列；若映射失败次数超过阈值，则直接拒绝该虚拟网络请求。虚拟网络映射的实现过程可以分为两个步骤：节点映射和链路映射。目前，主要是基于贪婪方法进行虚拟节点映射，使用k最短路径算法进行虚拟链路映射。
在相关技术的虚拟网络映射方法中，节点、链路映射往往只考虑到当前虚拟网络请求的需求，以贪婪方法为指导思想，以资源利用率，映射成功率为优化目标，而不考虑节点、链路映射的负载平衡问题，这样常常导致物理网络中的核心节点资源被过早的耗尽而其他节点还尚未映射，已经饱和的节点成为资源瓶颈，加重部分节点的负担，降低了资源映射的效率和成功率。
因此，本公开提供了一种虚拟网络映射方法、设备和存储介质，其避免了相关技术的局限和缺点所导致的问题中的一个或多个。
一方面，本公开提供了一种虚拟网络映射方法。图1为根据本公开实施例的虚拟网络映射方法的流程图。如图1所示，所述方法可 以包括步骤S101和步骤S102。
在步骤S101处，接收虚拟网络请求，所述虚拟网络请求携带虚拟网络的资源需求信息。
虚拟网络请求用于请求将虚拟网络映射到物理网络中。例如，虚拟网络请求用于请求将虚拟节点映射到物理节点，将虚拟链路映射到物理链路。
资源需求信息包括多个虚拟节点的资源需求信息以及多条虚拟链路的资源需求信息。例如，虚拟节点的资源需求信息包括但不限于：CPU(Central Processing Unit，中央处理器)资源需求信息。例如，虚拟链路的资源需求信息包括但不限于：带宽资源需求信息。
在步骤S102处，在物理网络中，选择满足所述资源需求信息且占用率最低的物理节点和物理链路并进行虚拟网络映射。
在一些实施例中，虚拟网络映射，包括：节点映射阶段和链路映射阶段。
在节点映射阶段，根据每个虚拟节点的资源需求信息以及包含所述虚拟节点的虚拟链路的资源需求信息，确定所述虚拟节点的请求值；按照请求值从大到小的顺序，顺次将所述多个虚拟节点映射到满足各自对应的资源需求信息且节点占用率最低的物理节点；在链路映射阶段，按照所述多条虚拟链路的资源需求信息中的带宽需求值从大到小的顺序，顺次将所述多条虚拟链路映射到满足各自对应的资源需求信息且链路占用率最低的物理链路。
在一些实施例中，在节点映射阶段，在未被映射的虚拟节点中确定请求值最大的虚拟节点，选择满足所述请求值最大的虚拟节点的资源需求信息的物理节点；根据所述物理节点的虚拟机数量，确定所述物理节点的节点占用率；将所述请求值最大的虚拟节点映射到节点占用率最低的物理节点；判断是否存在未被映射的虚拟节点，如果存在未被映射的虚拟节点，则继续进行虚拟节点映射，直到所述多个虚拟节点都映射到对应的物理节点为止。在链路映射阶段，在未被映射的虚拟链路中确定带宽需求值最大的虚拟链路，选择符合所述带宽需求值最大的虚拟链路的资源需求信息的物理链路；根据所述物理链路 的带宽占用率以及所述物理链路的长度，确定所述物理链路的链路占用率；将所述带宽需求值最大的虚拟链路映射到链路占用率最低的物理链路上；判断是否存在未被映射的虚拟链路，如果存在未被映射的虚拟链路，则继续进行虚拟链路映射，直到所述多条虚拟链路都映射到对应的物理链路为止。
本公开实施例提供的基于占有率反馈的虚拟网络映射方法可以适用于各种底层物理拓扑结构的网络中，包括但不限于树型拓扑结构、网状拓扑结构以及混合型拓扑结构网络。
在实际的应用中，底层物理网络承载多个虚拟网络，需要消耗一定的网络资源，包括物理节点的CPU资源、物理链路的带宽资源等，随着各个虚拟网络的加入与离开，底层物理网络上的资源将会出现分布不均的情况，各个物理节点和物理链路所具有的剩余资源各不相同。当有一个新的虚拟网络请求需要映射到底层物理网络上时，通过当前的方法，可以高效地将虚拟网络映射到物理网络中。当前的虚拟网络映射方法在满足虚拟网络请求的资源需求的同时，能够尽可能的提高物理网络的资源利用率，降低虚拟网络映射的成本。
根据当前的虚拟网络映射方法，在节点映射阶段中增加节点占用率参数，考虑底层物理节点被其他虚拟网络请求占用的情况，尽可能均衡的分散节点负载压力，有效地降低了关键节点资源瓶颈的概率；在链路映射阶段中，通过添加链路占用率参数，使得链路映射在前几次映射就能成功，提高链路映射的效率和成功率。
下面对本公开的虚拟网络映射方法进行进一步地描述。为了使本公开更加清楚，下面将分开描述节点映射阶段和链路映射阶段。
图2为根据本公开实施例的节点映射阶段的流程图。如图2所示，所述节点映射阶段可以包括如下步骤S201至S209。
在步骤S201处，在虚拟网络请求队列中，获取一个虚拟网络请求，该虚拟网络请求携带多个虚拟节点的资源需求信息和多条虚拟链路的资源需求信息。
这里，每接收一个虚拟网络请求就放入虚拟网络请求队列中，顺次处理虚拟网络请求队列中的虚拟网络请求。每个虚拟网络请求携 带多个虚拟节点的资源需求信息和多条虚拟链路的资源需求信息。
在一些实施例中，虚拟节点的资源需求信息为CPU资源需求信息，虚拟链路的资源需求信息为带宽资源需求信息。在一些实施例中，CPU资源需求信息可以为虚拟节点所需的最小CPU容量需求值。在一些实施例中，带宽资源需求信息可以为虚拟链路所需的最小带宽需求值。
在步骤S202处，根据每个虚拟节点的资源需求信息及其对应的虚拟链路的资源需求信息，计算每个虚拟节点的请求值，并按照请求值从大到小的顺序对各个虚拟节点排序。
请求值(rv)代表了虚拟节点在虚拟网络请求中的重要性。请求值(rv)越高的虚拟节点越重要，越重要的虚拟节点越优先进行映射。
例如：虚拟节点n v的请求值rv(n v)的计算公式如下：
Figure PCTCN2018109432-appb-000001
其中，BW(l v)表示虚拟链路l v的带宽需求值；CPU(n v)表示虚拟节点n v的CPU容量需求值；L(n v)表示包含虚拟节点n v的虚拟链路l v，即虚拟节点n v是虚拟链路l v中的节点；α和β是用于平衡CPU容量和链路带宽的权重调节参数，α和β为经验值或者实验获得的值。α和β的取值范围通常都在1至3之间。在一个实施例中，设置α和β都为1。
在步骤S203处，判断是否存在未被映射的虚拟节点，如果是，则执行步骤S204，如果否，则节点映射完成，进入链路映射阶段(稍后描述)。
步骤S204，在未映射的虚拟节点中，选择请求值最大的虚拟节点作为当前虚拟节点，并判断物理网络中是否存在剩余CPU容量大于当前虚拟节点所需CPU容量需求值的物理节点；如果是，则执行步骤S205；如果否，则执行步骤S207。
也就是说，在物理网络中，如果存在满足虚拟节点所需CPU资源需求信息的物理节点，则执行步骤S205，否则，虚拟网络请求映射失败，需要执行步骤S207。
步骤S205，在剩余CPU容量大于当前虚拟节点所需CPU容量需 求值的物理节点中，计算物理节点的加权资源值。
加权资源值(wrv)是用来计算底层物理节点提供资源的能力的参数，加权资源值(wrv)可以代表物理节点的资源量。
例如：物理节点n s的加权资源值wrv(n s)的计算公式如下；
Figure PCTCN2018109432-appb-000002
其中，neigh是物理节点ns的带宽系数；neigh的指数m表示根据当前虚拟网络请求已经完成映射的物理节点与物理节点n s有直接连接的个数；occupy表示物理节点n s已经被其他虚拟网络请求的虚拟节点映射的占用参数；occupy的指数n为物理节点n s已经被其他虚拟网络请求的虚拟节点映射的次数。
在一个示例中，neigh为大于1的实数。neigh m可以反映物理节点的带宽情况，物理节点的neigh m值越高，说明该物理节点与根据虚拟网络请求中已经完成映射的物理节点之间有较好的带宽资源。在一个示例中，occupy为0到1之间的实数，occupy选取的值越小，occupy的反馈作用得到加强。occupy表现为物理节点上已经存在的虚拟机的数量，因为每映射一个虚拟节点就会在对应的物理节点上创建一个虚拟机，以完成该虚拟节点的功能，最终occupy n的值越小，说明该物理节点已被越多的其他虚拟网络请求的虚拟节点所映射。在一些实施例中，出于节点负载平衡的目的，可以不映射occupy n值小的物理节点。
在一些实施例中，在选出剩余CPU资源大于当前选择的虚拟节点所需CPU资源的物理节点之后，选出的物理节点个数为多个。这样，计算每个物理节点的加权资源值(wrv)，并按照加权资源值(wrv)从大到小的顺序对物理节点排序。
在步骤S206处，将加权资源值最大的物理节点分配给当前虚拟节点，完成节点映射，然后跳转回步骤S203，检查是否还有未被映射的虚拟节点。
在步骤S207处，对该虚拟网络请求失败的次数进行累加，并判断该虚拟网络请求失败的次数是否超过预设次数；如果是，则执行步骤S208；如果否，则执行步骤S209。
在步骤S208处，拒绝该虚拟网络请求。
在步骤S209处，将该虚拟网络请求送至虚拟网络请求队列，等待下一次映射。
在本公开中，在节点映射阶段，加权资源值引入了参数occupy，若一个物理节点尚未被其他虚拟节点映射，则该物理节点的加权资源值(wrv)则相对较大，那么该物理节点将以较高的优先级被映射；若一个物理节点已经被其他虚拟节点映射，则该物理节点的加权资源值(wrv)则相对较小，那么该物理节点将以较低的优先级被再次映射。在本公开实施例中，考虑了底层物理节点被其他虚拟网络请求占用的情况，均衡了各物理节点的映射负载压力，有效地降低了关键节点资源瓶颈的概率，达到了节点负载平衡的目的。
图3是根据本公开实施例的链路映射阶段的流程图。如图3所示，所述链路映射阶段可以包括如下步骤S301至S309。
在步骤S301处，在根据虚拟网络请求完成节点映射之后，将虚拟网络请求所请求的多条虚拟链路按照带宽需求值从大到小排序。
在步骤S302处，判断是否存在未被映射的虚拟链路；如果是，则执行步骤S303；如果否，则链路映射完成。
在步骤S303处，在未映射的虚拟链路中，选择带宽需求值最大的虚拟链路作为当前虚拟链路，根据K最短路径算法，为当前虚拟链路在物理网络中选择前K条最短路径(K大于1)。
在步骤S304处，将该前K条最短路径的路径长度分别乘以各自对应的带宽占用率，得到前K条最短路径的链路占用率。
带宽占用率用于体现物理链路的可用带宽占链路总带宽的比例，或者已占用带宽占链路总带宽的比例。这里，带宽占用率为已占用带宽占链路总带宽的比例。
例如，带宽占用率＝1-(物理链路的可用带宽/物理链路的总带宽)+ε；
其中，ε取大于零，用于防止当物理链路未被占用时，带宽占用率的值变为零的情况。ε为经验值或者实验获得的值。在一个示例中，ε取0.5。
在计算前K条最短路径时，将计算出的多条最短路径的长度分别乘以各自对应的带宽占用率，得到链路占用率，该链路占用率可不仅考虑到了最短路径的长度，而且也参考了最短路径当前的链路资源。
在步骤S305处，在前K条最短路径中，判断是否存在符合当前虚拟链路的带宽需求值的最短路径，如果是，则执行步骤S306，如果否，则执行步骤S307。
在步骤S306处，将满足当前虚拟链路的带宽需求值且链路占用率最小的最短路径分配给当前虚拟链路，完成链路映射，然后跳转到步骤S303，检查是否还有其他未映射的虚拟链路。
在步骤S307处，对该虚拟网络请求失败的次数进行累加，并判断该虚拟网络请求失败的次数是否超过预设次数；如果是，则执行步骤S308；如果否，则执行步骤S309。
在步骤S308处，拒绝该虚拟网络请求。
在步骤S309处，将该虚拟网络请求送至虚拟网络请求队列，等待下一次映射。
本公开中，在链路映射阶段中，通过添加带宽占用率这一参数，将链路资源占用情况考虑到最短路径的求解中，使得链路映射在前几次映射就能成功，大大提高了链路映射的效率和成功率。
本公开实施例的虚拟网络映射方法避免了基于对节点CPU和链路资源的贪心算法，所导致的物理网络中具有较高CPU资源的节点及其周边节点会被优先映射，而其他节点还尚未映射的情况发生。本公开实施例的虚拟网络映射方法基于占有率反馈进行虚拟网络映射，克服了上述不足，有效平衡了节点的负载压力，提高链路映射效率和成功率。
此外，本公开实施例中使用的部分参数可以通过加权无向图中体现。
1)物理网络资源的加权无向图G s：G s中的参数有CPU(i)、NVM(i)、BW(i，j)。CPU(i)即底层物理网中每个物理节点所拥有的可分配CPU资源；NVM(i)即底层物理网中每个物理节点分别创建了多少个虚拟机，这个参数代表了该物理节点已被多少个虚拟网络请求映射，其值即为 参数occupy n中的指数n；BW(i，j)，即底层物理网中的所有物理链路可以提供的带宽资源。
2)虚拟网络请求的加权无向图G v：G v中的参数有CPU(I)和BW(I，J)。CPU(I)即虚拟网络请求中每个虚拟节点所请求的CPU容量需求值；BW(I，J)即虚拟网络请求中每条虚拟链路所请求的带宽需求值。
其中，参数CPU(i)、NVM(i)、CPU(I)和BW(I，J)可以从Openstack(云计算管理平台)的Nova模块中获得，参数BW(i，j)可以从Openstack的SDN管理模块中获得。
下面参照具体实施例来对说明本公开的虚拟网络映射方法。
如图4为根据本公开实施例的虚拟网络映射方法的示意图。
在本实施例中，在物理网络中包括物理节点1、物理节点2、物理节点3和物理节点4，其中任意两节点相互连接。这里，物理节点1的剩余CPU容量为60，物理节点2的剩余CPU容量为80，物理节点3的剩余CPU容量为70，物理节点4的剩余CPU容量为39。另外，物理节点1和物理节点2之间的带宽为80，物理节点1和物理节点3之间的带宽为70，物理节点1和物理节点4之间的带宽为90，物理节点2和物理节点3之间的带宽为50，物理节点2和物理节点4之间的带宽为80，物理节点3和物理节点4之间的带宽为80。由于物理节点1至物理节点4的带宽未被占用，即可用带宽等于总带宽。这里，需要注意的是，CPU容量的数值和带宽的数值为相对值，用于表示CPU容量和带宽的相对大小。
在本实施例中，在虚拟网络请求队列中包括：虚拟网络请求1、虚拟网络请求2、虚拟网络请求3和虚拟网络请求4。其中，虚拟网络请求1为队首，虚拟网络请求4为队尾。
根据本公开的虚拟网络映射方法，对于虚拟网络请求1，可以执行以下步骤11至步骤15以及步骤21至步骤25。
在步骤11处，从虚拟网络请求队列中获取虚拟网络请求1，执行针对虚拟网络请求1的虚拟网络映射处理。
在本实施例中，虚拟网络请求1用于请求将虚拟节点1、虚拟节 点2、虚拟节点3和虚拟节点4分别映射到物理节点上，将虚拟链路①、虚拟链路②和虚拟链路③分别映射到物理链路上。虚拟链路①为虚拟节点1→虚拟节点2，虚拟链路②为虚拟节点2→虚拟节点3，虚拟链路③为虚拟节点1→虚拟节点4。
在虚拟网络请求中包括：虚拟节点1、虚拟节点2、虚拟节点3和虚拟节点4的CPU容量需求值，以及虚拟链路①、虚拟链路②和虚拟链路③的带宽需求值。其中，虚拟节点1的CPU容量需求值为40，虚拟节点2的CPU容量需求值为20，虚拟节点3的CPU容量需求值为25，虚拟节点4的CPU容量需求值为10。虚拟链路①的带宽需求值为50，虚拟链路②的带宽需求值为45，虚拟链路③的带宽需求值为30。这里，需要注意的是，CPU容量需求值的数值和带宽需求值的数值为相对值，用于表示CPU容量需求和带宽需求的相对大小。
在步骤12处，分别计算虚拟节点1至虚拟节点4的请求值(rv)，并将虚拟节点1至虚拟节点4按照请求值(rv)从大到小排序。在计算时α和β都为1。
虚拟节点1的请求值
Figure PCTCN2018109432-appb-000003
Figure PCTCN2018109432-appb-000004
虚拟节点2的请求值
Figure PCTCN2018109432-appb-000005
Figure PCTCN2018109432-appb-000006
虚拟节点3的请求值
Figure PCTCN2018109432-appb-000007
Figure PCTCN2018109432-appb-000008
虚拟节点4的请求值
Figure PCTCN2018109432-appb-000009
Figure PCTCN2018109432-appb-000010
经比较可知，按照虚拟节点的请求值从大到小的顺序进行排序可以得到虚拟节点1、虚拟节点2、虚拟节点3和虚拟节点4。下面 的步骤仅以请求值最大的虚拟节点1的映射步骤进行说明，虚拟节点2、虚拟节点3和虚拟节点4参照虚拟节点1的映射步骤进行。
在步骤13处，先对请求值最大的虚拟节点1进行映射，在物理网络中，选择剩余CPU容量大于虚拟节点1的CPU容量需求值的物理节点。
虚拟节点1所需的CPU容量需求值为40，那么，物理节点1至物理节点3都符合虚拟节点1对CPU资源的需求。
在步骤14处，分别计算物理节点1至物理节点4的加权资源值(wrv)。
这里，在计算时，neigh取2，occupy取0.5。另外，在本实施例中，虚拟节点1至虚拟节点3都未完成映射，所以暂时没有根据虚拟网络请求完成映射的物理节点，m＝0，neigh m＝1；物理节点1至物理节点3都没有被其他虚拟节点占用，未设置虚拟机，因此，n＝0，occupy n＝1。
物理节点1的
Figure PCTCN2018109432-appb-000011
Figure PCTCN2018109432-appb-000012
物理节点2的
Figure PCTCN2018109432-appb-000013
Figure PCTCN2018109432-appb-000014
物理节点3的
Figure PCTCN2018109432-appb-000015
Figure PCTCN2018109432-appb-000016
经比较可知，物理节点2的加权资源值最大。
在步骤15处，将加权资源值最大的物理节点2分配给当前虚拟节点1，将虚拟节点1映射到物理节点2上，然后开始顺次映射虚拟节点2、虚拟节点3和虚拟节点4，完成虚拟网络请求1所请求的所有虚拟节点的映射。
在将虚拟节点1映射到物理节点2之后，根据虚拟节点1的映射步骤，最终可以将虚拟节点2映射到物理节点1，将虚拟节点3映射到物理节点3，将虚拟节点4映射到物理节点4，此时完成节点映射阶段，进入链路映射阶段。
可以理解的是，如果虚拟网络请求映射失败，则还可以包括步 骤：判断虚拟网络请求映射失败的次数是否超过预设次数，超过则拒绝该请求，未超过则送至等待队列，等待下一次的节点映射。
在步骤21处，将虚拟链路①、虚拟链路②和虚拟链路③按照带宽需求值从大到小的顺序排序。
由于虚拟链路①的带宽需求值为50，虚拟链路②的带宽需求值为45，虚拟链路③的带宽需求值为30。因此，排序结果为虚拟链路①、虚拟链路②和虚拟链路③。
在步骤22处，根据K最短路径算法，为带宽需求值最大的虚拟链路①在物理网络中选择前K条最短路径。
在本实施例中，取K＝3，虚拟链路①为虚拟节点1→虚拟节点2，对应到物理网络中，虚拟链路①对应物理节点1→物理节点2，这样计算出的前3条最短路径依次为物理节点1→物理节点2、物理节点1→物理节点4→物理节点2、物理节点1→物理节点3→物理节点2，路径长度分别为1、2、2。
在步骤23处，将前3条最短路径的路径长度分别乘以各自对应的带宽占用率，得到前3条最短路径优化后的路径长度。
在计算时，ε取0.5。由于物理节点1至物理节点4的带宽未被占用，即可用带宽等于总带宽，所以，前3条最短路径的带宽占用率都是0.5，这样，最短路径1：物理节点1→物理节点2优化后的路径长度为0.5，最短路径2：物理节点1→4→2优化后的路径长度为1，最短路径3：物理节点1→物理节点3→物理节点2优化后的路径长度为1。其中，最短路径1：物理节点1→物理节点2优化后的路径长度最短。
在步骤24处，前3条最短路径都满足虚拟链路①的带宽需求值50。
最短路径1：物理节点1→物理节点2的可用带宽为80。
物理节点1→物理节点4的可用带宽为90，物理节点4→物理节点2的可用带宽为80，因此，最短路径1：物理节点1→物理节点4→物理节点2的可用带宽为80。
物理节点1→物理节点3的可用带宽为70，物理节点3→物理节 点2的可用带宽为50，因此，最短路径3：物理节点1→物理节点3→物理节点2的可用带宽为50。
因此，前3条最短路径都满足虚拟链路①的带宽需求值50。
在步骤25处，在前3条最短路径中，将优化后路径长度最短的最短路径1分配给虚拟链路①。
在将虚拟链路①映射到物理节点1和物理节点2之间的链路上之后，参照虚拟链路①的映射步骤，将虚拟链路②和虚拟链路③映射到物理网络中。最终将虚拟链路②映射到物理节点1和3之间的链路上，将虚拟链路③映射到物理节点2和4之间的链路上，此时链路映射阶段完成。
本公开实施例提供了基于占有率反馈的网络功能虚拟化资源映射方法。在节点映射阶段，基于物理节点的剩余CPU资源、链路带宽并结合节点占有率反馈来进行物理节点选择，如果某物理节点已经被其它虚拟网络请求中的虚拟节点映射，则该物理节点将以较低的概率被选中；在链路映射阶段，综合链路路径的长度和带宽资源占有率，优先映射占有率低的物理链路。本公开实施例适用于网络功能虚拟化资源映射，具有物理节点负荷承载均匀化、链路映射效率高、虚拟网络请求映射成功率高等优点。
另一方面，本公开还提供了一种计算机程序。所述计算机程序在被处理器执行时使得处理器执行以下步骤：接收虚拟网络请求，所述虚拟网络请求携带虚拟网络的资源需求信息；在物理网络中，选择满足所述资源需求信息且占用率最低的物理节点和物理链路进行虚拟网络映射。
在一些实施例中，所述资源需求信息包括：多个虚拟节点的资源需求信息以及多条虚拟链路的资源需求信息。
虚拟网络映射包括节点映射阶段和链路映射阶段。
在一些实施例中，所述计算机程序在被处理器执行时使得处理器还执行以下步骤：在节点映射阶段，根据每个虚拟节点的资源需求信息以及包含所述虚拟节点的虚拟链路的资源需求信息，确定所述虚拟节点的请求值；按照请求值从大到小的顺序，顺次将所述多个虚拟 节点映射到满足各自对应的资源需求信息且节点占用率最低的物理节点；在链路映射阶段，按照所述多条虚拟链路的资源需求信息中的带宽需求值从大到小的顺序，顺次将所述多条虚拟链路映射到满足各自对应的资源需求信息且链路占用率最低的物理链路。
在一些实施例中，所述计算机程序在被处理器执行时使得处理器还执行以下步骤：在未被映射的虚拟节点中确定请求值最大的虚拟节点，选择满足所述请求值最大的虚拟节点的资源需求信息的物理节点；根据所述物理节点的虚拟机数量，确定所述物理节点的节点占用率；将所述请求值最大的虚拟节点映射到节点占用率最低的物理节点；判断是否存在未被映射的虚拟节点，如果存在未被映射的虚拟节点，则继续进行虚拟节点映射，直到所述多个虚拟节点都映射到对应的物理节点为止。
在一些实施例中，所述计算机程序在被处理器执行时使得处理器还执行以下步骤：在未被映射的虚拟链路中确定带宽需求值最大的虚拟链路，选择符合所述带宽需求值最大的虚拟链路的资源需求信息的物理链路；根据所述物理链路的带宽占用率以及所述物理链路的长度，确定所述物理链路的链路占用率；将所述带宽需求值最大的虚拟链路映射到链路占用率最低的物理链路上；判断是否存在未被映射的虚拟链路，如果存在未被映射的虚拟链路，则继续进行虚拟链路映射，直到所述多条虚拟链路都映射到对应的物理链路为止。
另一方面，本公开还提供一种存储有上述计算机程序的存储介质。所述存储介质可以为任何适当的存储介质，只要能存储上述程序即可。所述存储介质可以是只读存储器，磁盘或光盘等。
另一方面，本公开还提供了一种虚拟网络映射设备。所述虚拟网络设备配置为执行本文所述的虚拟网络映射方法。图5是根据本公开实施例的虚拟网络映射设备的硬件结构示意图。如图5所示，虚拟网络映射设备500可以包括一个或多个(图中仅示出一个)处理器510(处理器510可以包括但不限于微处理器MCU或可编程逻辑器件FPGA等的处理装置)、用于存储数据的存储器520、以及用于通信功能的数据收发器530。本领域普通技术人员可以理解，图5所示的结 构仅为示意，其并不对上述电子装置的结构造成单一限定。例如，虚拟网络映射设备500通过对上述功能的拆分或合并，还可包括比图5中所示更多或者更少的组件，或者具有与图5所示不同的配置。
存储器520可以配置为存储应用软件的软件程序以及模块，前述实施例中公开的虚拟网络映射方法对应的程序指令/模块就可以存储在存储器520，关于虚拟网络映射方法在之前的实施例已经详细描述，因此本实施例不再详细重述。
处理器510通过运行(执行)存储在存储器520内的软件程序以及模块，从而执行各种功能应用以及数据处理，即实现上述虚拟网络映射方法。存储器520可包括高速随机存储器，还可包括非易失性存储器，如一个或者多个磁性存储装置、闪存、或者其他非易失性固态存储器。在一些实施例中，存储器520可进一步包括相对于处理器510远程设置的存储器(例如云存储器)，这些远程存储器可以通过网络连接至虚拟网络映射设备500。上述网络的示例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
数据收发器530配置为经由网络接收或者发送数据。上述的网络的示例可包括虚拟网络映射设备500的通信供应商提供的无线网络。在一个示例中，数据收发器530包括网络适配器(Network Interface Controller，简称为NIC)，其可通过基站与其他网络设备相连从而可与互联网进行通讯。在一个示例中，数据收发器530包括射频(Radio Frequency，简称为RF)模块，其配置为通过无线方式与互联网进行通讯。
尽管为示例目的，已经公开了本公开的示例性实施例，本领域的技术人员将意识到各种改进、增加和取代也是可能的，因此，本公开的范围应当不限于上述实施例。

Claims (11)

  1. 一种虚拟网络映射方法，包括：
    接收虚拟网络请求，所述虚拟网络请求携带虚拟网络的资源需求信息；
    在物理网络中，选择满足所述资源需求信息且占用率最低的物理节点和物理链路进行虚拟网络映射。
  2. 根据权利要求1所述的方法，其中，所述资源需求信息包括：
    多个虚拟节点的资源需求信息以及多条虚拟链路的资源需求信息。
  3. 根据权利要求2所述的方法，其中，所述选择满足所述资源需求信息且占用率最低的物理节点和物理链路进行虚拟网络映射，包括：
    在节点映射阶段，根据每个虚拟节点的资源需求信息以及包含所述虚拟节点的虚拟链路的资源需求信息，确定所述虚拟节点的请求值；
    按照请求值从大到小的顺序，顺次将所述多个虚拟节点映射到满足各自对应的资源需求信息且节点占用率最低的物理节点；
    在链路映射阶段，按照所述多条虚拟链路的资源需求信息中的带宽需求值从大到小的顺序，顺次将所述多条虚拟链路映射到满足各自对应的资源需求信息且链路占用率最低的物理链路。
  4. 根据权利要求3所述的方法，其中，所述顺次将所述多个虚拟节点映射到满足各自对应的资源需求信息且节点占用率最低的物理节点，包括：
    在未被映射的虚拟节点中确定请求值最大的虚拟节点，选择满足所述请求值最大的虚拟节点的资源需求信息的物理节点；
    根据所述物理节点的虚拟机数量，确定所述物理节点的节点占 用率；
    将所述请求值最大的虚拟节点映射到节点占用率最低的物理节点；
    判断是否存在未被映射的虚拟节点，如果存在未被映射的虚拟节点，则继续进行虚拟节点映射，直到所述多个虚拟节点都映射到对应的物理节点为止。
  5. 根据权利要求3或4所述的方法，其中，所述顺次将所述多条虚拟链路映射到满足各自对应的资源需求信息且链路占用率最低的物理链路，包括：
    在未被映射的虚拟链路中确定带宽需求值最大的虚拟链路，选择符合所述带宽需求值最大的虚拟链路的资源需求信息的物理链路；
    根据所述物理链路的带宽占用率以及所述物理链路的长度，确定所述物理链路的链路占用率；
    将所述带宽需求值最大的虚拟链路映射到链路占用率最低的物理链路上；
    判断是否存在未被映射的虚拟链路，如果存在未被映射的虚拟链路，则继续进行虚拟链路映射，直到所述多条虚拟链路都映射到对应的物理链路为止。
  6. 一种虚拟网络映射设备，包括处理器、存储器；所述处理器配置为执行存储器中存储的程序以：
    接收虚拟网络请求，所述虚拟网络请求携带虚拟网络的资源需求信息；
    在物理网络中，选择满足所述资源需求信息且占用率最低的物理节点和物理链路进行虚拟网络映射。
  7. 根据权利要求6所述的虚拟网络映射设备，其中，所述资源需求信息包括：多个虚拟节点的资源需求信息以及多条虚拟链路的资源需求信息。
  8. 根据权利要求7所述的虚拟网络映射设备，其中，所述处理器还配置为执行存储器中存储的程序以：
    在节点映射阶段，根据每个虚拟节点的资源需求信息以及包含所述虚拟节点的虚拟链路的资源需求信息，确定所述虚拟节点的请求值；
    按照请求值从大到小的顺序，顺次将所述多个虚拟节点映射到满足各自对应的资源需求信息且节点占用率最低的物理节点；
    在链路映射阶段，按照所述多条虚拟链路的资源需求信息中的带宽需求值从大到小的顺序，顺次将所述多条虚拟链路映射到满足各自对应的资源需求信息且链路占用率最低的物理链路。
  9. 根据权利要求8所述的虚拟网络映射设备，其中，所述处理器还配置为执行存储器中存储的程序以：
    在未被映射的虚拟节点中确定请求值最大的虚拟节点，选择满足所述请求值最大的虚拟节点的资源需求信息的物理节点；
    根据所述物理节点的虚拟机数量，确定所述物理节点的节点占用率；
    将所述请求值最大的虚拟节点映射到节点占用率最低的物理节点；
    判断是否存在未被映射的虚拟节点，如果存在未被映射的虚拟节点，则继续进行虚拟节点映射，直到所述多个虚拟节点都映射到对应的物理节点为止。
  10. 根据权利要求8或9所述的虚拟网络映射设备，其中，所述处理器还配置为执行存储器中存储的程序以：
    在未被映射的虚拟链路中确定带宽需求值最大的虚拟链路，选择符合所述带宽需求值最大的虚拟链路的资源需求信息的物理链路；
    根据所述物理链路的带宽占用率以及所述物理链路的长度，确定所述物理链路的链路占用率；
    将所述带宽需求值最大的虚拟链路映射到链路占用率最低的物理链路上；
    判断是否存在未被映射的虚拟链路，如果存在未被映射的虚拟链路，则继续进行虚拟链路映射，直到所述多条虚拟链路都映射到对应的物理链路为止。
  11. 一种存储介质，其上存储有一个或者多个程序，所述一个或者多个程序被一个或者多个处理器执行时，实现权利要求1至5中任一项所述的虚拟网络映射方法。
PCT/CN2018/109432 2017-10-12 2018-10-09 虚拟网络映射方法、设备和存储介质 WO2019072162A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710947308.0A CN109660376B (zh) 2017-10-12 2017-10-12 一种虚拟网络映射方法、设备和存储介质
CN201710947308.0 2017-10-12

Publications (1)

Publication Number Publication Date
WO2019072162A1 true WO2019072162A1 (zh) 2019-04-18

Family

ID=66100375

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/109432 WO2019072162A1 (zh) 2017-10-12 2018-10-09 虚拟网络映射方法、设备和存储介质

Country Status (2)

Country Link
CN (1) CN109660376B (zh)
WO (1) WO2019072162A1 (zh)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113301583A (zh) * 2020-02-21 2021-08-24 中国电信股份有限公司 网络切片的重映射方法、装置以及存储介质
CN114422375A (zh) * 2021-12-10 2022-04-29 国网河南省电力公司 虚拟网资源分配方法、设备、介质及程序产品
CN115001971A (zh) * 2022-04-14 2022-09-02 西安交通大学 天地一体化信息网络下改进社团发现的虚拟网络映射方法
CN115209249A (zh) * 2022-07-07 2022-10-18 重庆邮电大学 基于光路邻接链路碎片感知的虚拟网络协同映射方法
CN115766589A (zh) * 2023-01-10 2023-03-07 长沙学院 一种基于高容错性的虚拟网络映射系统

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110247713B (zh) * 2019-04-26 2021-06-29 北京邮电大学 一种基于量子密钥分发光网络的虚拟业务映射方法及装置
CN111182037B (zh) * 2019-12-13 2022-02-25 中国联合网络通信集团有限公司 一种虚拟网络的映射方法和装置
CN111200550B (zh) * 2020-01-07 2021-11-26 中国烟草总公司郑州烟草研究院 一种虚拟网络映射方法及装置
CN112230848B (zh) * 2020-10-10 2023-12-22 上海拿森汽车电子有限公司 一种nvm自动配置方法、装置和设备
CN113438098B (zh) * 2021-05-31 2022-06-21 北京邮电大学 一种在云数据中心的时延敏感的虚拟网络映射方法及装置
CN116192755B (zh) * 2023-04-28 2023-08-11 惠州迈腾伟业科技发展有限公司 基于建立虚拟交换机的拥塞处理方法及其系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102075429A (zh) * 2011-01-21 2011-05-25 北京邮电大学 一种基于就近原则的虚拟网络映射方法
CN102868733A (zh) * 2012-08-29 2013-01-09 北京邮电大学 虚拟网络资源再映射方法
CN104901861A (zh) * 2015-06-04 2015-09-09 浙江工商大学 基于网络拓扑预优化和提高可用性的虚拟网络映射方法
CN106100964A (zh) * 2016-08-24 2016-11-09 北京邮电大学 一种虚拟网络映射的方法和装置

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102223281B (zh) * 2011-06-24 2013-09-04 清华大学 基于虚拟网络资源需求动态变化的再映射方法
CN102710488B (zh) * 2012-06-07 2015-02-18 北京邮电大学 一种实现虚拟网络映射的方法
CN102904794A (zh) * 2012-09-27 2013-01-30 北京邮电大学 一种虚拟网络映射方法和装置
US9485197B2 (en) * 2014-01-15 2016-11-01 Cisco Technology, Inc. Task scheduling using virtual clusters
CN106059799B (zh) * 2016-05-19 2019-03-26 西安电子科技大学 面向sdn的弹性光网络下的虚拟网络映射方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102075429A (zh) * 2011-01-21 2011-05-25 北京邮电大学 一种基于就近原则的虚拟网络映射方法
CN102868733A (zh) * 2012-08-29 2013-01-09 北京邮电大学 虚拟网络资源再映射方法
CN104901861A (zh) * 2015-06-04 2015-09-09 浙江工商大学 基于网络拓扑预优化和提高可用性的虚拟网络映射方法
CN106100964A (zh) * 2016-08-24 2016-11-09 北京邮电大学 一种虚拟网络映射的方法和装置

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113301583A (zh) * 2020-02-21 2021-08-24 中国电信股份有限公司 网络切片的重映射方法、装置以及存储介质
CN113301583B (zh) * 2020-02-21 2023-03-28 中国电信股份有限公司 网络切片的重映射方法、装置以及存储介质
CN114422375A (zh) * 2021-12-10 2022-04-29 国网河南省电力公司 虚拟网资源分配方法、设备、介质及程序产品
CN114422375B (zh) * 2021-12-10 2024-04-30 国网河南省电力公司 虚拟网资源分配方法、设备、介质及程序产品
CN115001971A (zh) * 2022-04-14 2022-09-02 西安交通大学 天地一体化信息网络下改进社团发现的虚拟网络映射方法
CN115001971B (zh) * 2022-04-14 2023-06-20 西安交通大学 天地一体化信息网络下改进社团发现的虚拟网络映射方法
CN115209249A (zh) * 2022-07-07 2022-10-18 重庆邮电大学 基于光路邻接链路碎片感知的虚拟网络协同映射方法
CN115766589A (zh) * 2023-01-10 2023-03-07 长沙学院 一种基于高容错性的虚拟网络映射系统
CN115766589B (zh) * 2023-01-10 2023-07-14 长沙学院 一种基于高容错性的虚拟网络映射系统

Also Published As

Publication number Publication date
CN109660376A (zh) 2019-04-19
CN109660376B (zh) 2022-09-02

Similar Documents

Publication Publication Date Title
WO2019072162A1 (zh) 虚拟网络映射方法、设备和存储介质
US10530846B2 (en) Scheduling packets to destination virtual machines based on identified deep flow
WO2023039965A1 (zh) 流量疏导的云边计算网络计算资源均衡调度方法及系统
US10341208B2 (en) File block placement in a distributed network
CN109104373B (zh) 网络拥塞的处理方法、装置及系统
US9794185B2 (en) Bandwidth guarantee and work conservation
CN108566659B (zh) 一种基于可靠性的5g网络切片在线映射方法
CN111953758A (zh) 一种边缘网络计算卸载和任务迁移方法及装置
CN107454019B (zh) 软件定义网络动态带宽分配方法、装置、设备及存储介质
WO2020019743A1 (zh) 流量控制方法及装置
KR20200017589A (ko) 무선 통신 시스템에서 모바일 노드의 태스크를 오프로딩하기 위한 클라우드 서버 및 그의 동작 방법
WO2014022395A1 (en) Priority driven channel allocation for packet transferring
CN107666448B (zh) 一种时延感知下的5g虚拟接入网映射方法
JP2012209928A (ja) 動的フローレットスケジューリングシステムおよび方法
Chen et al. Latency minimization for mobile edge computing networks
CN111182037B (zh) 一种虚拟网络的映射方法和装置
CN109614215A (zh) 基于深度强化学习的流调度方法、装置、设备及介质
CN107196806B (zh) 基于子图辐射的拓扑临近匹配虚拟网络映射方法
WO2020134133A1 (zh) 一种资源配置方法、变电站及计算机可读存储介质
Wen et al. Load balancing job assignment for cluster-based cloud computing
KR20130137539A (ko) 데이터 컷-스루를 수행하기 위한 시스템
WO2020185132A1 (en) Method and current edge cloud manager for controlling resources
CN107113323B (zh) 一种数据存储方法、装置和系统
CN108540405B (zh) 网络资源迁移方法及装置
CN113328953B (zh) 网络拥塞调整的方法、装置和存储介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18866150

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205 DATED 08/09/2020)

122 Ep: pct application non-entry in european phase

Ref document number: 18866150

Country of ref document: EP

Kind code of ref document: A1