WO2020011012A1

WO2020011012A1 - Computing resource searching method and system for p2p network

Info

Publication number: WO2020011012A1
Application number: PCT/CN2019/092682
Authority: WO
Inventors: 杨舟; 李升林; 孙立林
Original assignee: 云图有限公司
Priority date: 2018-07-10
Filing date: 2019-06-25
Publication date: 2020-01-16
Also published as: CN109062687A

Abstract

Provided are a computing resource searching method and system for a P2P network. The computing resource searching method comprises: receiving a computing resource search request, wherein the computing resource search request includes a required computing power; and according to the required computing power, searching for a corresponding preset computing power in a target P2P network based on an RFC7374 protocol, wherein the preset computing power is obtained by a computing node performing publishing in the target P2P network based on the RFC7374 protocol. The present invention can effectively reduce the steps of searching for a computing resource and improve efficiency of searching for the computing resource.

Description

Computing resource search method and system for P2P network

Technical field

The present application relates to the field of computer technology, and in particular, to a method and system for finding computing resources for a P2P network.

Background technique

With the development of artificial intelligence, the demand for computing power of P2P networks is increasing. Centralized computing power providers charge high fees, and some idle computing power resources are too scattered to be used and are being wasted. Therefore, searching for computing resources (ie, computing power) in P2P networks has become one of the important research topics related to current p2p networks.

In the prior art, the way to find computing resources in a P2P network is a computing platform using computing power or service discovery based on Chord. The former usually requires the application of a centralized service platform, such as BONIC, which requires the same platform. Sign up to use hash power. The latter is based on Chord to find the computing power service, forming a ring network through full nodes, and each node must maintain the predecessor node and the successor node at the same time to prevent the entire chain from breaking so that computing resources can be found.

However, in the prior art, a computing platform using a computing power will cause a waste of computing power, and a method based on Chord to find a computing power service will cause each node to pay a large network overhead in order to maintain a ring network. In the case of a search, it is necessary to perform a sequential query in the entire ring network, and may even need to be performed N times (N is equal to the number of nodes in the ring network).

Summary of the invention

Aiming at the problems in the prior art, the present application provides a method and system for searching for computing resources for a P2P network, which can effectively reduce the steps of searching for computing resources and improve the searching efficiency of computing resources.

To solve the above technical problems, this application provides the following technical solutions:

In a first aspect, the present application provides a computing resource search method for a P2P network. The computing resource search method includes:

Receiving a computing resource search request, wherein the computing resource search request includes a required computing power;

According to the required computing power, a corresponding preset computing power is found in the target P2P network based on the RFC7374 protocol, wherein the preset computing power is obtained by a computing node based on the RFC7374 protocol in the target P2P network.

In an embodiment, the computing resource search method further includes:

Register a computing node for providing computing resources in the target P2P network;

Based on the RFC7374 protocol, a computing resource corresponding to the computing node is released in a target P2P network.

In one embodiment, the registering a computing node for providing a computing resource in a target P2P network includes:

Determining whether a joining position of a computing node joining the target P2P network is behind a NAT device;

If yes, obtaining a relay address corresponding to the computing node, and registering the relay address in the target P2P network;

Otherwise, register the IP address of the computing node in the target P2P network.

In an embodiment, the obtaining a relay address corresponding to the computing node includes:

Find a TURN service corresponding to the computing node via a service discovery module in the target P2P network;

And, in the found TURN service, the computing node correspondingly obtains a relay address.

In an embodiment, the publishing the computing resources corresponding to the computing node in a target P2P network based on the RFC7374 protocol includes:

Selecting an initial level in the multi-tree of the RFC7374 protocol, wherein the initial level is any level other than the first level of the multi-tree;

Determining a spatial position of the preset computing power of the computing node at the initial level, and generating a first resource ID of the computing node;

Publishing the corresponding first resource ID and preset computing power to the corresponding spatial location, and determining whether the preset computing power satisfies the first preset condition, and if so, storing the preset computing power in all locations Described in the initial hierarchy.

In an embodiment, the computing resource search method further includes:

If the preset computing power does not satisfy the first preset condition, a computing power storage request is sent to a level other than the initial level according to the first preset rule.

In an embodiment, the sending a computing power storage request to a hierarchy other than the initial hierarchy according to a first preset rule includes:

If the preset computing power value of the computing node corresponds to the current maximum, minimum, or boundary value of the corresponding spatial position, sending a computing power storage request to the next layer of the initial level and storing the preset computing power In the next level of the initial level;

If a preset computing power value of the computing node is a unique value in a corresponding spatial position or a boundary value of a layer above the initial level, sending a computing power storage request to a layer above the initial level, and The preset computing power is stored in a layer above the initial level.

In an embodiment, the searching for the corresponding preset computing power in the target P2P network based on the RFC7374 protocol according to the required computing power includes:

Determining a spatial position of the demand computing power at an initial level, and generating a second resource ID corresponding to the demand computing power;

And, according to the second resource ID, a corresponding preset computing power is searched at the spatial position of the initial level.

In an embodiment, the computing resource search method further includes:

If the corresponding preset computing power is not found according to the second resource ID in the spatial position of the initial hierarchy, a query request is sent to the hierarchy other than the initial hierarchy according to the second preset rule.

In an embodiment, the sending a query request to a hierarchy other than the initial hierarchy according to a second preset rule includes:

Judging whether there is a subsequent node in the query result of searching for the corresponding preset computing power in the spatial position of the initial level according to the second resource ID;

If yes, continue to find the corresponding preset computing power at the spatial position one level above the initial level;

If not, continue to find the corresponding preset computing power at the spatial position of the next level of the initial level.

