CN115314558A - Resource allocation method and device in computational power network, storage medium and electronic equipment - Google Patents
Resource allocation method and device in computational power network, storage medium and electronic equipment Download PDFInfo
- Publication number
- CN115314558A CN115314558A CN202210952781.9A CN202210952781A CN115314558A CN 115314558 A CN115314558 A CN 115314558A CN 202210952781 A CN202210952781 A CN 202210952781A CN 115314558 A CN115314558 A CN 115314558A
- Authority
- CN
- China
- Prior art keywords
- tenant
- mapping
- resource
- address
- resource management
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
-
- 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)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present disclosure relates to the technical field of network security, and provides a resource allocation method in a computational power network, a resource allocation device in the computational power network, a computer storage medium, and an electronic device, wherein the resource allocation method in the computational power network comprises: in response to receiving a resource acquisition request of a tenant, mapping the identity of the tenant to a pre-constructed hash ring based on a preset mapping rule to obtain a first mapping value of the identity on the hash ring; mapping a plurality of IP addresses of a plurality of computing resource management nodes to a hash ring based on a preset mapping rule to obtain a second mapping value of each IP address on the hash ring; and selecting a target calculation force resource management node from the calculation force resource management nodes according to the numerical relation between the first mapping value and the second mapping values so as to distribute calculation force resources for the tenant through the target calculation force resource management node. The present disclosure can reduce hardware deployment costs.
Description
Technical Field
The present disclosure relates to the field of network security technologies, and in particular, to a resource allocation method in a computational power network, a resource allocation apparatus in the computational power network, a computer storage medium, and an electronic device.
Background
With the continuous and widespread development of resources such as computation, storage and the like, the industry proposes a computational network for integrating the resources such as computation, storage and the like of different owners, and providing optimal resource service and network connection according to different requirements of tenant business. In order to reasonably utilize multiple computing resources, the same computing resource pool may provide computing and storage services for multiple tenants through a computing routing node. Because the tenant needs to upload the data to the computing resource pool to complete the computing task, the tenant loses the direct control capability on the information and the data of the tenant, and therefore the security of the information and the data of the tenant needs to be protected.
In the related art, multi-tenant data isolation is generally realized by deploying a domain isolator device. However, this method requires additional hardware device overhead and is costly.
In view of the above, there is a need in the art to develop a new resource allocation method and apparatus in a computing network.
It is to be noted that the information disclosed in the background section above is only used to enhance understanding of the background of the present disclosure.
Disclosure of Invention
The present disclosure is directed to a resource allocation method in a computational power network, a resource allocation device in a computational power network, a computer storage medium, and an electronic device, thereby overcoming, at least to some extent, the technical problem of high hardware cost due to the limitations of the related art.
Additional features and advantages of the disclosure will be set forth in the detailed description which follows, or in part will be obvious from the description, or may be learned by practice of the disclosure.
According to a first aspect of the present disclosure, there is provided a resource allocation method in a computational power network, comprising: in response to a received resource acquisition request of a tenant, mapping an identity of the tenant to a pre-constructed hash ring based on a preset mapping rule to obtain a first mapping value of the identity on the hash ring; the resource acquisition request carries the identity of the tenant; the hash ring comprises a plurality of mapping values; mapping a plurality of IP addresses of the plurality of computing resource management nodes to the hash ring based on the preset mapping rule to obtain a second mapping value of each IP address on the hash ring; and selecting a target computing power resource management node from the plurality of computing power resource management nodes according to the numerical relation between the first mapping value and the plurality of second mapping values, so as to allocate computing power resources to the tenant through the target computing power resource management node.
In an exemplary embodiment of the present disclosure, the mapping, based on a preset mapping rule, an identity of a tenant onto a pre-constructed hash ring to obtain a first mapping value of the identity on the hash ring includes: performing hash operation on the identity to obtain a first hash value; and performing remainder operation on a preset target value by using the first hash value to obtain a first mapping value of the identity label on the hash ring.
In an exemplary embodiment of the present disclosure, the mapping, based on the preset mapping rule, a plurality of IP addresses of the plurality of computing resource management nodes onto the hash ring includes: performing hash operation on each IP address to obtain a second hash value; and performing remainder operation on the preset target value by using the second hash value to obtain a second mapping value of each IP address on the hash ring.
In an exemplary embodiment of the present disclosure, the selecting a target computing power resource management node from the plurality of computing power resource management nodes according to a numerical relationship between the first mapping value and a plurality of the second mapping values includes: selecting a target mapping value with the smallest difference value with the first mapping value from the plurality of second mapping values; determining the computing power resource management node corresponding to the target mapping value as a candidate target computing power resource management node; judging whether the idle resource holding amount of the candidate target computing resource management node is larger than the resource demand amount of the tenant; in response to the idle resource holding amount of the candidate target computing resource management node being larger than the resource demand amount of the tenant, determining the candidate target computing resource management node as the target computing resource management node; otherwise, jumping to the next mapping value of the target mapping value, and determining whether the next computational resource management node is determined as the target computational resource management node according to the idle resource holding amount of the next computational resource management node corresponding to the next mapping value; the next mapping value is a second mapping value having a smallest difference from the target mapping value.
According to a second aspect of the present disclosure, there is provided a resource allocation method in a computing power network, applied to a target computing power resource management node, the method including: distributing target calculation resources for tenants, and encrypting IP addresses of the target calculation resources; returning the identity of the tenant and the encrypted IP address to the tenant, and storing the corresponding relation between the identity of the tenant and the encrypted IP address; responding to a received resource access request of the tenant, and acquiring the encrypted IP address according to the identity of the tenant and the corresponding relation; the resource access request carries the identity of the tenant; decrypting the encrypted IP address to obtain an IP address corresponding to the target computing power resource; and establishing a connection channel between the IP address of the tenant and the IP address of the target computing resource.
In an exemplary embodiment of the present disclosure, the establishing a connection channel between the IP address of the tenant and the IP address of the target computing resource includes: establishing a secure tunnel between the tenant's IP address and the target computing resource's IP address based on a secure tunnel protocol.
According to a third aspect of the present disclosure, there is provided a resource allocation apparatus in a computational power network, the computational power network including a plurality of computational power resource management nodes, different computational power resource management nodes corresponding to different IP addresses, the apparatus including: the first mapping module is used for mapping the identity of a tenant to a pre-constructed hash ring based on a preset mapping rule in response to receiving a resource acquisition request of the tenant to obtain a first mapping value of the identity on the hash ring; a second mapping module, configured to map, based on the preset mapping rule, multiple IP addresses of the multiple computing resource management nodes onto the hash ring, so as to obtain a second mapping value of each IP address on the hash ring; and the management node selection module is used for selecting a target power resource management node from the plurality of power resource management nodes according to the numerical relationship between the first mapping value and the plurality of second mapping values so as to allocate power resources to the tenant through the target power resource management node.
According to a fourth aspect of the present disclosure, there is provided a resource allocation apparatus in a computational power network, the apparatus comprising: the calculation resource allocation module is used for allocating target calculation resources for tenants and encrypting the IP addresses of the target calculation resources; the encrypted address sending module is used for returning the encrypted IP address to the tenant and storing the corresponding relation between the identity of the tenant and the encrypted IP address; the encrypted address acquisition module is used for responding to a received resource access request of the tenant and acquiring the encrypted IP address according to the identity of the tenant and the pre-stored corresponding relation; the resource access request carries the identity of the tenant; the decryption module is used for decrypting the encrypted IP address to obtain the IP address corresponding to the computing resource; and the channel establishing module is used for establishing a connection channel between the IP address of the tenant and the IP address of the target computing resource.
According to a third aspect of the present disclosure, there is provided a computer storage medium having stored thereon a computer program which, when executed by a processor, implements the method of resource allocation in a computational power network of the first aspect described above.
According to a fourth aspect of the present disclosure, there is provided an electronic apparatus comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to perform the method for resource allocation in a computational power network of the first aspect via execution of the executable instructions.
As can be seen from the foregoing technical solutions, the resource allocation method in a computational power network, the resource allocation apparatus in a computational power network, the computer storage medium, and the electronic device in the exemplary embodiments of the present disclosure have at least the following advantages and positive effects:
in the technical solutions provided by some embodiments of the present disclosure, on one hand, the present disclosure obtains a first mapping value of an identity on a hash ring by mapping the identity of a tenant onto the hash ring constructed in advance based on a preset mapping rule in response to receiving a resource acquisition request of the tenant; the resource acquisition request carries an identity of a tenant; the method comprises the steps that a plurality of IP addresses of a plurality of computing power resource management nodes are mapped to a Hash ring based on a preset mapping rule to obtain a second mapping value of each IP address on the Hash ring, and then, a target computing power resource management node is selected from the computing power resource management nodes according to the numerical relation between the first mapping value and the second mapping values so as to distribute computing power resources for tenants through the target computing power resource management node, so that on one hand, the method provides a new idea for realizing data isolation of the multi-tenants without hardware equipment, thereby solving the technical problem of high hardware cost caused by the fact that multi-tenants are isolated through a domain isolator in the related technology, and reducing hardware deployment cost; on the other hand, based on the scheme in the disclosure, even if the number of the computing power resource management nodes is increased subsequently due to the service requirement, the tenant can be conveniently mapped to the newly added computing power resource management nodes based on the mapping rule, so that the problem of related data migration caused by the change of the number of the computing power resource management nodes can be avoided, and the complexity of subsequent service maintenance is reduced.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure. It is to be understood that the drawings in the following description are merely exemplary of the disclosure, and that other drawings may be derived from those drawings by one of ordinary skill in the art without the exercise of inventive faculty.
FIG. 1 is a flow diagram illustrating a method for resource allocation in a computational power network in an embodiment of the disclosure;
fig. 2 illustrates a schematic flow chart of mapping, in the embodiment of the present disclosure, an identity of a tenant onto a pre-constructed hash ring based on a preset mapping rule to obtain a first mapping value of the identity on the hash ring;
FIG. 3 is a schematic flow chart illustrating a process of selecting a target computing power resource management node from a plurality of computing power resource management nodes according to a numerical relationship between a first mapping value and a plurality of second mapping values in the embodiment of the present disclosure;
fig. 4 is a schematic diagram illustrating a distribution of the first mapping value and the plurality of second mapping values on the hash ring according to an embodiment of the present disclosure;
FIG. 5 is a schematic flow diagram illustrating a process in which a target computing power resource node allocates a target computing power resource to a tenant and establishes a connection channel between the tenant and the allocated target computing power resource in the embodiment of the present disclosure;
FIG. 6 is a schematic overall flowchart illustrating a target computing power resource management node and a tenant mapping management module cooperating with each other to allocate a target computing power resource to a tenant in the embodiment of the present disclosure;
FIG. 7 is an overall architecture diagram illustrating a resource allocation method in a computational power network in an embodiment of the present disclosure;
FIG. 8 is a schematic diagram illustrating a resource allocation apparatus in a computational power network according to an exemplary embodiment of the disclosure;
FIG. 9 is a schematic diagram illustrating an example of a resource allocation apparatus in another computational power network in an embodiment of the present disclosure;
fig. 10 shows a schematic structural diagram of an electronic device in an exemplary embodiment of the present disclosure.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the disclosure. One skilled in the relevant art will recognize, however, that the subject matter of the present disclosure can be practiced without one or more of the specific details, or with other methods, components, devices, steps, and the like. In other instances, well-known technical solutions have not been shown or described in detail to avoid obscuring aspects of the present disclosure.
The terms "a," "an," "the," and "said" are used in this specification to denote the presence of one or more elements/components/parts/etc.; the terms "comprising" and "having" are intended to be inclusive and mean that there may be additional elements/components/etc. other than the listed elements/components/etc.; the terms "first" and "second", etc. are used merely as labels, and are not limiting on the number of their objects.
Furthermore, the drawings are merely schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus their repetitive description will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities.
In the embodiment of the disclosure, firstly, a resource allocation method in a computational power network is provided, which overcomes the defect of high hardware cost in the related art at least to some extent.
The method fully considers the problems that when the existing computing power network provides computing power resource service, the protection on tenant information and leased resource information is insufficient, and the safety risk exists in the process of building a computing power network trading platform in the future, can be realized by adding related software function modules on the existing computing power network control layer and the computing power resource management node, does not influence the operation of the existing computing power network, has good flexibility, and plays a role in the construction of the computing power network in the follow-up process.
Fig. 1 illustrates a flowchart of a resource allocation method in a computational power network in an embodiment of the present disclosure, where an execution subject of the resource allocation method in the computational power network may be a management server (hereinafter referred to as a tenant mapping module) of a computational power resource management node.
Referring to fig. 1, a resource allocation method in a computational power network according to one embodiment of the present disclosure includes the steps of:
step S110, in response to receiving a resource obtaining request of a tenant, mapping the identity of the tenant to a pre-constructed hash ring based on a preset mapping rule to obtain a first mapping value of the identity on the hash ring; the resource acquisition request carries an identity of a tenant;
step S120, mapping a plurality of IP addresses of a plurality of computing resource management nodes to a Hash ring based on a preset mapping rule to obtain a second mapping value of each IP address on the Hash ring;
step S130, selecting a target calculation force resource management node from the calculation force resource management nodes according to the numerical relation between the first mapping value and the second mapping values, and distributing calculation force resources for the tenant through the target calculation force resource management node.
In the technical solution provided in the embodiment shown in fig. 1, in response to receiving a resource acquisition request of a tenant, the present disclosure maps an identity of the tenant onto a pre-constructed hash ring based on a preset mapping rule, so as to obtain a first mapping value of the identity on the hash ring; the resource acquisition request carries an identity of a tenant; the method comprises the steps that a plurality of IP addresses of a plurality of computing power resource management nodes are mapped to a hash ring based on a preset mapping rule to obtain second mapping values of the IP addresses on the hash ring, and then target computing power resource management nodes are selected from the computing power resource management nodes according to numerical relations between the first mapping values and the second mapping values to distribute computing power resources for tenants through the target computing power resource management nodes, so that on one hand, the method provides a new idea of realizing data isolation of multiple tenants without hardware equipment, thereby solving the technical problem of higher hardware cost caused by the fact that multiple tenants are isolated by deploying a domain isolator in the related technology, and reducing hardware deployment cost; on the other hand, based on the scheme in the disclosure, even if the number of the computing power resource management nodes is increased subsequently due to the service requirement, the tenant can be conveniently mapped to the newly added computing power resource management nodes based on the mapping rule, so that the problem of related data migration caused by the change of the number of the computing power resource management nodes can be avoided, and the complexity of subsequent service maintenance is reduced.
The following describes the specific implementation of each step in fig. 1 in detail:
the computing power network is a novel information infrastructure for allocating and flexibly scheduling computing resources, storage resources and network resources among the cloud, the network and the edge according to business requirements.
The computing power network can comprise a plurality of computing power resource management nodes, different computing power resource management nodes manage different computing power resource pools (the computing power resource pools comprise a plurality of computing power resources), and the computing power resource management nodes can allocate computing power resources for tenants from the computing power resource pools.
The computing resources may be various servers, virtual machines, and the like for executing computing tasks, and may be set by themselves according to actual conditions, which is not limited in this disclosure.
The tenants in the cloud management platform are a logic concept, and after each person or one enterprise registers an account in the public cloud platform, the platform considers that each person is a tenant, and then the tenant is used as a basic unit to allocate computing resources for the person. The Tenant (Tenant) refers to a Tenant using a system or an algorithm resource, and includes all Data recognizable in the system as a designated Tenant, such as an account and statistical information (Accounting Data) created in the system, various Data set in the system, a customized application environment set by the Tenant, and the like, which all belong to the scope of the Tenant.
According to the power calculation network control layer, the tenant mapping management module is added in the power calculation network control layer, and the mapping relation between the tenant and the power calculation management node is managed through the tenant mapping management module, so that the problem that hardware cost is high due to the fact that data isolation of multiple tenants can be achieved only by adding hardware isolation equipment in the related technology can be solved.
Specifically, the tenant mapping management module in the present disclosure may allocate a storage resource and a target computing power resource management node for the tenant, and a specific process of allocating the target computing power resource management node for the tenant by the tenant mapping management module may refer to the following steps S110 to S130:
it should be noted that, when the tenant completes registration on the power trading platform for the first time, the power trading platform may generate an identity for the tenant, and for example, the identity may be a 32-bit identity, and the specific number of bits may be set according to an actual situation, which is not particularly limited in the present disclosure.
After the tenant obtains the identity, a resource acquisition request for applying for computing resources may be sent to the tenant mapping management module.
In step S110, in response to receiving a resource obtaining request of a tenant, an identity of the tenant is mapped to a pre-constructed hash ring based on a preset mapping rule, so as to obtain a first mapping value of the identity on the hash ring.
In this step, after receiving a resource acquisition request (the resource acquisition request carries an identity of a tenant) sent by the tenant, the identity of the tenant may be mapped onto a pre-constructed hash ring to obtain a first mapping value of the identity on the hash ring.
Wherein the hash ring comprises 2 in total 32 A mapped value, 2 above 32 Each mapping value is 0 to 2 in sequence 32 -1。
For example, referring to fig. 2, fig. 2 shows a schematic flowchart of mapping the identity of the tenant onto the pre-constructed hash ring based on the preset mapping rule to obtain the first mapping value of the identity on the hash ring in the embodiment of the present disclosure, which includes steps S201 to S202:
in step S201, a hash operation is performed on the identity to obtain a first hash value.
In this step, hash operation may be performed on the identity identifier to obtain a first hash value hash (ID).
In step S202, a remainder operation is performed on the preset target value by using the first hash value, so as to obtain a first mapping value of the identity identifier on the hash ring.
In this step, after obtaining the first hash value, the preset target value (2) may be set by using the first hash value 32 ) Performing a residue operation to obtain a hash (ID)% 2 of a first mapping value of the identity on the hash ring 32 。
In step S120, a plurality of IP addresses of a plurality of computing resource management nodes are mapped onto a hash ring based on a preset mapping rule, so as to obtain a second mapping value of each IP address on the hash ring.
In this step, the total number of the plurality of computation resource management nodes and the IP address of each computation resource management node may be obtained, and then the plurality of IP addresses of the plurality of computation resource management nodes may be mapped onto the hash ring to obtain a second mapping value of each IP address on the hash ring, for example, referring to the relevant explanation of fig. 2, hash operation may be performed on each IP address to obtain a second hash value, and then the second hash value is used to obtain a preset target value (2) 32 ) And performing remainder operation to obtain a second mapping value of each IP address on the hash ring.
In step S130, a target computing power resource management node is selected from the plurality of computing power resource management nodes according to the numerical relationship between the first mapping value and the plurality of second mapping values, so as to allocate the computing power resource for the tenant through the target computing power resource management node.
In this step, after the identity of the user and the plurality of computing power resource management nodes are both mapped onto the hash ring, a target computing power resource management node may be selected from the plurality of computing power resource management nodes according to a numerical relationship between the first mapping value and the plurality of second mapping values, and then computing power resources are allocated to the tenant through the target computing power resource management node.
Exemplarily, referring to fig. 3, fig. 3 shows a schematic flowchart of selecting a target computing power resource management node from a plurality of computing power resource management nodes according to a numerical relationship between a first mapping value and a plurality of second mapping values in the embodiment of the present disclosure, which includes steps S301 to S305:
in step S301, a target mapping value having the smallest difference from the first mapping value is selected from the plurality of second mapping values.
In this step, taking an example that the first mapping value corresponding to the identifier is 4, the computational power network includes 3 computational power resource management nodes in total, and the second mappings corresponding to the 3 computational power resource management nodes are respectively 1, 8, and 16, reference may be made to fig. 4, where fig. 4 shows a schematic diagram of a distribution situation of the first mapping value and the multiple second mapping values on a hash ring in the embodiment of the present disclosure, so that the second mapping value with the smallest difference from the first mapping value 4 may be determined to be 1, and thus, 1 may be determined to be the target mapping value.
Optionally, the difference between the target mapping value and the first mapping value may be the smallest, and the second mapping value that is greater than the first mapping value may be determined as the target mapping value, at this time, because 1 is smaller than the first mapping value 4, 8 may be determined as the target mapping value, and the specific rule may be set according to the actual situation, which is not limited by the present disclosure.
In step S302, the computing power resource management node corresponding to the target mapping value is determined as a candidate target computing power resource management node.
In this step, after the target mapping value is determined, the computational resource node corresponding to the target mapping value may be determined as a candidate target computational resource node.
In step S303, it is determined whether the free resource holding amount of the candidate target computing resource management node is greater than the resource demand amount of the tenant.
In this step, it may be determined whether the idle resource holding amount of the candidate target computing resource management node is greater than the resource demand amount of the tenant.
In step S304, in response to that the free resource holding amount of the candidate target computing resource management node is greater than the resource demand amount of the tenant, the candidate target computing resource management node is determined as the target computing resource management node.
In this step, if the idle resource holding amount of the candidate target computing power resource management node is greater than the resource demand amount of the tenant, the candidate target computing power resource management node is determined as the target computing power resource management node.
In step S305, otherwise, the process jumps to the next mapping value of the target mapping value, and determines whether to determine the next computing resource management node as the target computing resource management node according to the idle resource holding amount of the next computing resource management node corresponding to the next mapping value.
In this step, if the free resource holding amount of the candidate target computing resource management node is not greater than the resource demand amount of the tenant, the next mapping value having the smallest difference from the target mapping value may be skipped to, for example: the second mapping value 16 in fig. 4, further, it may be determined whether the free resource holding amount of the computing resource management node corresponding to the second mapping value 16 is greater than the resource demand amount of the tenant, if so, the computing resource management node corresponding to the second mapping value 16 may be directly determined as the target computing resource management node, otherwise, another computing resource management node is obtained again until the free resource holding amount of the computing resource management node is greater than the resource demand amount of the tenant, and the target computing resource node is determined.
After the target computing power resource node is determined, the target computing power resource node may allocate a target computing power resource to a tenant from a computing power resource pool managed by the target computing power resource node, and establish a connection channel between the tenant and the allocated target computing power resource, specifically, referring to fig. 5, fig. 5 shows a schematic flow diagram of allocating the target computing power resource to the tenant and establishing a connection channel between the tenant and the allocated target computing power resource in the embodiment of the present disclosure, including step S501-step S505:
in step S501, a target computing power resource is allocated to the tenant, and an IP address of the target computing power resource is encrypted.
In this step, the target computing power resource management node may allocate target computing power resources to the tenant, and the number of the target computing power resources may be determined according to the resource demand of the tenant, which is not particularly limited in this disclosure.
After the target computing resource is allocated, the target computing resource management node may encrypt an IP address of the target computing resource to obtain an encrypted IP address: SN = encrypt (key, R _ Label), where key represents the encryption key used, and R _ Label is the IP address set of the target computing resource node, and illustratively, R _ Label = { IPAdd _ p, IPAdd _ v, \8230 }, where IPAdd _ p and IPAdd _ v represent the corresponding IP addresses of different target computing resources.
It should be noted that the encryption process may adopt a symmetric encryption algorithm, an asymmetric encryption algorithm, and the like, and may be set by the user according to the actual situation, which is not limited in this disclosure.
In step S502, the identity of the tenant and the encrypted IP address are returned to the tenant, and a correspondence between the identity of the tenant and the encrypted IP address is stored.
In this step, the target computing resource management node may return the identity of the tenant and the encrypted IP address to the tenant as a tenant Label, where, for example, the tenant Label T _ Label returned to the tenant may include: < ID, SN >. Illustratively, the tenant label described above may also be stored for later use.
In step S503, in response to receiving the resource access request of the tenant, the encrypted IP address is obtained according to the identity and the corresponding relationship of the tenant.
In this step, after returning the tenant label to the tenant, the tenant may initiate a resource access request to the target power resource management node, and then the target power resource management node may query the tenant label according to the identity of the tenant carried in the resource access request to obtain the encrypted IP address.
In step S504, the encrypted IP address is decrypted to obtain an IP address corresponding to the target computing resource.
In this step, after obtaining the encrypted IP address (i.e., the SN), the target computing force resource management node may decrypt the encrypted IP address to obtain an IP address (i.e., the R _ Label) corresponding to the target computing force resource.
In step S505, a connection channel between the IP address of the tenant and the IP address of the target computing power resource is established.
In this step, the target computing resource may establish a secure tunnel between the IP address of the tenant and the IP address of the target computing resource based on a secure tunnel protocol (e.g., IPSec), so as to facilitate a secure data transmission process.
Referring to fig. 6, fig. 6 is a schematic overall flowchart illustrating that the target computing power resource management node and the tenant mapping management module cooperate with each other to allocate a target computing power resource to a tenant in the embodiment of the present disclosure:
the target computing resource management node may include a tenant resource label generation module, a label encryption module, a label analysis authentication module, a tenant label generation module, and a routing module, specifically:
a tenant mapping management module: and acquiring a first mapping value corresponding to an Identity (ID) of the tenant and a second mapping value corresponding to the IP address of each computing power resource management node, and allocating a target computing power resource management node for the tenant so that the target computing power resource management node allocates a target computing power resource for the tenant.
The following are the steps performed by the various modules of the target computing resource:
a tenant resource label generation module: allocating target computing resources (including physical machine resources and virtual machine resources) for the tenant, and acquiring an IP address of the target computing resources, such as: r _ Label = { IPAdd _ p, IPAdd _ v, \8230 };
a tag encryption module: generating a key pair through an encryption algorithm, supporting methods such as symmetric encryption and asymmetric encryption, encrypting the IP address of the target computing power resource to obtain SN = encrypt (key, R _ Label);
a tenant label generation module: and generating a Label T _ Label = < ID, SN > for the tenant according to the ID obtained from the tenant mapping management module and the SN obtained from the Label encryption module, and feeding back the Label T _ Label = < ID, SN > to the tenant.
A label analysis and authentication module: decrypting the encrypted IP address to obtain the IP address of the target computing resource, wherein R _ Label = Decrypt (key, SN);
a routing module: the secure channel between the tenant and the target computing resource is established, which may be based on various secure tunnel routing protocols, such as IPSec, etc.
Referring to fig. 7, fig. 7 shows an overall architecture diagram of a resource allocation method in a computational power network in an embodiment of the present disclosure, where a computational power network control layer mainly includes a computational power network management module, a computational power resource scheduling module, a tenant mapping management module, and a routing scheduling module, and a computational power resource management node is used to manage a computational power resource pool (the computational power resource pool includes multiple computational power resources), and mainly includes a computational power resource sensing module, a routing module, a tenant label generation module, a tenant resource label generation module, a label encryption module, and a label analysis authentication module, specifically:
for the computational power network control layer:
the calculation network management module: the computing resource management nodes are used for managing and maintaining the computing resource management nodes;
the computing resource scheduling module is used for scheduling each computing resource management node;
a tenant mapping management module: the system is used for storing various mapping rules and protecting tenant information by managing an isolation mapping relation between a tenant and a calculation resource management node;
and the routing scheduling module is used for scheduling each computational resource management node.
For the computing power resource management node:
the calculation force resource perception module: the system is used for monitoring the running state of each computational resource in the computational resource pool in real time;
a tenant label generation module: the tenant Label is used for generating a tenant Label, wherein the Label comprises an ID of the tenant and a serial number generated after encryption of an IP address of a target computing resource distributed for the tenant, and T _ Label = < ID, SN >;
the tenant resource label generation module: the system comprises a server and a server, wherein the server is used for generating a corresponding label according to an IP address of a target computing resource rented by a tenant; the label is a set of IP addresses of various servers, virtual machines, etc., as follows: r _ Label = { IPAdd _ p, IPAdd _ v, \8230 };
a tag encryption module: in order to ensure the security of tenant resources, an IP address of a target computing resource allocated to a tenant needs to be encrypted to obtain an encrypted IP address: SN = Encry (R _ Label);
a label analysis and authentication module: searching a corresponding SN number through the identity ID of the tenant, and obtaining the IP address of the target computing resource after analysis; the analysis process is as follows: r _ Label = Decrypt (SN);
a routing module: and establishing a secure channel between the target computing resource and the tenant. Based on the framework in the disclosure, a tenant mapping management module is added in the computation network control layer, a tenant label generation module, a tenant resource label generation module, a label encryption module and label analysis authentication are added in the computation resource management node, and the computation resource management node can encrypt, analyze, index and the like the address of the computation resource leased by the tenant so as to manage and protect tenant information.
The present disclosure also provides a resource allocation apparatus in a computational power network, and fig. 8 shows a schematic structural diagram of a resource allocation apparatus in a computational power network in an exemplary embodiment of the present disclosure; as shown in fig. 8, a resource allocation apparatus 800 in a computational power network may include a first mapping module 810, a second mapping module 820, and a management node selection module 830. Wherein:
the first mapping module 810 is configured to, in response to receiving a resource acquisition request of a tenant, map an identity of the tenant onto a pre-constructed hash ring based on a preset mapping rule, to obtain a first mapping value of the identity on the hash ring;
a second mapping module 820, configured to map, based on the preset mapping rule, multiple IP addresses of the multiple computing resource management nodes onto the hash ring, so as to obtain a second mapping value of each IP address on the hash ring;
a management node selecting module 830, configured to select a target power resource management node from the power resource management nodes according to a numerical relationship between the first mapping value and the plurality of second mapping values, so as to allocate power resources to the tenant through the target power resource management node.
In an exemplary embodiment of the disclosure, the first mapping module 810 is configured to:
performing hash operation on the identity to obtain a first hash value; and performing remainder operation on a preset target value by using the first hash value to obtain a first mapping value of the identity label on the hash ring.
In an exemplary embodiment of the present disclosure, the second mapping module 820 is configured to:
performing hash operation on each IP address to obtain a second hash value; and performing remainder operation on the preset target value by using the second hash value to obtain a second mapping value of each IP address on the hash ring.
In an exemplary embodiment of the disclosure, the management node selection module 830 is configured to:
selecting a target mapping value with the smallest difference value with the first mapping value from the plurality of second mapping values; determining the computing power resource management node corresponding to the target mapping value as a candidate target computing power resource management node; judging whether the idle resource holding amount of the candidate target computing resource management node is larger than the resource demand amount of the tenant; in response to the idle resource holding amount of the candidate target computing power resource management node being larger than the resource demand amount of the tenant, determining the candidate target computing power resource management node as the target computing power resource management node; otherwise, jumping to the next mapping value of the target mapping value, and determining whether the next computational power resource management node is determined as the target computational power resource management node according to the idle resource holding amount of the next computational power resource management node corresponding to the next mapping value; the next mapping value is a second mapping value having a smallest difference from the target mapping value.
The present disclosure also provides a resource allocation apparatus in a computational power network, and fig. 9 shows a schematic structural diagram of a resource allocation apparatus in another computational power network in an exemplary embodiment of the present disclosure; as shown in fig. 9, the resource allocation apparatus 900 in the computational power network may include a computational power resource allocation module 910, an encrypted address sending module 920, an encrypted address obtaining module 930, a decryption module 940, and a channel establishing module 950. Wherein:
the calculation resource allocation module is used for allocating target calculation resources for tenants and encrypting the IP addresses of the target calculation resources;
the encrypted address sending module is used for returning the encrypted IP address to the tenant and storing the corresponding relation between the identity of the tenant and the encrypted IP address;
the encrypted address acquisition module is used for responding to a received resource access request of the tenant and acquiring the encrypted IP address according to the identity of the tenant and the pre-stored corresponding relation; the resource access request carries the identity of the tenant;
the decryption module is used for decrypting the encrypted IP address to obtain the IP address corresponding to the computing resource;
and the channel establishing module is used for establishing a connection channel between the IP address of the tenant and the IP address of the target computing resource.
In an exemplary embodiment of the present disclosure, the channel establishing module 950 is configured to:
establishing a secure tunnel between the tenant's IP address and the target computing resource's IP address based on a secure tunnel protocol.
The details of each module in the resource allocation device in the computational power network have been described in detail in the resource allocation method in the corresponding computational power network, and therefore are not described herein again.
It should be noted that although in the above detailed description several modules or units of the device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functions of two or more modules or units described above may be embodied in one module or unit, according to embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.
Moreover, although the steps of the methods of the present disclosure are depicted in the drawings in a particular order, this does not require or imply that the steps must be performed in this particular order, or that all of the depicted steps must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken into multiple step executions, etc.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.
The present application also provides a computer-readable storage medium, which may be contained in the electronic device described in the above embodiments; or may exist separately without being assembled into the electronic device.
A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable storage medium may transmit, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable storage medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The computer readable storage medium carries one or more programs which, when executed by an electronic device, cause the electronic device to implement the method as described in the above embodiments.
In addition, the embodiment of the disclosure also provides an electronic device capable of implementing the method.
As will be appreciated by one skilled in the art, aspects of the present disclosure may be embodied as a system, method or program product. Accordingly, various aspects of the present disclosure may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.) or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system.
An electronic device 1000 according to this embodiment of the disclosure is described below with reference to fig. 10. The electronic device 1000 shown in fig. 10 is only an example and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 10, the electronic device 1000 is embodied in the form of a general purpose computing device. The components of the electronic device 1000 may include, but are not limited to: the at least one processing unit 1010, the at least one memory unit 1020, a bus 1030 connecting different system components (including the memory unit 1020 and the processing unit 1010), and a display unit 1040.
Wherein the storage unit stores program code that is executable by the processing unit 1010 to cause the processing unit 1010 to perform steps according to various exemplary embodiments of the present disclosure described in the above section "exemplary methods" of the present specification. For example, the processing unit 1010 may perform the following as shown in fig. 1: step S110, in response to receiving a resource acquisition request of a tenant, mapping an identity of the tenant onto a pre-constructed hash ring based on a preset mapping rule to obtain a first mapping value of the identity on the hash ring; the resource acquisition request carries the identity of the tenant; the hash ring comprises a plurality of mapping values; step S120, mapping a plurality of IP addresses of the plurality of computing resource management nodes to the hash ring based on the preset mapping rule to obtain a second mapping value of each IP address on the hash ring; step S130, according to a numerical relationship between the first mapping value and the plurality of second mapping values, selecting a target computing resource management node from the plurality of computing resource management nodes, so as to allocate computing resources to the tenant through the target computing resource management node.
The storage unit 1020 may include readable media in the form of volatile memory units, such as a random access memory unit (RAM) 10201 and/or a cache memory unit 10202, and may further include a read-only memory unit (ROM) 10203.
The memory unit 1020 may also include a program/utility 10204 having a set (at least one) of program modules 10205, such program modules 10205 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.
The electronic device 1000 may also communicate with one or more external devices 1100 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device 1000, and/or with any device (e.g., router, modem, etc.) that enables the electronic device 1000 to communicate with one or more other computing devices. Such communication may occur through input/output (I/O) interfaces 1050. Also, the electronic device 1000 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network such as the Internet) via the network adapter 1060. As shown, the network adapter 1060 communicates with the other modules of the electronic device 1000 over the bus 1030. It should be appreciated that although not shown, other hardware and/or software modules may be used in conjunction with the electronic device 1000, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, to name a few.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
Claims (10)
1. A resource allocation method in a computing power network is characterized in that the computing power network comprises a plurality of computing power resource management nodes, and different computing power resource management nodes correspond to different IP addresses, and the method comprises the following steps:
in response to receiving a resource acquisition request of a tenant, mapping an identity of the tenant to a pre-constructed hash ring based on a preset mapping rule to obtain a first mapping value of the identity on the hash ring; the resource acquisition request carries the identity of the tenant; the hash ring comprises a plurality of mapping values;
mapping a plurality of IP addresses of the plurality of computing resource management nodes to the Hash ring based on the preset mapping rule to obtain a second mapping value of each IP address on the Hash ring;
and selecting a target computing power resource management node from the plurality of computing power resource management nodes according to the numerical relation between the first mapping value and the plurality of second mapping values, so as to allocate computing power resources to the tenant through the target computing power resource management node.
2. The method according to claim 1, wherein the mapping the identity of the tenant onto a pre-constructed hash ring based on a preset mapping rule to obtain a first mapping value of the identity on the hash ring comprises:
performing hash operation on the identity to obtain a first hash value;
and performing remainder operation on a preset target value by using the first hash value to obtain a first mapping value of the identity label on the hash ring.
3. The method according to claim 1, wherein the mapping the IP addresses of the computing resource management nodes onto the hash ring based on the preset mapping rule comprises:
performing hash operation on each IP address to obtain a second hash value;
and performing remainder operation on the preset target value by using the second hash value to obtain a second mapping value of each IP address on the hash ring.
4. The method according to any one of claims 1 to 3, wherein selecting a target computing power resource management node from the plurality of computing power resource management nodes according to a numerical relationship between the first mapping value and a plurality of the second mapping values comprises:
selecting a target mapping value with the smallest difference value with the first mapping value from the plurality of second mapping values;
determining the computing power resource management node corresponding to the target mapping value as a candidate target computing power resource management node;
judging whether the idle resource holding amount of the candidate target computing resource management node is larger than the resource demand amount of the tenant;
in response to the idle resource holding amount of the candidate target computing resource management node being larger than the resource demand amount of the tenant, determining the candidate target computing resource management node as the target computing resource management node;
otherwise, jumping to the next mapping value of the target mapping value, and determining whether the next computational resource management node is determined as the target computational resource management node according to the idle resource holding amount of the next computational resource management node corresponding to the next mapping value; the next mapping value is a second mapping value having a smallest difference from the target mapping value.
5. A resource allocation method in a computing power network is applied to a target computing power resource management node, and the method comprises the following steps:
distributing target calculation resources for tenants, and encrypting IP addresses of the target calculation resources;
returning the identity of the tenant and the encrypted IP address to the tenant, and storing the corresponding relation between the identity of the tenant and the encrypted IP address;
responding to a received resource access request of the tenant, and acquiring the encrypted IP address according to the identity of the tenant and the corresponding relation; the resource access request carries the identity of the tenant;
decrypting the encrypted IP address to obtain an IP address corresponding to the target computing power resource;
and establishing a connection channel between the IP address of the tenant and the IP address of the target computing resource.
6. The method of claim 5, wherein establishing a connection channel between the tenant's IP address and the target computing resource's IP address comprises:
establishing a secure tunnel between the tenant's IP address and the target computing resource's IP address based on a secure tunnel protocol.
7. A resource allocation apparatus in a computational power network, wherein the computational power network includes a plurality of computational power resource management nodes, and different computational power resource management nodes correspond to different IP addresses, the apparatus comprising:
the first mapping module is used for mapping the identity of a tenant to a pre-constructed hash ring based on a preset mapping rule in response to receiving a resource acquisition request of the tenant to obtain a first mapping value of the identity on the hash ring;
a second mapping module, configured to map, based on the preset mapping rule, multiple IP addresses of the multiple computational resource management nodes onto the hash ring, so as to obtain a second mapping value of each IP address on the hash ring;
and the management node selection module is used for selecting a target power resource management node from the plurality of power resource management nodes according to the numerical relationship between the first mapping value and the plurality of second mapping values so as to allocate power resources to the tenant through the target power resource management node.
8. An apparatus for resource allocation in a computational power network, the apparatus comprising:
the calculation resource allocation module is used for allocating target calculation resources for tenants and encrypting the IP addresses of the target calculation resources;
the encrypted address sending module is used for returning the encrypted IP address to the tenant and storing the corresponding relation between the identity of the tenant and the encrypted IP address;
the encrypted address acquisition module is used for responding to a received resource access request of the tenant and acquiring the encrypted IP address according to the identity of the tenant and the pre-stored corresponding relation; the resource access request carries the identity of the tenant;
the decryption module is used for decrypting the encrypted IP address to obtain the IP address corresponding to the computing resource;
and the channel establishing module is used for establishing a connection channel between the IP address of the tenant and the IP address of the target computing resource.
9. A computer storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements a method of resource allocation in a computational power network according to any one of claims 1 to 7.
10. An electronic device, comprising:
a processor; and
a memory for storing executable instructions of the processor;
wherein the processor is configured to perform the method of resource allocation in a computational power network of any one of claims 1-7 via execution of the executable instructions.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210952781.9A CN115314558B (en) | 2022-08-09 | 2022-08-09 | Resource allocation method and device in computing power network, storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210952781.9A CN115314558B (en) | 2022-08-09 | 2022-08-09 | Resource allocation method and device in computing power network, storage medium and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115314558A true CN115314558A (en) | 2022-11-08 |
| CN115314558B CN115314558B (en) | 2024-08-27 |
Family
ID=83861083
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210952781.9A Active CN115314558B (en) | 2022-08-09 | 2022-08-09 | Resource allocation method and device in computing power network, storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115314558B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115955505A (en) * | 2022-12-23 | 2023-04-11 | 中国联合网络通信集团有限公司 | SDN control system, control method and platform based on computing power network |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3374881A1 (en) * | 2015-12-16 | 2018-09-19 | Hewlett Packard Enterprise Development LP | Dynamic allocation of hash table resources |
| CN110071978A (en) * | 2019-04-28 | 2019-07-30 | 新华三信息安全技术有限公司 | A kind of method and device of cluster management |
| CN112988369A (en) * | 2019-12-12 | 2021-06-18 | 蜜蜂计算(香港)股份有限公司 | Computer resource allocation method and system based on computing element |
| CN114205139A (en) * | 2021-12-09 | 2022-03-18 | 中国电信股份有限公司 | Computing resource management method, node, system and storage medium |
| CN114666186A (en) * | 2022-03-23 | 2022-06-24 | 杭州迪普科技股份有限公司 | SSL VPN resource access method and device |
-
2022
- 2022-08-09 CN CN202210952781.9A patent/CN115314558B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3374881A1 (en) * | 2015-12-16 | 2018-09-19 | Hewlett Packard Enterprise Development LP | Dynamic allocation of hash table resources |
| CN110071978A (en) * | 2019-04-28 | 2019-07-30 | 新华三信息安全技术有限公司 | A kind of method and device of cluster management |
| CN112988369A (en) * | 2019-12-12 | 2021-06-18 | 蜜蜂计算(香港)股份有限公司 | Computer resource allocation method and system based on computing element |
| CN114205139A (en) * | 2021-12-09 | 2022-03-18 | 中国电信股份有限公司 | Computing resource management method, node, system and storage medium |
| CN114666186A (en) * | 2022-03-23 | 2022-06-24 | 杭州迪普科技股份有限公司 | SSL VPN resource access method and device |
Non-Patent Citations (2)
| Title |
|---|
| JIACONG LI 等: "A Load Balancing Approach for Distributed SDN Architecture Based on Sharing Data Store", 2020 21ST ASIA-PACIFIC NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM (APNOMS), 23 October 2020 (2020-10-23) * |
| 蔡岳平 等: "面向算力匹配调度的泛在确定性网络研究", 信息通信技术, no. 04, 15 August 2020 (2020-08-15) * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115955505A (en) * | 2022-12-23 | 2023-04-11 | 中国联合网络通信集团有限公司 | SDN control system, control method and platform based on computing power network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115314558B (en) | 2024-08-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11956207B2 (en) | Multi-tenant aware dynamic host configuration protocol (DHCP) mechanism for cloud networking | |
| US11469964B2 (en) | Extension resource groups of provider network services | |
| CN103368768B (en) | The method of the auto zoom network coverage, device and equipment in mixed cloud environment | |
| CN108062248B (en) | Resource management method, system, equipment and storage medium of heterogeneous virtualization platform | |
| US9317316B2 (en) | Host virtual machine assisting booting of a fully-encrypted user virtual machine on a cloud environment | |
| JP5809696B2 (en) | Distributed virtual network gateway | |
| CN110088732A (en) | A kind of data package processing method, host and system | |
| US11563799B2 (en) | Peripheral device enabling virtualized computing service extensions | |
| US10593009B1 (en) | Session coordination for auto-scaled virtualized graphics processing | |
| US10042676B1 (en) | Capacity pool health index | |
| US10218597B1 (en) | Provider network address range-based models | |
| US9686237B2 (en) | Secure communication channel using a blade server | |
| CN105530266B (en) | A kind of license passport management method, apparatus and system | |
| US11765142B1 (en) | Distribution of private session key to network communication device for secured communications | |
| US10673827B1 (en) | Secure access to user data | |
| CN108540408B (en) | Openstack-based distributed virtual switch management method and system | |
| CN110691042A (en) | Resource allocation method and device | |
| CN115314558B (en) | Resource allocation method and device in computing power network, storage medium and electronic equipment | |
| CN105933270A (en) | Cloud encryptor processing method and apparatus | |
| CN106911721A (en) | Data processing platform for business registration based on cloud computing | |
| CN103885725A (en) | Virtual machine access control system and method based on cloud computing environment | |
| CN112508693B (en) | Resource distribution channel distribution method and device based on user tags and electronic equipment | |
| WO2023005704A1 (en) | Sensitive data encryption | |
| JP7212158B2 (en) | Provider network service extension | |
| CN114785612A (en) | Cloud platform management method, device, equipment and medium |
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 |