Node scheduling method, device and storage medium

By obtaining the flow table requirements of the virtual machine and the flow table carrying capacity of the computing node in the NFV system, and scheduling the computing nodes, the problem of the virtual layer failing to effectively consider the flow table requirements is solved, and the service performance and user experience of telecommunications applications are improved .

CN114726852BActive Publication Date: 2024-11-12CHINA MOBILE COMM LTD RES INST +1
View PDF 8 Cites 0 Cited by

Patent Information

Application Number
CN202110002190.0
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-01-04
Publication Date
2024-11-12
Estimated Expiration
2041-01-04

AI Technical Summary

Technical Problem

In NFV systems, the virtual layer fails to effectively consider the flow table requirements of the virtual machine when scheduling computing nodes, resulting in the service performance of telecommunications applications being unable to be guaranteed and the user experience is poor.

Method used

By obtaining the flow table requirements of the virtual machine to be deployed and the flow table requirements of the deployed virtual machines on the compute nodes, combined with preset deployment policies, we determine the target compute nodes from multiple compute nodes to ensure that the virtual machine is deployed to be able to process its flow tables. On nodes with strong demand, avoid delays or packet loss caused by insufficient flow table processing capabilities.

Benefits of technology

In the virtual machine deployment scenario where flow tables are demanding, the service performance and reliability of NFV telecom applications are improved and the user experience is improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114726852B_ABST
    Figure CN114726852B_ABST
Patent Text Reader

Abstract

The present application discloses a node scheduling method, device and storage medium. The method includes: obtaining a first flow table requirement of a virtual machine to be deployed; determining a second flow table requirement of each computing node in a plurality of computing nodes; the second flow table requirement includes a flow table requirement of each virtual machine in at least one virtual machine deployed on the corresponding computing node; determining a target computing node from the plurality of computing nodes based on the obtained first flow table requirement and the determined plurality of second flow table requirements; and deploying the virtual machine to be deployed to the target computing node.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of Network Function Virtualization (NFV), and in particular to a node scheduling method, device and storage medium. Background Art

[0002] In the NFV system architecture, the virtual layer has the function of scheduling computing nodes when performing virtual machine creation, virtual machine evacuation, virtual machine cold migration (i.e., migration of virtual machines with power turned off) and virtual machine hot migration (i.e., migration of virtual machines without stopping the machine). For example, during the process of virtual machine creation, the virtual layer can select a computing node that meets the corresponding deployment requirements for deploying the virtual machine based on the deployment (i.e., creation) requirements of the virtual machine through a scheduling algorithm.

[0003] However, in the related art, the method of scheduling computing nodes at the virtual layer still needs to be optimized. Summary of the invention

[0004] To solve related technical problems, the embodiments of the present application provide a node scheduling method, device and storage medium.

[0005] The technical solution of the embodiment of the present application is implemented as follows:

[0006] The present application provides a node scheduling method, including:

[0007] Obtain the first-stream table requirements of the virtual machine to be deployed;

[0008] Determine a second flow table requirement of each computing node in the plurality of computing nodes; the second flow table requirement includes a flow table requirement of each virtual machine in at least one virtual machine deployed on the corresponding computing node;

[0009] Based on the acquired first flow table requirement and the determined multiple second flow table requirements, a target computing node is determined from the multiple computing nodes; and the to-be-deployed virtual machine is deployed on the target computing node.

[0010] In the above solution, the step of determining a target computing node from the multiple computing nodes based on the acquired first flow table requirement and the determined multiple second flow table requirements includes:

[0011] Compare the number of flow table entries included in the first flow table requirement with a first threshold to obtain a comparison result;

[0012] Based on the comparison result obtained, and in combination with the number of at least one flow table entry required to be included in each second flow table, a target computing node is determined from the multiple computing nodes.

[0013] In the above solution, the step of determining the target computing node from the plurality of computing nodes based on the obtained comparison result and in combination with the number of at least one flow table entry included in each second flow table requirement includes:

[0014] In a case where the comparison result indicates that the number of flow table entries included in the first flow table requirement is greater than or equal to the first threshold, determining a first type of computing node from the multiple computing nodes based on the number of at least one flow table entries included in each second flow table requirement; the maximum number of flow table entries among the at least one flow table entry number included in the second flow table requirement of the first type of computing node is less than the first threshold;

[0015] A target computing node is determined from the first type of computing nodes based on a preset deployment strategy.

[0016] In the above scheme, the method further includes:

[0017] In the case where the first type of computing node does not exist in the multiple computing nodes, determining a second type of computing node from the multiple computing nodes based on the number of at least one flow table entries included in each second flow table requirement; the sum of the number of at least one flow table entries included in the second flow table requirements of the second type of computing nodes is less than or equal to a second threshold;

[0018] A target computing node is determined from the second-type computing nodes based on the preset deployment strategy.

[0019] In the above solution, the step of determining the target computing node from the plurality of computing nodes based on the obtained comparison result and in combination with the number of at least one flow table entry included in each second flow table requirement includes:

[0020] In a case where the comparison result indicates that the number of flow table entries included in the first flow table requirement is less than the first threshold, determining a second type of computing node from the multiple computing nodes based on the number of at least one flow table entries included in each second flow table requirement; the sum of the number of at least one flow table entries included in the second flow table requirements of the second type of computing nodes is less than or equal to the second threshold;

[0021] A target computing node is determined from the second-category computing nodes based on a preset deployment strategy.

[0022] In the above solution, the step of determining the target computing node based on the preset deployment strategy includes:

[0023] Determine the target computing node based on other deployment requirements of the virtual machine to be deployed; the other deployment requirements include at least one of the following:

[0024] Computational capacity;

[0025] Storage capacity;

[0026] Deployment requirements related to network and / or application optimization.

[0027] In the above solution, the step of obtaining the first flow table requirement of the virtual machine to be deployed includes:

[0028] Obtain specification information of the virtual machine to be deployed; the specification information at least includes the first flow table requirement.

[0029] The embodiment of the present application also provides a node scheduling device, including:

[0030] An acquisition unit, used for acquiring a first flow table requirement of a virtual machine to be deployed;

[0031] A first processing unit, configured to determine a second flow table requirement of each computing node among a plurality of computing nodes; the second flow table requirement comprising a flow table requirement of each virtual machine among at least one virtual machine deployed on the corresponding computing node;

[0032] The second processing unit is used to determine a target computing node from the multiple computing nodes based on the acquired first flow table requirement and the determined multiple second flow table requirements; and deploy the to-be-deployed virtual machine to the target computing node.

[0033] The embodiment of the present application further provides a node scheduling device, comprising: a processor and a memory for storing a computer program that can be run on the processor,

[0034] Wherein, the processor is used to execute the steps of any of the above methods when running the computer program.

[0035] An embodiment of the present application further provides a storage medium on which a computer program is stored. When the computer program is executed by a processor, the steps of any of the above methods are implemented.

[0036] The node scheduling method, device and storage medium provided in the embodiment of the present application obtain the first flow table requirement of the virtual machine to be deployed; determine the second flow table requirement of each computing node in multiple computing nodes; the second flow table requirement includes the flow table requirement of each virtual machine in at least one virtual machine deployed on the corresponding computing node; based on the obtained first flow table requirement and the determined multiple second flow table requirements, determine the target computing node from the multiple computing nodes; and deploy the virtual machine to be deployed to the target computing node. The scheme of the embodiment of the present application, when deploying virtual machines, schedules the computing nodes in combination with the flow table requirements of the virtual machines to be deployed and the flow table requirements of the virtual machines deployed on the computing nodes; that is, schedules the computing nodes in combination with the flow table requirements of the virtual machines to be deployed and the flow table carrying (i.e. processing) capacity of the computing nodes for the virtual machines to be deployed, so that in the scenario where virtual machines with large flow table requirements are deployed, the service performance of NFV telecommunication applications can be guaranteed and the user experience can be improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] Figure 1 A schematic diagram of a node scheduling method according to an embodiment of the present application;

[0038] Figure 2 This is a schematic diagram of the structure of a node scheduling device according to an embodiment of the present application;

[0039] Figure 3 This is a schematic diagram of the hardware structure of the node scheduling device according to an embodiment of the present application. DETAILED DESCRIPTION

[0040] The present application is further described in detail below in conjunction with the accompanying drawings and embodiments.

[0041] In the related technology, through the NFV system, hardware resources can be virtualized into virtual resources that can be dynamically requested and provided to the virtualized network function (VNF), so that the VNF can be used as a virtualized functional device (i.e., virtual network element) with the same functions as the physical network element. At the same time, in order to further improve the flexibility of the system, the control plane and data plane of the virtual network element are decoupled, and the software defined network (SDN) technology is introduced into the NFV system. The virtual network elements are networked using SDN technology, which can realize information technology (IT) and telecommunication applications.

[0042] As shown in Table 1, in the process of implementing telecommunication applications, due to the application characteristics of telecommunication-class VNFs for multi-protocol connections and the design of full interconnection of virtual machines within virtual network elements, the north-south traffic (i.e., traffic between clients and servers) and east-west traffic (i.e., traffic between servers) of telecommunication applications are much larger than the north-south traffic and east-west traffic of IT applications. In addition, since network traffic in SDN is implemented through flows (expressed as Flow in English), and the SDN controller sends OpenFlow flow tables (expressed as FlowTable in English) to lower-level nodes for node management, the north-south flow table requirements and east-west flow table requirements of telecommunication applications are much larger than the north-south flow table requirements and east-west flow table requirements of IT applications.

[0043]

[0044]

[0045] Table 1

[0046] It can be seen from this that in the process of implementing telecommunication applications, when the virtual layer schedules computing nodes for virtual machine deployment, if the target computing nodes are determined only based on the deployment requirements of the virtual machines without considering the flow table requirements of the virtual machines, the business performance of telecommunication applications may not be guaranteed.

[0047] In addition, the computing node implements the deployment of virtual machines through the software Open VSwitch (abbreviated as OVS), and OVS uses the central processing unit (CPU) to perform data hashing to query and forward the flow table. Due to the low efficiency of OVS in querying and forwarding flow tables, in order to avoid hash conflicts, OVS can only support (i.e. process) a limited number of flow table entries. If multiple virtual machines with large flow table requirements are deployed on the same computing node, the flow table processing capacity of the underlying OVS itself may be exceeded, resulting in packet forwarding delays or even packet loss, which seriously affects the reliability of upper-layer applications and poor user experience.

