CN115442291A - Ethernet-oriented active network topology sensing method - Google Patents

Ethernet-oriented active network topology sensing method Download PDF

Info

Publication number
CN115442291A
CN115442291A CN202210999573.4A CN202210999573A CN115442291A CN 115442291 A CN115442291 A CN 115442291A CN 202210999573 A CN202210999573 A CN 202210999573A CN 115442291 A CN115442291 A CN 115442291A
Authority
CN
China
Prior art keywords
node
target
active
target node
transaction
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.)
Pending
Application number
CN202210999573.4A
Other languages
Chinese (zh)
Inventor
魏松杰
白销东
刘代东
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing University of Science and Technology
Original Assignee
Nanjing University of Science and Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nanjing University of Science and Technology filed Critical Nanjing University of Science and Technology
Priority to CN202210999573.4A priority Critical patent/CN115442291A/en
Publication of CN115442291A publication Critical patent/CN115442291A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12Discovery or management of network topologies

Landscapes

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

Abstract

The invention discloses an Ethernet-house-oriented active network topology perception method, which mainly comprises the following steps: by deploying sensing nodes in the Ethernet workshop network, the routing table sensing of a target node is realized by utilizing a node discovery protocol in an improved Ethernet workshop network specification protocol; the method comprises the steps that the message forwarding protocol in the Ethernet network specification protocol is utilized to realize the speculation of the active connection number of a target node; and finally, verifying whether the active connection exists between the target node and the peer node in the routing table of the target node in a transaction isolation verification mode according to the processing strategy of the Ethernet memory pool on the future transaction. The invention has the advantages of simple implementation, high efficiency and the like, and can provide a more efficient and more accurate Ethernet movable network topology perception scheme.

Description

Ethernet-oriented active network topology sensing method
Technical Field
The invention belongs to the technical field of network space security, and particularly relates to an Ethernet-house-oriented active network topology sensing method.
Background
As a basis for peer-to-peer communications, the ethernet network layer has received widespread attention for its critical role in the communication between the involved participants. The unstructured peer-to-peer network has a topology mismatch problem on the topology structure, and the mismatch between the logical link and the physical link causes low data transmission efficiency in the network. The Ethernet workshop developer realizes the purpose of maintaining the security of the Ethernet workshop by means of implicitly hiding a network topology structure, and any node accessing the Ethernet workshop can obtain information of other nodes from the network, but the connection between the nodes is hidden. Although hiding the ethernet network topology increases the difficulty of attacks, inferring that network connections can span this limitation through techniques such as side-channel attacks, it is clear that topology confusion is not an effective defense strategy. In view of the requirement for maintaining the Ethernet workshop network security, the realization of the perception of the Ethernet workshop network topology has extremely important significance. The existing Ethernet workshop network topology sensing method is mainly based on a static routing table of a sensing node, and the network topology of the Ethernet workshop is drawn through the static routing table. However, the connection between the ethernet nodes has hysteresis, and the disconnected node is not immediately cleared from the routing table of the neighboring node, resulting in lower accuracy and timeliness of the perceived topology. In addition, the traditional Ethernet network topology sensing method can generate redundant flow in the sensing process, so that the problems of poor controllability and low efficiency in the topology sensing process are caused.
Disclosure of Invention
The invention aims to provide an Ethernet workshop-oriented active network topology sensing method, which aims to overcome the problems of node routing table sensing, active connection verification among nodes and the like in the prior art and realize a more efficient and more accurate Ethernet workshop active network topology sensing scheme
The technical scheme for realizing the purpose of the invention is as follows: an Ethernet bay-oriented active network topology sensing method comprises the following steps:
step 1, sensing a node routing table; the sensing node generates 16 specific target values based on the global unique identifier of the target node to be mapped into different buckets of the target node, executes an improved Ether shop node discovery protocol, requests the buckets in a polling mode, and obtains a potential active connection node set of the target node;
step 2, presuming the number of active connections; the sensing node passively collects the message forwarding records of the target node in the network, divides the message forwarded by the target node into two categories of body message and hash message, and counts the number of the two message categories in a specified time;
step 3, isolation verification; according to the support of the Ether house memory pool to the affair replacement strategy and the processing strategy of the future affairs, the sensing node verifies the active connection between the target nodes by sequentially transmitting the future affairs with the specified price to the network; under the limitation of the potential active connection set and the number of active connections of the target node, obtaining an active connection node set of the target node through continuous iteration of the isolation verification method;
step 4, drawing the active topology; and drawing the network topology according to the active connection node set of the target node obtained by the isolation verification.
Compared with the prior art, the invention has the remarkable advantages that: (1) Based on the improved node discovery protocol, the routing table perception of the target node can be realized within controllable request times, the injection of redundant flow in the network is greatly reduced, and the method has the advantages of high efficiency, controllability, convenience in adjustment and the like; (2) The process of isolation verification is accelerated by the node active connection quantity conjecture based on the message forwarding protocol, so that the active connection node set of the target node can be converged quickly; (3) Based on the transaction strategy supported by the memory pool of the Ethernet workshop, the method for isolation and verification realizes the verifiability of the movable connection between the nodes, and greatly improves the real-time performance and the accuracy of the network topology drawing of the Ethernet workshop; (4) The invention has the advantages of simple implementation, high efficiency and the like, and can provide a more efficient and more accurate active network topology perception scheme for each Ethernet house accessed user.
Drawings
Fig. 1 is an overall architecture diagram of the present invention.
Fig. 2 is a routing table aware workflow diagram of the present invention.
FIG. 3 is a schematic diagram of the isolation verification of the present invention.
Fig. 4 is a perception trend of perception nodes to the ethernet network topology over several iterations.
Detailed Description
The invention discloses an Ethernet-house-oriented active network topology sensing method, which comprises the following steps of:
step 1, sensing a node routing table, wherein a sensing node initiates a peer node information request to a target node according to an improved node discovery protocol to sense routing table data of the target node. As a part of a node discovery protocol, a neighbor node storage mechanism of an Etherhouse reserves 17 buckets for each node through Kademlia DHT to store peer nodes thereof, and each bucket stores 16 nodes; for a sensing node to request a routing table from a target node, different target values must be generated to map to buckets.
And 2, active connection quantity presumption, wherein the sensing node receives the message forwarding record from the target node, counts the message body quantity and the message hash quantity forwarded by the target node, calculates according to the statistical data, and presumes the active connection quantity of the target node. Aiming at the message forwarding mechanism of the EtherFang, no matter the node selects a message body or message hash, the selection of the peer node is always random even for the same group of neighbor nodes; aiming at the message forwarding of a target node, firstly, the message body and the message hash number forwarded by the node in a period of time are recorded, and then the message body number and the message hash number received by a sensing node in a short time can be known to keep a certain proportional relation by utilizing a statistical principle according to the randomness of the message forwarding; in ETH/66, a node forwards the message body to the square root of connected nodes and the message hash to the remaining nodes in the message forwarding process.
Suppose a node has M active connections, msg of which full Is the number of message bodies, msg hash The hash number for a message is:
Figure BDA0003806989320000031
and then calculating the number M of the node active connections:
Figure BDA0003806989320000032
step 3, isolation verification and EtherhouseThe memory pool supports two strategies of transaction replacement and transaction eviction, the transaction existing in the memory pool can be replaced or evicted by subsequent high-price transactions, and an isolation verification method of the future transaction is designed to check whether active connection exists between nodes according to the characteristics of the future transaction in the Ethengfang and the transaction replacement strategy; first, sensing node M sends high-priced future transaction TX with nonce value h to target node A a Then sends a low cost future transaction TX with nonce value h to potential peer node B in the target node routing table b Finally, a medium-cost future transaction TX with a nonce value h is sent to other nodes C in the network c After the sensing node M broadcasts the preposed affair to carry out state activation, the high-price affair TX of the node A is carried out according to the replacement strategy of the affair a Path through node C to node B is a medium transaction TX c Isolated, expensive transaction TX if node A a Propagate to node B and replace low-cost transaction TX b Then it is verified that an active connection exists between node a and node B. And under the limitation of the potential active connection node set of the target node obtained in the step 2 and the target node active connection quantity presumption in the step 3, converging the potential active connection node set of the target node at an extremely fast speed in an iterative isolation verification mode to obtain the active node set of the target node.
And 4, drawing the active network topology, including a new peer node obtained from the target node into the node set to be sensed, and obtaining the active network topology of the Etheng by continuously iterating the new node. Aiming at the active network topology perception of the Ethernet, firstly, a node routing table of a single node is perceived, and under the limitation of the number of active connections, iterative isolation verification is continuously carried out on peer nodes in the routing table, and finally the active connections of the single node are obtained; and finally, the active network topology of the Ethernet workshop network can be drawn by carrying out iterative sensing on the nodes which are not requested and found in the Ethernet workshop.
The invention is further described with reference to the drawings and examples in the following description.
As shown in fig. 1, an ethernet-oriented active network topology sensing method in the embodiment of the present invention specifically includes the following steps:
step 1, sensing nodes, and reconstructing a node discovery protocol and a message forwarding protocol in an EtherFang source code. Firstly, in a node discovery protocol, calculating and generating 16 target values mapped to different buckets of a target node according to a global unique identifier of the target node; secondly, in the message forwarding protocol, the message body and the message hash forwarded by the neighbor node are counted, and the number of the message body and the message hash is recorded in a database. And recompiling the Ethernet workshop source code to generate an Ethernet workshop account, a private key and a Keystore, accessing the Ethernet workshop network according to a DNS seed list provided in the Ethernet workshop source code, and bringing the peer nodes of the sensing nodes into a node set to be sensed.
Step 2, sensing a node routing table, wherein as a part of a node discovery protocol, an adjacent node storage mechanism of an Etherhouse reserves 17 buckets for each node through Kademlia DHT to store peer nodes of the nodes, and each bucket stores 16 nodes; for a sensing node to request a routing table from a target node, different target values must be generated to be mapped to buckets according to the global unique identifier of the target node. As shown in fig. 2, the specific flow of node routing table sensing is as follows:
(1) For the sensing node, detecting the activity of the target node through a handshake protocol, sending a Ping data packet to the sensing node for verification, and responding with a Pong data packet if the target node is in an active state;
(2) The sensing node generates a designated target value, sends a FindNode data packet to request a node in a bucket close to the target value, and the target node responds with a Neighbor data packet;
(3) Calculating and generating 16 different target values, and polling nodes in buckets which are not subjected to target requests to a target node;
(4) And aggregating, screening and removing the duplicate of all the peer nodes obtained by the request, wherein the obtained peer node set is the potential active connection of the target node.
Step 3, active connection quantity presumption, aiming at the message forwarding mechanism of the Ether house, whether a node selects a message body or message hash, the selection of peer nodes is random always, even for the same group of neighbor nodes; aiming at the message forwarding of a target node, firstly, the message body and the message hash number forwarded by the node in a period of time are recorded, and then the message body number and the message hash number received by a sensing node in a short time can be known to keep a certain proportional relation by utilizing a statistical principle according to the randomness of the message forwarding; in the ETH/66 protocol, the nodes forward the message body to square root connected nodes in the message forwarding process, forward the message hash to other nodes, and calculate the active connection number of the target node according to the characteristics and the relation in the message forwarding protocol.
And 4, isolation verification, wherein the memory pool of the Ethernet workshop node has two strategies of transaction replacement and transaction eviction, and the transaction in the memory pool of the Ethernet workshop node can be replaced or evicted by subsequent high-price transactions. When a node receives a new transaction from another node, the node verifies the transaction and determines whether to admit the transaction into the memory pool, and once the node chooses to admit the transaction into the memory pool, it may trigger a transaction replacement or a transaction eviction. Transaction replacement means that a transaction can be replaced by a high priced transaction from the same sender account and with the same nonce value. The transaction eviction means that an existing transaction in the memory pool can be evicted from the memory pool by other transactions from different senders or different nonce values, and generally when the memory pool overflows, a low-priced transaction is evicted by another transaction from different senders or different nonce values;
assuming that a sensing node is M, a target node is a, any node in a potential active connection set is B, and the rest nodes in the network of the ethernet are C, as shown in fig. 3, the method specifically includes:
(1) Verifying whether active connection exists between the node A and the node B or not in an isolation verification mode aiming at the target node and peer node information in a routing table thereof and the inferred active connection quantity of the target node;
(2) Node M sends a high-priced future transaction TX to node A a The future transaction can not be directly broadcast and is put into a waiting queue in the memory pool after validity verification;
(3) Node M sends a message to node BA low price of future transactions TX b The future transaction can not be directly broadcast and is put into a waiting queue in the memory pool after validity verification;
(4) Node M sends two intermediate and consecutive pending transactions TX to node C p And TX c Wherein TX a 、TX b And TX c Is a transaction with the same Nonce value sent by the same node M, a high-priced transaction TX according to the price preset by the transaction a Inability to replace medium cost transaction TX c Medium value transaction TX c Inability to replace low-cost transactions TX b High-priced transaction TX a May replace the low-cost transaction TX b ;TX p As a pre-transaction that activates the above transaction;
(6) Node C receives TX p And TX c Then broadcast it, node A receives TX broadcast by node C p And TX c Rear, TX p Prompting TX as an active transaction a And TX c Transaction replacement occurs, but the transaction residing in the memory pool of node A is still TX due to failure of replacement because the price threshold required for replacement is not met a
(7) Node C receives TX p And TX c Then broadcast it, and the node B receives the TX broadcast by the node C p And TX c Rear, TX p Prompting TX as an active transaction b And TX c Transaction replacement occurs, but the transaction residing in the memory pool of the node B is still TX due to failure of replacement because the price threshold required for replacement is not reached b
(8) The resident transaction in the current node A memory pool is TX a The resident transaction in the node B memory pool is TX b The resident transaction in the memory of the node C is TX c (ii) a After sensing node M is simply adjusted, transaction TX in node A is prompted a To the outside, due to TX a 、TX b And TX c Alternative relationships between transactions, transactions TX in memory pool of node A a The paths to node B via node C are all by a medium transaction TX c When the path is blocked, path isolation is realized; upon low-cost transaction TX in node B b Is priced transaction TX a If the node A is replaced with the node B, the node A is replaced with the node BThere is an active connection between node a and node B otherwise.
(9) And continuously iterating the isolation verification method under the limit of the number of the active connections of the target node to finally obtain an active connection node set of the target node.
And 5, drawing the active network topology, including a new peer node obtained from the target node into the node set to be sensed, and obtaining the active network topology of the Etheng by continuously iterating the new node. Aiming at the active network topology perception of the Ethernet, firstly, a node routing table of a single node is perceived, and under the limitation of the number of active connections, iterative isolation verification is continuously carried out on peer nodes in the routing table, and finally the active connections of the single node are obtained; and finally, drawing the active network topology of the Ethernet workshop by iteratively sensing the unrequested nodes found in the Ethernet workshop. As shown in fig. 4, after several iterations, the method proposed by the present invention is able to perceive more than 95% of the nodes in the network.
In conclusion, the sensing node is deployed in the Ethernet workshop network, and the routing table sensing of the target node is realized by improving the node discovery protocol in the Ethernet workshop network specification protocol; the method comprises the steps that the message forwarding protocol in the Ethengfang network specification protocol is utilized to realize the speculation of the active connection number of a target node; and finally, verifying whether the active connection exists between the target node and the peer node in the routing table of the target node in a transaction isolation verification mode according to the processing strategy of the Ethernet memory pool on future transactions. The invention has the advantages of simple implementation, high efficiency and the like, and can provide a more efficient and more accurate Ethernet movable network topology perception scheme.

Claims (5)

1. An Ethernet-oriented active network topology sensing method is characterized by comprising the following steps:
step 1, sensing a node routing table; the sensing node generates 16 specific target values based on the global unique identifier of the target node to be mapped into different buckets of the target node, executes an improved Ether shop node discovery protocol, requests the buckets in a polling mode, and obtains a potential active connection node set of the target node;
step 2, presuming the number of active connections; the sensing node passively collects the message forwarding records of the target node in the network, divides the message forwarded by the target node into two categories of body message and hash message, and counts the number of the two message categories in a specified time;
step 3, isolation verification; according to the support of the Etherhouse memory pool to the transaction replacement strategy and the processing strategy of future transactions, the sensing node verifies the active connection between the target nodes in a mode of sequentially transmitting the future transactions with specified prices to the network; under the limitation of the potential active connection set and the number of active connections of the target node, obtaining an active connection node set of the target node through continuous iteration of an isolation verification method;
step 4, drawing the active topology; and drawing the network topology according to the active connection node set of the target node obtained by the isolation verification.
2. The Etherhouse-oriented active network topology awareness method according to claim 1, wherein the node routing table awareness method of step 1 specifically comprises: as a part of a node discovery protocol, a storage mechanism of adjacent nodes of an Etherhouse reserves 17 buckets for each node through Kademlia DHT to store the peer nodes of the Etherhouse, and each bucket stores 16 nodes; aiming at a sensing node requesting a routing table from a target node, 16 different target values are generated according to a global unique identifier of the target node to map different buckets of the node, and in a polling request, if the target node receives a FindNode request containing the target value, information in the corresponding bucket is returned through a Neighbor data packet, and finally a potential active connection node set of the target node is obtained.
3. The Etherhouse-oriented active network topology awareness method according to claim 1, wherein the active connection quantity inference method in step 2 is: aiming at an information forwarding mechanism of an EtherFang, recording the information body forwarded by a node and the number of information hashes in a specified time, wherein two kinds of information specified by an ETH/66 protocol have a fixed proportional relation on the forwarding number, and calculating the number of active connections of the node according to the proportional value;
suppose a node has M active connections, msg of which full Is the number of message bodies, msg hash The hash number for a message is:
Figure FDA0003806989310000021
and then calculating the number M of the node active connections:
Figure FDA0003806989310000022
4. the Etherhouse-oriented active network topology awareness method according to claim 1, wherein the isolation verification method in step 3 is: aiming at the characteristics of future transactions in an Etherhouse and a transaction replacement strategy, firstly, a sensing node M sends a high-price future transaction TX with a nonce value of h to a target node A a Then sends a low cost future transaction TX with nonce value h to potential peer node B in the target node routing table b Finally, a medium-cost future transaction TX with a nonce value h is sent to other nodes C in the network c After the sensing node M broadcasts the preposed affair to carry out state activation, the high-price affair TX of the node A is carried out according to the replacement strategy of the affair a Path through node C to node B is a medium transaction TX c Isolated, expensive transaction TX if node A a Propagate to node B and replace low-cost transaction TX b If so, the active connection exists between the node A and the node B; and under the limitation of the potential active connection node set of the target node obtained in the step 1 and the active connection quantity presumption of the target node in the step 2, obtaining the active connection node set of the target node by adopting an iterative isolation verification mode for the target node.
5. The Etherhouse-oriented activity network topology awareness method according to claim 1, wherein the network topology rendering method in step 4 is: after the step 1, the step 2 and the step 3 are carried out on the target node, an active node set of the target node is obtained; and sequentially obtaining the active node set of each target node in the network in an iteration mode, and drawing the network topology according to the active connection node sets of all the target nodes.
CN202210999573.4A 2022-08-19 2022-08-19 Ethernet-oriented active network topology sensing method Pending CN115442291A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210999573.4A CN115442291A (en) 2022-08-19 2022-08-19 Ethernet-oriented active network topology sensing method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210999573.4A CN115442291A (en) 2022-08-19 2022-08-19 Ethernet-oriented active network topology sensing method

Publications (1)

Publication Number Publication Date
CN115442291A true CN115442291A (en) 2022-12-06

Family

ID=84241691

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210999573.4A Pending CN115442291A (en) 2022-08-19 2022-08-19 Ethernet-oriented active network topology sensing method

Country Status (1)

Country Link
CN (1) CN115442291A (en)

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109347643A (en) * 2018-11-21 2019-02-15 海南新软软件有限公司 A kind of monitoring and managing method and device of the customer center system safety based on ether mill
US20190332702A1 (en) * 2018-04-30 2019-10-31 Hewlett Packard Enterprise Development Lp System and method of decentralized management of multi-owner nodes using blockchain
CN111082995A (en) * 2019-12-25 2020-04-28 中国科学院信息工程研究所 Ethernet workshop network behavior analysis method, corresponding storage medium and electronic device
CN113259455A (en) * 2021-06-02 2021-08-13 支付宝(杭州)信息技术有限公司 Cross-subnet interaction method and device
US20210295227A1 (en) * 2020-03-17 2021-09-23 Xi'an Jiaotong University Multi-energy distributed transaction and smart contract design method based on ethereum private chain
CN114024748A (en) * 2021-11-04 2022-02-08 东南大学 Efficient Ethernet workshop flow identification method combining active node library and machine learning
CN114140123A (en) * 2021-12-07 2022-03-04 北京众信星空网络技术有限公司 Method and system for tracing two-layer network transaction of Ethernet workshop
KR20220089383A (en) * 2020-12-21 2022-06-28 서강대학교산학협력단 Load balancing method based on transaction execution time in Ethereum sharding environment and Ethereum sharding system

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20190332702A1 (en) * 2018-04-30 2019-10-31 Hewlett Packard Enterprise Development Lp System and method of decentralized management of multi-owner nodes using blockchain
CN109347643A (en) * 2018-11-21 2019-02-15 海南新软软件有限公司 A kind of monitoring and managing method and device of the customer center system safety based on ether mill
CN111082995A (en) * 2019-12-25 2020-04-28 中国科学院信息工程研究所 Ethernet workshop network behavior analysis method, corresponding storage medium and electronic device
US20210295227A1 (en) * 2020-03-17 2021-09-23 Xi'an Jiaotong University Multi-energy distributed transaction and smart contract design method based on ethereum private chain
KR20220089383A (en) * 2020-12-21 2022-06-28 서강대학교산학협력단 Load balancing method based on transaction execution time in Ethereum sharding environment and Ethereum sharding system
CN113259455A (en) * 2021-06-02 2021-08-13 支付宝(杭州)信息技术有限公司 Cross-subnet interaction method and device
CN114024748A (en) * 2021-11-04 2022-02-08 东南大学 Efficient Ethernet workshop flow identification method combining active node library and machine learning
CN114140123A (en) * 2021-12-07 2022-03-04 北京众信星空网络技术有限公司 Method and system for tracing two-layer network transaction of Ethernet workshop