In an embodiment, the computing resource search method further includes:

If the required computing power is a boundary value of the spatial position of the initial level, it is determined that a preset computing power corresponding to the required computing power does not exist in the target p2p network, and the search is stopped.

In a second aspect, the present application provides a computing resource search system for a P2P network. The computing resource search system includes:

A computing resource search request receiving module, configured to receive a computing resource search request, wherein the computing resource search request includes a required computing power;

A computing resource search module is configured to find a corresponding preset computing power in a target P2P network based on the RFC7374 protocol according to the required computing power, wherein the preset computing power is calculated by the computing node based on the RFC7374 protocol at the target Published in P2P networks.

In an embodiment, the computing resource search system further includes:

A computing node registration module, configured to register a computing node for providing computing resources in a target P2P network;

A computing resource issuing module is configured to release a computing resource corresponding to the computing node in a target P2P network based on the RFC7374 protocol.

According to a third aspect, the present application provides an electronic device including a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the program, the processor for the P2P network is implemented. Steps of a computing resource lookup method.

In a fourth aspect, the present application provides a computer-readable storage medium having stored thereon a computer program that, when executed by a processor, implements the steps of the method for finding a computing resource for a P2P network.

It can be known from the foregoing technical solution that the present application provides a computing resource search method for a P2P network by receiving a computing resource search request, wherein the computing resource search request includes a required computing power; according to the required computing power, Finding the corresponding preset computing power in the target P2P network based on the RFC7374 protocol, wherein the preset computing power is obtained by a computing node based on the RFC7374 protocol in the target P2P network, which can effectively reduce the search for computing resources Steps to improve the search efficiency of computing resources, not only can make overall use of computing resources in P2P networks, but also greatly shorten the search cycle of demand side of computing resources in P2P networks, and improve the utilization of computing resources.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to more clearly explain the embodiments of the present application or the technical solutions in the prior art, the drawings used in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings in the following description are Some embodiments of the present application, for those of ordinary skill in the art, can obtain other drawings according to these drawings without paying creative labor.

FIG. 1 is a schematic flowchart of a computing resource search method for a P2P network according to an embodiment of the present application.

FIG. 2 is a schematic diagram of an example of a ReDiR tree of the present application.

FIG. 3 is a schematic diagram of numbering of tree nodes at levels 0-2 in the ReDiR tree of the present application.

FIG. 4 is a schematic diagram of the intervals allocated for tree nodes in the ReDiR trees of the level 0 and the level 1 of the present application.

FIG. 5 is a schematic flowchart of steps A00 and B00 in a method for finding a computing resource for a P2P network in the present application.

FIG. 6 is a schematic flowchart of step A00 in the method for searching for computing resources for a P2P network in this application.

FIG. 7 is a schematic flowchart of step A02 in the method for searching for computing resources for a P2P network in the present application.

FIG. 8 is a schematic flowchart of step B00 in the method for searching for computing resources for a P2P network in the present application.

FIG. 9 is a schematic flowchart of step 200 in a method for finding a computing resource for a P2P network in this application.

FIG. 10 is a schematic structural diagram of a computing resource search system for a P2P network according to an embodiment of the present application.

FIG. 11 is another schematic structural diagram of a computing resource search system for a P2P network according to an embodiment of the present application.

FIG. 12 is a schematic structural diagram of an electronic device in an embodiment of the present application.

detailed description

To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer and clearer, the embodiments of the present invention are described in further detail below with reference to the accompanying drawings. Here, the exemplary embodiments of the present invention and the description thereof are used to explain the present invention, but are not intended to limit the present invention.

An embodiment of the present application provides a specific implementation manner of a computing resource search method for a P2P network. Referring to FIG. 1, the computing resource search method for a P2P network specifically includes the following content:

Step 100: Receive a computing resource search request, wherein the computing resource search request includes a required computing power.

In step 100, a computing resource search system for a P2P network receives a computing resource search request, wherein the computing resource search request includes a required computing power. It can be understood that the computing resource search system for a P2P network may be embodied as a server of a P2P network, and the hardware composition of the computing resource search system for a P2P network may also include a terminal device. The terminal The device may have a display function. Specifically, the terminal device may include a smart phone, a tablet electronic device, a network set-top box, a portable computer, a desktop computer, a personal digital assistant (PDA), a vehicle-mounted device, a smart wearable device, and the like. The smart wearable device may include smart glasses, smart watches, smart bracelets, and the like. And the first terminal and the second terminal are both one of the foregoing terminal types.

The server may communicate with the terminal device. The server and the terminal device may communicate using any suitable network protocol, including a network protocol that has not been developed at the filing date of this application. The network protocol may include, for example, TCP / IP protocol, UDP / IP protocol, HTTP protocol, HTTPS protocol, and the like. Of course, the network protocol may also include, for example, an RPC protocol (Remote Procedure Call Protocol), a REST protocol (Representational State Transfer Protocol), etc. used on the above protocol.

It can be understood that the required computing power is the computing power required by the computing power service demander, and the required computing power is added to the computing resource search request, and the server corresponding to the target P2P network (that is, the A computing resource search system of a P2P network) sends the computing resource search request, where the computing power is a quantified expression of the computing resource.

Step 200: Find the corresponding preset computing power in the target P2P network based on the RFC7374 protocol according to the required computing power, wherein the preset computing power is published by the computing node in the target P2P network based on the RFC7374 protocol. To get.

