CN117112234B - Reliable resource pre-allocation method and system in network target range - Google Patents
Reliable resource pre-allocation method and system in network target range Download PDFInfo
- Publication number
- CN117112234B CN117112234B CN202311353005.8A CN202311353005A CN117112234B CN 117112234 B CN117112234 B CN 117112234B CN 202311353005 A CN202311353005 A CN 202311353005A CN 117112234 B CN117112234 B CN 117112234B
- Authority
- CN
- China
- Prior art keywords
- scene
- instantiation
- resource
- resources
- coordination node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 18
- 238000011084 recovery Methods 0.000 claims abstract description 31
- 230000001360 synchronised effect Effects 0.000 claims abstract description 18
- 230000004044 response Effects 0.000 claims description 6
- 238000005516 engineering process Methods 0.000 description 2
- 230000009191 jumping Effects 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000007123 defense Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5061—Partitioning or combining of resources
- G06F9/5077—Logical partitioning of resources; Management or configuration of virtualized resources
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
- G06F9/45533—Hypervisors; Virtual machine monitors
- G06F9/45558—Hypervisor-specific management and integration aspects
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
- G06F9/5022—Mechanisms to release resources
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
- G06F9/45533—Hypervisors; Virtual machine monitors
- G06F9/45558—Hypervisor-specific management and integration aspects
- G06F2009/45595—Network integration; Enabling network access in virtual machine instances
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a reliable resource pre-allocation method and a system in a network shooting range, wherein a coordination node is additionally arranged, the total amount of physical resources required by instantiation of all nodes in the shooting range scene is counted, the coordination node is applied to occupy pre-allocation resource amount, and whether the total amount of resources available to a computing cluster is enough or not is judged by the coordination node; registering a resource recovery address and a resource initiative query address of a scene to a coordination node; the virtual machines in the scene are instantiated one by one through the virtualization platform, and the instantiation information of the virtual machines is synchronized to the coordination node; the coordination node updates and calculates the total quantity of the resources which are allocated by the instantiation of the cluster and the pre-allocation resource limit corresponding to the scene; and if the instantiation of the virtual machine in the scene fails, releasing the pre-allocated resource limit corresponding to the scene, calling the resource recovery address of the scene, and triggering the physical resource recovery of the instantiated virtual machine in the scene. The method and the device can ensure the consistency of scene instantiation and avoid deadlock caused by preemption of a plurality of scene resources.
Description
Technical Field
The invention relates to a reliable resource pre-allocation method and a system in a network target range, belonging to the technical fields of virtualization technology and network security.
Background
The network target range is a test platform which simulates a real network space attack and defense combat environment through a virtualization technology and can support combat capability research and weapon equipment verification. In order to achieve the above purpose, a user plans various network topology scenes according to service requirements, and the target platform instantiates each node in the scene topology in a virtualized mode.
As shown in fig. 1, in the actual service system, the virtualization platform and the scenario instantiation program are deployed independently. The scene instantiation program converts the network topology defined by the user into single virtual machines and network connection relations among the virtual machines, and invokes the virtualization platform to instantiate one by one; the virtualization platform provides the basic capabilities of instantiation of virtual machines, network connectivity, and the like. When a plurality of scene instantiation programs work simultaneously, resource competition can be generated; and because the instantiation is not an atomic operation, the instantiation program can be interrupted in advance in the execution process due to insufficient resources and the like.
Specifically, the existing scenario instantiation method has the following problems: 1. the scene is composed of a plurality of virtual machines, and each virtual machine applies for corresponding physical resources (CPU, memory and disk) when being instantiated. If a scene is already partially instantiated, the entire scene is failed to be instantiated as long as a subsequent virtual machine cannot be instantiated due to insufficient hardware resources, and user experience is affected. For a user, the scene instantiation should be checked with consistency, namely, insufficient resources are prompted at the beginning of the scene Jing Shili instantiation, or enough physical resources are reserved to ensure that the scene can be successfully instantiated; 2. multiple scenarios, when instantiated, can compete for physical resources, resulting in resource deadlocks. If the physical resources required by the two scenes are the same, and the current remaining physical resources just meet the instantiation requirement of one scene, however, when the two scenes are started simultaneously, partial resources are preempted, so that the instantiation of the two scenes fails.
Disclosure of Invention
The invention aims to: aiming at the problems in the prior art, the invention aims to provide a reliable resource pre-allocation method and a system in a network shooting range, which ensure the consistency of scene instantiation and avoid deadlock caused by preemption of a plurality of scene resources.
The technical scheme is as follows: in order to achieve the aim of the invention, the invention adopts the following technical scheme:
a reliable resource pre-allocation method in a network target range, comprising the steps of:
counting the total amount of physical resources required by instantiation of all nodes in a target range scene, and applying for occupying pre-allocation resource amount to a coordination node;
the coordination node judges whether the total amount of available resources of the computing cluster is enough, if not, the scene instantiation fails, and the flow is ended; if so, updating the total amount of the pre-allocated resources;
registering a resource recovery address and a resource initiative query address of a scene to a coordination node;
the virtual machines in the scene are instantiated one by one through the virtualization platform, and the instantiation information of the virtual machines is synchronized to the coordination node, wherein the synchronized information comprises scene numbers, physical resource requirements of the instantiating virtual machines and marks of whether the coordination node is required to actively inquire; the coordination node updates and calculates the total quantity of the resources which are allocated by the instantiation of the cluster and the pre-allocation resource limit corresponding to the scene; and if the instantiation of the virtual machine in the scene fails, releasing the pre-allocated resource limit corresponding to the scene, calling the resource recovery address of the scene, and triggering the physical resource recovery of the instantiated virtual machine in the scene.
Preferably, when the instantiation information of the virtual machine is synchronized to the coordination node, if no response is received by the coordination node, retrying, if no response is received after the specified times are reached, continuing to instantiate a subsequent virtual machine in the scene, setting an active query flag in the subsequent instantiation synchronization information as true, and setting the state of the currently unsynchronized virtual machine as unsynchronized.
Preferably, if the active query flag of the coordination node is true in the synchronization information, the coordination node invokes the active query address of the resource of the scene, queries the synchronization state of each virtual machine in the scene, counts the physical resource requirement of the virtual machine with the unsynchronized synchronization state, updates the total amount of the resources which are allocated by the computing cluster in an instantiated manner and the pre-allocation resource limit corresponding to the scene, and sets the state of the virtual machine to be synchronized.
Preferably, the coordination node periodically traverses the scene in each instantiation, and if the instantiation of the scene fails or does not respond, the coordination node releases the corresponding pre-allocation resource limit and invokes the resource recovery address of the scene to trigger the physical resource recovery of the instantiated virtual machine in the scene.
Preferably, the total amount of resources available to the computing cluster is the total amount of computing cluster physical resources minus the total amount of resources that have been allocated by actual instantiation, and minus the total amount of resources that have been pre-allocated.
Preferably, the coordinator node is deployed in a highly available manner.
Based on the same inventive concept, the invention provides a reliable resource pre-allocation system in a network target range, which comprises:
the scene instantiation program module is used for counting the total amount of physical resources required by the instantiation of all nodes in the shooting range scene and applying for occupying pre-allocation resource limit to the coordination nodes; registering a resource recovery address and a resource initiative query address of a scene to a coordination node; the virtual machines in the scene are instantiated one by one through the virtualization platform, and the instantiation information of the virtual machines is synchronized to the coordination node, wherein the synchronized information comprises scene numbers, physical resource requirements of the instantiating virtual machines and marks of whether the coordination node actively inquires;
the coordination node is used for failing the scene instantiation if the scene instantiation program module applies to occupy the preallocated resource limit; if the total amount of the pre-allocated resources is enough, the scene instantiation program module is informed to carry out instantiation; when the scene instantiation program module synchronizes the information of the virtual machine instantiation, updating the total quantity of the resources which are allocated by the computing cluster in an instantiation mode and the pre-allocation resource limit corresponding to the scene; and if the instantiation of the virtual machine in the scene fails, releasing the pre-allocated resource limit corresponding to the scene, calling the resource recovery address of the scene, and triggering the physical resource recovery of the instantiated virtual machine in the scene.
The beneficial effects are that: compared with the prior art, the invention has the following advantages: 1. in the invention, the scene needs to be pre-applied for physical resources during instantiation, so that the pre-applied resources can be ensured not to be occupied by other scenes, thereby ensuring the consistency of scene instantiation; 2. pre-allocation physical resources belong to logical atomic operations, and deadlock caused by preemption of a plurality of scene resources is avoided; 3. the invention adds a coordination node which is responsible for controlling the pre-allocation of the physical resources of the whole cluster. After completion of the field Jing Shili, marking that the pre-allocated resources have been used; if the scene instantiation fails, calling a resource deletion interface corresponding to the scene, releasing the occupied pre-allocation resources, and ensuring that no resource leakage occurs; 4. the coordination node in the invention can be deployed in a high-availability mode, thereby ensuring the reliability of the pre-allocation resource calculation and avoiding resource leakage.
Drawings
Fig. 1 is a schematic diagram of an existing scenario instantiation scheme.
FIG. 2 is a scene start-up flow chart in an embodiment of the invention.
FIG. 3 is a flowchart of a synchronization information exception handling process in an embodiment of the present invention.
FIG. 4 is a flow chart of a coordinated node compensation task in an embodiment of the invention.
Detailed Description
The technical scheme of the invention will be clearly and completely described below with reference to the accompanying drawings and specific embodiments.
According to the reliable resource pre-allocation method in the network target range, disclosed by the embodiment of the invention, resources are divided into three types of unused, pre-allocated and instantiated by adding the coordination node between the scene instantiation program module and the virtualization platform, so that unified management and control of various resources are realized, and resource deadlock caused by simultaneous instantiation of a plurality of scenes is avoided. When scene instantiation starts, registering resource inquiry and resource recovery information to a coordination node; in scene starting, the coordination node dynamically calculates the service condition of pre-allocated resources; when an error occurs, consistency of the resources can be ensured through a compensation mechanism. In addition, the coordination nodes can be deployed in a high-availability mode, such as the deployment of distributed consistency components like an integration zookeeper, etcd, so that high availability of the functions of pre-allocation, inquiry and release of resources can be ensured, and physical resource leakage caused by inconsistent pre-allocation resources due to downtime of the coordination nodes is avoided.
As shown in fig. 2, the resource pre-allocation method in the embodiment of the invention mainly includes the following steps:
step 1, when an instantiation program module X executes scene instantiation, firstly counting the total quantity A of physical resources required by all node instantiations in a scene; and then applies for pre-allocation of the corresponding physical resource A to the coordination node Y.
Step 2, after the coordination node Y receives the request, counting the total amount of the current physical resources of the computing cluster, and marking as B; the total amount of the resources which are actually instantiated and allocated is marked as C; the total amount of the pre-allocated resources is marked as D; the total amount of resources currently available to the cluster e=b-C-D is calculated. If C < A, jumping to step 3; otherwise, jumping to the step 4.
Step 3, the scene is failed to start, the user is prompted that available resources of the current system are insufficient, and the flow is ended;
and 4, pre-distributing the resource A for the current scene, and simultaneously marking the total quantity of the pre-distributed resources corresponding to the step 2 as D=D+A. The instantiation program module X is notified to perform the actual instantiation operation.
Step 5, the instantiation program module X registers a resource recovery address Z1 (such as/api/changing/{ changing_id }/cancel) of the current scene to the coordination node Y, and the resource actively inquires an address Z2 (/ api/changing/{ changing_id }/query); the coordination node Y can inquire the necessary information of the specified scene, such as the state of the virtual machine, the physical resource requirement and the like, through the registered address, and trigger the physical resource recovery of the scene. The functional implementation of specific information query, resource reclamation may be integrated in the instantiation program module X or implemented by a separate program module.
Step 6, the set of N virtual machines in the scene is denoted as m= { M1, M2, …, MN }, and the instantiation program module X instantiates the virtual machines in the scene one by one.
And 7, after the instantiation of a certain virtual machine MI in the scene is completed, the instantiation program module X synchronizes the instantiation information of the virtual machine MI to the coordination node Y. The synchronization information includes the current scene number, the physical resource requirement F of the virtual machine being instantiated, the result (success or failure) of the instantiation, and a flag of whether the coordinator node Y needs to actively query. After receiving the request, the coordination node Y performs the following operations:
7.1, updating the total quantity C=C+F of resources which are allocated by the current cluster in an instantiation way, and updating the time stamp T of interaction between the current scene and the coordination node Y;
7.2, if the virtual machine is successfully instantiated, deducting the pre-allocated resource limit A corresponding to the current scene, wherein A=A-F;
and 7.3, if the virtual machine instantiation fails, marking the preallocated resource limit A corresponding to the current scene as 0, namely, completely releasing preallocated resources to other scenes for use.
Considering the scenario that the synchronization information may fail to be transmitted, a retry mechanism is introduced. As shown in fig. 3, if the coordinating node Y does not respond correctly to the instantiation synchronization information of the virtual machine, the instantiation program module X may attempt to send the synchronization information multiple times. After the designated times of transmission, the coordinating node Y does not respond to the synchronization information yet, the instantiation program module X continues the subsequent instantiation of the scene, marks the active query mark in the subsequent instantiation synchronization information as true, and simultaneously sets the current unsynchronized node state as unsynchronized. If the coordinating node Y responds correctly, the current node state is set to synchronized. And if the subsequent virtual machine is in failure in instantiation, the coordination node Y calls the scene resource recovery address Z1 to trigger the instantiated physical resource recovery.
And 8, in the instantiation synchronization information, if the active query mark is true, the coordination node Y calls the active query address of the resource registered in the current scene to query the synchronization state of each virtual machine in the scene. And for the virtual machine instance with the unsynchronized synchronous state, acquiring the physical resource requirement H, updating the corresponding pre-allocation resource limit to A=A-H, updating the total quantity of the resources allocated by the cluster in an instantiated mode to C=C+H, and setting the node state to be synchronized.
As shown in fig. 4, to ensure consistency of resources, a compensation task flow is added. The coordination node Y periodically traverses the scenes in each instantiation, and if the interval between the current time of the coordination node Y and the latest time stamp T of the scenes exceeds a specified threshold value, the coordination node Y actively inquires about the instantiation state of the scenes. If the scene instantiation fails or does not respond, the coordination node Y sets the pre-occupied resource A corresponding to the error scene as 0, and the coordination node Y calls the scene resource recovery address Z1 to trigger the instantiated physical resource recovery. And if the scene is successfully instantiated, executing the information synchronization flow in the step 8, and after the information synchronization is completed, marking the scene as successfully instantiated by the coordination node Y, wherein the pre-allocation resource occupied by the scene is 0.
Based on the same inventive concept, the reliable resource pre-allocation system in the network target range disclosed by the embodiment of the invention comprises the following steps: the scene instantiation program module is used for counting the total amount of physical resources required by the instantiation of all nodes in the shooting range scene and applying for occupying pre-allocation resource limit to the coordination nodes; registering a resource recovery address and a resource initiative query address of a scene to a coordination node; the virtual machines in the scene are instantiated one by one through the virtualization platform, and the instantiation information of the virtual machines is synchronized to the coordination node; the coordination node is used for failing the scene instantiation if the scene instantiation program module applies to occupy the preallocated resource limit; if the total amount of the pre-allocated resources is enough, the scene instantiation program module is informed to carry out instantiation; when the scene instantiation program module synchronizes the information of the virtual machine instantiation, updating the total quantity of the resources which are allocated by the computing cluster in an instantiation mode and the pre-allocation resource limit corresponding to the scene; and if the instantiation of the virtual machine in the scene fails, releasing the pre-allocated resource limit corresponding to the scene, calling the resource recovery address of the scene, and triggering the physical resource recovery of the instantiated virtual machine in the scene. Specific implementation details refer to the above method embodiments, and are not repeated.
Claims (8)
1. A reliable resource pre-allocation method in a network target range, comprising the steps of:
counting the total amount of physical resources required by instantiation of all nodes in a target range scene, and applying for occupying pre-allocation resource amount to a coordination node;
the coordination node judges whether the total amount of available resources of the computing cluster is enough, if not, the scene instantiation fails, and the flow is ended; if so, updating the total amount of the pre-allocated resources;
registering a resource recovery address and a resource initiative query address of a scene to a coordination node;
the virtual machines in the scene are instantiated one by one through the virtualization platform, and the instantiation information of the virtual machines is synchronized to the coordination node, wherein the synchronized information comprises scene numbers, physical resource requirements of the instantiating virtual machines and marks of whether the coordination node is required to actively inquire; the coordination node updates and calculates the total quantity of the resources which are allocated by the instantiation of the cluster and the pre-allocation resource limit corresponding to the scene; if the instantiation of the virtual machine in the scene fails, releasing the pre-allocation resource limit corresponding to the scene, calling the resource recovery address of the scene, and triggering the physical resource recovery of the instantiated virtual machine in the scene; if the active query mark of the coordination node is true in the synchronization information, the coordination node calls the active query address of the resources of the scene, queries the synchronization state of each virtual machine in the scene, counts the physical resource requirement of the virtual machines with the unsynchronized synchronization state, updates the total quantity of the resources which are allocated by the computing cluster in an instantiated mode and the pre-allocation resource limit corresponding to the scene, and simultaneously sets the state of the virtual machines to be synchronized.
2. The method according to claim 1, wherein when the instantiation information of the virtual machine is synchronized to the coordination node, if no response is received from the coordination node, retrying, if no response is received after a specified number of times, continuing to instantiate a subsequent virtual machine in the scene, setting an active query flag in the subsequent instantiation synchronization information to true, and setting a current unsynchronized virtual machine state to unsynchronized.
3. The method according to claim 1, wherein the coordinating node periodically traverses the scenes in each instantiation, and if the scene is failed to be instantiated or is unresponsive, the coordinating node releases its corresponding pre-allocated resource unit and invokes the resource recovery address of the scene to trigger the recovery of physical resources of the instantiated virtual machines in the scene.
4. A reliable resource pre-allocation method in a network target according to claim 1, wherein the total amount of resources available to the computing cluster is the total amount of computing cluster physical resources minus the total amount of resources allocated by actual instantiation and minus the total amount of resources pre-allocated.
5. A reliable resource pre-allocation method in a network shooting range according to claim 1, wherein the coordinator node is deployed in a high availability manner.
6. A reliable resource pre-allocation system in a network target range, comprising:
the scene instantiation program module is used for counting the total amount of physical resources required by the instantiation of all nodes in the shooting range scene and applying for occupying pre-allocation resource limit to the coordination nodes; registering a resource recovery address and a resource initiative query address of a scene to a coordination node; the virtual machines in the scene are instantiated one by one through the virtualization platform, and the instantiation information of the virtual machines is synchronized to the coordination node, wherein the synchronized information comprises scene numbers, physical resource requirements of the instantiating virtual machines and marks of whether the coordination node actively inquires;
the coordination node is used for failing the scene instantiation if the scene instantiation program module applies to occupy the preallocated resource limit; if the total amount of the pre-allocated resources is enough, the scene instantiation program module is informed to carry out instantiation; when the scene instantiation program module synchronizes the information of the virtual machine instantiation, updating the total quantity of the resources which are allocated by the computing cluster in an instantiation mode and the pre-allocation resource limit corresponding to the scene; if the instantiation of the virtual machine in the scene fails, releasing the pre-allocation resource limit corresponding to the scene, calling the resource recovery address of the scene, and triggering the physical resource recovery of the instantiated virtual machine in the scene; if the active query mark of the coordination node is true in the synchronization information, the coordination node calls the active query address of the resources of the scene, queries the synchronization state of each virtual machine in the scene, counts the physical resource requirement of the virtual machines with the unsynchronized synchronization state, updates the total quantity of the resources which are allocated by the computing cluster in an instantiated mode and the pre-allocation resource limit corresponding to the scene, and simultaneously sets the state of the virtual machines to be synchronized.
7. The system according to claim 6, wherein the scenario instantiation program module, when synchronizing the instantiation information of the virtual machine to the coordinating node, if no response is received from the coordinating node, retries, if no response is received after a specified number of times, continues to instantiate a subsequent virtual machine in the scenario, and sets an active query flag in the subsequent instantiation synchronization information to true, while setting a current unsynchronized virtual machine state to unsynchronized.
8. The system of claim 6, wherein the coordinating node periodically traverses each scene in the instantiation, and if the scene is failed to be instantiated or is unresponsive, the coordinating node releases its corresponding pre-allocated resource credit and invokes the resource recovery address of the scene to trigger the recovery of physical resources of the instantiated virtual machines in the scene.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311353005.8A CN117112234B (en) | 2023-10-19 | 2023-10-19 | Reliable resource pre-allocation method and system in network target range |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311353005.8A CN117112234B (en) | 2023-10-19 | 2023-10-19 | Reliable resource pre-allocation method and system in network target range |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117112234A CN117112234A (en) | 2023-11-24 |
| CN117112234B true CN117112234B (en) | 2024-02-09 |
Family
ID=88796800
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311353005.8A Active CN117112234B (en) | 2023-10-19 | 2023-10-19 | Reliable resource pre-allocation method and system in network target range |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117112234B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2008225520A (en) * | 2007-03-08 | 2008-09-25 | Nec Corp | Memory resource arrangement control method for arranging memory resource in virtual machine environment, virtual machine system, and program |
| CN103092699A (en) * | 2013-01-10 | 2013-05-08 | 中国南方电网有限责任公司超高压输电公司 | Cloud computing resource pre-distribution achievement method |
| WO2015136309A1 (en) * | 2014-03-13 | 2015-09-17 | Vodafone Ip Licensing Limited | Management of resource allocation in a mobile telecommunication network |
| CN111464567A (en) * | 2020-06-16 | 2020-07-28 | 鹏城实验室 | Configuration method and device of attack and defense shooting range system and storage medium |
| CN111796933A (en) * | 2020-06-28 | 2020-10-20 | 北京小米松果电子有限公司 | Resource scheduling method, device, storage medium and electronic equipment |
| CN112860370A (en) * | 2019-11-27 | 2021-05-28 | 中国电信股份有限公司 | Virtual machine resource allocation method, device, system and storage medium |
| CN113268206A (en) * | 2021-07-19 | 2021-08-17 | 南京赛宁信息技术有限公司 | Network target range resource hot plug implementation method and system |
| CN114327824A (en) * | 2021-12-28 | 2022-04-12 | 绿盟科技集团股份有限公司 | Method and device for determining service host and electronic equipment |
| CN115643178A (en) * | 2022-10-26 | 2023-01-24 | 新华三信息安全技术有限公司 | Network target range configuration method, device, equipment and machine readable storage medium |
| CN116723143A (en) * | 2023-08-11 | 2023-09-08 | 南京赛宁信息技术有限公司 | Network target range resource allocation method and system based on traffic affinity |
-
2023
- 2023-10-19 CN CN202311353005.8A patent/CN117112234B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2008225520A (en) * | 2007-03-08 | 2008-09-25 | Nec Corp | Memory resource arrangement control method for arranging memory resource in virtual machine environment, virtual machine system, and program |
| CN103092699A (en) * | 2013-01-10 | 2013-05-08 | 中国南方电网有限责任公司超高压输电公司 | Cloud computing resource pre-distribution achievement method |
| WO2015136309A1 (en) * | 2014-03-13 | 2015-09-17 | Vodafone Ip Licensing Limited | Management of resource allocation in a mobile telecommunication network |
| CN112860370A (en) * | 2019-11-27 | 2021-05-28 | 中国电信股份有限公司 | Virtual machine resource allocation method, device, system and storage medium |
| CN111464567A (en) * | 2020-06-16 | 2020-07-28 | 鹏城实验室 | Configuration method and device of attack and defense shooting range system and storage medium |
| CN111796933A (en) * | 2020-06-28 | 2020-10-20 | 北京小米松果电子有限公司 | Resource scheduling method, device, storage medium and electronic equipment |
| CN113268206A (en) * | 2021-07-19 | 2021-08-17 | 南京赛宁信息技术有限公司 | Network target range resource hot plug implementation method and system |
| CN114327824A (en) * | 2021-12-28 | 2022-04-12 | 绿盟科技集团股份有限公司 | Method and device for determining service host and electronic equipment |
| CN115643178A (en) * | 2022-10-26 | 2023-01-24 | 新华三信息安全技术有限公司 | Network target range configuration method, device, equipment and machine readable storage medium |
| CN116723143A (en) * | 2023-08-11 | 2023-09-08 | 南京赛宁信息技术有限公司 | Network target range resource allocation method and system based on traffic affinity |
Non-Patent Citations (2)
| Title |
|---|
| Dynamic Resource Allocation Scheme in Cloud Computing.《Procedia Computer Science》.2015,第30-36页. * |
| 一种基于资源预分配的虚拟机软实时调度方法.《计算机工程与科学》.2015,第865-872页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117112234A (en) | 2023-11-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108874552B (en) | Distributed lock execution method, device and system, application server and storage medium | |
| JP5519909B2 (en) | Non-intrusive method for replaying internal events in an application process and system implementing this method | |
| CN112153133B (en) | Data sharing method, device and medium | |
| CN103152434A (en) | Leader node replacing method of distributed cloud system | |
| US7171581B2 (en) | Fault-tolerant match-and-set locking mechanism for multiprocessor systems | |
| CN106406933B (en) | One-key automatic deployment method for Tomcat cluster | |
| CN104793981B (en) | A kind of online snapshot management method and device of cluster virtual machine | |
| CN117112234B (en) | Reliable resource pre-allocation method and system in network target range | |
| CN111880956A (en) | Data synchronization method and device | |
| CN103500119A (en) | Task allocation method based on pre-dispatch | |
| CN112698838A (en) | Multi-cloud container deployment system and container deployment method thereof | |
| Lofstead et al. | D2t: Doubly distributed transactions for high performance and distributed computing | |
| CN114565502A (en) | GPU resource management method, scheduling method, device, electronic equipment and storage medium | |
| CN114675938A (en) | Heterogeneous cluster virtual machine migration method and system and cloud platform | |
| CN107025257A (en) | A kind of transaction methods and device | |
| CN113010326A (en) | Distributed lock processing method and device, electronic equipment and storage medium | |
| CN110825758B (en) | Transaction processing method and device | |
| CN114493602B (en) | Block chain transaction execution method and device, electronic equipment and storage medium | |
| CN111381937A (en) | Experimental scene snapshot generating system and method based on time base line | |
| CN113900728A (en) | Method, system, electronic device and storage medium for synchronous configuration | |
| CN115495239A (en) | Test resource multiplexing method and device, storage medium and computer equipment | |
| CN113094173B (en) | DPDK-based large-page memory dynamic migration method and device | |
| CN112153093B (en) | Cluster-based task scheduling method, device, equipment and readable storage medium | |
| CN115269136A (en) | Heterogeneous multi-core platform partition operating system safety scheduling method and system | |
| CN104657240B (en) | The Failure Control method and device of more kernel operating systems |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |