CN112954080B - Relay routing pyramid data storage method and device - Google Patents

Relay routing pyramid data storage method and device Download PDF

Info

Publication number
CN112954080B
CN112954080B CN202110393363.6A CN202110393363A CN112954080B CN 112954080 B CN112954080 B CN 112954080B CN 202110393363 A CN202110393363 A CN 202110393363A CN 112954080 B CN112954080 B CN 112954080B
Authority
CN
China
Prior art keywords
node
relay routing
routing node
pyramid
parameter
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202110393363.6A
Other languages
Chinese (zh)
Other versions
CN112954080A (en
Inventor
王大浩
杜雄杰
姜栋
朱星迪
杨帆
刘弋嘉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Dunhe Everything Information Technology Suzhou Co ltd
Original Assignee
Suzhou Zhiwei Security Technology Co ltd
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 Suzhou Zhiwei Security Technology Co ltd filed Critical Suzhou Zhiwei Security Technology Co ltd
Priority to CN202110393363.6A priority Critical patent/CN112954080B/en
Publication of CN112954080A publication Critical patent/CN112954080A/en
Application granted granted Critical
Publication of CN112954080B publication Critical patent/CN112954080B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0604—Improving or facilitating administration, e.g. storage management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/067—Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/44—Distributed routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Human Computer Interaction (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention provides a relay routing pyramid data storage method which is applied to a P2P network comprising a plurality of nodes and comprises the following steps: step1, constructing a pyramid storage model, wherein the pyramid storage model comprises N storage levels, and N is a positive integer greater than 3. Step2, receiving the relay routing node set, and analyzing to obtain the node ID of the relay routing node; and 3, acquiring the first 8 bits of the node ID of the relay routing node as a parameter A, taking the first 8 bits of the prefix of the specific subtree of the P2P network as a parameter B, carrying out XOR calculation on the parameter AB according to the bits to obtain f (AB), when f (AB) is greater than 0, calculating to obtain a storage level L (A) = (N-log2(f (AB)) of the relay routing node, and storing the relay routing node to a L (A) layer, otherwise, storing the node to an N level.

Description

Relay routing pyramid data storage method and device
Technical Field
The invention relates to the technical field of information security, in particular to a relay routing pyramid data storage method and device.
Background
In recent years, DDoS botnet family activities still dominate the traditional IoT trojan family represented by Mirai and Gafgyt. These traditional IoT trojans have evolved new varieties by adding new vulnerabilities and communication control approaches. In the iterative process, novel IoT botnets such as Mozi and bigvtor are generated, and the internal fighting situation of the botnets is further aggravated. More seriously, the Mozi botnet attack target focuses on the Internet of things equipment with security vulnerabilities. With the rapid development of 5G and IoT, how to monitor and defend the novel botnet becomes important work for mastering the safety situation of the Internet of things and guaranteeing the safety of the Internet of things.
In addition, when data processing is performed based on the relay route, how to improve the storage and reading efficiency of the relay route data is an urgent problem to be solved.
Disclosure of Invention
The invention mainly aims to provide a relay routing pyramid data storage method and a relay routing pyramid data storage device, and aims to improve the storage and reading efficiency of relay routing data.
In order to achieve the above object, the present invention provides a relay routing pyramid data storage method, which is applied in a P2P network including a plurality of nodes, and the method includes the following steps:
step1, constructing a pyramid storage model, wherein the pyramid storage model comprises N storage levels, and N is a positive integer greater than 3.
Step2, receiving the relay routing node set, and analyzing to obtain the node ID of the relay routing node;
step3, obtaining the first 8 bits of the node ID of the relay routing node as a parameter A, taking the first 8 bits of the prefix of the specific subtree of the P2P network as a parameter B, carrying out XOR calculation on the parameter AB according to the bits to obtain f (AB), and when f (AB) is larger than 0, calculating to obtain the storage level L (A) = (N-log) of the relay routing node2(f (AB)), rounding L (A), and storing the relay routing node to the L (A) th layer; otherwise, the node is stored in the nth level.
The specific subtree is a subtree formed by gathering Mozi nodes in a node binary tree constructed according to node IDs in a Kademlia network;
the node information of the relay routing node comprises an IP address, a port number and a node ID;
wherein the method further comprises: and carrying out hierarchical division on the pyramid storage model, dividing N by 2 to obtain a parameter C by rounding downwards, taking layers from 1 to C as low layers and layers from C +1 to N as high layers, identifying a hierarchical identification field in a request when receiving a relay routing node reading request, wherein the numerical value of the hierarchical identification field comprises the low layer and the high layer, and returning the relay routing node of the corresponding hierarchy to a request end.
The invention provides a relay routing pyramid data storage device, which is applied to a P2P network comprising a plurality of nodes, and comprises:
the pyramid storage module is used for constructing a pyramid storage model and comprises N storage levels, wherein N is a positive integer larger than 3.
The analysis module is used for receiving the relay routing node set and analyzing to obtain the node ID of the relay routing node;
a calculation module, configured to obtain the first 8 bits of the node ID of the relay routing node as a parameter a, obtain f (AB) by performing xor calculation on the parameter AB according to the bits by using the first 8 bits of the prefix of the specific sub-tree of the P2P network as a parameter B, and obtain a storage level l (a) = (N-log) of the relay routing node by calculation when f (AB) is greater than 02(f (AB)), rounding L (A), and storing the relay routing node to the L (A) th layer; otherwise, the node is stored in the nth level.
The specific subtree is a subtree formed by gathering Mozi nodes in a node binary tree constructed according to node IDs in a Kademlia network;
the node information of the relay routing node comprises an IP address, a port number and a node ID;
wherein the apparatus further comprises: and the hierarchy dividing module is used for carrying out hierarchy division on the pyramid storage model, dividing N by 2 to obtain a parameter C by rounding downwards, taking layers from 1 to C as low layers and layers from C +1 to N as high layers, identifying a hierarchy identification field in a request when a relay routing node reading request is received, wherein the numerical value of the hierarchy identification field comprises the low layer and the high layer, and returning the relay routing node of the corresponding hierarchy to the request end.
The beneficial effects of the invention include: (1) according to the distance between the relay routing node and the specific subtree, the nodes are stored in different levels of the pyramid storage model, the storage levels of the nodes represent the distance between the relay routing node and the botnet node, and the data storage management efficiency is improved; (2) the storage hierarchy in the pyramid model is divided into a high layer and a low layer for difference management, when a relay routing node reading request is received, a hierarchy identification field in the request is identified, the numerical value of the hierarchy identification field comprises the low layer and the high layer, the relay routing node of the corresponding hierarchy is returned to a request end, and the data reading efficiency is improved.
Drawings
FIG. 1 is a flow chart of the method of the present invention.
Detailed Description
The Kademlia protocol, Kad, is a Distributed Hash Table (DHT) technology, and establishes a brand new DHT topology structure by using exclusive or algorithm (XOR) as the distance measurement basis, which can greatly improve the speed of route query.
Kad have now become the mainstream implementation of DHT, the p2p network hosted by the Mozi botnet is also based on Kad. The Kademlia algorithm is a distributed hash storage and routing algorithm, and each node of the P2P network realized based on Kad protocol stores partial resources.
In the p2p network constructed by Kademlia protocol, all information is stored in the form of hash table entries, and the entries are dispersedly stored on each node, so that a huge distributed hash table is formed in a full-network mode.
Node distance. Key value (Key) of data in Kademlia network, node ID (NodeID) are all represented by 160 bits, and NodeID is randomly distributed when joining the network. The Kad protocol specifies that each node maintains 2 pieces of information as follows: 1. the resource to be stored, which is stored in the form of a < key, value > pair, can be understood as a hash value of a file name and a file content. 2. A routing table called as "k-packet" is layered according to Node IDs and records IDs, IP addresses and ports of other nodes with limited number.
In the Kad network, the distance between two nodes is measured not by physical distance and router hop number, but by the exclusive or distance of node ID.
For another understanding of the above description: if the nodes of the entire network are combed into a binary tree arranged by node IDs, each leaf at the extreme end of the tree is a node. The location of each node is uniquely determined by the shortest prefix of its ID value. The process of composing Kad a network node tree from nodes is as follows: step 1: keys (such as node IDs) are represented in a binary form, and then the keys are sequentially processed according to steps 2-3 from high order to low order. Step 2: the nth bit of the binary corresponds to the nth level of the binary tree. Step 3: if the current bit is 1, the right sub-tree is entered, if 0, the left sub-tree is entered (set is considered, and the reverse is possible). Step 4: after the processing according to the high order to the low order is finished, the Key value corresponds to a certain leaf node on the binary tree.
Assume that each node ID is N bits. After each node splits a sub-tree according to the own view angle, N sub-trees can be obtained in total. If 1 node in each of the N subtrees is known, the current node can be recursively routed using the N nodes to reach any subtree and node of the entire binary tree. Also, the cost of maintaining these N nodes depends on the tree height. The tree height of Kademlia default 160 is relatively maintenance-less costly. In the actual use process, considering the problem of robustness (each node may be quit or down), only one node is not enough to be known, and more nodes are needed to be relatively insurance.
After each node splits a sub-tree according to its own view, N sub-trees can be obtained, and then N routing tables (corresponding to N K-buckets) need to be maintained. The Kad algorithm uses the concept of K-bucket to store the state information of other neighboring nodes, which is composed of (IP address, UDP port, Node ID) data list (Kad network exchanges information by UDP protocol). Each such list is referred to as a K-bucket, and the internal information storage location of each K-bucket is arranged according to the time sequence of last sight, last-sight being placed at the head and last-sight being placed at the tail. Each bucket has no more than K data items.
The Kademlia protocol includes four remote RPC operations: PING, STORE, FIND _ NODE, FIND _ VALUE. 1. The PING operation is used for detecting a node to judge whether the node is still online; 2. the effect of the STORE operation is to inform a node to STORE a < key, value > pair for later querying needs; 3. the FIND _ NODE operation uses a 160 bit ID as a parameter. The recipient of this operation returns (IP address, UDP port, Node ID) information for the K nodes it knows that are closer to the target ID.
The aggregation of Mozi nodes under specific subtrees embodies the necessity to track these specific subtrees.
The goal of tracking a particular sub-tree is to acquire as many nodes as possible under those sub-trees and then perform the validation of the Mozi nodes. Compared with Mozi confirmation of random nodes in a random purposeless way, the tracking efficiency is greatly improved.
The first problem to be solved is how to acquire as many nodes as possible under a particular sub-tree. At this point, the characteristics of the Kad protocol are used: the node will return the α nodes closest to the target node in its own routing table in response to the find _ node request.
If we use the normal p2p node as the relay routing node and send the find _ node request targeting the random node under the specific subtree, the normal p2p node will return the α nodes closest to the random node of the specific subtree in its routing table. The a nodes may exist directly in a particular sub-tree, even if not, relatively closer to the particular sub-tree. If the returned node is not in the specific subtree, the node is taken as a relay routing node, and the acquisition of the routing table data is continued, and the process is repeated in a circulating way.
Common available public normal p2p nodes are for example:
- dht.transmissionbt.com:6881
- router.bittorrent.com:6881
- router.utorrent.com:6881
- bttracker.debian.org:6881
by probing the specific routing table data of normal p2p nodes, we can collect a large amount of node data under a specific sub-tree.
The distance between a relay routing node and a particular sub-tree determines the mining efficiency of the particular node. In order to accelerate the tracking speed, a relay routing pyramid storage model is designed, the relay routing nodes are classified based on the first 8 bits of the node ID, and a detection program can quickly locate the relay routing node which is close to a specific subtree. (NodeID, IP, PORT) can uniquely label one p2p node. The first 8 bits of the node ID of the relay routing node are taken as a calculation unit, and exclusive OR calculation is carried out on the calculation unit and the first 8 bits of the prefix of the specific subtree, and the position of the relay routing node in the pyramid storage model is determined by the exclusive OR value. The pyramid storage model is designed as follows:
suppose that: the ID of the relay routing node is A, the prefix ID of a specific subtree is B, the parameter AB is subjected to XOR calculation according to bit bits to obtain f (AB), and when f (AB) is larger than 0, the storage level L (A) = (N-log) of the relay routing node is obtained through calculation2(f (AB)), rounding L (A), and storing the relay routing node to the L (A) th layer; otherwise, the node is stored in the nth level.
Such as: a = 0x36, B = 0x38, take the first 8 bits, then l (a) = 5, then the information of the relay routing node (a, IP of a, Port of a) should be stored in level 5 of the pyramid storage model.
After the pyramid storage model is built, when tracking is carried out each time, a high-level node in the pyramid is preferentially selected as a relay routing node to be detected. Meanwhile, if the number of the high-level nodes is insufficient, the low-level nodes need to be extracted for detection so as to supplement the high-level nodes.
In practical use, the initialization node may select the p2p public node listed above, put the public node into the pyramid storage model first, and then perform the data update work of the persistent specific sub-tree detection and pyramid storage data model.
In engineering practice, MongoDB is selected for storing pyramid storage model data. The data structure is as follows:
{
"_id": "ip:port",
int,// number of accesses, default 0
Level int,// level, 1-8
"latest": int,// most recent Access time
Date/entry time, validity period 6 hours
}
And writing background Worker consumption Redis data entry Mongo by using the nodes needing to be put in storage in the Redis cache, and finishing data storage.
When the relay routing node needs to be used, the node is obtained from the MongoDB through the API according to a certain scheduling algorithm.
And the low-level node pulling module acquires the relay routing node far away from the specific subtree by accessing the pyramid data interface. After being input into the relay node detection packet sending module, the nodes output relay routing nodes with higher levels, namely closer to a specific sub-tree. Therefore, the significance of the low-level node pulling module is that the relay routing nodes at higher levels can be continuously input into the pyramid data model to transfuse blood for the high-level node pulling module. And carrying out hierarchical division on the pyramid storage model, dividing N by 2 to obtain a parameter C by rounding downwards, taking layers from 1 to C as low layers and layers from C +1 to N as high layers, identifying a hierarchical identification field in a request when receiving a relay routing node reading request, wherein the numerical value of the hierarchical identification field comprises the low layer and the high layer, and returning the relay routing node of the corresponding hierarchy to a request end.
A plurality of specific node tracking devices can be deployed in the network, and the efficiency of tracking can be greatly improved by the aid of the multi-path parallel tracking devices.
The invention provides a relay routing pyramid data storage method which is applied to a P2P network comprising a plurality of nodes, and the method comprises the following steps:
step1, constructing a pyramid storage model, wherein the pyramid storage model comprises N storage levels, and N is a positive integer greater than 3.
Step2, receiving the relay routing node set, and analyzing to obtain the node ID of the relay routing node;
step3, obtaining the first 8 bits of the node ID of the relay routing node as a parameter A, taking the first 8 bits of the prefix of the specific subtree of the P2P network as a parameter B, carrying out XOR calculation on the parameter AB according to the bits to obtain f (AB), and when f (AB) is greater than 0, calculating to obtain the storage level L (A) = of the relay routing node(N-log2(f (AB)), rounding L (A), and storing the relay routing node to the L (A) th layer; otherwise, the node is stored in the nth level.
The specific subtree is a subtree formed by gathering Mozi nodes in a node binary tree constructed according to node IDs in a Kademlia network;
the node information of the relay routing node comprises an IP address, a port number and a node ID;
wherein the method further comprises: and carrying out hierarchical division on the pyramid storage model, dividing N by 2 to obtain a parameter C by rounding downwards, taking layers from 1 to C as low layers and layers from C +1 to N as high layers, identifying a hierarchical identification field in a request when receiving a relay routing node reading request, wherein the numerical value of the hierarchical identification field comprises the low layer and the high layer, and returning the relay routing node of the corresponding hierarchy to a request end.
The invention provides a relay routing pyramid data storage device, which is applied to a P2P network comprising a plurality of nodes, and comprises:
the pyramid storage module is used for constructing a pyramid storage model and comprises N storage levels, wherein N is a positive integer larger than 3.
The analysis module is used for receiving the relay routing node set and analyzing to obtain the node ID of the relay routing node;
a calculation module, configured to obtain the first 8 bits of the node ID of the relay routing node as a parameter a, obtain f (AB) by performing xor calculation on the parameter AB according to the bits by using the first 8 bits of the prefix of the specific sub-tree of the P2P network as a parameter B, and obtain a storage level l (a) = (N-log) of the relay routing node by calculation when f (AB) is greater than 02(f (AB)), rounding L (A), and storing the relay routing node to the L (A) th layer; otherwise, the node is stored in the nth level.
The specific subtree is a subtree formed by gathering Mozi nodes in a node binary tree constructed according to node IDs in a Kademlia network;
the node information of the relay routing node comprises an IP address, a port number and a node ID;
wherein the apparatus further comprises: and the hierarchy dividing module is used for carrying out hierarchy division on the pyramid storage model, dividing N by 2 to obtain a parameter C by rounding downwards, taking layers from 1 to C as low layers and layers from C +1 to N as high layers, identifying a hierarchy identification field in a request when a relay routing node reading request is received, wherein the numerical value of the hierarchy identification field comprises the low layer and the high layer, and returning the relay routing node of the corresponding hierarchy to the request end.
While the present invention has been described with reference to the embodiments shown in the drawings, the present invention is not limited to the embodiments, which are illustrative and not restrictive, and it will be apparent to those skilled in the art that various changes and modifications can be made therein without departing from the spirit and scope of the invention as defined in the appended claims.

Claims (8)

1. A relay routing pyramid data storage method is applied to a P2P network comprising a plurality of nodes, and comprises the following steps:
step1, constructing a pyramid storage model, wherein the pyramid storage model comprises N storage levels, and N is a positive integer greater than 3;
step2, receiving the relay routing node set, and analyzing to obtain the node ID of the relay routing node;
step3, obtaining the first 8 bits of the node ID of the relay routing node as a parameter A, taking the first 8 bits of the prefix of the specific subtree of the P2P network as a parameter B, carrying out XOR calculation on the parameter AB according to the bits to obtain f (AB), and when f (AB) is larger than 0, calculating to obtain the storage level L (A) = (N-log) of the relay routing node2(f (AB)), rounding L (A), and storing the relay routing node to the L (A) th layer; otherwise, storing the node in the Nth level;
the method further comprises the following steps: and carrying out hierarchical division on the pyramid storage model, dividing N by 2 to obtain a parameter C by rounding downwards, taking layers from 1 to C as low layers and layers from C +1 to N as high layers, identifying a hierarchical identification field in a request when receiving a relay routing node reading request, wherein the numerical value of the hierarchical identification field comprises the low layer and the high layer, and returning the relay routing node of the corresponding hierarchy to a request end.
2. The method of claim 1, wherein the particular sub-tree is a sub-tree of a Mozi node cluster in a binary tree of nodes constructed from node IDs in a Kademlia network.
3. The method of claim 1, wherein the node information of the relay routing node includes an IP address, a port number, and a node ID.
4. A relay routing pyramid data storage apparatus, for use in a P2P network comprising a plurality of nodes, the apparatus comprising: the pyramid storage module is used for constructing a pyramid storage model and comprises N storage levels, wherein N is a positive integer greater than 3; the analysis module is used for receiving the relay routing node set and analyzing to obtain the node ID of the relay routing node; a calculation module, configured to obtain the first 8 bits of the node ID of the relay routing node as a parameter a, obtain f (AB) by performing xor calculation on the parameter AB according to the bits by using the first 8 bits of the prefix of the specific sub-tree of the P2P network as a parameter B, and obtain a storage level l (a) = (N-log) of the relay routing node by calculation when f (AB) is greater than 02(f (AB)), rounding L (A), and storing the relay routing node to the L (A) th layer; otherwise, storing the node in the Nth level;
the apparatus further comprises: and the hierarchy dividing module is used for carrying out hierarchy division on the pyramid storage model, dividing N by 2 to obtain a parameter C by rounding downwards, taking layers from 1 to C as low layers and layers from C +1 to N as high layers, identifying a hierarchy identification field in a request when a relay routing node reading request is received, wherein the numerical value of the hierarchy identification field comprises the low layer and the high layer, and returning the relay routing node of the corresponding hierarchy to the request end.
5. The apparatus of claim 4, wherein the particular sub-tree is a sub-tree of a Mozi node aggregation in a binary tree of nodes constructed from node IDs in a Kademlia network.
6. The apparatus of claim 4, wherein the node information of the relay routing node includes an IP address, a port number, a node ID.
7. A relay routing pyramid data storage device, comprising: a processor, a memory, wherein the memory has stored thereon a computer program which, when executed by the processor, performs the method of any of claims 1-3.
8. A computer-readable storage medium, in which a computer program is stored which, when executed, performs the method according to any one of claims 1-3.
CN202110393363.6A 2021-04-13 2021-04-13 Relay routing pyramid data storage method and device Active CN112954080B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110393363.6A CN112954080B (en) 2021-04-13 2021-04-13 Relay routing pyramid data storage method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110393363.6A CN112954080B (en) 2021-04-13 2021-04-13 Relay routing pyramid data storage method and device

Publications (2)

Publication Number Publication Date
CN112954080A CN112954080A (en) 2021-06-11
CN112954080B true CN112954080B (en) 2022-03-04

Family

ID=76232428

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110393363.6A Active CN112954080B (en) 2021-04-13 2021-04-13 Relay routing pyramid data storage method and device

Country Status (1)

Country Link
CN (1) CN112954080B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012027055A1 (en) * 2010-08-25 2012-03-01 Alcatel Lucent Peer-to-peer traffic localization for content in a distributed hash table
CN104009891A (en) * 2014-06-12 2014-08-27 中国人民解放军国防科学技术大学 Method for detecting P2P network search hot spots based on multi-probe nodes
CN110381157A (en) * 2019-07-26 2019-10-25 正链科技(深圳)有限公司 A kind of distributed directional data storage P2P network based on Kademlia algorithm

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101753567B (en) * 2009-12-25 2013-04-17 中国科学院计算技术研究所 Resource sharing method for operator to actively participate in the peer-to-peer network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012027055A1 (en) * 2010-08-25 2012-03-01 Alcatel Lucent Peer-to-peer traffic localization for content in a distributed hash table
CN104009891A (en) * 2014-06-12 2014-08-27 中国人民解放军国防科学技术大学 Method for detecting P2P network search hot spots based on multi-probe nodes
CN110381157A (en) * 2019-07-26 2019-10-25 正链科技(深圳)有限公司 A kind of distributed directional data storage P2P network based on Kademlia algorithm

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
《结构化对等网络：分等级体系结构研究和性能评价》;欧中洪;《中国优秀博硕士学位论文全文数据库(博士)》;20111215(第12期);全文 *

Also Published As

Publication number Publication date
CN112954080A (en) 2021-06-11

Similar Documents

Publication Publication Date Title
EP2356792B1 (en) Network nodes and methods for data authorization in distributed storage networks
Yang et al. RIHT: a novel hybrid IP traceback scheme
Guo et al. Exploiting path diversity for thwarting pollution attacks in named data networking
EP3905622A1 (en) Botnet detection method and system, and storage medium
CN108965248B (en) P2P botnet detection system and method based on traffic analysis
CN112383393B (en) Trusted communication system and method for software defined sensor network
CN111314379B (en) Attacked domain name identification method and device, computer equipment and storage medium
Nayak et al. A survey on the roles of bloom filter in implementation of the named data networking
CN112235336A (en) Active discovery method for block chain nodes based on protocol fingerprints
Timpanaro et al. Evaluation of the anonymous I2P network's design choices against performance and security
Malliga et al. A hybrid scheme using packet marking and logging for IP traceback
CN112954080B (en) Relay routing pyramid data storage method and device
Shi et al. On capturing DDoS traffic footprints on the Internet
CN106850541B (en) Method and device for determining address of node in Internet of things
Kardes et al. Graph based induction of unresponsive routers in internet topologies
Davis et al. Optimising sybil attacks against P2P-based botnets
Roy et al. IP traceback in star colored networks
CN108206834B (en) Method, device and system for processing central service request
Gao et al. Protecting router cache privacy in named data networking
CN113364730B (en) Progressive node active tracking method and device for P2P botnet
Sridhar et al. Content Censorship in the InterPlanetary File System
US7995595B1 (en) Method for efficiently detecting node addresses
KR101068716B1 (en) Method for tracebacking packet sensor network
CN115348275A (en) Offshore data distributed storage system based on block chain quick addressing technology
Germanus et al. Pass: an address space slicing framework for p2p eclipse attack mitigation

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CP01 Change in the name or title of a patent holder
CP01 Change in the name or title of a patent holder

Address after: Room 907-1, dantaihu building (Wuluo Science Park), No.9, Taihu East Road, Wuzhong District, Suzhou City, Jiangsu Province, 215000

Patentee after: Dunhe Everything Information Technology (Suzhou) Co.,Ltd.

Address before: Room 907-1, dantaihu building (Wuluo Science Park), No.9, Taihu East Road, Wuzhong District, Suzhou City, Jiangsu Province, 215000

Patentee before: Suzhou Zhiwei Security Technology Co.,Ltd.