CN111682961A - Method for eliminating low-bandwidth nodes in I2P network, computer readable storage medium and I2P network - Google Patents
Method for eliminating low-bandwidth nodes in I2P network, computer readable storage medium and I2P network Download PDFInfo
- Publication number
- CN111682961A CN111682961A CN202010422166.8A CN202010422166A CN111682961A CN 111682961 A CN111682961 A CN 111682961A CN 202010422166 A CN202010422166 A CN 202010422166A CN 111682961 A CN111682961 A CN 111682961A
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- test
- bandwidth
- network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- 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/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- 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/0803—Configuration setting
- H04L41/0823—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
-
- 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/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Environmental & Geological Engineering (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a method for eliminating low-bandwidth nodes in an I2P network, which comprises the following steps: preprocessing each newly joined I2P node and synchronizing messages for each newly joined I2P node; selecting a test initiating node according to a set rule, and selecting a first part I2P of I2P nodes closest to the test initiating node as a test node and a second part I2P of the test initiating node as a tested node respectively; each testing node tests the bandwidth of the tested node, broadcasts the testing result obtained by the testing node and collects the testing results of other testing nodes; and screening the tested nodes needing to be deleted based on the test results of all the test nodes and deleting the tested nodes. The invention also relates to computer readable storage media and I2P networks. The invention avoids the problem that the high-delay node affects the performance of the whole network by rejecting the low-bandwidth node.
Description
Technical Field
The invention relates to the field of I2P networks, in particular to a method for eliminating low-bandwidth nodes in an I2P network, a computer readable storage medium and an I2P network.
Background
Anonymous communication technology is widely used today to protect privacy, especially for government, military and other security-related organizations and enterprises. The most widely used early anonymous communication technology was the onion network. The onion network well solves the problems of encryption and anti-tracking of data streams, but the onion network depends on a directory server, once the directory server breaks down, the whole network can be in an unavailable situation, and in addition, a plurality of relay servers randomly selected by the onion network possibly have the situation that individual relay bandwidth resources are low, so that the network delay is serious.
The advent of I2P solved the problem of onion network relying on centralized directory servers, I2P solved the problem of onion network directory server centralization by introducing a Distributed Hash Table (DHT), which decentralizes the process of obtaining relay servers from directory servers, and nodes randomly connecting to data in any DHT network can recursively obtain relay servers near each queried node. However, the problem that individual relay bandwidth resources in the onion network are too low is not solved by I2P, a malicious attacker can forge a large number of relay nodes in a witch attack manner, and each relay node intentionally delays forwarding of a message, thereby affecting the performance of the entire I2P network.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a method for eliminating low bandwidth nodes in an I2P network, a computer readable storage medium and an I2P network, which can eliminate delayed nodes through bandwidth testing, thereby avoiding high delay nodes from affecting the performance of the entire I2P network, and thus solving the problems of unstable bandwidth and excessively high delay in the I2P network.
The technical scheme adopted by the invention for solving the technical problems is as follows: a method for eliminating low-bandwidth nodes in an I2P network is constructed, and comprises the following steps:
s1, preprocessing each newly added I2P node and synchronizing information for each newly added I2P node;
s2, selecting a test initiating node according to a set rule, and selecting a first part of I2P nodes in the I2P nodes closest to the test initiating node as test nodes and a second part of I2P nodes as tested nodes respectively by the test initiating node;
s3, each testing node tests the bandwidth of the tested node, broadcasts the testing result obtained by the testing node and collects the testing results of other testing nodes;
and S4, screening the tested nodes needing to be deleted based on the test results of all the test nodes and deleting the tested nodes.
In the method of rejecting low bandwidth nodes in I2P network, the step S1 further includes:
s11, carrying out node discovery processing on the newly added I2P node;
and S12, performing inter-node state confirmation processing on the newly added I2P node after the node discovery processing.
In the method of rejecting low bandwidth nodes in I2P network, the step S11 further includes:
s111, connecting the newly added I2P node to a seed node, and then requiring the seed node to give an I2P node closest to the seed node;
and S112, inquiring the second closest node from the I2P node closest to the node, and recursively inquiring for a plurality of times until a set number of I2P found nodes are obtained.
In the method of rejecting low bandwidth nodes in I2P network, the step S12 further includes:
s121, the newly added I2P node selects a set number of nearest nodes from the I2P discovery nodes according to a set rule, and sends a handshake message to the nearest nodes;
s122, the nearest node receiving the handshake message verifies the handshake message and returns a handshake confirmation message based on a verification result;
s123, the newly added I2P node synchronizes the latest message based on the handshake confirmation message.
In the method of rejecting low bandwidth nodes in I2P network, the step S2 further includes:
s21, sorting asc of public keys of a plurality of I2P nodes, and selecting an I2P node with an index value as a set value in the asc sorting as a test initiating node;
s22, selecting one part of the nearest I2P nodes from the first test node as the tested nodes, and selecting the other part of the nearest I2P nodes from the first test node as the test nodes.
In the method of rejecting low bandwidth nodes in I2P network, the step S3 further includes:
s31, randomly screening a block hash set generated in the past by the test initiating node, and broadcasting the block hash set to the test node;
s32, each testing node calls local storage information according to the block hash set, then splicing is carried out according to the sequence so as to calculate the sum of the number of bytes occupied by all blocks, and then the sum is divided by the lowest bandwidth so as to obtain the longest return time;
s33, each testing node sends a request to the tested node, and generates a testing result according to whether the tested node returns all blocks within the longest return time;
and S34, each testing node broadcasts the testing result obtained by the testing node to other testing nodes and collects the testing results of other testing nodes.
In the method for eliminating low-bandwidth nodes in the I2P network, in the step S33, the test result includes the block hash set, the public key of the node to be tested and its corresponding IP port, and the bandwidth test result.
In the method of rejecting low bandwidth nodes in I2P network, the step S4 further includes:
s41, aiming at each tested node, judging whether a set number of tested nodes consider the tested nodes as low-bandwidth nodes, if so, executing the step S42, otherwise, not executing the subsequent operation;
and S42, isolating or deleting the I2P node which is finally determined as the low-bandwidth node.
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 rejecting low-bandwidth nodes in an I2P network.
In order to solve the technical problems, the invention adopts another technical scheme that an I2P network is constructed, the I2P 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 rejecting low-bandwidth nodes in the I2P network is realized.
By implementing the method for rejecting the low-bandwidth nodes in the I2P network, the computer-readable storage medium and the I2P network, the delayed nodes can be rejected through bandwidth test, so that the situation that the high-delay nodes affect the performance of the whole I2P network is avoided, and the problems of unstable bandwidth and over-high delay in the I2P network are solved.
Drawings
The invention will be further described with reference to the accompanying drawings and examples, in which:
FIG. 1 is a schematic flow chart of a first preferred embodiment of the method for eliminating low bandwidth nodes in an I2P network;
fig. 2 is a flowchart illustrating a first preferred embodiment of the method for eliminating low bandwidth nodes in an I2P network 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 are not intended to limit the invention.
The invention relates to a method for eliminating low-bandwidth nodes in an I2P network, which comprises the following steps: preprocessing each newly joined I2P node and synchronizing messages for each newly joined I2P node; selecting a test initiating node according to a set rule, and selecting a first part I2P of I2P nodes closest to the test initiating node as a test node and a second part I2P of the test initiating node as a tested node respectively; each testing node tests the bandwidth of the tested node, broadcasts the testing result obtained by the testing node and collects the testing results of other testing nodes; and screening the tested nodes needing to be deleted based on the test results of all the test nodes and deleting the tested nodes. According to the invention, the low-delay nodes are removed through decentralized periodic bandwidth test among DHT nodes in the I2P network, and when a communication initiator selects a relay node, the nodes which do not pass the bandwidth test can not be provided for the communication initiator, so that the problem that the high-delay nodes cause the performance of the whole network to be affected is avoided, and the problems of unstable bandwidth and excessively high delay in the I2P network are further solved.
Fig. 1 is a flowchart illustrating a first preferred embodiment of the method for eliminating low bandwidth nodes in an I2P network according to the present invention. As shown in fig. 1, in step S1, each newly joined I2P node is preprocessed and messages are synchronized for each newly joined I2P node. In a preferred embodiment of the present invention, the preprocessing process includes a node discovery process and an inter-node state process.
The node discovery process further includes connecting the newly joined I2P node to a seed node, and then asking the seed node to give the closest I2P node to itself; inquiring the I2P node closest to the node, and repeating the inquiry for a plurality of times until acquiring a set number of I2P discovery nodes. The distance between nodes can be calculated according to a classical DHT distance algorithm. Here, the maximum number of discovered nodes is 1024.
The inter-node state processing includes, for the newly joined I2P node after the node discovery processing is finished, selecting a set number of nearest nodes from the I2P discovery nodes according to a set rule, and sending a handshake message to the nearest nodes. It is proposed here to select a small number of nodes, for example N. The number can be set according to actual needs. Here, the handshake message may contain the latest message received by itself. The closest node receiving the handshake message verifies the handshake message and returns a handshake confirmation message based on the verification result. The newly joined I2P node synchronizes the latest messages based on the handshake confirmation message. For example, if the latest message sent by the opposite terminal is found to be different from the timestamp of the latest message of the opposite terminal by no more than 120 seconds, replying to the confirmation message and returning the latest message of the opposite terminal.
In step S2, a test initiating node is selected according to a set rule, and the test initiating node selects a first part I2P of the I2P nodes closest to itself as a test node and a second part I2P node as a tested node respectively.
In the preferred embodiment of the invention, asc sorting of public keys of a plurality of I2P nodes is carried out, and an I2P node with an index value of a set value in the asc sorting is selected as a test initiating node. For example, the index value index is just the period Periodic% N, and any suitable index value of the I2P node may be selected. The selection can be made by those skilled in the art according to the actual situation. Selecting a portion of the nearest I2P nodes to the first test node as tested nodes and selecting another portion of the nearest I2P nodes to the first test node as test nodes. For example, M nodes among the N nodes closest to the node can be randomly selected as tested nodes, and the remaining 3F +1 nodes can be used as test nodes to test the bandwidth of the tested nodes. Here, the values of N, M, and F may be set according to the size and the computing capability of the I2P network, as long as 3F +1+ M < N is satisfied.
In step S3, each of the test nodes tests the bandwidth of the node under test, broadcasts the test result obtained by itself, and collects the test results of other test nodes. In a preferred embodiment of the present invention, the test initiating node randomly filters a set of hash of the chunks generated in the past and broadcasts the set of hash of the chunks to the test node. And each test node calls local storage information according to the block hash set, then splices the local storage information according to the sequence to calculate the sum of the number of bytes occupied by all the blocks, and then divides the sum by the lowest bandwidth to obtain the longest return time. And each testing node sends a request to the tested node and generates a testing result according to whether the tested node returns all the blocks within the longest return time. Each test node broadcasts the test result obtained by the test node to other test nodes and collects the test results of other test nodes. Preferably, the test result includes the block hash set, the public key of the tested node and its corresponding IP port, and the bandwidth test result.
In step S4, the nodes to be tested that need to be deleted are screened and deleted based on the test results of all the test nodes. Preferably, for each node under test, it is determined whether a set number of test nodes consider it to be a low bandwidth node, if the I2P node that is ultimately determined to be a low bandwidth node is isolated or deleted. For example, if a test node with 2/3 considers the tested node to be a low bandwidth node, it is isolated or deleted, and for example, 1/2 or other values may be selected.
The invention adopts a block chain common identification mode to solve the problem of bandwidth test in an I2P network, and estimates the longest time required for sending blocks under the condition of the lowest bandwidth by periodically selecting Hash of a group of blocks and according to the number of bytes occupied by the blocks, and if the time required for sending the blocks by a tested node exceeds the longest time, the bandwidth test is not over, and the bandwidth test is kicked out of the I2P network.
In a preferred embodiment of the invention, the contents of the tiles in the blockchain may be customized by the implementer, but in any case the contents of the tiles contain a tile Hash. And the whole block can be completely acquired through the block Hash. Preferably, every time a period T elapses, the test initiating node in the PBFT first selects a part of nodes to perform bandwidth test, which can randomly select a Hash of a group of blocks, and then evaluates how long it takes to send the blocks under the condition of the lowest bandwidth. And then the test initiating node sends the tested node and the Hash of the block for testing to the test point, and then waits for other test points to test the bandwidth of the tested node. The test node will ask the tested node to send the designated blocks and test their time to return to these blocks, if it is lower than the longest required time, fill the test result with the pass, otherwise fill the test result with the fail. For the tested node, if the tested node exceeding 2/3 considers that the bandwidth speed is lower than the minimum bandwidth requirement, the node is considered to use the non-compliant bandwidth node
By implementing the method for eliminating the low-bandwidth nodes in the I2P network, the delayed nodes can be eliminated through bandwidth test, so that the situation that the high-delay nodes accumulate the performance of the whole I2P network is avoided, and the problems of unstable bandwidth and over-high delay in the I2P network are solved.
Fig. 2 is a flowchart illustrating a first preferred embodiment of the method for eliminating low bandwidth nodes in an I2P network according to the present invention. The invention is further described below in connection with fig. 2.
First, in the present embodiment, parameters are defined and explained as follows. Those skilled in the art will appreciate that the selection of specific values for the parameters herein is merely illustrative and that any other suitable values may be used by those skilled in the art.
F number of Byzantine nodes (suggested value is 7)
M number of tested nodes (the suggested value is not more than 10)
N P2P the nearest node number N is 3F +1+ M (32 is suggested)
B minimum bandwidth value (value according to service type)
S number of blocks selected each time
L longest return time
Period of period (starting from 0)
R Bandwidth test result (1 pass 0 fail)
C bandwidth final confirmation result (1 does not pass 0, and is obtained after collecting bandwidth test result R of other test nodes).
The identity of each I2P node in the I2P network at each test cycle may define and function to define the test initiating node as follows: the system is used for initiating a test and broadcasting a test result;
the tested node: the node of the tested bandwidth needs to return appointed data within a specified time to prove that the bandwidth of the node meets the minimum requirement;
testing the nodes: and testing the tested node, and broadcasting and confirming the test result.
After each newly-added I2P node enters the I2P network, the newly-added I2P node is firstly connected to the seed node, then the seed node is required to give the node closest to the seed node, and the distance between the nodes can be calculated according to a classic DHT distance algorithm. After receiving the nearest node given by the seed node, continuously inquiring the nearest node for the second nearest node, and repeating the inquiry for a plurality of times until obtaining enough nodes, wherein the maximum number of the discovered nodes is 1024.
After the nodes are found, the nodes are screened, a small number of nodes closest to the nodes are selected according to a DHT algorithm, N nodes closest to the nodes are selected, then the nodes closest to the nodes are connected, handshake messages are sent, the handshake messages comprise messages recently received by the nodes, and the handshake messages are added. And the opposite terminal checks the identity, and if the latest message sent by the opposite terminal is found and the time difference between the latest message and the timestamp of the latest message is not more than 120 seconds, replying a confirmation message and returning the latest message. After receiving the handshake confirmation, if the message of the local terminal is found to be different from the message of the remote terminal, the latest message is synchronized to the opposite terminal.
After entering the test, the test initiating node needs to be confirmed first. Firstly, the node judges whether the node is qualified to initiate the test of the current round, the simplest method is to perform asc sequencing on the node and public keys of all found N nodes, and if the index value index of the node in the asc sequencing is found to be exactly the period Periodic% N, the node can become the test initiating node of the test of the current round. After the identity of the test initiating node is confirmed, M nodes in the N nodes nearest to the test initiating node are randomly screened to serve as tested nodes, and the rest 3F +1 nodes serve as test nodes to test the bandwidth of the tested nodes.
After the tested node of the number is selected, the test initiating node starts to randomly screen the block Hash [ h ] generated in the past1,h2,h3,h4,h5]And will [ h ]1,h2,h3,h4,h5]Broadcast to test node P1,P2,…,P10]. The test node firstly confirms whether the test initiating node qualifies for initiating the test, and then according to the requirement of the test initiating node [ h ]1,h2,h3,h4,h5]The corresponding messages stored locally are taken out and then are spliced and calculated according to the sequenceThe sum of the number of bytes occupied for all blocks is then divided by the minimum bandwidth requirement B to get the longest return time L. Of course, in other simplified embodiments of the present invention, qualification tests may not be performed, and their qualifications may be defaulted.
And then the test node sends a request to the tested node, if the data of all the blocks in the tested node L is returned to the test node, the test node considers that the bandwidth of the tested node meets the requirement, and sets R to be 1. If the maximum return time L is exceeded, R is set to 0.
After the test nodes finish testing all the tested nodes, the test nodes begin to broadcast test results to the rest nodes in the 3F +1 nodes nearest to the test nodes, and the test results comprise: block Hash set [ h ]1,h2,h3,h4,h5](ii) a Public key P of tested node1,P2,…,P10]Port and corresponding IP; bandwidth test result collection
And then, performing secondary confirmation on the test result, namely broadcasting the test result set of the test node by the test node, starting to collect the test result sets of other test nodes, performing statistical confirmation on a single tested node, broadcasting the final test confirmation result to other nodes if the 2F test node exceeding the single tested node considers that the bandwidth is lower than the minimum requirement, and removing the failed tested node from the I2P network. The final test validation results include: block Hash set [ h ]1,h2,h3,h4,h5](ii) a Public key P of tested node1,P2,…,P10]Port and corresponding IP; final test result collection of bandwidths
For nodes that are dropped from the I2P network, when the client establishes a path, its IP: Port will not be broadcast to the client to prevent its bandwidth from becoming a bottleneck for I2P network communications.
Therefore, the invention solves the problem of bandwidth test in the I2P network by means of block chain consensus, by periodically selecting hashes of a group of blocks, and estimating the longest time required for sending the blocks under the condition of the lowest bandwidth according to the number of bytes occupied by the blocks, if the time required for sending the blocks by the tested node exceeds the longest time, the bandwidth test is not performed, and the tested node is kicked out of the I2P network.
By implementing the method for eliminating the low-bandwidth nodes in the I2P network, the delayed nodes can be eliminated through bandwidth test, so that the situation that the high-delay nodes accumulate the performance of the whole I2P network is avoided, and the problems of unstable bandwidth and over-high delay in the I2P network are solved.
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 rejecting low bandwidth nodes in an I2P network.
The invention also relates to an I2P network, comprising a client node and a server node, wherein the client node and the server node are stored with computer programs, and the programs are executed by a processor to realize the method for eliminating the low-bandwidth nodes in the I2P network.
By implementing the computer-readable storage medium and the I2P network, delayed nodes can be eliminated through bandwidth test, so that the performance of the whole I2P network is prevented from being affected by high-delay nodes, and the problems of unstable bandwidth and excessively high delay in the I2P network are solved.
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 (10)
1. A method for eliminating low-bandwidth nodes in an I2P network is characterized by comprising the following steps:
s1, preprocessing each newly added I2P node and synchronizing information for each newly added I2P node;
s2, selecting a test initiating node according to a set rule, and selecting a first part of I2P nodes in the I2P nodes closest to the test initiating node as test nodes and a second part of I2P nodes as tested nodes respectively by the test initiating node;
s3, each testing node tests the bandwidth of the tested node, broadcasts the testing result obtained by the testing node and collects the testing results of other testing nodes;
and S4, screening the tested nodes needing to be deleted based on the test results of all the test nodes and deleting the tested nodes.
2. The method for eliminating low bandwidth nodes in I2P network as claimed in claim 1, wherein said step S1 further comprises:
s11, carrying out node discovery processing on the newly added I2P node;
and S12, performing inter-node state confirmation processing on the newly added I2P node after the node discovery processing.
3. The method of claim 2, wherein the step S11 further comprises:
s111, connecting the newly added I2P node to a seed node, and then requiring the seed node to give an I2P node closest to the seed node;
and S112, inquiring the second closest node from the I2P node closest to the node, and recursively inquiring for a plurality of times until a set number of I2P found nodes are obtained.
4. The method of claim 3, wherein the step S12 further comprises:
s121, the newly added I2P node selects a set number of nearest nodes from the I2P discovery nodes according to a set rule, and sends a handshake message to the nearest nodes;
s122, the nearest node receiving the handshake message verifies the handshake message and returns a handshake confirmation message based on a verification result;
s123, the newly added I2P node synchronizes the latest message based on the handshake confirmation message.
5. The method for eliminating low bandwidth nodes in I2P network as claimed in claim 1, wherein said step S2 further comprises:
s21, sorting asc of public keys of a plurality of I2P nodes, and selecting an I2P node with an index value as a set value in the asc sorting as a test initiating node;
s22, selecting one part of the nearest I2P nodes from the first test node as the tested nodes, and selecting the other part of the nearest I2P nodes from the first test node as the test nodes.
6. The method for eliminating low bandwidth nodes in I2P network as claimed in claim 1, wherein said step S3 further comprises:
s31, randomly screening a block hash set generated in the past by the test initiating node, and broadcasting the block hash set to the test node;
s32, each testing node calls local storage information according to the block hash set, then splicing is carried out according to the sequence so as to calculate the sum of the number of bytes occupied by all blocks, and then the sum is divided by the lowest bandwidth so as to obtain the longest return time;
s33, each testing node sends a request to the tested node, and generates a testing result according to whether the tested node returns all blocks within the longest return time;
and S34, each testing node broadcasts the testing result obtained by the testing node to other testing nodes and collects the testing results of other testing nodes.
7. The method of claim 6, wherein in the step S33, the test result comprises the block hash set, the public key of the tested node and its corresponding IP port, and the bandwidth test result.
8. The method for eliminating low bandwidth nodes in I2P network as claimed in claim 1, wherein said step S4 further comprises:
s41, aiming at each tested node, judging whether a set number of tested nodes consider the tested nodes as low-bandwidth nodes, if so, executing the step S42, otherwise, not executing the subsequent operation;
and S42, isolating or deleting the I2P node which is finally determined as the low-bandwidth node.
9. A computer-readable storage medium, on which a computer program is stored, which program, when being executed by a processor, carries out the method of rejecting low bandwidth nodes in an I2P network according to any one of claims 1 to 8.
10. An I2P network comprising a plurality of I2P nodes, the I2P nodes having stored thereon a computer program, wherein the program when executed by a processor implements a method of culling low bandwidth nodes in an I2P network as claimed in any one of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010422166.8A CN111682961B (en) | 2020-05-18 | 2020-05-18 | Method for eliminating low-bandwidth nodes in I2P network, computer readable storage medium and I2P network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010422166.8A CN111682961B (en) | 2020-05-18 | 2020-05-18 | Method for eliminating low-bandwidth nodes in I2P network, computer readable storage medium and I2P network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111682961A true CN111682961A (en) | 2020-09-18 |
| CN111682961B CN111682961B (en) | 2023-03-07 |
Family
ID=72452013
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010422166.8A Active CN111682961B (en) | 2020-05-18 | 2020-05-18 | Method for eliminating low-bandwidth nodes in I2P network, computer readable storage medium and I2P network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111682961B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106789446A (en) * | 2017-02-17 | 2017-05-31 | 深圳市中博睿存信息技术有限公司 | The cluster distributed test frame and method of a kind of node equity |
| CN109639436A (en) * | 2019-01-04 | 2019-04-16 | 平安科技（深圳）有限公司 | The data property held verification method and terminal device based on salt figure |
| CN110061964A (en) * | 2019-03-13 | 2019-07-26 | 国家计算机网络与信息安全管理中心 | Node selecting method towards communication delay in a kind of anonymous communication |
| CN111131145A (en) * | 2019-11-08 | 2020-05-08 | 西安电子科技大学 | Management query system and method for hiding communication key nodes |
-
2020
- 2020-05-18 CN CN202010422166.8A patent/CN111682961B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106789446A (en) * | 2017-02-17 | 2017-05-31 | 深圳市中博睿存信息技术有限公司 | The cluster distributed test frame and method of a kind of node equity |
| CN109639436A (en) * | 2019-01-04 | 2019-04-16 | 平安科技（深圳）有限公司 | The data property held verification method and terminal device based on salt figure |
| CN110061964A (en) * | 2019-03-13 | 2019-07-26 | 国家计算机网络与信息安全管理中心 | Node selecting method towards communication delay in a kind of anonymous communication |
| CN111131145A (en) * | 2019-11-08 | 2020-05-08 | 西安电子科技大学 | Management query system and method for hiding communication key nodes |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111682961B (en) | 2023-03-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107332876B (en) | Method and device for synchronizing block chain state | |
| CN111625593B (en) | Block chain-based data processing method and device and computer equipment | |
| US20180091412A1 (en) | Self-forming network | |
| CN112491823A (en) | DDoS attack joint defense system and method based on block chain | |
| CN112261172A (en) | Service addressing access method, device, system, equipment and medium | |
| CN111401904B (en) | Consensus method and system in alliance chain | |
| CN113411376A (en) | Sensor data processing method and device based on block chain fragmentation storage | |
| CN113285923A (en) | Data security transmission method and storage medium based on air-sea cross-domain communication gateway | |
| US20220166842A1 (en) | Data distribution method and electronic device | |
| CN110460536B (en) | Data processing method and apparatus for block chain, medium, and electronic device | |
| CN110830496A (en) | Using method and operation method of system for preventing scanning authority file | |
| CN110650097A (en) | Data broadcasting method and device and computer readable storage medium | |
| CN115102963A (en) | IP (Internet protocol) distinguishing method, storage medium and electronic equipment of neighbor nodes based on virtual currency public link network transaction nodes | |
| CN111682961B (en) | Method for eliminating low-bandwidth nodes in I2P network, computer readable storage medium and I2P network | |
| CN113727348B (en) | Method, device, system and storage medium for detecting user data of User Equipment (UE) | |
| CN116360954B (en) | Industrial Internet of things management and control method and system based on cloud edge cooperative technology | |
| US20090083379A1 (en) | Enabling connections for use with a network | |
| CN110636072B (en) | Target domain name scheduling method, device, equipment and storage medium | |
| CN112910663A (en) | Method, device, equipment and storage medium for message broadcasting and terminal registration | |
| CN116684416A (en) | Mirror image distribution method, device and system in network element cluster | |
| AU2005208660A1 (en) | Method for improving peer to peer network communication | |
| CN112260946A (en) | Link fault processing method and device, terminal equipment and storage medium | |
| CN113422696B (en) | Monitoring data updating method, system, equipment and readable storage medium | |
| CN111818152B (en) | Leader election consensus method based on distributed network | |
| CN110995413B (en) | Alliance chain consensus node management method for preventing pseudo node attack |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |