CN111555900B - Method for guiding client nodes in P2P network to reasonably select node bandwidth, computer readable storage medium and P2P network - Google Patents

Method for guiding client nodes in P2P network to reasonably select node bandwidth, computer readable storage medium and P2P network Download PDF

Info

Publication number
CN111555900B
CN111555900B CN202010154981.0A CN202010154981A CN111555900B CN 111555900 B CN111555900 B CN 111555900B CN 202010154981 A CN202010154981 A CN 202010154981A CN 111555900 B CN111555900 B CN 111555900B
Authority
CN
China
Prior art keywords
workload
node
network
session
client
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202010154981.0A
Other languages
Chinese (zh)
Other versions
CN111555900A (en
Inventor
杜晓楠
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to CN202010154981.0A priority Critical patent/CN111555900B/en
Publication of CN111555900A publication Critical patent/CN111555900A/en
Priority to PCT/CN2021/073099 priority patent/WO2021175036A1/en
Application granted granted Critical
Publication of CN111555900B publication Critical patent/CN111555900B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0896—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms

Landscapes

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

Abstract

The invention relates to a method for guiding client nodes in a P2P network to reasonably select node bandwidth, which comprises the following steps: s1, respectively configuring service type and workload certification requirements for the server nodes in the P2P network; s2, the client node discovers the server nodes and obtains the service type, the workload certification requirement and the workload certification parameter of each discovered server node; s3, the client node selects a server node according to the self service type and generates a workload certification according to the workload certification parameter, and then submits the workload certification and sends a session requirement to the server node; s4, the server node verifies the workload proof and judges whether to establish connection with the client node based on the verification result. The invention also relates to a computer readable storage medium and a P2P network. The invention can guide the client node to select the node according to the self service, thereby reasonably distributing the node bandwidth and effectively avoiding the waste of high-quality bandwidth resources by the service which does not need high quality.

Description

Method for guiding client nodes in P2P network to reasonably select node bandwidth, computer readable storage medium and P2P network
Technical Field
The invention relates to the field of P2P networks, in particular to a method for guiding client nodes in a P2P network to reasonably select node bandwidth, a computer readable storage medium and a P2P network.
Background
A P2P network (Peer-to-Peer network), i.e., a Peer-to-Peer network, in which participants share a portion of their own hardware resources, and these shared resources provide services and content through the network and can be accessed directly by other Peer nodes without going through intermediate entities. Participants in this network are both providers and acquirers of resources, services and content.
The P2P network is widely used in the scenario requiring high availability, and since there is no centralized node, the failure of any one node in the network will not affect the normal operation of other nodes. The P2P network is usually used to store large file data, and when a large file is uploaded to the P2P network, the file is first fragmented, and at the same time, each file fragment generates a Hash, and then each fragment and the Hash are respectively stored on each P2P node. Therefore, clients of the P2P network all need to use a multi-threaded, multi-connection mode to download files in the P2P network.
Different service scenarios are sometimes compatible with the same P2P network, and some service scenarios have very high requirements on bandwidth, and it is necessary for the P2P node to limit the number of connections to provide high-quality bandwidth for only a few clients. However, some service scenarios have low bandwidth requirements, short network jitter and delay do not affect the service experience, and one P2P node can serve many nodes.
In the traditional P2P protocol, the nodes only need to connect a plurality of nodes nearest to the nodes according to the distance algorithm of KAD to start service, which can cause that the network bandwidth resources can not be allocated with planning, thereby causing that a plurality of nodes with high-quality bandwidth are occupied by a large number of nodes without high-quality bandwidth.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a method, a computer-readable storage medium, and a P2P network for guiding a client node in a P2P network to reasonably select a node bandwidth, which can guide the client node to perform node selection according to its own service, thereby reasonably allocating the node bandwidth, and effectively avoiding the waste of high-quality bandwidth resources by a service end that does not need high quality.
The technical scheme adopted by the invention for solving the technical problems is as follows: a method for guiding client nodes in a P2P network to reasonably select node bandwidth is constructed, and the method comprises the following steps:
s1, respectively configuring service type and workload certification requirements for the server nodes in the P2P network;
s2, the client node discovers the server node and obtains the service type, the workload certification requirement and the workload certification parameter of each discovered server node;
s3, the client node selects a server node according to the self service type and generates a workload certification according to the workload certification parameter, and then submits the workload certification and sends a session requirement to the server node;
s4, the server node verifies the workload proof and judges whether to establish connection with the client node based on the verification result.
In the method for guiding the client node to reasonably select the node bandwidth in the P2P network, the service types comprise session service types and communication service types, and the workload certification requirements comprise session workload certification requirements and communication workload certification requirements.
In the method for guiding a client node in a P2P network to reasonably select a node bandwidth, the step S1 includes:
s11, configuring session service type and session workload certification requirements for partial server nodes in the P2P network;
s12, configuring communication service type and communication workload certification requirements for partial server nodes in the P2P network.
In the method for guiding client nodes to reasonably select node bandwidth in P2P network according to the present invention, the step S2 further includes: the client node discovers a plurality of server nodes according to the DHT algorithm and acquires the service type, the workload certification and the workload certification parameters of each discovered server node.
In the method for guiding a client node in a P2P network to reasonably select a node bandwidth, the workload certification parameter includes: the method comprises the steps of universal unique identification code, workload certification initial hash value, session keep-alive difficulty and submission of workload certification function.
In the method for guiding client nodes to reasonably select node bandwidth in P2P network according to the present invention, the step S3 further includes:
s31, the client node selects at least one server node according to the service type of the client node, generates a first random nonce continuously based on the workload certificate initial hash value of the server node, and calculates the workload certificate by adopting the submitted workload certificate function based on the universal unique identification code, the workload certificate initial hash value and the first random nonce;
s32, repeating the step S31 until the obtained leading 0 of the workload certification meets the conversation keep-alive difficulty;
and S33, submitting the universal unique identification code, the workload certificate initial hash value, the first random nonce and the workload certificate to the server node, and submitting a session request to the server node.
In the method for guiding client nodes to reasonably select node bandwidth in P2P network according to the present invention, the step S4 further includes:
s41, the server node verifies the workload proof and judges whether to establish connection with the client node based on the verification result, if so, the step S42 is executed, otherwise, the connection with the client node is refused;
s42, the server node returns a session establishment success message to the client node, where the session establishment success message includes: session ID, session timeout time, hash value of next workload submission proof;
s43, the client node and the server node carry out data communication, and ceaselessly generate a second random nonce according to the hash value of the next submitted workload certificate, and calculate a next workload certificate according to the submitted workload certificate function based on the session ID, the hash value of the next submitted workload certificate and the second random nonce;
s44, repeating the step S43 until the obtained leading 0 of the next workload proof meets the conversation keep-alive difficulty;
s45, generating a next session workload certification message based on the next workload certification before the session timeout time, and sending the next session workload certification message to the server node, where the next session workload certification message includes: the session ID, the hash value of the next-submitted workload proof, the second nonce, and the next-submitted workload proof;
and S46, the server node verifies the next workload certification and judges whether to continue communication with the client node or not based on the verification result and the session progress condition.
In the method for guiding client nodes to reasonably select node bandwidth in P2P network according to the present invention, the step S46 further includes:
s461, the server node verifies the next workload certification, if the next workload certification is passed through the verification, step S462 is executed, otherwise, the data communication with the client is interrupted, and a notification of refusing the communication is returned;
and S462, judging whether the data communication is finished, if so, disconnecting the server node from the client and returning a notification of finishing the communication, and if not, returning to the step S43.
Another technical solution adopted by the present invention to solve the technical problem is to construct a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the method for guiding a client node in a P2P network to reasonably select a node bandwidth.
In order to solve the technical problems, the invention adopts another technical scheme that a P2P network is constructed, the P2P network comprises a client node and a server node, computer programs are stored on the client node and the server node, and when the computer programs are executed by a processor, the method for guiding the client node in the P2P network to reasonably select the node bandwidth is realized.
By implementing the method for guiding the client node to reasonably select the node bandwidth in the P2P network, the computer readable storage medium and the P2P network, the client node can be guided to select the node according to the service of the client node, so that the node bandwidth is reasonably distributed, and the waste of high-quality bandwidth resources by the service which does not need high quality is effectively avoided. Furthermore, the workload difficulty of the client is verified during connection, so that the node can be prevented from doing malicious activities, the waste of network bandwidth resources is avoided, the use of the network bandwidth resources is optimized, and the network performance of P2P is improved. Furthermore, in the data communication process, workload difficulty detection can be further performed at intervals of set time, so that network bandwidth resource waste is further performed, network bandwidth resource use is optimized, and the network performance of P2P is improved.
Drawings
The invention will be further described with reference to the accompanying drawings and examples, in which:
fig. 1 is a flowchart illustrating a first preferred embodiment of the method for guiding a client node in a P2P network to reasonably select a node bandwidth according to the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and do not limit the invention.
The invention creates a method for guiding a client node to select a server node according to business requirements in the operation process of a decentralized network. The invention does not force the client to select the server node, but the server node requires the client to give corresponding workload certification according to the bandwidth condition of the server node and the QoS type expected to be provided for the client, thereby reasonably distributing the node bandwidth and effectively avoiding the waste of high-quality bandwidth resources by the service end which does not need high quality.
The invention relates to a method for guiding client nodes in a P2P network to reasonably select node bandwidth, which comprises the following steps: s1, respectively configuring service type and workload certification requirements for the server nodes in the P2P network; s2, the client node discovers the server node and obtains the service type, the workload certification requirement and the workload certification parameter of each discovered server node; s3, the client node selects a server node according to the self service type and generates a workload certification according to the workload certification parameter, and then submits the workload certification and sends a session requirement to the server node; s4, the server node verifies the workload proof and judges whether to establish connection with the client node based on the verification result.
Fig. 1 is a flowchart illustrating a first preferred embodiment of the method for guiding a client node in a P2P network to reasonably select a node bandwidth according to the present invention. As shown in fig. 1, in step S1, the server nodes in the P2P network are configured with traffic type and workload certification requirements, respectively. In a preferred embodiment of the present invention, the service types include a session service type and a communication service type, and the workload certification requirement includes a session workload certification requirement and a communication workload certification requirement, so the step S1 includes: s11, configuring the conversation service type and the conversation workload certification requirement for the partial server nodes in the P2P network; s12, configuring communication service type and communication workload certification requirements for partial server nodes in the P2P network.
The concrete description is as follows: the service types configured at the server node include a Session service type (Session type) and a communication service type (Traffic type), wherein the Session service type indicates a service that needs to occupy a longer time of bandwidth and keep the bandwidth above at least a certain value, for example: generally for voice and video services. While the communication service type is mainly used for services with low bandwidth requirements and without the need to connect services that maintain stable bandwidth for a long time, such as: ordinary text chatting, small file transmission and the like. Of course, in other preferred embodiments of the present invention, other service types may also be set. At the same time, the server node configures workload certification requirements for each traffic type. In a preferred embodiment of the present invention, the workload certification requirements include workload certification requirements needed to initiate a business. In a further preferred implementation of the invention, the workload proof requirements may also comprise workload proof requirements for maintaining a service. The workload required to initiate and maintain a session traffic type proves to be high, while the workload required to initiate and maintain a traffic type proves to be low.
Returning now to fig. 1, in step S2, the client node discovers the server nodes and obtains the traffic type, workload proof requirements, and workload proof parameters for each discovered server node. In a preferred embodiment of the invention, the client node discovers a plurality of server nodes according to the DHT algorithm and obtains the service type, the workload proof and the workload proof parameters of each discovered server node. Preferably, the workload certification parameters include: the method comprises the steps of universal unique identification code, workload certification initial hash value, session keep-alive difficulty and submission of workload certification function. In a further preferred embodiment of the invention, the workload certification parameter time to failure is also included.
Returning now to fig. 1, in step S3, the client node selects a server node according to its service type and generates a workload proof according to the workload proof parameter, and then submits the workload proof and sends a session request to the server node. In a preferred embodiment of the present invention, the step S3 further includes: s31, the client node selects at least one server node according to the service type of the client node, generates a first random nonce continuously based on the workload certificate initial hash value of the server node, and calculates the workload certificate by adopting the submitted workload certificate function based on the universal unique identification code, the workload certificate initial hash value and the first random nonce; s32, repeating the step S31 until the obtained leading 0 of the workload certification meets the conversation keep-alive difficulty; and S33, submitting the universal unique identification code, the workload certificate initial hash value, the first random nonce and the workload certificate to the server node, and submitting a session request to the server node.
The specific examples are illustrated below: the workload certification parameters for each server node include: universal unique identification code S and workload proof initial hash value h 0 (ii) a Conversation keep-alive difficulty D k The workload proving function F () is submitted. Preferably, the method can further comprise the step of judging the session timeout time T s And is used to limit the time for submitting the proof of workload, although it is also possible to do so without limitation.
After the client node selects at least one server node according to the service type of the client node, the client node proves the initial hash value h according to the workload given by the server node 0 Continuously generating a first random nonce, and simultaneously using the submitted workload certification function given by the server according to the universal unique identification code S; workload proof initial hash value h 0 First random nonce calculates said proof of workload P 0 ：P 0 ＝F(S+h 0 + nonce); until the workload proof P 0 Satisfies the session keep-alive difficulty D k Until now. Then, a session workload certification message is submitted to the server to establish a session, wherein the session workload certification message comprises the following key parameters: a universal unique identification code S; workload proof initial hash value h 0 (ii) a The first random nonce value; said workload certificate P 0 。
Returning now to fig. 1, in step S4, the server node verifies the workload proof and determines whether to establish a connection with the client node based on the verification result. In a further preferred embodiment of the present invention, the step S4 further includes: s41, the server node verifies the workload proof and judges whether to establish connection with the client node based on the verification result, if so, the step S42 is executed, otherwise, the connection with the client node is refused to be established; s42, the server node returns a session establishment success message to the client node, where the session establishment success message includes: the session ID, the session timeout time and the hash value of the next submitted workload certificate; s43, the client node and the server node carry out data communication, and ceaselessly generate a second random nonce according to the hash value of the next-time submitted workload proof, and calculate a next-time workload proof according to the submitted workload proof function based on the session ID, the hash value of the next-time submitted workload proof and the second random nonce; s44, repeating the step S43 until the obtained leading 0 of the next workload proof meets the conversation keep-alive difficulty; s45, generating a next session workload certification message based on the next workload certification before the session timeout time, and sending the next session workload certification message to the server node, where the next session workload certification message includes: the session ID, the hash value of the next-submitted workload proof, the second nonce, and the next-submitted workload proof; and S46, the server node verifies the next workload certification and judges whether to continue communication with the client node or not based on the verification result and the session progress condition.
The specific examples are illustrated below: the server node receives several key parameters including: universal unique identification code S and workload proof initial hash value h 0 The first random nonce value, the workload proof P 0 After the session workload attestation message, verifying the workload attestation P 0 Whether the request is satisfied, if so, returning a session establishment success message to the client, wherein the session establishment success message comprises: session IDS 1 Session timeout time T s1 The next submitting workerCertified quantity hash value h 1 。
After receiving the session establishment success message, the client node starts data communication, and meanwhile, the hash value h of the next submitted workload certification is used 1 Continuously generating a second random nonce and calculating a next workload proof P using a commit workload proof function F () 1 ：P 1 ＝F(S 1 +h 1 + nonce) and at said session timeout time T s1 Prior proof of P based on the next workload 1 And generating a next session workload certification message and sending the next session workload certification message to the server node, wherein the server node verifies the next workload certification, judges whether the data communication is finished or not if the next session workload certification passes the verification, and otherwise, interrupts the data communication with the client and returns a notice of refusing the communication. If the data communication has ended, the server node is disconnected from the client and a notification of the end of communication is returned. If the data communication is still over, then the communication data continues to be propagated, and the generation and verification of the next workload proof described above is repeatedly performed until the communication is over or the verification fails.
In the preferred embodiment, the message type is defined as follows.
The message type of the client NODE discovery server NODE is 0, which is indicated as GET _ NODE _ INFO _ REQ, and is mainly used for acquiring information of other NODEs in the P2P network, and the message type includes the following fields: t message type.
The message type of the client side acquisition server NODE is 1, which is indicated as GET _ NODE _ INFO _ RSP, and is mainly used for returning information of the server NODE in the P2P network, and the message contains the following fields: a t message type; i-node information, wherein the node information comprises: node IP, node PORT, node support Session type s1, s2, i.e. Session Traffic type (Session type) and Traffic type (Traffic type).
The message type of SESSION establishment is 2, which is denoted as SESSION _ INFO _ REQ, and is mainly used for establishing a SESSION between a client node and a server node and then performing data interaction, and the message type comprises the following fields: a t message type; s session type s1| s 2.
The message type of the server node is 3, which is denoted as SESSION _ INFO _ RSP, and is used for the server node to show the service type of the initiated SESSION, the workload certification requirement and the workload certification parameter to the client node, and the message type includes the following fields; u workload attestation parameters; o workload proof parameter failure time.
The message type of the client node initiating the SESSION is 4, which is denoted as START _ SESSION _ REQ, after receiving the message of the server node, the client node STARTs to perform workload certification calculation based on workload certification parameters, and after the workload certification is calculated, the client node initiates the SESSION request, which comprises the following fields: t message type, u universal unique identification code; p workload proofs; n generates a nonce value for the proof of workload.
The message type of the server reply to the SESSION is 5, denoted START _ SESSION _ RSP: t. message type, s session ID, r reject the session reason (if not, this field is not included).
The message type of DATA communication is 6, denoted as SESSION _ DATA, and contains the following fields: t message type, s session ID, d data payload.
By implementing the method for guiding the client node to reasonably select the node bandwidth in the P2P network, the client node can be guided to select the node according to the service of the client node, so that the node bandwidth is reasonably distributed, and the waste of high-quality bandwidth resources by the service end which does not need high quality is effectively avoided. Furthermore, the workload difficulty of the client is verified during connection, so that the node can be prevented from doing malicious activities, the waste of network bandwidth resources is avoided, the use of the network bandwidth resources is optimized, and the network performance of P2P is improved. Furthermore, in the data communication process, workload difficulty detection can be further performed at intervals of set time, so that network bandwidth resource waste is further performed, network bandwidth resource use is optimized, and the network performance of P2P is improved.
The invention also relates to a computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the method of directing client nodes in a P2P network to make a reasonable selection of a node bandwidth.
The invention also relates to a P2P network, comprising client nodes and server nodes, wherein the client nodes and the server nodes are stored with computer programs, and the programs realize the method for guiding the client nodes in the P2P network to reasonably select node bandwidth when being executed by a processor.
The computer readable storage medium for guiding the client node to reasonably select the node bandwidth in the P2P network and the P2P network can guide the client node to select the node according to the service of the client node, thereby reasonably distributing the node bandwidth and effectively avoiding the waste of high-quality bandwidth resources by the service which does not need high quality. Furthermore, the workload difficulty of the client is verified during connection, so that the node can be prevented from doing malicious activities, the waste of network bandwidth resources is avoided, the use of the network bandwidth resources is optimized, and the network performance of P2P is improved. Furthermore, in the data communication process, workload difficulty detection can be further performed at intervals of set time, so that network bandwidth resource waste is further performed, network bandwidth resource use is optimized, and the network performance of P2P is improved.
Accordingly, the present invention can be realized in hardware, software, or a combination of hardware and software. The present invention can be realized in a centralized fashion in at least one computer system, or in a distributed fashion where different elements are spread across several interconnected computer systems. Any kind of computer system or other apparatus adapted for carrying out the methods of the present invention is suited. A typical combination of hardware and software could be a general purpose computer system with a computer program that, when being loaded and executed, controls the computer system such that it carries out the methods described herein.
The present invention may also be implemented by a computer program product, comprising all the features enabling the implementation of the methods of the invention, when loaded in a computer system. The computer program in this document refers to: any expression, in any programming language, code or notation, of a set of instructions intended to cause a system having an information processing capability to perform a particular function either directly or after either or both of the following: a) conversion to other languages, codes or symbols; b) reproduced in a different format.
While the invention has been described with reference to specific embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted without departing from the scope of the invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the invention without departing from its scope. Therefore, it is intended that the invention not be limited to the particular embodiment disclosed, but that the invention will include all embodiments falling within the scope of the appended claims.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents and improvements made within the spirit and principle of the present invention are intended to be included within the scope of the present invention.