[0048] Based on this, in various embodiments of the present application, when deploying a virtual machine, the computing node is scheduled in combination with the flow table requirements of the virtual machine to be deployed and the flow table requirements of the virtual machines already deployed on the computing node; that is, the computing node is scheduled in combination with the flow table requirements of the virtual machine to be deployed and the flow table carrying (i.e., processing) capacity of the computing node for the virtual machine to be deployed. In this way, in the scenario where a virtual machine with a large flow table requirement is deployed, the service performance of NFV telecommunication applications can be guaranteed, that is, the reliability of NFV telecommunication applications can be improved, thereby improving the user experience.

[0049] The present application embodiment provides a node scheduling method, such as Figure 1 As shown, the method includes:

[0050] Step 101: Obtain the first flow table requirement of the virtual machine to be deployed;

[0051] Step 102: Determine a second flow table requirement of each computing node among the plurality of computing nodes;

[0052] Here, the second flow table requirement includes the flow table requirement of each virtual machine in at least one virtual machine deployed on the corresponding computing node;

[0053] Step 103: Based on the acquired first flow table requirement and the determined multiple second flow table requirements, determine a target computing node from the multiple computing nodes; and deploy the to-be-deployed virtual machine to the target computing node.

[0054] Here, it should be noted that the node scheduling method provided in the embodiment of the present application is applied to the virtual layer in the NFV system architecture, and is specifically applied to the virtualized infrastructure manager (VIM); the flow table requirement refers to the OpenFlow flow table requirement; the corresponding flow table requirement at least includes the number of flow table entries. In addition, the computing node refers to a node with a virtualization software layer (Hypervisor) installed, which can also be called a Hypervisor node; the multiple computing nodes are used to deploy virtual machines.

[0055] Among them, in actual application, the second flow table demand can reflect the flow table carrying (i.e. processing) capacity of the corresponding computing node for the virtual machine to be deployed. Specifically, when the second flow table demand represents that the corresponding computing node has deployed at least one virtual machine with a large flow table demand, it reflects that the flow table carrying capacity of the corresponding computing node for the virtual machine to be deployed is relatively weak; when the second flow table demand represents that the flow table demand of the virtual machine deployed by the corresponding computing node is relatively small, it reflects that the flow table carrying capacity of the corresponding computing node for the virtual machine to be deployed is relatively strong. Of course, there may be computing nodes on which no virtual machines are deployed among the multiple computing nodes. In this case, the virtual machine to be deployed can be preferentially deployed on this computing node.

[0056] Regarding step 101, in one embodiment, obtaining the first flow table requirement of the virtual machine to be deployed may include:

[0057] Obtain flavor information of the virtual machine to be deployed; the flavor information at least includes the first flow table requirement.

[0058] Specifically, in actual application, the maximum flow table entry field (which can be expressed as K) in the image information contained in the Flavor information can be used to configure the number of flow table entries (i.e., the first flow table requirement) that the virtual machine to be deployed needs to occupy. Of course, when the number of flow table entries that the virtual machine to be deployed needs to occupy is small, K can be set to 0. In other words, when the Flavor information of the virtual machine to be deployed is obtained and K is determined to be 0, the VIM can determine that the virtual machine to be deployed has no flow table requirement (i.e., it is determined that the flow table requirement of the virtual machine to be deployed can be ignored). At this point, the VIM can determine the target computing node based on the preset deployment strategy.

[0059] In one embodiment, determining the target computing node based on a preset deployment strategy may include:

[0060] Determine a target computing node based on other deployment requirements of the virtual machine to be deployed; the other deployment requirements may include at least one of the following:

[0061] Computational capacity;

[0062] Storage capacity;

[0063] Deployment requirements related to network and / or application optimization.

[0064] In actual application, the other deployment requirements may also be obtained through the Flavor information of the virtual machine to be deployed.

[0065] In actual application, the computing capacity can be understood as the demand of the virtual machine to be deployed for computing resources; the storage capacity can be understood as the demand of the virtual machine to be deployed for storage resources; the network-related deployment requirements can be understood as the demand of the virtual machine to be deployed for network resources; the program optimization-related deployment requirements can include the acceleration resource requirements of the virtual machine to be deployed and the hardware requirements such as CPU and hard disk.

[0066] In actual application, the process of determining the target computing node based on the flow table requirement can be implemented by an application program, such as a flow table filter (FlowTableFilter) program for filtering the multiple computing nodes based on the acquired first flow table requirement and the determined multiple second flow table requirements. Of course, the process of determining the target computing node based on the preset deployment strategy can also be implemented by a filter program. For example, the filter program for implementing the determination of the target computing node based on the preset deployment strategy may include:

[0067] A retry filter (RetryFilter), used to filter out the computing nodes that have failed to create (ie deploy) the virtual machine this time from the multiple computing nodes;

[0068] A running status filter (ComputeFilter), used to filter out computing nodes that are faulty, sub-healthy, or in maintenance status from the plurality of computing nodes;

[0069] An availability zone filter (AvailabilityZoneFilter), used to filter out computing nodes that are not in corresponding availability zone information (Nova AZ) from the multiple computing nodes;

[0070] A feature filter (TraitFilter), used to filter the multiple computing nodes according to the feature (Trait) requirements contained in the Flavor information;

[0071] An image property filter (ImagePropertiesFilter), used to filter the plurality of computing nodes according to the architecture property requirements (ie, demands) configured in the corresponding image information;