In step 200, a computing resource search system for a P2P network receives a computing resource search request sent by the computing power service demander, and reads the computing resource search request to obtain a required computing power corresponding to the computing resource search request. Then according to the required computing power, based on the RFC7374 protocol, find the corresponding preset computing power in the target P2P network. It can be understood that the preset computing power is a computing resource that can be provided by a computing node in the target P2P network, and the preset computing power is the corresponding computing node in the target P2P network based on the RFC7374 protocol. Published in.

In the above description, the RFC7374 protocol is specifically one of RFC (Request For Comments) documents recording basic Internet communication protocols and Internet standards, wherein the RFC document is a series of files arranged by numbers, and the The document gathers information about the Internet, as well as software files for UNIX and the Internet community. The basic Internet communication protocols are specified in RFC documents. The RFC file also adds a number of topics to the standard, such as the Internet's newly developed protocols and all the records in development. The published content of the RFC7374 protocol document is shown in Table 1.

Table 1

The RFC7374 document discloses a service discovery application (Reload) (Service Relocation) for locating and discovering resources (Resource and Location (Reload)), where the resource positioning and discovery (reload) RFC 6940 document does not include The universal service discovery mechanism is defined as part of the basic protocol. Therefore, in order to solve this problem, the RFC7374 document defines how to apply the recursive distributed rendezvous ReDiR (Recursive Distributed Rendezvous) service discovery mechanism in the RELOAD overlay network to provide universal service discovery. A mechanism in which the ReDiR service is embodied in the form of a tree structure, that is, a ReDiR tree. The ReDiR tree is a tree structure of a node that provides a specific service. The node uses the ELOAD storage and acquisition request to embed the ReDiR tree into the RELOAD overlay network. Each tree node in the ReDiR tree is at a certain level in the tree. The root node of the ReDiR tree is at level 0 of the ReDiR tree. The children of the root node are at level 1. The children of a tree node at level 1 are at level 2, and so on. ReDiR tree branch coefficient b. The most space of each level in the ReDiR tree is the b ^ level tree node. Each tree node in the ReDiR tree is uniquely identified by a pair (lvl, j), where lvl is a level in the ReDiR tree and j is the position of the tree node (from the left) at that level.

Referring to an example of the ReDiR tree shown in FIG. 2, its branch coefficient is 2 and the identifier space size of the overlay is 16. Each tree node in the ReDiR tree is displayed as two horizontal lines, with a vertical line ('|') in the middle. The horizontal lines represent the two intervals each node is responsible for. At level 0, only one node (0,0) is responsible for the two intervals, which together cover the entire identifier space of the reload overlay instance. In level 1, there are two nodes (1,0) and (1,1), each of which is responsible for half of the identifier space of the RELOAD overlay network. In level 2, there are four nodes. They each have a quarter of the identifier space. In level 3, there are 8 nodes, each of which is responsible for 1/8 of the identifier space. Figure 3 shows how to number tree nodes at levels 0-2 in the ReDiR tree, and Figure 4 shows how to In the ReDiR trees of level 0 and level 1, the tree nodes are allocated intervals. For example, a single tree node (0,0) at level 0 is divided into two intervals, each interval covering half of the identifier space. These two intervals are [0,7] and [8,15]. In addition, all the above examples are simplified. In a real ReDiR tree, the default ReDiR branch factor is 10, which means that each tree The nodes are divided into 10 intervals, and each tree node has 10 children. In this ReDiR tree, level 1 contains 10 nodes and 100 intervals. Level 2 contains 100 nodes and 1000 intervals, Level 3 contains 1000 nodes and 10,000 intervals, and so on. In addition, the minimum identifier space size of the ReDiR tree in a real RELOAD overlay network is 2 ^ 128.

It can be known from the foregoing description that the embodiments of the present application provide a method for searching for computing resources in a P2P network, which can effectively reduce the steps of searching for computing resources and improve the efficiency of searching for computing resources. Moreover, it can greatly shorten the search period of the demand side of computing resources in the P2P network and improve the utilization rate of computing power resources.

In a specific embodiment, referring to FIG. 5, the method for finding computing resources for a P2P network in the present application further includes steps A00 and B00, and the steps A00 and B00 may be performed before step 100 or at any time. Executed when a computing node joins the target P2P network. The steps A00 and B00 specifically include the following:

Step A00: Register a computing node for providing computing resources in the target P2P network.

Step B00: Publishing the computing resources corresponding to the computing nodes in the target P2P network based on the RFC7374 protocol.

In the above description, referring to FIG. 6, the step A00 specifically includes the following content:

Step A01: judging whether the joining position of the computing nodes joining the target P2P network is behind the NAT device. It can be understood that the NAT device is a network address translation (Network Address Translation) device.

If yes, go to step A02; otherwise, go to step A03.

Step A02: Obtain a relay address corresponding to the computing node, and register the relay address in the target P2P network.

Step A03: Register the IP address of the computing node in the target P2P network.

In step A02, referring to FIG. 7, the step A02 specifically includes the following content:

A02-1: find a TURN service corresponding to the computing node via a service discovery module in the target P2P network;

In the above description, the TURN service is the TURN protocol (RFC5766). If a host is behind a NAT, communication between the two hosts cannot be performed under certain conditions. Under these conditions, it is necessary to use relay services to provide communication. This specification defines a protocol called TURN (using relay traversal NAT), which allows a host to use the relay service to transmit messages with the peer. TURN differs from other relay protocols in that it allows a client to communicate with multiple peers simultaneously using one relay address. The TURN protocol is also part of the ICE (Interactive Connection Establishment) protocol and can also be used alone.

A02-2: Obtain a relay address corresponding to the computing node in the found TURN service.

In the above description, referring to FIG. 8, the step B00 specifically includes the following content:

Step B01: selecting an initial level in the multi-tree of the RFC7374 protocol, wherein the initial level is any level other than the first level of the multi-tree;

Step B02: determining a spatial position of the preset computing power of the computing node at the initial level, and generating a first resource ID of the computing node;

Step B03: Publish the corresponding first resource ID and the preset computing power to the corresponding spatial locations, and determine whether the preset computing power satisfies the first preset condition, and if so, execute step B04;

Otherwise, execute step B05.

Step B04 stores the preset computing power in the initial hierarchy.

Step B05: According to a first preset rule, a computing power storage request is sent to a hierarchy other than the initial hierarchy.

Understandably. The multi-tree is the aforementioned ReDiR tree.

In step B05, if the preset computing power value of the computing node is the current maximum, minimum, or boundary value of the corresponding spatial position, sending a computing power storage request to the next layer of the initial level, And store the preset computing power in the next level of the initial level; if the preset computing power value of the computing node is the only value in the corresponding spatial position or the boundary value of the previous level of the initial level , Sending a computing power storage request to a layer above the initial level, and storing a preset computing power in a layer above the initial level.

It can be understood that the first preset condition corresponds to the first preset rule, that is, determining whether the preset computing power meets the first preset condition is: determining whether a preset computing power value of the computing node is Is not the current maximum value, minimum value, or boundary value of the corresponding spatial position, or the preset computing power value of the computing node is the only value in the corresponding spatial position or the boundary value of the previous level of the initial level Any one of them.

It can be known from the above description that the embodiments of the present application provide a method for finding computing resources for a P2P network, by registering a computing node for providing computing resources in a target P2P network, and in the target P2P network based on the RFC7374 protocol The release of the computing resources corresponding to the computing nodes can effectively reduce the search steps of computing resources and improve the search efficiency of computing resources. Not only can the computing resources in the P2P network be used in a unified manner, but also the computing resource requirements in the P2P network can be greatly reduced. Square search cycle, improve the utilization of computing resources.

In a specific embodiment, referring to FIG. 9, step 200 in the method for searching for computing resources for a P2P network in the present application specifically includes the following content:

Step 201: Select an initial level in the multi-tree of the RFC7374 protocol, where the initial level is any level other than the first level of the multi-tree.

Step 202: Determine the spatial position of the required computing power at the initial level, and generate a second resource ID corresponding to the required computing power.

Step 203: Find a corresponding preset computing power at the spatial position of the initial level according to the second resource ID.

Step 204: If the corresponding preset computing power is not found according to the second resource ID at the spatial position of the initial level, then send a query request to other levels except the initial level according to the second preset rule.

It can be understood that the sending of a query request to a hierarchy other than the initial hierarchy according to the second preset rule specifically includes the following content:

Step 205-1: Determine whether there is a subsequent node in the query result of searching for the corresponding preset computing power in the initial hierarchical spatial position according to the second resource ID;

If yes, go to step 205-2; if no, go to step 205-3.

Step 205-2: Continue to search for the corresponding preset computing power at the spatial position one level above the initial level;

Step 205-3: Continue to search for the corresponding preset computing power at the spatial position of the next level of the initial level.

In addition, step 200 in the method for finding computing resources in a P2P network further includes step 206:

Step 206: If the required computing power is a boundary value of the spatial position of the initial level, determine that a preset computing power corresponding to the required computing power does not exist in the target p2p network, and stop searching.

It can be known from the foregoing description that the embodiments of the present application provide a method for finding computing resources for a P2P network. According to the required computing power, the corresponding preset computing power is found in the target P2P network based on the RFC7374 protocol, which can effectively reduce the calculation. The resource search step improves the search efficiency of computing resources. Not only can the computing resources in the P2P network be used in a coordinated way, but it can also greatly shorten the search cycle of the demand side of the computing resources in the P2P network and improve the utilization of computing resources.

To further illustrate this solution, the present application also provides a specific implementation method of a computing resource search method for a P2P network, which specifically includes the following content:

S1: The computing node is registered as the computing power service provider of the target P2P network.

S2: The computing node issues computing power services in the target P2P network based on the RFC7374 protocol.

S3: The computing power service demander searches for the computing power service in the target P2P network based on the RFC7374 protocol.

First, the step S1 specifically includes the following content:

S1-1: The computing nodes used to provide computing power services join the target P2P network.

S1-2: The computing nodes joining the P2P network apply the STUN (Simple traversal of UDP over NATs) protocol to determine whether their joining position is behind a NAT (Network Address Translation) device;

If yes, execute S1-3; if not, execute S1-6.

S1-3: Find a TURN (a protocol that uses relay traversing NAT) service through a service discovery module, where the TURN service is used to provide the computing node with a service capability in a target P2P network.

S1-4: Obtain the relay Relay address from the found TURN service.

S1-5: The computing node registers the relay Relay address in the target P2P network, that is, it registers itself as the computing power service provider of the target P2P network.

S1-6: The computing node registers its own IP address in the target P2P network, that is, it registers itself as the computing power service provider of the target P2P network.

Secondly, the step S2 specifically includes the following content:

S2-1: Select an initial level in the ReDiR tree of the RFC7374 protocol, where the initial level is any level other than the first level of the ReDiR tree;

S2-2: determine the spatial position of the computing power of the computing node at the initial level;

S2-3: generating a first resource ID of the computing node according to the computing power and the initial level of the computing node, where the resource ID is composed of a namespace, the computing power of the computing node, and the initial level;

S2-4: the computing node issues the corresponding first resource ID and computing power information to the spatial location, and

S2-5: Determine whether the computing power satisfies the first preset condition; if not, execute step S2-6, and if yes, execute step S2-7.

S2-6: Send a computing power storage request to a hierarchy other than the initial hierarchy according to a first preset rule. And the S2-6 includes:

If the computing power value of the computing node is the current maximum, minimum, or boundary value of the corresponding spatial position, if it is, send a computing power storage request to the next layer of the specified level, and store the computing power in The next level of the initial level;

If the computing power value of the computing node is a unique value in a corresponding spatial position or a boundary value of a layer above the initial level, a computing power storage request is sent to a layer above the initial level, and the calculation is performed. The force is stored in a layer above the initial level.

S2-7: Store the computing power in the initial hierarchy.

Third, the step S3 specifically includes the following:

S3-1: Select an initial level in the ReDiR tree of the RFC7374 protocol, where the initial level is any level other than the first level of the ReDiR tree;

S3-2: Determine the spatial position of the required computing power at the initial level;

S3-3: generating a second resource ID of the required computing power according to the required computing power and the initial level, wherein the second resource ID is composed of a namespace, the computing power of the computing node, and an initial level;

S3-4: Find a computing power resource at an initial hierarchical spatial position according to the second resource ID.

S3-5: If no computing power resource is found in the initial hierarchical spatial position according to the second resource ID, step S3-6 is performed.

S3-6: Send a query request to layers other than the initial layer according to a second preset rule. And the S3-6 includes:

Judging whether there is a subsequent node in the query result of searching for a computing power resource in the spatial position of the initial level according to the second resource ID;

If yes, continue to search for computing resources at the spatial position one level above the initial level;

If not, continue to search for computing power resources at the spatial position of the next level of the initial level.

S3-7: If the required computing power is a boundary value of the spatial position of the initial level, determine that there is no computing power resource corresponding to the required computing power in the target p2p network, and stop searching for computing power resources.

In a specific example, the specific implementation manner of the computing resource search method for a P2P network specifically includes the following content:

1. Publish computing power service

Computing nodes join the network to provide computing power services. Before registering as computing power service providers, they need to use the STUN protocol to determine whether they are behind a NAT device. If you are behind a NAT device, you need to find a TURN service through service discovery to provide yourself with the service capabilities of the public network. The computing node needs to register its own IP address or the Relay address obtained from the TURN service to the network.

When the computing node publishes the computing power service, it selects the specified level l (usually 2) as our starting level, finds the specified power (the computing power provided by the node) at the spatial position I (l, power) of the level l, and generates resources ID (ID = namespace + level + power), and publish the resource ID and computing power information into the space I (l, power). At the same time, according to the power, it is necessary to send storage requests to other levels. The conditions based on:

The power value is the current maximum or minimum value of space I (l, power) or the boundary value of space I (l, power), which needs to be stored to the level + 1 layer.

The power value is the only value in the current space or the lower boundary value needs to be stored to the level-1 layer.

2. Discover computing power services

In the calculation, we need to match the computing nodes according to the computing power. First, we select the specified level l (usually 2) as our starting level, and find the spatial position I (l, power of the specified power (the computing power provided by the node) on the l level. ) To generate a resource ID (ID = namespace + level + power). Use the resource ID to query the specified space I (l, power). When no resources are found at level l, you need to determine whether to send query requests to other levels based on power. The conditions based on:

If there are no subsequent nodes in the query result, it may exist in a higher level, so that level + 1 continues to search upwards.

If there is a subsequent value indicating that it may exist in a lower level, so that level-1 continues to search downwards. If power is the boundary value of space I (l, power), the entire network does not exist, and the query is stopped.

As can be seen from the above description, the application example of the present application provides a method for finding computing resources for P2P networks. Based on ReDiR (Recursive Distributed Rendezvous) [RFC7374], DHT algorithm, a method for publishing and querying computing resources is designed. This method generates a unique resource ID for each type of computing power value by digitally dividing the computing power and distributes it to the P2P network. For the requester, a resource ID can be constructed based on the required computing power value to query in the network. The worst method for computing resource discovery in this application requires only L queries (L equals the number of ReDiR layers), and N based on the chord algorithm (N equals the number of nodes in the network). The ReDiR discovery mechanism does not need to actively detect the state between nodes. , Only the service node actively reports. In order to maintain a ring network, chord needs to periodically and actively detect the status of the predecessor and successor nodes. It can effectively reduce the search steps of computing resources and improve the search efficiency of computing resources. It can not only make overall use of computing resources in P2P networks, but also greatly shorten the search cycle of demand side of computing resources in P2P networks and improve the utilization of computing resources. Rate, can be applied to blockchain, scientific computing, data services, transportation, medical, network of IoT computing resources and other fields. In the field of blockchain, its efficient publishing and query functions can be used to find and forward blocks. . In the field of scientific computing can be used in the field of scientific computing equipment discovery services. In the direction of the Internet of Things, the field of discovery services among smart devices can be utilized.

An embodiment of the present application provides a specific implementation of a computing resource search system for a P2P network capable of realizing all the contents of the computing resource search method for a P2P network. Referring to FIG. 10, the The computing resource search system specifically includes the following:

A computing resource search request receiving module 10 is configured to receive a computing resource search request, wherein the computing resource search request includes a required computing power;

A computing resource search module 20 is configured to find a corresponding preset computing power in the target P2P network based on the RFC7374 protocol according to the required computing power, wherein the preset computing power is calculated by the computing node based on the RFC7374 protocol in the Published in the target P2P network.

Referring to FIG. 11, the computing resource search system further includes:

A computing node registration module is used to register a computing node for providing computing resources in a target P2P network.

The embodiment of the computing resource search system for a P2P network provided in this application can be specifically used to execute the processing flow of the embodiment of the computing resource search method for a P2P network in the above embodiments. Reference may be made to the detailed description of the foregoing method embodiments.

It can be known from the foregoing description that the embodiments of the present application provide a computing resource search system for a P2P network, which can effectively reduce the search steps of computing resources and improve the search efficiency of computing resources. Moreover, it can greatly shorten the search period of the demand side of computing resources in the P2P network and improve the utilization rate of computing power resources.

An embodiment of the present application further provides a specific implementation of an electronic device capable of implementing all the steps in the method for finding a computing resource for a P2P network in the foregoing embodiment. The electronic device specifically includes the following content:

A processor, a memory, a communication interface, and a bus; wherein the processor, the memory, and the communication interface communicate with each other through the bus; the communication interface is used to implement Information transmission between a computing resource search system of a P2P network and related devices such as a user terminal; the electronic device may be a desktop computer, a tablet computer, a mobile terminal, etc. This embodiment is not limited thereto. In this embodiment, the electronic device may be implemented by referring to the embodiment of the method for computing resource search for P2P networks and the embodiment of the device for searching computing resources for P2P networks, the content of which is incorporated herein and repeated I will not repeat them here.

FIG. 12 is a schematic block diagram of a system configuration of an electronic device 600 according to an embodiment of the present application. As shown in FIG. 12, the electronic device 600 may include a central processing unit 100 and a memory 140; the memory 140 is coupled to the central processing unit 100. It is worth noting that this figure is exemplary; other types of structures can also be used to supplement or replace the structure to implement telecommunication functions or other functions.

In one embodiment, a computing resource search function for a P2P network may be integrated into the central processing unit 100. The central processor 100 may be configured to perform the following control: Step 100: receiving a computing resource search request, wherein the computing resource search request includes a required computing power; step 200: according to the required computing power, based on RFC7374 The protocol searches a corresponding preset computing power in the target P2P network, wherein the preset computing power is obtained by a computing node based on the RFC7374 protocol and published in the target P2P network.

It can be known from the foregoing description that the embodiments of the present application provide an electronic device that can effectively reduce the search steps of computing resources and improve the search efficiency of computing resources. The search cycle of demand side of computing resources in P2P networks improves the utilization of computing power resources.

In another embodiment, the computing resource search device for a P2P network may be configured separately from the central processing unit 100. For example, the computing resource search device for a P2P network may be configured as a chip connected to the central processing unit 100, and through the central processing unit, The processor is controlled to implement the computing resource search function for the P2P network.

As shown in FIG. 12, the electronic device 600 may further include a communication module 110, an input unit 120, an audio processing unit 130, a display 160, and a power source 170. It is worth noting that the electronic device 600 does not necessarily need to include all the components shown in FIG. 12; in addition, the electronic device 600 may also include components not shown in FIG. 12, and reference may be made to the prior art.

As shown in FIG. 12, the central processing unit 100 is sometimes referred to as a controller or an operation control, and may include a microprocessor or other processor devices and / or logic devices. The central processing unit 100 receives input and controls each of the electronic devices 600 Operation of parts.

The memory 140 may be, for example, one or more of a buffer, a flash memory, a hard drive, a removable medium, a volatile memory, a non-volatile memory, or other suitable devices. The above-mentioned failure-related information can be stored, and in addition, a program for executing the related information can be stored. In addition, the central processing unit 100 may execute the program stored in the memory 140 to implement information storage or processing.

The input unit 120 provides input to the central processing unit 100. The input unit 120 is, for example, a key input or a touch input device. The power source 170 is used to provide power to the electronic device 600. The display 160 is used for displaying display objects such as images and characters. The display may be, for example, an LCD display, but is not limited thereto.

The memory 140 may be a solid-state memory, such as a read-only memory (ROM), a random access memory (RAM), a SIM card, and the like. It may also be a memory that holds information even when power is off, can be selectively erased, and is provided with more data. An example of this memory is sometimes called EPROM or the like. The memory 140 may also be some other type of device. The memory 140 includes a buffer memory 141 (sometimes referred to as a buffer). The memory 140 may include an application / function storage section 142 for storing application programs and function programs or a flow for performing operations of the electronic device 600 through the central processing unit 100.

The memory 140 may further include a data storage section 143 for storing data, such as contacts, digital data, pictures, sounds, and / or any other data used by the electronic device. The driver storage section 144 of the memory 140 may include various driver programs for the communication function of the electronic device and / or for performing other functions of the electronic device (such as a messaging application, an address book application, etc.).

The communication module 110 is a transmitter / receiver 110 that transmits and receives signals via the antenna 111. A communication module (transmitter / receiver) 110 is coupled to the central processing unit 100 to provide input signals and receive output signals, which may be the same as the case of a conventional mobile communication terminal.

Based on different communication technologies, multiple communication modules 110 may be provided in the same electronic device, such as a cellular network module, a Bluetooth module, and / or a wireless local area network module. The communication module (transmitter / receiver) 110 is also coupled to the speaker 131 and the microphone 132 via the audio processor 130 to provide audio output via the speaker 131 and to receive audio input from the microphone 132, thereby realizing general telecommunication functions. The audio processor 130 may include any suitable buffers, decoders, amplifiers, and the like. In addition, the audio processor 130 is also coupled to the central processing unit 100, thereby enabling recording on the unit through the microphone 132, and enabling sounds stored on the unit to be played through the speaker 131.

An embodiment of the present application further provides a computer-readable storage medium capable of implementing all the steps in the method for finding a computing resource for a P2P network in the foregoing embodiment. The computer-readable storage medium stores a computer program, and the computer When the program is executed by a processor, all steps of the method for finding a computing resource for a P2P network in the foregoing embodiment are implemented. For example, when the processor executes the computer program, the following steps are implemented:

It can be known from the foregoing description that the embodiments of the present application provide a computer-readable storage medium, which can effectively reduce the search steps of computing resources and improve the search efficiency of computing resources. It greatly shortens the search cycle of the demand side of computing resources in P2P networks and improves the utilization of computing power resources.

Each embodiment in this specification is described in a progressive manner, and the same or similar parts between the various embodiments can be referred to each other. Each embodiment focuses on the differences from other embodiments. In particular, for the hardware + program embodiment, since it is basically similar to the method embodiment, the description is relatively simple. For the related parts, refer to the description of the method embodiment.

The specific embodiments of the present specification have been described above. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments and the desired result may still be achieved. In addition, the processes depicted in the figures do not necessarily require the particular order shown or sequential order to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

Although the present application provides method operation steps as described in the embodiments or flowcharts, more or less operation steps may be included based on conventional or non-creative labor. The order of steps listed in the embodiments is only one way of executing the steps, and does not represent the only order of execution. When the actual device or client product is executed, it may be executed sequentially or in parallel according to the method shown in the embodiment or the accompanying drawings (for example, a parallel processor or a multi-threaded environment).

The system, device, module, or unit described in the foregoing embodiments may be specifically implemented by a computer chip or entity, or a product with a certain function. A typical implementation device is a computer. Specifically, the computer may be, for example, a personal computer, a laptop computer, a vehicle-mounted human-computer interaction device, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, and a tablet. A computer, a wearable device, or a combination of any of these devices.

Although the embodiments of the specification provide method operation steps as described in the embodiments or flowcharts, conventional or non-creative methods may include more or fewer operation steps. The order of steps listed in the embodiments is only one way of executing the steps, and does not represent the only order of execution. When an actual device or terminal product is executed, it may be executed sequentially or in parallel according to the method shown in the embodiment or the accompanying drawings (for example, a parallel processor or multi-threaded environment, or even a distributed data processing environment). The terms "including", "comprising", or any other variation thereof are intended to encompass non-exclusive inclusion, such that a process, method, product, or device that includes a series of elements includes not only those elements, but also other elements not explicitly listed Elements, or elements that are inherent to such a process, method, product, or device. Without more restrictions, it does not exclude that there are other identical or equivalent elements in the process, method, product or equipment including the elements.

For the convenience of description, when describing the above device, the functions are divided into various modules and described separately. Of course, when implementing the embodiments of the present specification, the functions of each module may be implemented in the same or multiple software and / or hardware, or the module that implements the same function may be implemented by a combination of multiple submodules or subunits. The device embodiments described above are only schematic. For example, the division of the unit is only a logical function division. In actual implementation, there may be another division manner. For example, multiple units or components may be combined or integrated. To another system, or some features can be ignored or not implemented. In addition, the displayed or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, which may be electrical, mechanical or other forms.

Those skilled in the art also know that, in addition to implementing the controller in pure computer-readable program code, it is entirely possible to make the controller logic gates, switches, application specific integrated circuits, programmable logic controllers, and embedded controllers by logically programming the method steps. Microcontrollers and the like to achieve the same function. Therefore, such a controller can be considered as a hardware component, and the device included in the controller for implementing various functions can also be considered as a structure within the hardware component. Or even, the means for implementing various functions may be regarded as a structure that can be both a software module implementing the method and a hardware component.

The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowcharts and / or block diagrams, and combinations of processes and / or blocks in the flowcharts and / or block diagrams can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing device to produce a machine, so that the instructions generated by the processor of the computer or other programmable data processing device are used to generate instructions Means for implementing the functions specified in one or more flowcharts and / or one or more blocks of the block diagrams.

These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to work in a specific manner such that the instructions stored in the computer-readable memory produce a manufactured article including an instruction device, the instructions The device implements the functions specified in one or more flowcharts and / or one or more blocks of the block diagram.

These computer program instructions can also be loaded onto a computer or other programmable data processing device, so that a series of steps can be performed on the computer or other programmable device to produce a computer-implemented process, which can be executed on the computer or other programmable device. The instructions provide steps for implementing the functions specified in one or more flowcharts and / or one or more blocks of the block diagrams.

In a typical configuration, a computing device includes one or more processors (CPUs), input / output interfaces, network interfaces, and memory.

Memory may include non-persistent memory, random access memory (RAM), and / or non-volatile memory in computer-readable media, such as read-only memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.

Computer-readable media includes permanent and non-persistent, removable and non-removable media. Information storage can be accomplished by any method or technology. Information may be computer-readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), and read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, read-only disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, Magnetic tape cartridges, magnetic tape storage or other magnetic storage devices or any other non-transmitting medium may be used to store information that can be accessed by a computing device. As defined herein, computer-readable media does not include temporary computer-readable media, such as modulated data signals and carrier waves.

Those skilled in the art should understand that the embodiments of the present specification may be provided as a method, a system, or a computer program product. Therefore, the embodiments of the present specification may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Moreover, the embodiments of the present specification may take the form of a computer program product implemented on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

Embodiments of the specification may be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. The embodiments of the present specification can also be practiced in distributed computing environments, in which tasks are performed by remote processing devices connected through a communication network. In a distributed computing environment, program modules may be located in local and remote computer storage media, including storage devices.

Each embodiment in this specification is described in a progressive manner, and the same or similar parts between the various embodiments can be referred to each other. Each embodiment focuses on the differences from other embodiments. In particular, for the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and for the relevant parts, refer to the description of the method embodiment. In the description of this specification, the description with reference to the terms “one embodiment”, “some embodiments”, “examples”, “specific examples”, or “some examples” and the like means specific features described in conjunction with the embodiments or examples , Structure, materials, or features are included in at least one embodiment or example of an embodiment of this specification. In this specification, the schematic expressions of the above terms are not necessarily directed to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. In addition, those skilled in the art can combine and combine different embodiments or examples and features of different embodiments or examples without conflicting one another.

The above descriptions are merely examples of the embodiments of the present specification, and are not intended to limit the embodiments of the present specification. For those skilled in the art, the embodiments of the present specification may have various modifications and changes. Any modification, equivalent replacement, and improvement made within the spirit and principle of the embodiment of the present specification shall be included in the scope of claims of the embodiment of the present specification.

Claims

A computing resource search method for a P2P network is characterized in that the computing resource search method includes:

Receiving a computing resource search request, wherein the computing resource search request includes a required computing power;

According to the required computing power, a corresponding preset computing power is found in the target P2P network based on the RFC7374 protocol, wherein the preset computing power is obtained by a computing node based on the RFC7374 protocol in the target P2P network.
The computing resource search method according to claim 1, wherein the computing resource search method further comprises:

Register a computing node for providing computing resources in the target P2P network;

Based on the RFC7374 protocol, a computing resource corresponding to the computing node is released in a target P2P network.
The method for finding computing resources according to claim 2, wherein the registering a computing node for providing computing resources in a target P2P network comprises:

Determining whether a joining position of a computing node joining the target P2P network is behind a NAT device;

If yes, obtaining a relay address corresponding to the computing node, and registering the relay address in the target P2P network;

Otherwise, register the IP address of the computing node in the target P2P network.
The method for searching for a computing resource according to claim 3, wherein the obtaining a relay address corresponding to the computing node comprises:

Find a TURN service corresponding to the computing node via a service discovery module in the target P2P network;

And, in the found TURN service, the computing node correspondingly obtains a relay address.
The method for searching for computing resources according to claim 2, wherein the publishing the computing resources corresponding to the computing nodes in a target P2P network based on the RFC7374 protocol comprises:

Selecting an initial level in the multi-tree of the RFC7374 protocol, wherein the initial level is any level other than the first level of the multi-tree;

Determining a spatial position of the preset computing power of the computing node at the initial level, and generating a first resource ID of the computing node;

Publishing the corresponding first resource ID and preset computing power to the corresponding spatial location, and determining whether the preset computing power satisfies the first preset condition, and if so, storing the preset computing power in all locations Described in the initial hierarchy.
The computing resource search method according to claim 5, wherein the computing resource search method further comprises:

If the preset computing power does not satisfy the first preset condition, a computing power storage request is sent to a level other than the initial level according to the first preset rule.
The method for searching for a computing resource according to claim 6, wherein the sending a computing power storage request to a hierarchy other than the initial hierarchy according to a first preset rule comprises:

If the preset computing power value of the computing node corresponds to the current maximum, minimum, or boundary value of the corresponding spatial position, sending a computing power storage request to the next layer of the initial level and storing the preset computing power In the next level of the initial level;

If a preset computing power value of the computing node is a unique value in a corresponding spatial position or a boundary value of a layer above the initial level, sending a computing power storage request to a layer above the initial level, and The preset computing power is stored in a layer above the initial level.
The method for searching for computing resources according to claim 1, wherein the searching for the corresponding preset computing power in the target P2P network based on the RFC7374 protocol according to the required computing power comprises:

Selecting an initial level in the multi-tree of the RFC7374 protocol, wherein the initial level is any level other than the first level of the multi-tree;

Determining a spatial position of the demand computing power at an initial level, and generating a second resource ID corresponding to the demand computing power;

And, according to the second resource ID, a corresponding preset computing power is searched at the spatial position of the initial level.
The computing resource search method according to claim 8, wherein the computing resource search method further comprises:

If the corresponding preset computing power is not found according to the second resource ID in the spatial position of the initial hierarchy, a query request is sent to the hierarchy other than the initial hierarchy according to the second preset rule.
The method for searching for computing resources according to claim 9, wherein the sending a query request to a layer other than the initial layer according to a second preset rule comprises:

Judging whether there is a subsequent node in the query result of searching for the corresponding preset computing power in the spatial position of the initial level according to the second resource ID;

If yes, continue to find the corresponding preset computing power at the spatial position one level above the initial level;

If not, continue to find the corresponding preset computing power at the spatial position of the next level of the initial level.
The computing resource search method according to claim 8, wherein the computing resource search method further comprises:

If the required computing power is a boundary value of the spatial position of the initial level, it is determined that a preset computing power corresponding to the required computing power does not exist in the target p2p network, and the search is stopped.
A computing resource search system for a P2P network is characterized in that the computing resource search system includes:

A computing resource search request receiving module, configured to receive a computing resource search request, wherein the computing resource search request includes a required computing power;

A computing resource search module is configured to find a corresponding preset computing power in a target P2P network based on the RFC7374 protocol according to the required computing power, wherein the preset computing power is calculated by the computing node based on the RFC7374 protocol at the target Published in P2P networks.
The computing resource search system according to claim 12, wherein the computing resource search system further comprises:

A computing node registration module, configured to register a computing node for providing computing resources in a target P2P network;

A computing resource issuing module is configured to release a computing resource corresponding to the computing node in a target P2P network based on the RFC7374 protocol.
An electronic device includes a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor implements any one of claims 1 to 11 when executing the program. Steps of a computing resource finding method for a P2P network.
A computer-readable storage medium having stored thereon a computer program, characterized in that the computer program, when executed by a processor, implements the steps of the method for searching for a computing resource for a P2P network according to any one of claims 1 to 11.