Claims (7)

1. A method for directing client nodes in a P2P network to rationally select node bandwidth, comprising:
s1, respectively configuring service type and workload certification requirements for the server nodes in the P2P network;
s2, the client node discovers the server node and obtains the service type, the workload certification requirement and the workload certification parameter of each discovered server node;
s3, the client node selects a server node according to the self service type and generates a workload certification according to the workload certification parameter, and then submits the workload certification and sends a session requirement to the server node;
s4, the server node verifies the workload certificate and judges whether to establish connection with the client node based on the verification result;
the step S2 further includes: the client node discovers a plurality of server nodes according to a DHT algorithm and acquires the service type, the workload certification requirement and the workload certification parameter of each discovered server node; the workload certification parameters include: the method comprises the following steps of identifying a universal unique identification code, a workload certification initial hash value, a session keep-alive difficulty and a submitted workload certification function;
the step S4 further includes:
s41, the server node verifies the workload proof and judges whether to establish connection with the client node based on the verification result, if so, the step S42 is executed, otherwise, the connection with the client node is refused to be established;
s42, the server node returns a session establishment success message to the client node, where the session establishment success message includes: the session ID, the session timeout time and the hash value of the next submitted workload certificate;
s43, the client node and the server node carry out data communication, and ceaselessly generate a second random nonce according to the hash value of the next-time submitted workload proof, and calculate a next-time workload proof according to the submitted workload proof function based on the session ID, the hash value of the next-time submitted workload proof and the second random nonce;
s44, repeating the step S43 until the obtained leading 0 of the next workload proof meets the conversation keep-alive difficulty;
s45, generating a next session workload certification message based on the next workload certification before the session timeout time, and sending the next session workload certification message to the server node, where the next session workload certification message includes: the session ID, the hash value of the next-submitted workload proof, the second nonce, and the next-submitted workload proof;
and S46, the server node verifies the next workload certification and judges whether to continue communication with the client node or not based on the verification result and the session progress condition.
2. The method of directing client nodes in a P2P network to rationally select node bandwidths according to claim 1, wherein said traffic types include session traffic types and communication traffic types, and wherein said workload certification requirements include session workload certification requirements and communication workload certification requirements.
3. The method for guiding client nodes in a P2P network to rationally select a node bandwidth as claimed in claim 2, wherein the step S1 comprises:
s11, configuring the conversation service type and the conversation workload certification requirement for the partial server nodes in the P2P network;
s12, configuring communication service type and communication workload certification requirements for partial server nodes in the P2P network.
4. The method for guiding client nodes to rationally select node bandwidth in a P2P network as claimed in claim 3, wherein said step S3 further comprises:
s31, the client node selects at least one server node according to the service type of the client node, generates a first random nonce continuously based on the workload certificate initial hash value of the server node, and calculates the workload certificate by adopting the submitted workload certificate function based on the universal unique identification code, the workload certificate initial hash value and the first random nonce;
s32, repeating the step S31 until the obtained leading 0 of the workload certification meets the conversation keep-alive difficulty;
s33, submitting the universal unique identification code, the workload certificate initial hash value, the first random nonce and the workload certificate to the server node, and submitting a session request to the server node.
5. The method for guiding client nodes in a P2P network to rationally select a node bandwidth as claimed in claim 4, wherein said step S46 further comprises:
s461, the server node verifies the next workload proof, if the next workload proof passes the verification, the step S462 is executed, otherwise, the data communication with the client node is interrupted, and a notice of refusing the communication is returned;
and S462, judging whether the data communication is finished, if so, disconnecting the server node from the client node and returning a notification of finishing the communication, and if not, returning to the step S43.
6. A computer-readable storage medium, on which a computer program is stored, which program, when being executed by a processor, carries out a method of directing a client node in a P2P network to rationally select a node bandwidth according to any of claims 1-5.
7. A P2P network comprising client nodes and server nodes having computer programs stored thereon, wherein the programs when executed by a processor implement a method of directing client nodes in a P2P network to rationally select node bandwidths according to any of claims 1-5.
CN202010154981.0A 2020-03-06 2020-03-06 Method for guiding client nodes in P2P network to reasonably select node bandwidth, computer readable storage medium and P2P network Active CN111555900B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN202010154981.0A CN111555900B (en) 2020-03-06 2020-03-06 Method for guiding client nodes in P2P network to reasonably select node bandwidth, computer readable storage medium and P2P network
PCT/CN2021/073099 WO2021175036A1 (en) 2020-03-06 2021-01-21 Methods for preventing client node from invalidly occupying a connection resource for a long time and for guiding client node to reasonably select node bandwidth in p2p network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010154981.0A CN111555900B (en) 2020-03-06 2020-03-06 Method for guiding client nodes in P2P network to reasonably select node bandwidth, computer readable storage medium and P2P network

Publications (2)

Publication Number Publication Date
CN111555900A CN111555900A (en) 2020-08-18
CN111555900B true CN111555900B (en) 2022-09-20

Family

ID=72008920

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010154981.0A Active CN111555900B (en) 2020-03-06 2020-03-06 Method for guiding client nodes in P2P network to reasonably select node bandwidth, computer readable storage medium and P2P network

Country Status (1)

Country Link
CN (1) CN111555900B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021175036A1 (en) * 2020-03-06 2021-09-10 杜晓楠 Methods for preventing client node from invalidly occupying a connection resource for a long time and for guiding client node to reasonably select node bandwidth in p2p network

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101102310A (en) * 2007-07-25 2008-01-09 中国科学院沈阳计算技术研究所有限公司 SIP soft switching system supporting P2P media transmission and its implementation method

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103209196A (en) * 2012-01-12 2013-07-17 中兴通讯股份有限公司 Portal access method and device
US10116693B1 (en) * 2016-06-28 2018-10-30 EMC IP Holding Company LLC Server using proof-of-work technique for hardening against denial of service attacks
CN107688733B (en) * 2017-07-25 2020-03-06 深圳壹账通智能科技有限公司 Service interface calling method, device, user terminal and readable storage medium
CN110855603B (en) * 2018-12-24 2021-11-09 互联网域名系统北京市工程研究中心有限公司 Method for preventing DoS attack based on block chain technology

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101102310A (en) * 2007-07-25 2008-01-09 中国科学院沈阳计算技术研究所有限公司 SIP soft switching system supporting P2P media transmission and its implementation method