[0072] A NUMA topology filter (NUMATopologyFilter), used to filter the multiple computing nodes according to the “hw:numa_nodes” attribute requirement contained in the Flavor information; the “hw:numa_nodes” attribute requirement may include a requirement on the number of virtual CPUs (vCPUs), a requirement on the capacity of virtual random access memory (vRAM), a requirement on the number of network card pass-through functions (SR-IOV VFs), etc.;

[0073] an accelerating resource filter (AcceleratingResourceFilter), configured to filter the plurality of computing nodes according to the accelerating resource requirements declared (i.e., contained) in a configuration file (Device Profile) associated with the Flavor information;

[0074] A disk filter (DiskFilter), configured to filter the plurality of computing nodes according to the sum of the capacities (including Disk, Swap, and Ephemeral) set (i.e., included) in the Flavor information; and / or to filter the plurality of computing nodes according to the number and capacity requirements of the pass-through disks or pass-through partitions specified by the user when creating the virtual machine to be deployed; the number and capacity requirements of the pass-through disks or pass-through partitions specified by the user when creating the virtual machine to be deployed can be obtained through the Flavor information;

[0075] A computing capability filter (ComputeCapabilitiesFilter), used to filter the multiple computing nodes according to the "hw:cpu_model" attribute requirement and the "capabilities:cpu_info:arch" attribute requirement set (i.e., included) in the Flavor information; the "hw:cpu_model" attribute requirement may include requirements for a CPU instruction set and a CPU model; the "capabilities:cpu_info:arch" attribute requirement may be a default value, i.e., the "capabilities:cpu_info:arch" attribute requirement is not set in the Flavor information;

[0076] ServiceAffinityFilter, used to prioritize the compute nodes that have deployed virtual machines with the same "OS-SCH-HNT:scheduler_hints.service" parameter value when deploying virtual machines;

[0077] ServerGroupAntiAffinityFilter, which is used to prioritize the scheduling of compute nodes that do not deploy virtual machines included in the specified anti-affinity service group;

[0078] Multi-tenant isolation (MultiTenancyIsolation) is used to filter out computing nodes that do not belong to the current tenant corresponding to the virtual machine to be deployed from the multiple computing nodes.

[0079] In step 102, in actual application, the VIM can locally maintain the operating status information of each of the multiple computing nodes, and determine the second flow table requirements of each computing node based on the locally maintained operating status information of each of the multiple computing nodes when virtual machine deployment is required.

[0080] In actual application, in order to ensure the reliability of the service performance corresponding to NFV telecommunication applications and improve user experience in the scenario where a virtual machine with a large flow table demand is deployed, a flow table demand threshold (referred to as the first threshold in the subsequent description) can be set in advance. In the process of determining the target computing node, the number of flow table entries included in the first flow table demand is first compared with the first threshold; when the number of flow table entries included in the first flow table demand is greater than or equal to the first threshold, it can be determined that the flow table demand of the virtual machine to be deployed is large; when the number of flow table entries included in the first flow table demand is less than the first threshold, it can be determined that the flow table demand of the virtual machine to be deployed is small.

[0081] Based on this, for step 103, in one embodiment, determining the target computing node from the multiple computing nodes based on the acquired first flow table requirement and the determined multiple second flow table requirements may include:

[0082] Compare the number of flow table entries included in the first flow table requirement with a first threshold to obtain a comparison result;

[0083] Based on the comparison result obtained, and in combination with the number of at least one flow table entry required to be included in each second flow table, a target computing node is determined from the multiple computing nodes.

[0084] In actual application, the size of the first threshold can be set according to demand, such as 200,000.

[0085] In actual application, when the comparison result indicates that the number of flow table entries included in the first flow table demand is greater than or equal to the first threshold, it means that the flow table demand of the virtual machine to be deployed is large. At this time, in order to ensure that after the virtual machine to be deployed is deployed to the target computing node, the number of flow table entries that the target computing node needs to process does not exceed the flow table processing capability of its underlying OVS itself, at least one virtual machine deployed on the target computing node should not include a virtual machine whose flow table demand includes a number of flow table entries greater than or equal to the first threshold.

[0086] Based on this, in one embodiment, determining the target computing node from the multiple computing nodes based on the obtained comparison result and in combination with the number of at least one flow table entry included in each second flow table requirement may include:

[0087] In a case where the comparison result indicates that the number of flow table entries included in the first flow table requirement is greater than or equal to the first threshold, determining a first type of computing node from the multiple computing nodes based on the number of at least one flow table entries included in each second flow table requirement; the maximum number of flow table entries among the at least one flow table entry number included in the second flow table requirement of the first type of computing node is less than the first threshold;

[0088] A target computing node is determined from the first type of computing nodes based on the preset deployment strategy.

[0089] In actual application, each of the multiple computing nodes may have deployed a virtual machine whose flow table requirement includes a number of flow table entries greater than or equal to the first threshold. At this time, in order to successfully deploy the virtual machine to be deployed, the maximum number of flow table entries that the OVS at the bottom of each computing node can forward can be pre-set (referred to as the second threshold in the subsequent description), and the total number of flow table entries included in the second flow table requirement of each computing node (that is, the sum of the number of at least one flow table entry included in the corresponding second flow table requirement) is compared with the corresponding second threshold; when the total number of flow table entries included in the second flow table requirement is greater than the corresponding second threshold, it can be determined that the number of flow table entries that the corresponding computing node needs to process exceeds the flow table processing capability of its underlying OVS itself, that is, there is no remaining flow table processing space on the corresponding computing node, and a new virtual machine should not be deployed on the corresponding computing node; when the total number of flow table entries included in the second flow table requirement is less than or equal to the corresponding second threshold, it can be determined that the number of flow table entries that the corresponding computing node needs to process does not exceed the flow table processing capability of its underlying OVS itself, that is, there is remaining flow table processing space on the corresponding computing node, and a new virtual machine can be deployed on the corresponding computing node.

[0090] Based on this, in one embodiment, the method may further include:

[0091] In the case where the first type of computing node does not exist in the multiple computing nodes, determining a second type of computing node from the multiple computing nodes based on the number of at least one flow table entries included in each second flow table requirement; the sum of the number of at least one flow table entries included in the second flow table requirements of the second type of computing nodes is less than or equal to a second threshold;

[0092] A target computing node is determined from the second-type computing nodes based on the preset deployment strategy.

[0093] Here, the second threshold is greater than the first threshold; the second threshold represents the maximum number of flow table entries that the corresponding computing node can forward, that is, the maximum number of flow table entries that the OVS installed at the bottom of the corresponding computing node can forward, and can also be understood as the number of flow table entries that the Exact Match Cache (EMC) of the OVS installed at the bottom of the corresponding computing node can carry; the second threshold can reflect the flow table processing capability of the corresponding computing node. In actual application, the size of the second threshold can be set according to demand. For example, when the first threshold is 200,000, the second threshold can be 600,000. Here, the second threshold can be set for each computing node in a single-host configuration or a high availability (HA) cluster configuration; that is, the second threshold corresponding to each computing node can be the same or different.

[0094] In actual application, when setting the second threshold for each computing node in a single-host mode or a high availability (HA) mode, the same method can also be used to set the over-resolution ratio for each computing node, that is, the maximum ratio of the number of flow table entries actually forwarded by the corresponding computing node to the second threshold. Exemplarily, the second threshold corresponding to a computing node is set to 300,000. When the over-resolution ratio is 2, the maximum number of flow table entries that the computing node can actually forward is 600,000; when the over-resolution ratio is 0.9, the maximum number of flow table entries that the computing node can actually forward is 270,000. Of course, the over-resolution ratio corresponding to each computing node can be the same or different. When the over-resolution ratio corresponding to the corresponding computing node is not equal to 1, when comparing the total number of flow table entries contained in the second flow table demand of the corresponding computing node with the corresponding second threshold, the corresponding second threshold needs to be updated by "multiplying the corresponding second threshold by the corresponding over-resolution ratio".

[0095] In actual application, when the comparison result indicates that the number of flow table entries included in the first flow table requirement is less than the first threshold, it means that the flow table requirement of the virtual machine to be deployed is small, and at this time, the virtual machine to be deployed can be deployed on the first type of computing node. Of course, in order to screen out computing nodes with more suitable performance and optimize the computing power of computing nodes, a second type of computing node can be first determined from the multiple computing nodes, and then the target computing node can be determined from the second type of computing node based on the preset deployment strategy.

[0096] Based on this, in one embodiment, determining the target computing node from the multiple computing nodes based on the obtained comparison result and in combination with the number of at least one flow table entry included in each second flow table requirement may include:

[0097] In a case where the comparison result indicates that the number of flow table entries included in the first flow table requirement is less than the first threshold, determining a second type of computing node from the multiple computing nodes based on the number of at least one flow table entries included in each second flow table requirement; the sum of the number of at least one flow table entries included in the second flow table requirements of the second type of computing nodes is less than or equal to the second threshold;

[0098] A target computing node is determined from the second-type computing nodes based on the preset deployment strategy.

[0099] In actual application, if the target computing node cannot be determined based on the preset deployment strategy, it can be determined that the deployment of the virtual machine to be deployed has failed, and the deployment can be retried after a preset time.

[0100] In actual application, VIM can be implemented through the OpenStack cloud computing management platform (hereinafter referred to as OpenStack), wherein the Nova component of OpenStack is used to manage computing resources. Specifically, Nova can record the host X (host, i.e., computing node) with a large flow table virtual machine (i.e., a virtual machine whose flow table requirements contain a number of flow table entries greater than or equal to the first threshold). If the virtual machine to be deployed is a large flow table virtual machine, then in the first round of deployment, the virtual machine to be deployed cannot be deployed on the host X, and the virtual machine to be deployed can be deployed on other computing nodes except the host X.

[0101] If the virtual machine to be deployed is a virtual machine with a small flow table (i.e., a virtual machine whose flow table requirements include a flow table number less than the first threshold) or a virtual machine that failed to be deployed in the first round, the virtual machine to be deployed can be deployed on all computing nodes including the host X. At this time, for each computing node among all computing nodes including the host X, it is necessary to calculate the number of flows of all virtual machines deployed on the corresponding computing node Sum (M1, M2, ..., Mi) (i.e., the sum of at least one flow table entry number included in the second flow table requirements of the corresponding computing node, M represents the number of flow table entries included in the flow table requirements of a virtual machine deployed on the corresponding computing node, and i represents the number of virtual machines deployed on the corresponding computing node), and compare the Sum of the corresponding computing node with the second threshold. If Sum is greater than the second threshold, the corresponding computing node is excluded. After screening out all nodes (i.e., other computing nodes except the host X, or computing nodes whose Sum is less than or equal to the second threshold), the virtual machine can be deployed according to other filters (i.e., the filter program for realizing the determination of the target computing node based on the preset deployment strategy); if there is no suitable computing node, the deployment fails.

