CN114997877A - Network topology data analysis method of IP of virtual currency public link network transaction node, storage medium and electronic equipment - Google Patents
Network topology data analysis method of IP of virtual currency public link network transaction node, storage medium and electronic equipment Download PDFInfo
- Publication number
- CN114997877A CN114997877A CN202210743301.8A CN202210743301A CN114997877A CN 114997877 A CN114997877 A CN 114997877A CN 202210743301 A CN202210743301 A CN 202210743301A CN 114997877 A CN114997877 A CN 114997877A
- Authority
- CN
- China
- Prior art keywords
- node
- transaction
- nodes
- information
- probe
- 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
- 238000000034 method Methods 0.000 title claims abstract description 75
- 238000003860 storage Methods 0.000 title claims abstract description 27
- 238000007405 data analysis Methods 0.000 title claims abstract description 7
- 239000000523 sample Substances 0.000 claims abstract description 110
- 238000012163 sequencing technique Methods 0.000 claims abstract description 39
- 238000004364 calculation method Methods 0.000 claims description 15
- 230000008569 process Effects 0.000 claims description 15
- 238000004590 computer program Methods 0.000 claims description 12
- 238000012544 monitoring process Methods 0.000 claims description 6
- 238000012216 screening Methods 0.000 claims description 4
- 230000000007 visual effect Effects 0.000 claims description 3
- 230000006870 function Effects 0.000 description 15
- 238000010586 diagram Methods 0.000 description 13
- 230000014509 gene expression Effects 0.000 description 6
- 230000000977 initiatory effect Effects 0.000 description 6
- 230000003993 interaction Effects 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 4
- 238000012545 processing Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 239000011159 matrix material Substances 0.000 description 2
- 241000700605 Viruses Species 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000003999 initiator Substances 0.000 description 1
- 238000004900 laundering Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012552 review Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/40—Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
- G06Q20/401—Transaction verification
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/389—Keeping log of transactions for guaranteeing non-repudiation of a transaction
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Engineering & Computer Science (AREA)
- Finance (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a network topology data analysis method, a storage medium and electronic equipment of an IP of a virtual currency public link network transaction node, comprising the following steps: the method comprises the steps that transaction information transmitted by each node in a transaction network is recorded by deploying a probe node, and IP addresses of transaction senders corresponding to different transaction information with the same transaction hash value are sequenced according to the sequence of arrival time of the transaction information of each transaction received by the probe node to obtain a first sequencing set group; then counting the number of sequencing sets of the target node and the node to be tested in the first sequencing set group, and calculating the neighbor node of the target node; after the neighbor nodes of all transaction nodes in the public link network are judged, the transaction topology of the initially set virtual currency public link network can be constructed, and the tracing of subsequent transaction information can be realized through the topology.
Description
Technical Field
The invention relates to the technical field of server node monitoring, in particular to a network topology data analysis method of an IP of a virtual currency public link network transaction node, a storage medium and electronic equipment.
Background
Recently, with the rapid development of the blockchain technology, the scale of virtual currency transaction is gradually increased, which attracts great attention at home and abroad. Taking the bit currency transaction in the virtual currency as an example, the bit currency transaction has the characteristics of block chain decentralization and anonymization, so that the identity of a virtual currency transactor is difficult to identify, and a hidden space is provided for illegal activities (such as illegal item transaction, virtual currency Lesox virus, money laundering and the like). The virtual currency transaction based on the block chain has the decentralization characteristic, and has stronger anti-traceability capacity compared with the traditional financial system.
Virtual currency transaction systems based on blockchains generally have the following characteristics: (1) the IP address of the trader is anonymous, the trader IP is an account number used when the user participates in the virtual currency transaction when the virtual currency is transacted, the address is created by the user, the address is irrelevant to the identity information of the user, and a third party is not required to participate in the creating and using processes. (2) The transaction nodes are distributed, and the virtual currency system supports users to initiate transactions through different transaction nodes, so that the transaction information of the users is distributed in different transaction nodes, and the identity characteristics of the users are difficult to find through analyzing transaction records. (3) The network structure is decentralized, the virtual currency system adopts P2P (peer-to-peer network) protocol networking, and no central node exists.
Based on the characteristics of the virtual currency system, it is difficult to track the propagation path of the transaction information in the virtual currency public link network by monitoring a single server, and the traditional transaction tracing technology cannot be applied to the virtual currency system. Therefore, the propagation path of the transaction information in the virtual currency public link network cannot be predicted, and the accuracy of tracing the transaction information is influenced.
Disclosure of Invention
Therefore, a technical scheme for analyzing the network topology data of the IP of the virtual currency public link network transaction node needs to be provided, so as to solve the problems of high transaction information tracing difficulty, low accuracy and the like in the existing virtual currency tracing technology.
In order to achieve the above object, in a first aspect, the present invention discloses a method for analyzing network topology data of an IP of a virtual currency public link network transaction node, the method comprising the steps of:
s1: setting at least one probe node in the virtual currency public link network; the probe node is configured to be capable of establishing connections with all nodes in the virtual currency public link network;
s2: monitoring all transaction information of each transaction node in the virtual currency public link network in the transaction process through the probe node; the transaction information comprises transaction hash values, and each transaction information corresponds to a unique transaction hash value;
s3: the probe node classifies all collected transaction information according to different transaction hash values, and sorts the IP addresses of transaction senders corresponding to the transaction information with the same transaction hash value according to the sequence of the arrival time of the received transaction information of each transaction information to obtain a first sorting set group; the transaction information arrival time refers to timestamp information of each transaction information received by the probe node, and the IP address information of the transaction sender is the IP address information of the sender sending the transaction information to the probe node;
s4: counting the number of sequencing sets of a target node and a node to be tested which simultaneously appear in a first sequencing set group, calculating the ratio of the number of the sequencing sets of the target node and the node to be tested which simultaneously appear to the number of sets containing the target node in the first sequencing set group, and outputting the calculation result as the probability that the node to be tested is a potential neighbor node of the target node;
s5: selecting a plurality of nodes to be tested with the highest probability values of the potential neighbor nodes of the target node as neighbor nodes of the target node, taking the neighbor nodes of the target node as new target nodes, calculating the probabilities of the potential neighbor nodes of the new target nodes according to the steps S3-S4 and outputting; repeating the steps until the neighbor nodes of all transaction nodes in the virtual currency public link network are confirmed;
s6: and constructing a transaction topology of the initially-set virtual currency public link network according to the neighbor nodes of all transaction nodes in the virtual currency public link network, and converting the probability value of each transaction node and the corresponding neighbor node into the routing overhead of the adjacent transaction nodes.
Further, the step of "calculating a ratio of the number of the ordering sets in which the target node and the node to be detected simultaneously appear to the number of sets including the target node in the first ordering set group, and outputting a calculation result as a probability that the node to be detected is a potential neighbor node of the target node" includes:
calculating the ratio of the number of the sequencing sets of the target node and each node to be tested appearing at the same time to the number of sets containing the target node in the first sequencing set group, and obtaining and outputting the probability of each node to be tested as a potential neighbor node of the target node;
and screening out the nodes to be tested, which are used as the potential neighbor nodes of the target node and have the probability higher than a preset probability threshold value, when the number of the nodes to be tested is larger than a preset number, and using the nodes to be tested as the potential neighbor nodes of the target node.
Further, the method comprises:
the probe node requests a node information table known by a target node from the target node connected with the probe node to serve as a visual node information table corresponding to the target node;
and judging whether the identification information of the node to be detected of the potential neighbor node listed as the target node appears in a visible node information table corresponding to the target node, if so, keeping the node to be detected as the potential neighbor node of the target node, otherwise, removing the node to be detected from the potential neighbor node of the target node.
Further, the method comprises:
and judging the difference degree of a time sorting set which is corresponding to a certain transaction information and reaches the probe node in the first sorting set group and a propagation path routing overhead sorting set which is corresponding to a certain transaction node as an originating node and reaches the probe node, and if the difference degree is minimum, determining the transaction node as the originating node corresponding to the transaction.
Further, the method comprises:
the selecting the plurality of nodes to be tested with the highest probability values of the potential neighbor nodes of the target node as the neighbor nodes of the target node comprises:
setting a probability threshold;
and judging whether the probability value corresponding to the screened node to be tested is larger than the probability threshold value, if so, reserving the node to be tested as a neighbor node of the target node, otherwise, not using the node to be tested as the neighbor node of the target node.
Further, the method comprises:
acquiring all transaction information in a plurality of unit times, respectively calculating the probability that the node to be detected is a potential neighbor node of the target node in each unit time to obtain a group of probability value sequences, and fitting the probability value sequences to obtain a probability value fitting function corresponding to the node to be detected;
acquiring all transaction information in next unit time, calculating the probability that the node to be detected is the potential neighbor node of the target node in current unit time, judging whether the probability that the node to be detected is the potential neighbor node of the target node in current unit time is matched with the result predicted by the fitting function, if so, keeping the node to be detected as the potential neighbor node of the target node, otherwise, removing the node to be detected from the potential neighbor node of the target node.
Further, the information transmitted between the probe node and all nodes in the virtual currency public link network comprises first type message information and second type message information; the first type message information is message information which can influence the judgment result of a neighbor node and comprises the transaction information, and the second type message information is message information except the first type message information;
the method comprises the following steps:
the probe node is configured to not forward the first type message information, and normally process the second type message information, so that the probe node always keeps an active state in the virtual currency public link network.
Furthermore, the number of the seed nodes is multiple, and each seed node stores node information corresponding to part of transaction nodes in the virtual currency public link network;
the probe node is configured to be capable of establishing connection with all nodes in the virtual currency public link network, and comprises the following steps:
after the probe node establishes connection with each seed node in the virtual currency public link network, a node information acquisition request is sent to all the seed nodes;
the probe node acquires node information to be stored by each seed node; the node information includes IP address information of a corresponding node in the virtual currency public link network;
the probe node sorts the node information sent by all the seed nodes, initiates a connection request to the IP address of each node and establishes connection;
the probe node arranges the node information sent by all the seed nodes, and the arrangement comprises the following steps: when the received node information sent by various child nodes contains a plurality of same IP addresses, a connection request is initiated to only one of the IP addresses.
In a second aspect, the present invention provides a storage medium disposed within a probe node, the storage medium having stored therein a computer program which, when executed, implements a method according to the first aspect of the invention.
In a third aspect, the present invention provides an electronic device comprising:
a storage medium according to the second aspect of the present invention;
a processor, electrically connected to the storage medium, for executing the computer program stored by the storage medium to implement the method according to the first aspect of the present invention.
Different from the prior art, the invention provides an IP network topology data analysis method, a storage medium and an electronic device for a virtual currency public link network transaction node, wherein the method comprises the following steps: arranging probe nodes in a virtual currency public link network, recording transaction information transmitted by each node in a transaction network by adopting the probe nodes, and sequencing IP addresses of transaction senders corresponding to different transaction information with the same transaction hash value according to the sequence of the arrival time of the transaction information of each transaction received by the probe nodes to obtain a first sequencing set group; then counting the number of the sequencing sets of the target node and the node to be tested which simultaneously appear in the first sequencing set group, calculating the ratio of the number of the sequencing sets of the target node and the node to be tested which simultaneously appear to the number of sets containing the target node in the first sequencing set group, and outputting the calculation result as the probability that the node to be tested is the potential neighbor node of the target node. According to the scheme, the neighbor nodes of all transaction nodes in the virtual currency public link network can be predicted, so that the transaction topology of the virtual currency public link network can be constructed, the propagation path of all transaction information in the transaction topology can be predicted better in the follow-up process, and the transaction information can be traced.
Drawings
Fig. 1 is a flowchart of a method for analyzing network topology data of an IP of a virtual currency public link network transaction node according to a first embodiment of the present invention;
fig. 2 is a flowchart of a method for analyzing network topology data of an IP of a virtual currency public link network transaction node according to a second embodiment of the present invention;
fig. 3 is a flowchart of a method for analyzing network topology data of an IP of a virtual currency public link network transaction node according to a third embodiment of the present invention;
fig. 4 is a flowchart of a method for analyzing network topology data of an IP of a virtual currency public link network transaction node according to a fourth embodiment of the present invention;
fig. 5 is a flowchart of a method for analyzing network topology data of an IP of a virtual currency public link network transaction node according to a fifth embodiment of the present invention;
fig. 6 is a method for connecting a probe node to a whole network transaction node according to an embodiment of the present invention;
fig. 7 is a schematic diagram of an electronic device according to an embodiment of the present invention;
fig. 8 is a schematic diagram of first-order neighbor nodes corresponding to each target node according to an embodiment of the present invention;
fig. 9 is a full-chain first-order link node connection topology diagram according to an embodiment of the present invention.
Detailed Description
In order to explain in detail possible application scenarios, technical principles, practical embodiments, and the like of the present application, the following detailed description is given with reference to the accompanying drawings in conjunction with the listed embodiments. The embodiments described herein are merely for more clearly illustrating the technical solutions of the present application, and therefore, the embodiments are only used as examples, and the scope of the present application is not limited thereby.
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase "an embodiment" in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or related to other embodiments specifically defined. In principle, in the present application, the technical features mentioned in the embodiments can be combined in any manner to form a corresponding implementable technical solution as long as there is no technical contradiction or conflict.
Unless defined otherwise, technical terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs; the use of relational terms herein is intended to describe specific embodiments only and is not intended to limit the present application.
In the description of the present application, the term "and/or" is a expression for describing a logical relationship between objects, meaning that three relationships may exist, for example a and/or B, meaning: there are three cases of A, B, and both A and B. In addition, the character "/" herein generally indicates that the former and latter associated objects are in a logical relationship of "or".
In this application, terms such as "first" and "second" are used merely to distinguish one entity or operation from another entity or operation without necessarily requiring or implying any actual such relationship or order between such entities or operations.
Without further limitation, in this application, the use of "including," "comprising," "having," or other similar expressions in phrases and expressions of "including," "comprising," or "having," is intended to cover a non-exclusive inclusion, and such expressions do not exclude the presence of additional elements in a process, method, or article that includes an element, such that a process, method, or article that includes a list of elements may include not only those elements but also other elements not expressly listed or inherent to such process, method, or article.
As is understood in the "review guidelines," in this application, the terms "greater than," "less than," "more than," and the like are to be understood as excluding the number; the expressions "above", "below", "within" and the like are understood to include the present numbers. In addition, in the description of the embodiments of the present application, "a plurality" means two or more (including two), and expressions related to "a plurality" similar thereto are also understood, for example, "a plurality of groups", "a plurality of times", and the like, unless specifically defined otherwise.
To facilitate understanding of the concepts described herein, certain terms referred to herein are defined and explained below, in particular as follows:
(1) virtual currency public link network:
the virtual currency public link network refers to a virtual currency transaction network constructed based on the blockchain technology, and virtual currencies can include bitcoin, lexel, ethernet and the like. Typically, a virtual currency public link network includes a plurality of transaction nodes, each transaction node may be implemented by a server or a cluster of servers.
The transaction nodes in the virtual currency public link network communicate with each other through a specific communication protocol, for example, the bit currency transaction is performed, and each transaction node can be connected into the bit currency transaction network by initiating a connection-xxxx-port command. Meanwhile, in order to ensure that the receiving and forwarding of the transaction information are not interfered by other information, the user of each transaction node can shield the transaction information of other types of virtual money by setting a port authority, namely, each transaction node is ensured to only receive the transaction information in a certain virtual money public link network once being connected into the virtual money public link network.
(2) Probe node
The probe node in the application refers to a transaction node which is provided with a tracing program and is deployed in a virtual currency public link network, and the tracing program is used for analyzing and processing various data collected and recorded by the probe node when being executed so as to judge the probability that a certain node is a neighbor node of another node. The probe node in the application is configured to be capable of establishing connection with all other transaction nodes in the virtual currency public link network, so that the transaction information forwarded by all transaction nodes in the virtual currency public link network can be acquired. The probe node joins a virtual currency public link network by sending a specific protocol command.
(3) Transaction information
Typically, in a virtual currency public link network, transaction information includes transaction hash values, transaction amounts, and other remark information. The transaction hash value is a group of random character strings, is randomly generated by the transaction initiating node when initiating the transaction, and is forwarded to the next transaction node along with the transaction content (such as transaction amount and other remarks) of the transaction. In the process of transmitting the transaction information, although the same transaction information is continuously transmitted by each transaction node, the transaction hash value of the same transaction information is always unchanged. The same transaction here refers to a transaction initiated by a transaction node at a certain point in time.
(4) Transaction information arrival time
In the present application, the transaction information arrival time refers to the time information of each transaction information received by the probe node. Preferably, the arrival time of the transaction information can be expressed by a differential time, which is a difference between a timestamp of a certain transaction received by the probe node and a timestamp of the transaction initiated in the virtual currency public link network, namely network delay. When a certain transaction node initiates a certain transaction, based on the transaction mechanism of the virtual currency, all transaction nodes in the virtual currency public link network can know the initiation time of the transaction, but cannot know which transaction node initiates the transaction. The method and the device establish connection with all transaction nodes by setting the probe nodes, and then calculate the probability that a certain node is a neighbor node of another node by respectively monitoring and collecting all transaction information.
(5) IP address information of transaction sender
In the present application, the IP address information of the transaction sender is the IP address information of the sender that forwards the transaction information to the probe node. In short, all transaction nodes in the virtual currency public link network are connected with the probe node, that is, the probe node is a neighbor node of all transaction nodes, so that the probe node can continuously receive transaction information forwarded by each transaction node, and the probe node can record the arrival time corresponding to each transaction information and the IP address of a sender (that is, which node transaction IP sends the transaction information to the probe node) besides classifying the transaction information according to the transaction hash value.
(6) Node to be tested and target node
The node to be tested is relative to the target node, and one of the purposes of the present application is to determine the probability that a certain node is a neighbor node of another node, for example, if it needs to be determined whether the node a is the probability value of the neighbor node of the node B, the node a is the node to be tested, and the node B is the target node.
(7) Seed node
In the virtual currency public link network, a plurality of nodes which run stably for a long time are regarded as seed nodes, and the seed nodes are even written into a program in a hard coding mode, so that other nodes in the network can be found quickly by connecting to the seed nodes. The IP addresses of the seed nodes in the virtual currency transaction block chain are known, and the probe node can acquire node information (including the IP addresses of all transaction nodes in partial or complete transactions) from a plurality of seed nodes and other node IP information known by the nodes. And the probe node sends connection requests to the collected node information, and establishes connection one by one, so that the probe node can establish connection with all transaction nodes in the current virtual currency public link network.
In a first aspect, as shown in fig. 1, the present invention provides a method for analyzing network topology data of an IP of a virtual currency public link network transaction node, the method comprising the steps of:
s1: setting at least one probe node in the virtual currency public link network; the probe node is configured to be capable of establishing connections with all nodes in the virtual currency public link network;
s2: monitoring all transaction information of each transaction node in the virtual currency public link network in the transaction process through the probe node; the transaction information comprises transaction hash values, and each transaction information corresponds to a unique transaction hash value;
s3: the probe node classifies all collected transaction information according to different transaction hash values, and sorts the IP addresses of transaction senders corresponding to the transaction information with the same transaction hash value according to the sequence of the arrival time of the received transaction information of each transaction information to obtain a first sorting set group; the transaction information arrival time refers to timestamp information of each transaction information received by the probe node, and the IP address information of the transaction sender is the IP address information of the sender sending the transaction information to the probe node;
s4: counting the number of sequencing sets of a target node and a node to be tested which simultaneously appear in a first sequencing set group, calculating the ratio of the number of the sequencing sets of the target node and the node to be tested which simultaneously appear to the number of sets containing the target node in the first sequencing set group, and outputting the calculation result as the probability that the node to be tested is a potential neighbor node of the target node.
Then, step S5 may be entered, as shown in fig. 4, step S5 may include step S401 of selecting a plurality of nodes to be tested having the highest probability values of the potential neighbor nodes of the target node as neighbor nodes of the target node; step S402, taking the neighbor node of the target node as a new target node, calculating the probability of the potential neighbor node of the new target node according to the steps S3-S4 and outputting the probability; s403, repeating the steps until the neighbor nodes of all transaction nodes in the virtual currency public link network are confirmed;
s6: and constructing a transaction topology of the initially-set virtual currency public link network according to the neighbor nodes of all transaction nodes in the virtual currency public link network, and converting the probability value of each transaction node and the corresponding neighbor node into the routing overhead of the adjacent transaction nodes.
For example, the target node is a transaction node a, and for the target node a, the method in steps S3-S4 is adopted to screen out the transaction node with the probability value of top 8 as a potential neighbor node of the target node a, where the 8 transaction nodes are transaction nodes B-transaction nodes I, respectively, and then any one of the transaction nodes B-transaction nodes I can be used as a new target node, and all neighbor nodes of the new target node are obtained through calculation. By analogy, until all transaction nodes in the virtual currency public link network are calculated once as target nodes, the neighbor nodes corresponding to all transaction nodes in the virtual currency public link network can be obtained.
After the processing by the method shown in fig. 4, the neighbor nodes corresponding to all the transaction nodes in the virtual currency public link network can be obtained, and the transaction topology of the initially set virtual currency public link network can be obtained by connecting the neighbor transaction nodes on the basis. Because the probability values of the neighboring nodes among different neighboring nodes are different, in order to make the transaction topology of the initially-set virtual currency public link network more practical, the probability values of each transaction node and the corresponding neighboring nodes can be converted into the routing overhead of the neighboring transaction nodes. Routing overhead, that is, network delay, generally, the higher the probability that two transaction nodes are mutually neighbor nodes, the shorter the communication time required for information interaction between the two transaction nodes, that is, the smaller the routing overhead. Therefore, the probability values obtained by calculation can be inverted to be converted into the routing overhead of the adjacent transaction nodes. After the routing cost between every two adjacent transaction nodes is obtained through calculation, the time that transaction information initiated by any transaction node in the virtual currency public link network as a transaction initial node reaches the probe node through any propagation path can be obtained through estimation, the initial node and the propagation path of each transaction information in the virtual currency public link network can be predicted according to the specific numerical value of each transaction time received by the probe node, and therefore the tracing of the transaction information is completed.
In this embodiment, the probe node classifies the collected transaction information according to the transaction hash value. Each transaction has a corresponding transaction hash value, and different transactions involve different transaction hash values. The collected transaction information is classified according to the transaction hash value through the probe node, so that the arrival time of the transaction information of the same hash value, which is forwarded to the probe node through different propagation links, can be known, and the IP addresses of the transaction senders corresponding to the arrival time of a plurality of transaction information ranked in the front are selected according to the sequence of the arrival time to obtain a first sequencing set group.
Aiming at the same virtual currency transaction with the same transaction hash value, a probe node receives a plurality of versions of transaction information from transaction nodes of different paths in a virtual currency public link network, although the transaction hash value of each version of transaction information is the same, because the time for forwarding the transaction information by different transaction nodes is different (usually, two transaction nodes which are mutually adjacent nodes appear in the first arrival time sequence of the same transaction information), the probe node can sequence corresponding transaction senders according to the arrival time sequence of the received transaction information with the same hash value, after a first sequencing set group is obtained, the number of sequencing sets which simultaneously appear between a target node and a node to be tested in the first sequencing set group is counted, and the ratio of the number of the sequencing sets which simultaneously appear between the target node and the node to be tested to the number of sets which comprise the target node in the first sequencing set group is calculated, and taking the calculation result as the probability that the node to be detected is a potential neighbor node of the target node and outputting the probability.
For example, when a probe node collects 10000 transaction information which occurs in a virtual currency public link network in a certain time period, and selects and records the IP addresses of the first 8 transaction senders which arrive at the front of the certain transaction information, a first ordered set group of 10000 rows and 8 columns can be obtained, and if 2000 transaction nodes appear in 10000 sets and 1500 transaction nodes a and B appear together, the probability that the transaction node B is a neighbor node of the transaction node a can be calculated to be 1500/2000-0.75. Based on the above manner, the probability value that one transaction node in the virtual currency public link network is another transaction node can be calculated, so that the construction of the transaction topology of the virtual currency public link network is completed, and the tracing of subsequent transaction information is facilitated.
As shown in fig. 2, the "calculating a ratio of the number of the ordering sets in which the target node and the node to be detected appear simultaneously to the number of sets including the target node in the first ordering set group, and outputting a calculation result as a probability that the node to be detected is a potential neighbor node of the target node" includes:
firstly, step S201 is carried out to calculate the ratio of the number of the sequencing sets of the target node and each node to be tested appearing at the same time to the number of the sets of the target node in the first sequencing set group, and the probability of each node to be tested serving as a potential neighbor node of the target node is obtained and output;
and then, step S202 is carried out, when the number of the nodes to be tested is larger than the preset number, the nodes to be tested, which are taken as the target nodes, are screened out, and the probability of the potential neighbor nodes is larger than the preset probability threshold value, and the nodes to be tested are taken as the potential neighbor nodes of the target nodes.
Preferably, the predetermined number is less than 10. For example, the preset number is 8, assuming that the preset probability threshold value is 0.6, and when the transaction nodes a are taken as target nodes and the transaction nodes in the virtual currency public link network are judged one by one as nodes to be tested, the nodes to be tested are the probability values of the neighbor nodes of the transaction nodes a, and assuming that the number of the nodes to be tested which is obtained through final calculation and meets the probability value of being greater than 0.6 is 12, the first 8 nodes with the larger probability value are selected as the potential neighbor nodes of the transaction nodes a. Of course, if the number of the nodes to be tested which satisfy the probability value of more than 0.6 and are obtained by calculation is less than 8, the first 8 nodes with the larger probability value can be directly selected as the potential neighbor nodes of the transaction node A.
In some embodiments, the selecting, as the neighbor nodes of the target node, a number of nodes to be tested whose potential neighbor nodes of the target node have the highest probability values includes:
setting a probability threshold;
and judging whether the probability value corresponding to the screened node to be tested is greater than the probability threshold value, if so, reserving the node to be tested as the neighbor node of the target node, otherwise, not taking the node to be tested as the neighbor node of the target node.
For example, if the value of the probability threshold is 0.8, after screening out a plurality of nodes to be tested having the highest probability value, further analyzing and judging whether the probability value corresponding to the screened nodes to be tested is greater than 0.8, if so, reserving the nodes to be tested as neighbor nodes of the target node, otherwise, not taking the nodes to be tested as neighbor nodes of the target node. By setting the probability threshold, the neighbor nodes corresponding to the target node can be screened out from the potential neighbor nodes more accurately, so that the accuracy of the constructed initial network topology is higher.
As shown in fig. 3, the method includes:
firstly, entering step S301, the probe node requests a node information table known by a target node from the target node connected with the probe node to serve as a visual node information table corresponding to the target node;
and then step S302 is carried out to judge whether the identification information of the node to be detected of the potential neighbor node listed as the target node appears in a visible node information table corresponding to the target node, if so, the node to be detected is reserved as the potential neighbor node of the target node, otherwise, the node to be detected is removed from the potential neighbor node of the target node.
In the virtual currency public link network, each transaction node has a node information table corresponding to the transaction node, wherein node IP addresses with information interaction with the transaction node in historical data are stored, the node IP addresses are arranged according to the sequence of interaction time from near to far, if two transaction nodes are adjacent nodes, the IP address of the other transaction node is stored in the node information table of one transaction node, namely in the past historical transaction data, the two transaction nodes should transmit transaction information with each other.
Therefore, the node information table known by the target node is obtained and used as the visible node information table corresponding to the target node, then whether the identification information of the node to be detected listed as the potential neighbor node of the target node appears in the visible node information table corresponding to the target node or not is judged, if yes, the node to be detected is reserved to be used as the potential neighbor node of the target node, and if not, the node to be detected is removed from the potential neighbor node of the target node. By the method, the accuracy of judging whether the node to be detected is the neighbor node of the target node can be further improved.
As shown in fig. 5, in certain embodiments, the method comprises:
firstly, step S501 is carried out to obtain all transaction information in a plurality of unit time, the probability that the node to be detected is a potential neighbor node of the target node in each unit time is respectively calculated to obtain a group of probability value sequences, and the probability value sequences are fitted to obtain a probability value fitting function corresponding to the node to be detected;
then, step S502 is carried out to obtain all transaction information in the next unit time, and the probability that the node to be tested is a potential neighbor node of the target node in the current unit time is calculated;
and then, step S503 is carried out to judge whether the probability that the node to be detected is the potential neighbor node of the target node in the current unit time is matched with the result predicted by the fitting function, if so, step S504 is carried out to keep the node to be detected as the potential neighbor node of the target node, and if not, step S505 is carried out to remove the node to be detected from the potential neighbor node of the target node.
For example, all transaction information is acquired within a preset time period (including multiple unit time periods), the acquired transaction information is sliced according to unit time (such as 1 day), then the probability of the potential neighbor node of the target node is calculated according to the transaction information within each unit time, and the probability of taking a certain node to be measured as the potential neighbor node of the target node can be correspondingly calculated within multiple unit times. And fitting the probabilities as discrete points to obtain a fitting function, and predicting the probability of the node to be detected as a potential neighbor node of the target node based on the transaction information of the next unit time according to the fitting function. The probability value in the next period is predicted by calculating the fitting function, and the further screening of the potential neighbor nodes of the target node can be realized by comparing the predicted value with the actual value, so that the transaction topology of the initially-set virtual currency public link network is more practical, and the accuracy of transaction tracing is improved.
Preferably, the judging whether the probability that the node to be tested is the potential neighbor node of the target node in the current unit time is matched with the result predicted by the fitting function includes: and judging whether the frequency of the probability that the node to be detected is the potential neighbor node of the target node in the current unit time deviates from the predicted value of the fitting function exceeds a preset frequency, if so, judging that the node to be detected is not matched with the target node, otherwise, judging that the node to be detected is matched with the target node.
In some embodiments, the information transmitted between the probe node and all nodes in the virtual currency public link network comprises first type message information and second type message information; the first type message information is message information which can influence the judgment result of a neighbor node and comprises the transaction information, and the second type message information is message information except the first type message information;
the method comprises the following steps:
the probe node is configured to not forward the first type message information, and normally process the second type message information, so that the probe node always keeps an active state in the virtual currency public link network.
Taking a bitcoin trading network as an example, the interaction protocol between adjacent trading nodes in two networks comprises the protocols of node discovery, connection, message forwarding, initial block downloading, an SPV client, heartbeat messages and the like. The information such as getaddr, addr message broadcast, getlocks, getdata and the like is first type message information, and the probe node does not forward the information. The interaction information such as heartbeat message information, connection information (such as version synchronization information) and node discovery is second type message information, and the probe node normally processes such messages, so that the probe node always keeps an active state in the virtual currency public link network, and the concealment of the probe node in the whole transaction network is improved.
As shown in fig. 6, the number of the seed nodes is multiple, and each seed node stores node information corresponding to a part of transaction nodes in the virtual currency public link network; the probe node is configured to be capable of establishing connection with all nodes in the virtual currency public link network, and comprises the following steps:
firstly, after a probe node establishes connection with each seed node in the virtual currency public link network in step S601, initiating a node information acquisition request to all the seed nodes;
then, the probe node enters a step S602 to acquire node information stored by each seed node; the node information includes IP address information of a corresponding node in the virtual currency public link network;
then step S603, the probe node sorts the node information sent by all the seed nodes, and initiates a connection request to the IP address of each node to establish connection;
then, step S604 is performed, where the probe node sorts the node information sent by all the seed nodes, including: when the received node information sent by various child nodes contains a plurality of same IP addresses, a connection request is initiated to only one of the IP addresses.
By arranging the node information sent by all the seed nodes and only initiating a connection request to one of the IP addresses, the bandwidth can be effectively saved.
In a second aspect, the present invention also provides a storage medium disposed within a probe node, the storage medium having stored therein a computer program which, when executed, implements a method according to the first aspect of the present invention.
As shown in fig. 7, in a third aspect, the present invention further provides an electronic device 10, which includes a processor 101 and a storage medium 102, where the storage medium 102 is the storage medium according to the second aspect; the processor 101 is electrically connected to said storage medium 102 for executing a computer program stored in the storage medium 102 for carrying out the method steps as of the first aspect.
In this embodiment, the electronic device is a computer device, including but not limited to: personal computers, servers, general-purpose computers, special-purpose computers, network devices, embedded devices, programmable devices, intelligent mobile terminals, intelligent home devices, wearable intelligent devices, vehicle-mounted intelligent devices, and the like. Storage media include, but are not limited to: RAM, ROM, diskette, tape, optical disk, flash memory, U disk, removable hard disk, memory card, memory stick, network server storage, network cloud storage, etc. Processors include, but are not limited to, a CPU (Central processing Unit), a GPU (image processor), an MCU (Microprocessor), and the like.
The method of the present application is described in detail below with reference to examples:
connecting a probe Node d to a block chain network (such as a virtual currency public chain network), and establishing connection with all nodes in the network, wherein the probe Node can store all Node information as a list Node ═ { Node _1, Node _2, Node _3, …, Node _ m }; wherein m is the total number of all nodes connected by the probe node d.
Then, the probe Node d requests Node information from all the Node _ i in the Node list Node, and the Node _ i returns the Node information { Node _ i } known to the probe Node d. The probe node d establishes a node relation table NeighborNodes { { node _1}, { node _2}, { node _3}, …, { node _ m } }, and records the node information known by all nodes. Usually, there is history information interaction between two adjacent trading nodes, so if a certain trading node is a neighbor node of another trading node, the node information table of the trading node generally stores the IP address of another trading node.
The probe node d monitors the transaction data on the link, and for the same transaction data (transaction information with the same hash value), the probe node d sends the transaction data to the probe node d, and the transaction data are sorted according to the received time sequence:
List(txid_1)＝{node1,node2,node3,…,nodek}，
probe node d continuously listens to the transaction messages on the link, and for each new transaction datum, a record of the order of arrival of the transaction messages sent to it by each node is generated, and List (txid _ i) ═ … }.
As shown in fig. 8, a discriminant model of whether any two transaction nodes in the network are first-order neighbor node relationships may then be constructed, specifically as follows:
1) construct subset list (txid): since the message of the originating node (initiator of transaction message) of a certain transaction message and its first-order neighbor node most probably reaches the probe node first, the probability that the first-order neighbor nodes are the first-order neighbor nodes is the highest for the first-order nodes in the List (txid _ i). Let l be 8, i.e. take the top 8 nodes in the top order as potential first-order neighbor node objects, construct the List (txid _ i) subset
The number of nodes in list (txid) is not more than l.
2) Taking a target node _ i, calculating the probability that node _ j is a first-order neighbor node of node _ i, where node _ j belongs to the subset list (txid), and node _ j is contained in the node information table { node _ i } of node _ i. The calculation steps are as follows:
(1) setting time granularity (unit time) as 1 day, slicing the list (txid) according to the date, and calculating the number Count (node _ i) of node _ i nodes in the list (txid) observed in the same day;
(2) calculating the number Count (node _ i, node _ j) of nodes i and j simultaneously contained in the list (txid);
(3) the probability that node j is node i can be expressed as:
P date (node_j|node_i)＝Count(node_i,node_j)/Count(node_i)
wherein, P date In (1), date is a subscript to date.
Observing and recording transaction information obtained by the probe node within a period of time, calculating according to the day as a unit to obtain a group of probability value sequences of first-order neighbor nodes of two transaction nodes of node _ i and node _ j, and adopting a curve fitting function P ═ at for the probability value sequences 2 + bt + c, where t is a time variable, a set of fitting parameters a, b, c can be calculated.
And predicting the probability that the node _ j is the first-order neighbor node of the node _ i in the next time period according to the fitting function, and taking the first k (k is less than or equal to l) nodes with the maximum probability as the first-order neighbor nodes of the node _ i.
According to the latest time period that the probe node d receives the transaction messages to reach the List (txid _ i), calculating the probability P that the node _ j is the node _ i in the latest period new_date (node _ j | node _ i) if P new_ If date continuously deviates from the fitting value more than a specified number of times, node _ j is no longer the first-order neighbor node of node _ i in a new time period, and the first-order neighbor node table of node _ i is updated.
As shown in fig. 9, in order to construct a schematic diagram of an obtained full-link first-order link node connection topology (i.e., a transaction topology of a primary virtual currency public link network), after a first-order neighbor node table according to each transaction node is obtained, a full-link transaction node matrix may be established:
then, a first-order neighbor node matrix corresponding to the full-chain transaction node can be established:
the first 8 nodes with the maximum connection probability are taken as neighbor nodes of the target node, and then a full-chain first-order node connection topological structure can be constructed, as shown in fig. 9. It should be noted that, because the Node connection state in the full-link transaction Node list Node is not permanent, and a new Node may be added when some nodes disappear in the middle, the neighbor Node corresponding to each target Node is in a changed state, that is, the full-link first-order Node connection topology structure diagram is dynamically changed. In order to ensure that the full-chain first-order node connection topological structure chart is maximally consistent with the actual condition, the dynamic full-chain first-order node connection topological structure chart can be constructed by taking 24 hours as a time unit according to the method.
In certain embodiments, the method further comprises:
and judging the difference degree of a time sorting set which is corresponding to a certain transaction information and reaches the probe node in the first sorting set group and a propagation path routing overhead sorting set which is corresponding to a certain transaction node as an originating node and reaches the probe node, and if the difference degree is minimum, determining the transaction node as the originating node corresponding to the transaction.
Specifically, when calculating an initial node of a certain transaction, a plurality of shortest times when certain transaction information reaches the probe node can be taken as elements of a time set corresponding to the transaction information, and the elements in the time set are arranged in a descending order and marked with sequence numbers to obtain a real arrangement order; the quantity of the plurality of times is the same as the selected quantity of the plurality of propagation paths; and then selecting the elements in the time set one by one as potential originating nodes, calculating a set of the sum of the routing overheads of each propagation path received by the probe node through different propagation paths by the transaction node originating transaction information, sequencing the elements according to the sum of the routing overheads from small to large to obtain a simulated arrangement sequence, calculating the difference degree between the simulated arrangement sequence and the real arrangement sequence, and finally determining the corresponding element with the minimum difference degree as the originating node of the transaction information.
The invention provides a network topology data analysis method, a storage medium and electronic equipment of an IP of a virtual currency public link network transaction node, comprising the following steps: the method comprises the steps that transaction information transmitted by each node in a transaction network is recorded by deploying a probe node, and IP addresses of transaction senders corresponding to different transaction information with the same transaction hash value are sequenced according to the sequence of arrival time of the transaction information of each transaction received by the probe node to obtain a first sequencing set group; then counting the number of the sequencing sets of the target node and the node to be tested in the first sequencing set group, calculating the ratio of the number of the sequencing sets of the target node and the node to be tested in the first sequencing set group to the number of sets of the target node, and outputting the calculation result as the probability that the node to be tested is a potential neighbor node of the target node, thereby realizing the judgment of the neighbor node of each transaction node and facilitating the tracing of subsequent transaction information.
As will be appreciated by one skilled in the art, the above-described embodiments may be provided as a method, apparatus, or computer program product. These embodiments may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. All or part of the steps of the methods related to the above embodiments may be implemented by a program instructing relevant hardware, where the program may be stored in a storage medium readable by a computer device, and is used to execute all or part of the steps of the methods related to the above embodiments.
The various embodiments described above are described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a computer apparatus to produce a machine, such that the instructions, which execute via the processor of the computer apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer device to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer apparatus to cause a series of operational steps to be performed on the computer apparatus to produce a computer implemented process such that the instructions which execute on the computer apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Although the embodiments have been described, once the basic inventive concept is obtained, other variations and modifications of these embodiments can be made by those skilled in the art, so that these embodiments are only examples of the present invention, and not intended to limit the scope of the present invention, and all equivalent structures or equivalent processes that can be used in the present specification and drawings, or used directly or indirectly in other related fields are encompassed by the present invention.
Claims (10)
1. A method for analyzing network topology data of an IP of a virtual currency public link network transaction node, the method comprising the steps of:
s1: setting at least one probe node in the virtual currency public link network; the probe node is configured to be capable of establishing connections with all nodes in the virtual currency public link network;
s2: monitoring all transaction information of each transaction node in the virtual currency public link network in the transaction process through the probe node; the transaction information comprises transaction hash values, and each transaction information corresponds to a unique transaction hash value;
s3: the probe node classifies all collected transaction information according to different transaction hash values, and sorts the IP addresses of transaction senders corresponding to the transaction information with the same transaction hash value according to the sequence of the arrival time of the received transaction information of each transaction information to obtain a first sorting set group; the transaction information arrival time refers to timestamp information of each transaction information received by the probe node, and the IP address information of the transaction sender is the IP address information of the sender sending the transaction information to the probe node;
s4: counting the number of sequencing sets of a target node and a node to be tested which simultaneously appear in a first sequencing set group, calculating the ratio of the number of the sequencing sets of the target node and the node to be tested which simultaneously appear to the number of sets containing the target node in the first sequencing set group, and outputting the calculation result as the probability that the node to be tested is a potential neighbor node of the target node;
s5: selecting a plurality of nodes to be tested with the highest probability values of the potential neighbor nodes of the target node as neighbor nodes of the target node, taking the neighbor nodes of the target node as new target nodes, calculating the probabilities of the potential neighbor nodes of the new target nodes according to the steps S3-S4 and outputting; repeating the steps until the neighbor nodes of all transaction nodes in the virtual currency public link network are confirmed;
s6: and constructing a transaction topology of the initially-set virtual currency public link network according to the neighbor nodes of all transaction nodes in the virtual currency public link network, and converting the probability value of each transaction node and the corresponding neighbor node into the routing overhead of the adjacent transaction nodes.
2. The method according to claim 1, wherein the number of the nodes to be tested is plural, and the "calculating a ratio of the number of the ordering sets in which the target node and the nodes to be tested simultaneously to the number of sets including the target node in the first ordering set group, and outputting the calculation result as the probability that the node to be tested is a potential neighbor node of the target node" comprises:
calculating the ratio of the number of the sequencing sets of the target node and each node to be tested appearing at the same time to the number of sets comprising the target node in the first sequencing set group, and obtaining and outputting the probability that each node to be tested is used as a potential neighbor node of the target node;
and screening out the nodes to be tested, which are used as the potential neighbor nodes of the target node and have the probability higher than a preset probability threshold value, when the number of the nodes to be tested is larger than a preset number, and using the nodes to be tested as the potential neighbor nodes of the target node.
3. The method of analyzing network topology data of an IP of a virtual currency public link network transaction node as recited in claim 2, the method comprising:
the probe node requests a node information table known by a target node from the target node connected with the probe node to serve as a visual node information table corresponding to the target node;
and judging whether the identification information of the node to be detected which is listed as the potential neighbor node of the target node appears in a visible node information table corresponding to the target node, if so, keeping the node to be detected as the potential neighbor node of the target node, otherwise, removing the node to be detected from the potential neighbor node of the target node.
4. The method for analyzing network topology data of an IP of a virtual currency public link network transaction node according to claim 1, wherein said method further comprises:
and judging the difference degree of a time sorting set reaching the probe node corresponding to a certain transaction information in the first sorting set group and a propagation path routing overhead sorting set reaching the probe node corresponding to a certain transaction node serving as an originating node, and if the difference degree is minimum, determining that the transaction node is the originating node corresponding to the transaction.
5. The method for analyzing network topology data of IP of a virtual money public link network transaction node according to claim 1,
the selecting the plurality of nodes to be tested with the highest probability values of the potential neighbor nodes of the target node as the neighbor nodes of the target node comprises:
setting a probability threshold;
and judging whether the probability value corresponding to the screened node to be tested is larger than the probability threshold value, if so, reserving the node to be tested as a neighbor node of the target node, otherwise, not using the node to be tested as the neighbor node of the target node.
6. The method of network topology data analysis of the IP of a virtual currency public link network transaction node as recited in claim 1, the method comprising:
acquiring all transaction information in a plurality of unit times, respectively calculating the probability that the node to be detected is a potential neighbor node of the target node in each unit time to obtain a group of probability value sequences, and fitting the probability value sequences to obtain a probability value fitting function corresponding to the node to be detected;
acquiring all transaction information in next unit time, calculating the probability that the node to be detected is the potential neighbor node of the target node in current unit time, judging whether the probability that the node to be detected is the potential neighbor node of the target node in current unit time is matched with the result predicted by the fitting function, if so, keeping the node to be detected as the potential neighbor node of the target node, otherwise, removing the node to be detected from the potential neighbor node of the target node.
7. The method for analyzing network topology data of an IP of a virtual money public link network transaction node according to claim 1,
the information transmitted between the probe node and all nodes in the virtual currency public link network comprises first type message information and second type message information; the first type message information is message information which can influence the judgment result of a neighbor node and comprises the transaction information, and the second type message information is message information except the first type message information;
the method comprises the following steps:
the probe node is configured to not forward the first type message information, and normally process the second type message information, so that the probe node always keeps an active state in the virtual currency public link network.
8. The method for analyzing network topology data of IP of a virtual money public link network transaction node according to claim 1,
the number of the seed nodes is multiple, and each seed node stores node information corresponding to part of transaction nodes in the virtual currency public link network;
the probe node is configured to be capable of establishing connection with all nodes in the virtual currency public link network, and comprises the following steps:
after the probe node establishes connection with each seed node in the virtual currency public link network, a node information acquisition request is sent to all the seed nodes;
the probe node acquires node information to be stored by each seed node; the node information includes IP address information of a corresponding node in the virtual currency public link network;
the probe node sorts node information sent by all the seed nodes, initiates a connection request to an IP address of each node, and broadcasts the connection request after receiving the connection request so that other nodes can establish connection with the probe node after receiving the connection request;
the step of the probe node sorting the node information sent by all the seed nodes comprises the following steps: when the received node information sent by various child nodes contains a plurality of same IP addresses, a connection request is initiated to only one of the IP addresses.
9. A storage medium disposed in a probe node, the storage medium having stored therein a computer program which, when executed, implements the method of any one of claims 1 to 8.
10. An electronic device, comprising:
a storage medium according to claim 9;
a processor, electrically connected to the storage medium, for executing a computer program stored by the storage medium to implement the method of any one of claims 1 to 8.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110982737.8A CN113689219A (en) | 2021-08-25 | 2021-08-25 | Authenticity verification method and system for transaction node of digital currency network based on block chain |
| CN2021109827378 | 2021-08-25 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114997877A true CN114997877A (en) | 2022-09-02 |
| CN114997877B CN114997877B (en) | 2024-07-12 |
Family
ID=
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115550240A (en) * | 2022-11-24 | 2022-12-30 | 云账户技术(天津)有限公司 | Network routing method, system, electronic device and readable storage medium |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018032372A1 (en) * | 2016-08-13 | 2018-02-22 | 深圳市樊溪电子有限公司 | Trusted power grid transaction platform based on block chain technology |
| CN108009807A (en) * | 2017-10-17 | 2018-05-08 | 国家计算机网络与信息安全管理中心 | A kind of bit coin transaction identity method |
| CN109087079A (en) * | 2018-07-09 | 2018-12-25 | 北京知帆科技有限公司 | Digital cash Transaction Information analysis method |
| EP3445009A1 (en) * | 2017-08-17 | 2019-02-20 | Nokia Solutions and Networks Oy | Selection of network routing topology |
| CN110569408A (en) * | 2019-09-04 | 2019-12-13 | 广州大学 | digital currency tracing method and system |
| WO2020119287A1 (en) * | 2018-12-13 | 2020-06-18 | 阿里巴巴集团控股有限公司 | Blockchain-based invoice creation method and apparatus, and electronic device |
| WO2020143196A1 (en) * | 2019-01-11 | 2020-07-16 | 平安科技（深圳）有限公司 | Communication method and device between blockchain nodes, storage medium and electronic apparatus |
| CN112351119A (en) * | 2021-01-11 | 2021-02-09 | 北京知帆科技有限公司 | Probability-based block chain transaction originating IP address determination method and device |
| CN112381552A (en) * | 2020-11-19 | 2021-02-19 | 华南理工大学 | Supply chain tracing method based on hierarchical block chain and application |
| CN112883113A (en) * | 2021-02-22 | 2021-06-01 | 深圳市星网储区块链有限公司 | Block chain-based data value certificate and verification proving and recording method and device |
| CN113269649A (en) * | 2021-06-16 | 2021-08-17 | 上海势炎信息科技有限公司 | System and method for tracking digital currency |
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018032372A1 (en) * | 2016-08-13 | 2018-02-22 | 深圳市樊溪电子有限公司 | Trusted power grid transaction platform based on block chain technology |
| EP3445009A1 (en) * | 2017-08-17 | 2019-02-20 | Nokia Solutions and Networks Oy | Selection of network routing topology |
| CN108009807A (en) * | 2017-10-17 | 2018-05-08 | 国家计算机网络与信息安全管理中心 | A kind of bit coin transaction identity method |
| CN109087079A (en) * | 2018-07-09 | 2018-12-25 | 北京知帆科技有限公司 | Digital cash Transaction Information analysis method |
| WO2020119287A1 (en) * | 2018-12-13 | 2020-06-18 | 阿里巴巴集团控股有限公司 | Blockchain-based invoice creation method and apparatus, and electronic device |
| WO2020143196A1 (en) * | 2019-01-11 | 2020-07-16 | 平安科技（深圳）有限公司 | Communication method and device between blockchain nodes, storage medium and electronic apparatus |
| CN110569408A (en) * | 2019-09-04 | 2019-12-13 | 广州大学 | digital currency tracing method and system |
| CN112381552A (en) * | 2020-11-19 | 2021-02-19 | 华南理工大学 | Supply chain tracing method based on hierarchical block chain and application |
| CN112351119A (en) * | 2021-01-11 | 2021-02-09 | 北京知帆科技有限公司 | Probability-based block chain transaction originating IP address determination method and device |
| CN112883113A (en) * | 2021-02-22 | 2021-06-01 | 深圳市星网储区块链有限公司 | Block chain-based data value certificate and verification proving and recording method and device |
| CN113269649A (en) * | 2021-06-16 | 2021-08-17 | 上海势炎信息科技有限公司 | System and method for tracking digital currency |
Non-Patent Citations (1)
| Title |
|---|
| 高峰等: "轻量级比特币交易溯源机制", 《计算机学报》, no. 05, 5 December 2017 (2017-12-05), pages 1 - 17 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115550240A (en) * | 2022-11-24 | 2022-12-30 | 云账户技术(天津)有限公司 | Network routing method, system, electronic device and readable storage medium |
| CN115550240B (en) * | 2022-11-24 | 2023-03-10 | 云账户技术(天津)有限公司 | Network routing method, system, electronic device and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113689219A (en) | 2021-11-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN115102963A (en) | IP (Internet protocol) distinguishing method, storage medium and electronic equipment of neighbor nodes based on virtual currency public link network transaction nodes | |
| Gaeta et al. | Generalized probabilistic flooding in unstructured peer-to-peer networks | |
| CN109660401A (en) | A kind of distributed network assets detection method | |
| Khan et al. | A fast distributed approximation algorithm for minimum spanning trees | |
| JP2009089369A (en) | Optimal operation of hierarchical peer-to-peer networks | |
| Guo et al. | A measurement study of bitcoin lightning network | |
| Schollmeier et al. | Why peer-to-peer (P2P) does scale: An analysis of P2P traffic patterns | |
| CN112700332B (en) | Bit currency account clustering method based on graph calculation | |
| CN113706305A (en) | Initial node judgment method and system for digital currency network transaction based on block chain | |
| CN115759289A (en) | Federal learning method, system and device based on user grouping cooperation | |
| CN115018502A (en) | Virtual currency public link network transaction node IP-based tracing method and system | |
| Gholami et al. | On the importance of trust in next-generation networked cps systems: An ai perspective | |
| CN114997877B (en) | IP network topology data analysis method of virtual currency public-link network transaction node, storage medium and electronic equipment | |
| CN114997877A (en) | Network topology data analysis method of IP of virtual currency public link network transaction node, storage medium and electronic equipment | |
| Long et al. | Efficient block propagation in wireless blockchain networks and its application in Bitcoin | |
| CN115018646B (en) | IP distinguishing method and system based on virtual currency public network transaction originating node | |
| CN113689222A (en) | Block chain-based digital currency transaction network topology data analysis and optimization method and system | |
| Borgnat et al. | Evolving networks | |
| Leyba et al. | Cutting through the noise to infer autonomous system topology | |
| Agarwal et al. | Co-virality of competing content over osns? | |
| KR20200007421A (en) | Bitcoin network scanning system and method | |
| CN110310138A (en) | A kind of method and device of determining customer relationship | |
| Socievole et al. | Multi-layer sociality in opportunistic networks: An extensive analysis of online and offline node social behaviors | |
| Kim et al. | A machine learning approach to peer connectivity estimation for reliable blockchain networking | |
| Masakuna et al. | Distributed Identification of Central Nodes with Less Communication |
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 |