Also Published As

Publication number Publication date
CN111555900A (en) 2020-08-18

Similar Documents

Publication Publication Date Title
US11432347B2 (en) Peer to peer networking and sharing systems and methods
US11362940B2 (en) Method and apparatus for determining identification information about cross-domain path, and storage medium
KR101560601B1 (en) Policy service system architecture for sessions created using stun
US9038162B2 (en) Creating secure interactive connections with remote resources
US7350227B2 (en) Cryptographic peer discovery, authentication, and authorization for on-path signaling
US20070078986A1 (en) Techniques for reducing session set-up for real-time communications over a network
JP6597802B2 (en) Group formation control in multi-group peer-to-peer networks
US8102846B2 (en) Method and apparatus for managing a multicast tree using a multicast tree manager and a content server
US10411994B2 (en) Multi-link convergence method, server, client, and system
US20200169695A1 (en) Video conference multi-point control method and device, storage medium and computer apparatus
US20110078312A1 (en) Method and system for monitoring incoming connection requests in a Peer-to-Peer network
WO2023000936A1 (en) Data processing method, function device and readable storage medium
CN111064742B (en) Method, device and related equipment for realizing intranet access based on network agent
KR102490698B1 (en) Communication method for selecting a network slice / service and a communication device performing the same
CN114499989A (en) Security device management method and device
CN111555900B (en) Method for guiding client nodes in P2P network to reasonably select node bandwidth, computer readable storage medium and P2P network
CN111541732B (en) Method for avoiding invalid occupation of connection resources by client in P2P network, computer readable storage medium and P2P network
CN108900584B (en) Data transmission method and system for content distribution network
JP2004265419A (en) Method and system for expected delay allocation of resource
WO2021175036A1 (en) Methods for preventing client node from invalidly occupying a connection resource for a long time and for guiding client node to reasonably select node bandwidth in p2p network
US20110302245A1 (en) Realization method and system for participating in a predefined group session
US11272001B1 (en) Port prediction for peer-to-peer communications
US8627505B2 (en) Technique for controlling access by a client entity to a service
US20220400229A1 (en) Conference creation method, terminal, server end, and storage medium
EP2924622A1 (en) Method of establishing a data connection and path computation element

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
REG Reference to a national code

Ref country code: HK

Ref legal event code: DE

Ref document number: 40027004

Country of ref document: HK

GR01 Patent grant
GR01 Patent grant