[0102] The node scheduling method provided in the embodiment of the present application obtains the first flow table requirement of the virtual machine to be deployed; determines the second flow table requirement of each computing node in multiple computing nodes; the second flow table requirement includes the flow table requirement of each virtual machine in at least one virtual machine deployed on the corresponding computing node; based on the obtained first flow table requirement and the determined multiple second flow table requirements, determines the target computing node from the multiple computing nodes; and deploys the virtual machine to be deployed to the target computing node. The scheme of the embodiment of the present application, when deploying virtual machines, schedules the computing nodes in combination with the flow table requirements of the virtual machines to be deployed and the flow table requirements of the virtual machines deployed on the computing nodes; that is, schedules the computing nodes in combination with the flow table requirements of the virtual machines to be deployed and the flow table carrying (i.e., processing) capacity of the computing nodes for the virtual machines to be deployed, so that in the scenario where virtual machines with large flow table requirements are deployed, the service performance of NFV telecommunication applications can be guaranteed and the user experience can be improved.

[0103] In order to implement the method of the embodiment of the present application, the embodiment of the present application also provides a node scheduling device, such as Figure 2 As shown, the device comprises:

[0104] An acquisition unit 201 is used to acquire a first flow table requirement of a virtual machine to be deployed;

[0105] A first processing unit 202 is configured to determine a second flow table requirement of each computing node in the plurality of computing nodes; the second flow table requirement includes a flow table requirement of each virtual machine in at least one virtual machine deployed on the corresponding computing node;

[0106] The second processing unit 203 is configured to determine a target computing node from the multiple computing nodes based on the acquired first flow table requirement and the determined multiple second flow table requirements; and deploy the to-be-deployed virtual machine to the target computing node.

[0107] In one embodiment, the second processing unit 203 is specifically configured to:

[0108] Compare the number of flow table entries included in the first flow table requirement with a first threshold to obtain a comparison result;

[0109] Based on the comparison result obtained, and in combination with the number of at least one flow table entry required to be included in each second flow table, a target computing node is determined from the multiple computing nodes.

[0110] In one embodiment, the second processing unit 203 is further configured to:

[0111] In a case where the comparison result indicates that the number of flow table entries included in the first flow table requirement is greater than or equal to the first threshold, determining a first type of computing node from the multiple computing nodes based on the number of at least one flow table entries included in each second flow table requirement; the maximum number of flow table entries among the at least one flow table entry number included in the second flow table requirement of the first type of computing node is less than the first threshold;

[0112] A target computing node is determined from the first type of computing nodes based on a preset deployment strategy.

[0113] In one embodiment, the second processing unit 203 is further configured to:

[0114] In the case where the first type of computing node does not exist in the multiple computing nodes, determining a second type of computing node from the multiple computing nodes based on the number of at least one flow table entries included in each second flow table requirement; the sum of the number of at least one flow table entries included in the second flow table requirements of the second type of computing nodes is less than or equal to a second threshold;

[0115] A target computing node is determined from the second-category computing nodes based on a preset deployment strategy.

[0116] In one embodiment, the second processing unit 203 is further configured to:

[0117] In a case where the comparison result indicates that the number of flow table entries included in the first flow table requirement is less than the first threshold, determining a second type of computing node from the multiple computing nodes based on the number of at least one flow table entries included in each second flow table requirement; the sum of the number of at least one flow table entries included in the second flow table requirements of the second type of computing nodes is less than or equal to the second threshold;

[0118] A target computing node is determined from the second-category computing nodes based on a preset deployment strategy.

[0119] In one embodiment, the second processing unit 203 is further configured to determine the target computing node based on other deployment requirements of the virtual machine to be deployed; the other deployment requirements include at least one of the following:

[0120] Computational capacity;

[0121] Storage capacity;

[0122] Deployment requirements related to network and / or application optimization.

[0123] In one embodiment, the acquisition unit 201 is specifically used to acquire specification information of the virtual machine to be deployed; the specification information at least includes the first flow table requirement.

[0124] In actual application, the acquisition unit 201 can be implemented by the processor of the device in combination with a communication interface; the first processing unit 202 and the second processing unit 203 can be implemented by the processor of the device.

[0125] It should be noted that: the node scheduling device provided in the above embodiment only uses the division of the above program modules as an example when scheduling computing nodes. In actual application, the above processing can be assigned to different program modules as needed, that is, the internal structure of the device can be divided into different program modules to complete all or part of the processing described above. In addition, the node scheduling device provided in the above embodiment and the node scheduling method embodiment belong to the same concept. The specific implementation process is detailed in the method embodiment and will not be repeated here.

[0126] Based on the hardware implementation of the above program modules, and in order to implement the method of the embodiment of the present application, the embodiment of the present application also provides a node scheduling device, such as Figure 3 As shown, the node scheduling device 300 includes:

[0127] Communication interface 301, capable of exchanging information with other electronic devices;

[0128] A processor 302, connected to the communication interface 301 to implement information interaction with other electronic devices, and used to execute the method provided by one or more of the above technical solutions when running a computer program;