Similar Documents

Publication Publication Date Title
US20050080858A1 (en) System and method for searching a peer-to-peer network
CA2748688C (en) Multi-source transmission system and method of instant messaging file
US20150215307A1 (en) Secure push and status communication between client and server
CN111934999B (en) Message transmission method and device
CN105407128B (en) Interest keeping method and system on intermediate router in CCN
CN101483604B (en) Method, apparatus and system for resource list sending
CN101355591A (en) P2P network and scheduling method thereof
JP5259835B2 (en) Data node device, peer information acquisition method and system
CN106357839B (en) A kind of DNS query method and device
CN104734962B (en) A kind of resource search method of non-structural P 2 P network
JP6564852B2 (en) Method for managing packets in a network of information centric networking (ICN) nodes
CN108632401B (en) Anonymous query method and system for reducing privacy leakage on DNS recursive server
Wang et al. DiCAS: An efficient distributed caching mechanism for P2P systems
WO2021042786A1 (en) Decentralized domain name registration system and method based on blockchain
Kaune et al. Embracing the peer next door: Proximity in kademlia
US8310956B2 (en) System and method for implementing PNRP locality
WO2022170934A1 (en) Content delivery network bandwidth scheduling method, apparatus, and device
CN108173903A (en) Application of the autonomous system cooperation caching strategy in CCN
CN115442291A (en) Ethernet-oriented active network topology sensing method
Kawadia et al. Slinky: An adaptive protocol for content access in disruption-tolerant ad hoc networks
Gao et al. Practical deanonymization attack in Ethereum based on P2P network analysis
JP4923115B2 (en) Method, computer program and node for distributing references to objects in a self-organizing distributed overlay network, and self-organizing distributed overlay network
CN101436926B (en) Method, network node and system for preventing aggression in P2P network
Kim et al. Restricted path flooding scheme in distributed P2P overlay networks
CN110505280A (en) The control method and P2P node of P2P transmission

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