[0129] The memory 303 is used to store a computer program that can be executed on the processor 302 .

[0130] Specifically, the processor 302 is configured to perform the following operations:

[0131] Obtain the first-stream table requirements of the virtual machine to be deployed;

[0132] Determine a second flow table requirement of each computing node in the plurality of computing nodes; the second flow table requirement includes a flow table requirement of each virtual machine in at least one virtual machine deployed on the corresponding computing node;

[0133] Based on the acquired first flow table requirement and the determined multiple second flow table requirements, a target computing node is determined from the multiple computing nodes; and the to-be-deployed virtual machine is deployed on the target computing node.

[0134] In one embodiment, the processor 302 is further configured to perform the following operations:

[0135] Compare the number of flow table entries included in the first flow table requirement with a first threshold to obtain a comparison result;

[0136] Based on the comparison result obtained, and in combination with the number of at least one flow table entry required to be included in each second flow table, a target computing node is determined from the multiple computing nodes.

[0137] In one embodiment, the processor 302 is further configured to perform the following operations:

[0138] In a case where the comparison result indicates that the number of flow table entries included in the first flow table requirement is greater than or equal to the first threshold, determining a first type of computing node from the multiple computing nodes based on the number of at least one flow table entries included in each second flow table requirement; the maximum number of flow table entries among the at least one flow table entry number included in the second flow table requirement of the first type of computing node is less than the first threshold;

[0139] A target computing node is determined from the first type of computing nodes based on a preset deployment strategy.

[0140] In one embodiment, the processor 302 is further configured to perform the following operations:

[0141] In the case where the first type of computing node does not exist in the multiple computing nodes, determining a second type of computing node from the multiple computing nodes based on the number of at least one flow table entries included in each second flow table requirement; the sum of the number of at least one flow table entries included in the second flow table requirements of the second type of computing nodes is less than or equal to a second threshold;

[0142] A target computing node is determined from the second-category computing nodes based on a preset deployment strategy.

[0143] In one embodiment, the processor 302 is further configured to perform the following operations:

[0144] In a case where the comparison result indicates that the number of flow table entries included in the first flow table requirement is less than the first threshold, determining a second type of computing node from the multiple computing nodes based on the number of at least one flow table entries included in each second flow table requirement; the sum of the number of at least one flow table entries included in the second flow table requirements of the second type of computing nodes is less than or equal to the second threshold;

[0145] A target computing node is determined from the second-category computing nodes based on a preset deployment strategy.

[0146] In one embodiment, the processor 302 is further configured to perform the following operations:

[0147] Determine the target computing node based on other deployment requirements of the virtual machine to be deployed; the other deployment requirements include at least one of the following:

[0148] Computational capacity;

[0149] Storage capacity;

[0150] Deployment requirements related to network and / or application optimization.

[0151] In one embodiment, the processor 302 is further configured to obtain specification information of the virtual machine to be deployed; the specification information at least includes the first flow table requirement.

[0152] It should be noted that: the specific process of the processor 302 performing the above operations is detailed in the method embodiment, which will not be repeated here.

[0153] Of course, in actual application, the various components in the node scheduling device 300 are coupled together through the bus system 304. It can be understood that the bus system 304 is used to realize the connection and communication between these components. In addition to the data bus, the bus system 304 also includes a power bus, a control bus, and a status signal bus. However, for the sake of clarity, Figure 3 Various buses are labeled as bus system 304 .

[0154] The memory 303 in the embodiment of the present application is used to store various types of data to support the operation of the node scheduling device 300. Examples of such data include: any computer program used to operate on the node scheduling device 300.

[0155] The method disclosed in the above embodiment of the present application can be applied to the processor 302, or implemented by the processor 302. The processor 302 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by the hardware integrated logic circuit or software instructions in the processor 302. The above processor 302 may be a general-purpose processor, a digital signal processor (DSP, Digital Signal Processor), or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. The processor 302 can implement or execute the various methods, steps and logic block diagrams disclosed in the embodiments of the present application. The general-purpose processor may be a microprocessor or any conventional processor, etc. In combination with the steps of the method disclosed in the embodiment of the present application, it can be directly embodied as a hardware decoding processor to execute, or it can be executed by a combination of hardware and software modules in the decoding processor. The software module can be located in a storage medium, which is located in the memory 303, and the processor 302 reads the information in the memory 303 and completes the steps of the above method in combination with its hardware.

[0156] In an exemplary embodiment, the node scheduling device 300 can be implemented by one or more application-specific integrated circuits (ASIC), DSP, programmable logic device (PLD), complex programmable logic device (CPLD), field-programmable gate array (FPGA), general-purpose processor, controller, microcontroller (MCU), microprocessor, or other electronic components to execute the aforementioned method.

[0157] It can be understood that the memory 303 of the embodiment of the present application can be a volatile memory or a non-volatile memory, and can also include both volatile and non-volatile memories. Among them, the non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), a magnetic random access memory (FRAM), a flash memory, a magnetic surface memory, an optical disc, or a compact disc read-only memory (CD-ROM); the magnetic surface memory can be a disk memory or a tape memory. The volatile memory can be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static random access memory (SRAM), synchronous static random access memory (SSRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDRSDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM, SyncLink Dynamic Random Access Memory), and direct RAMbus random access memory (DRRAM, Direct Rambus Random Access Memory).The memory described in the embodiments of the present application is intended to include, but is not limited to, these and any other suitable types of memory.

[0158] In an exemplary embodiment, the embodiment of the present application further provides a storage medium, namely a computer storage medium, specifically a computer-readable storage medium, for example, a memory 303 storing a computer program, and the computer program can be executed by a processor 302 of a node scheduling device 300 to complete the steps of the aforementioned method. The computer-readable storage medium can be a memory such as FRAM, ROM, PROM, EPROM, EEPROM, Flash Memory, magnetic surface storage, optical disk, or CD-ROM.

[0159] It should be noted that: "first", "second", etc. are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence.

[0160] In addition, the technical solutions described in the embodiments of the present application can be combined arbitrarily without conflict.

[0161] The above description is only a preferred embodiment of the present application and is not intended to limit the protection scope of the present application.

Claims

1. A node scheduling method, It is characterized in that include: Obtain the first-stream table requirements of the virtual machine to be deployed; Determining a second flow table requirement for each computing node in the plurality of computing nodes; The second flow table requirement includes a flow table requirement of each virtual machine in at least one virtual machine deployed on the corresponding computing node; Based on the acquired first flow table requirement and the determined multiple second flow table requirements, determining a target computing node from the multiple computing nodes; and deploying the to-be-deployed virtual machine to the target computing node; The determining of the target computing node from the plurality of computing nodes based on the acquired first flow table requirement and the determined plurality of second flow table requirements includes: Compare the number of flow table entries included in the first flow table requirement with a first threshold to obtain a comparison result; Based on the comparison result obtained, and in combination with the number of at least one flow table entry required to be included in each second flow table, a target computing node is determined from the multiple computing nodes.

2. The method according to claim 1, It is characterized in that The step of determining a target computing node from the plurality of computing nodes based on the obtained comparison result and in combination with the number of at least one flow table entry required to be included in each second flow table comprises: In a case where the comparison result indicates that the number of flow table entries included in the first flow table requirement is greater than or equal to the first threshold, determining a first type of computing node from the multiple computing nodes based on the number of at least one flow table entries included in each second flow table requirement; the maximum number of flow table entries among the at least one flow table entry number included in the second flow table requirement of the first type of computing node is less than the first threshold; A target computing node is determined from the first type of computing nodes based on a preset deployment strategy.

3. The method according to claim 2, It is characterized in that The method further comprises: In the case where the first type of computing node does not exist in the multiple computing nodes, determining a second type of computing node from the multiple computing nodes based on the number of at least one flow table entries included in each second flow table requirement; the sum of the number of at least one flow table entries included in the second flow table requirements of the second type of computing nodes is less than or equal to a second threshold; A target computing node is determined from the second-type computing nodes based on the preset deployment strategy.

4. The method according to claim 1, It is characterized in that The step of determining a target computing node from the plurality of computing nodes based on the obtained comparison result and in combination with the number of at least one flow table entry required to be included in each second flow table comprises: In a case where the comparison result indicates that the number of flow table entries included in the first flow table requirement is less than the first threshold, determining a second type of computing node from the multiple computing nodes based on the number of at least one flow table entries included in each second flow table requirement; the sum of the number of at least one flow table entries included in the second flow table requirements of the second type of computing nodes is less than or equal to the second threshold; A target computing node is determined from the second-category computing nodes based on a preset deployment strategy.

5. The method according to any one of claims 2 to 4, It is characterized in that The determining of the target computing node based on the preset deployment strategy includes: Determine the target computing node based on other deployment requirements of the virtual machine to be deployed; the other deployment requirements include at least one of the following: Computational capacity; Storage capacity; Deployment requirements related to network and / or application optimization.

6. The method according to any one of claims 1 to 4, It is characterized in that The obtaining of the first flow table requirement of the virtual machine to be deployed includes: Obtain specification information of the virtual machine to be deployed; the specification information at least includes the first flow table requirement.

7. A node scheduling device, It is characterized in that include: An acquisition unit, used for acquiring a first flow table requirement of a virtual machine to be deployed; A first processing unit, configured to determine a second flow table requirement for each computing node among the plurality of computing nodes; The second flow table requirement includes a flow table requirement of each virtual machine in at least one virtual machine deployed on the corresponding computing node; a second processing unit, configured to determine a target computing node from the plurality of computing nodes based on the acquired first flow table requirement and the determined plurality of second flow table requirements; and deploy the to-be-deployed virtual machine to the target computing node; and further configured to compare the number of flow table entries included in the first flow table requirement with a first threshold value to obtain a comparison result; Based on the comparison result obtained, and in combination with the number of at least one flow table entry required to be included in each second flow table, a target computing node is determined from the multiple computing nodes.

8. A node scheduling device, It is characterized in that include: a processor and a memory for storing a computer program capable of being executed on the processor, Wherein, when the processor is used to run the computer program, it executes the steps of the method described in any one of claims 1 to 6.

9. A storage medium having a computer program stored thereon, It is characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

Citation Information

Patent Citations

  • Management system of mirror network flow in virtual network environment and control method

    CN106375384A

  • Multi-dimensional environment perception-based rapid adaptive network function migration method

    CN107193638A

  • Business deployment method and device

    CN108243044A

  • Network access control device and method

    CN108540387A

  • Virtual switch and virtual network function joint deployment method in software defined network

    CN110198234A