CN107888436A - A kind of P2P network routing tables acquisition method, flow and equipment - Google Patents
A kind of P2P network routing tables acquisition method, flow and equipment Download PDFInfo
- Publication number
- CN107888436A CN107888436A CN201610863784.XA CN201610863784A CN107888436A CN 107888436 A CN107888436 A CN 107888436A CN 201610863784 A CN201610863784 A CN 201610863784A CN 107888436 A CN107888436 A CN 107888436A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- module
- routing tables
- flow
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/02—Capturing of monitoring data
- H04L43/022—Capturing of monitoring data by sampling
- H04L43/024—Capturing of monitoring data by sampling by adaptive sampling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/50—Testing arrangements
-
- 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)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of P2P network routing tables acquisition method, comprise the steps of：Step 1, node, random selection new node are found with breadth traversal algorithm；Step 2, new node searching result is judged by mixed strategy；If mixed strategy, which is the nodes that have collected and the estimated nodes ratio of the whole network, is less than blend factor values, step 1 is jumped to；If ratio is higher than blend factor values, step 3 is jumped to；Step 4 is jumped to when reaching threshold value；Step 3, take in-depth traverse method to find node, and jump to step 2；Step 4, stop finding；The value of hybrid cytokine is m/n, and wherein n is the node total number in current network, m be from breadth traversal be switched to extreme saturation when collection number of nodes.The present invention has million scale P2P network routing tables of collection in the energy short time, accurately gathers P2P network snapshots advantages.
Description
Technical field
The present invention relates to distributed system field, more particularly to a kind of P2P network routing tables acquisition method, flow and set
It is standby.
Background technology
Due to the dynamic and self-organization of P2P networks, we are difficult to count its structure and performance spy in a short time
Data are levied, and the measurement of P2P network routing tables is particularly significant for P2P O＆Ms, is the efficiency analysis of P2P routing inquiries, new is
The basis for the technologies such as framework, security of uniting.In general P2P measurements are measured by technologies such as reptiles to P2P networks, the time
Long, efficiency is low, inaccurate.It is well known that distributed reptile needs to spend substantial amounts of CPU and network bandwidth to carry out different main frames
Between synchronization.
Kad is first P2P network realized in true application, and it is integrated in eMule at present（Electric donkey）With aMule texts
In part shareware.Kad full distributed traffic model also has important application in distributed storage, to strengthen basic system
Scalability, and reduce deployment and maintenance cost.
P2P network measures are to carry out the basis of P2P Protocol Designs, chess game optimization, security protection etc., for millions of
For the extensive P2P networks of line node, it is very big that global routing table difficulty how is collected in a short time.
Traditional depth or the P2P network routing table acquisition methods of breadth traversal, respectively there is its shortcoming：Breadth traversal is restrained
Slowly；Extreme saturation starts slow.It is difficult to the routing table of whole nodes on network is collected in a short time.In general depth, range
For the node collector of traversal in whole routing table gatherer process, the node that breadth traversal method collects gathers number in the first round
According to rear, a large amount of duplicate nodes are had, but great deal of nodes can be returned in former wheel traversals；The node that extreme saturation collects repeats
Lack, but former to take turns the data volume that collects small.
The content of the invention
In order to solve fast and accurately to gather the information of the whole network P2P node route lists, therefore, the present invention provides one kind
P2P network routing tables acquisition method, flow and equipment, it has million scale P2P network routing tables of collection in the energy short time, accurate
True collection P2P network snapshots advantages.
To achieve these goals, the present invention adopts the following technical scheme that.
P2P network routing table acquisition methods, are comprised the steps of：
Step 1, node, random selection new node are found with breadth traversal algorithm；
Step 2, new node searching result is judged by mixed strategy；Mixed strategy is the nodes if collected
It is less than blend factor values with the estimated nodes ratio of the whole network, then jumps to step 1；If ratio is higher than blend factor values, jump to
Step 3；Step 4 is jumped to when reaching threshold value；
Step 3, take in-depth traverse method to find node, and jump to step 2；
Step 4, stop finding.
The value of hybrid cytokine is m/n, and wherein n is the node total number in current network, and m is to be switched to depth from breadth traversal
The number of nodes of collection during traversal.
P2P network routing table acquisition process flows include, and flow 1, send P2P messages：Step 1 is pressed during startup to seed section
Point sends message；The node conveyed during non-start up according to the mixed strategy module of step 2 sends message；Flow 2, from P2P networks
Receive message；Flow 3, parsing node simultaneously preserve；Flow 4, judged by step 2 according to new node；If perform step 1 or
Step 3 carries out the iterative transmission message of flow 1, and flow 5 is jumped to if step 4 is performed；Flow 5, stop finding node, will adopt
The node of collection is saved in database.
Flow 1 is to send BOOTSTRAP_REQ messages.
Flow 2 is to receive BOOTSTRAP_RES messages.
Flow 3 is to parse the dozens of node in BOOTSTRAP_RES, and each node is<Node ID, IP, port>'s
Triple, these nodes have it is new have been friends in the past, old node is filtered, and new node is saved in node pool.Utilize
BOOSTRAP messages gather routing table information, more than the nodes that KADMELIA message returns, efficiency high.
P2P network routing table collectors, include network request sending module, network request receiving module, mixed strategy mould
Block, data storage module.Network request is sent and receiving module is responsible for handling P2P network communication parts.Mixed strategy module is born
Blame dynamic select acquisition strategies, maximum system efficiency.Data storage module is responsible for the nodal information collected to preserve,
Used for system iteration.
Mixed strategy module includes extreme saturation, breadth traversal and strategy factor.Extreme saturation module, refers to preferential detection
In logic closer to the new node of tested node；Breadth traversal module, refer to random probing new node.
The value that mixed strategy module is responsible for controlling elements makes it collect whole nodes n value minimum.
Network request sending module is used to sequentially send route requests, and for different P2P networks, the request of transmission disappears
Ceasing type can be different.
Network request is sent and receiving module is two independent threads.The two threads share a node in internal memory
Pond, the node pool save the node resource having been found that.
For Kad networks, network request sending module uses BOOTSTRAP_REQ messages, because it is returned every time
New node quantity it is most, it is more efficient more than KADMELIA2_REQ messages.This method is the logical of P2P network routing tables collection
With method, not exclusively in KAD networks.Network request sending module is changed, after network request receiving module, this method can be with
It is used on different P2P networks.
Network request receiving module：Be responsible for receiving BOOTSTRAP_RES messages, and parse the node IP of return, ID,
Port information, it is saved in node memory pond.
Node pool：P2P nodes known to being preserved in internal memory, access efficiency is far above database in internal memory.The number of use
It is java HashMap according to structure<String, peer>, Key is the ID of node, and peer is<IP, port, node ID>Three
Tuple.Ephemeral data（Node route list）All it is stored in memory node pond, far faster than file and the read-write operation of database.
Data storage module：The module has functioned simultaneously as the terminator of routing table collection, when the discovery rate of new node is less than
When 2%, system judges that collection can terminate.
Data storage module notice mixed strategy module is out of service, no longer drives the new section of network request sending module detection
Point；Then a period of time is stopped（2 minutes）, wait the message on network to completely return to after network request receiving module, in
The data deposited in node pool are written in database.
Beneficial effects of the present invention：Million scale P2P network routing tables of collection in this method energy short time, accurately collection
P2P network snapshots.Mixed strategy method is employed, the advantages of having taken into account depth, range method, while avoid its shortcoming.Temporarily
Data（Node route list）All it is stored in memory node pond, far faster than file and the read-write operation of database.Network request
Receiving module is single thread running, efficiency high, does not have thread switching problem.BOOSTRAP messages gather routing table information, than
The nodes that KADMELIA messages return are more, efficiency high.This method is the universal method of P2P network routing tables collection, not only
It is in KAD networks.Network request sending module is changed, after network request receiving module, this method can be used in difference
P2P networks on.
Brief description of the drawings
Fig. 1 is P2P network routing table collecting device structural representations.
Fig. 2 is P2P network routing table acquisition process flow charts.
Fig. 3 is that P2P network routing tables gather the flow chart that is stopped.
Embodiment
The invention will be further described with embodiment below in conjunction with the accompanying drawings.
As shown in figure 1, P2P network routing table collectors, comprising network request sending module, network request receiving module,
Mixed strategy module, data storage module.Network request is sent and receiving module is responsible for handling P2P network communication parts.Mixing
Dynamic select acquisition strategies, maximum system efficiency are responsible in policy module.Data storage module is responsible for the node collected to believe
Breath preserves, and is used for system iteration.
Mixed strategy module includes extreme saturation, breadth traversal and strategy factor.
Mixed strategy module is responsible for controlling the value of hybrid cytokine it is collected whole nodes n value minimum.This because
The value of son is the empirical value after a test of many times, and we are set to for the P2P networks of 600 to 700 ten thousand nodes
28.6% to 33.3%.
Data storage module is responsible for judging the termination of collection, when newfound number of nodes is dropped to below 2%, stops whole
Individual gatherer process.The data in internal memory are written in database simultaneously.
As shown in Fig. 2 P2P network routing table collector for processing flows are to send P2P messages, receive P2P messages, parse
New node is saved in node pool, and mixed strategy module judges whether the node of collection has arrived strategy factor and judged, continue with
Node to be measured is selected according to extreme saturation or selects node to be measured according to breadth traversal.
As shown in figure 3, data storage module is an independent thread, thread is waken up in each time window, is waken up
The new node number in node pool and the old nodes after preceding once wake-up are made comparisons afterwards, judge the proportional numbers of new node number.
1）If the proportional numbers of new node is higher than 2%, data storage module enters sleep states, and wait is called out next time
Wake up.
2）If the proportional numbers of new node is less than 2%, data storage module notice mixed strategy module from service, stop
New node is conveyed to data transmission blocks.
3）2）After the completion of wait 2 minutes, all BOOTSTRAP_RES messages all return to network request and connect on network
After receiving module.Data storage module is all written to the data in memory node pond in database.Operator is prompted on GUI：This
Secondary route gatherer process is completed, it was found that node xxxx.
Although above-mentioned the embodiment of the present invention is described with reference to accompanying drawing, model not is protected to the present invention
The limitation enclosed, one of ordinary skill in the art should be understood that on the basis of technical scheme those skilled in the art are not
Need to pay various modifications or deformation that creative work can make still within protection scope of the present invention.
Claims (10)
1. a kind of P2P network routing tables acquisition method, it is characterised in that comprise the steps of：
Step 1, node, random selection new node are found with breadth traversal algorithm；
Step 2, new node searching result is judged by mixed strategy；Mixed strategy is the nodes if collected
It is less than blend factor values with the estimated nodes ratio of the whole network, then jumps to step 1；If ratio is higher than blend factor values, jump to
Step 3；Step 4 is jumped to when reaching threshold value；
Step 3, take in-depth traverse method to find node, and jump to step 2；
Step 4, stop finding；
The value of hybrid cytokine is m/n, and wherein n is the node total number in current network, and m is to be switched to extreme saturation from breadth traversal
When collection number of nodes.
2. P2P network routing tables acquisition process flow according to claim 1, it is characterised in that include below scheme：
Flow 1, send P2P messages：During startup message is sent by step 1 to seed node；According to the mixing of step 2 during non-start up
The node of policy module conveying sends message；
Flow 2, from P2P networks receive message；
Flow 3, parsing node simultaneously preserve；
Flow 4, judged by step 2 according to new node；If perform step 1 or step 3 carries out iterative send of flow 1 and reported
Text, flow 5 is jumped to if step 4 is performed；
Flow 5, stop finding node, the node of collection is saved in database.
A kind of 3. P2P network routing tables collector according to claim 2, it is characterised in that comprising network request sending module,
Network request receiving module, mixed strategy module, data storage module；Network request is sent and receiving module is responsible for handling P2P
Network communication part；Mixed strategy module is responsible for dynamic select acquisition strategies, maximum system efficiency；Data storage module is responsible for
The nodal information collected is preserved, used for system iteration.
4. P2P network routing tables collector as claimed in claim 3, it is characterised in that mixed strategy module includes depth time
Go through, breadth traversal and strategy factor.
5. P2P network routing tables collector as claimed in claim 3, it is characterised in that the network request sends and received
Module is two independent threads；The two threads share a node pool in internal memory, and the node pool, which saves, to be had been found that
Node resource.
6. P2P network routing tables collector as claimed in claim 3, it is characterised in that for Kad networks, network request hair
Module is sent to use BOOTSTRAP_REQ messages；
Network request receiving module：It is responsible for receiving BOOTSTRAP_RES messages, and parses the node IP of return, ID, port
Information, it is saved in node memory pond.
7. P2P network routing tables collector as claimed in claim 3, it is characterised in that node pool use data structure be
Java HashMap<String, peer>, Key is the ID of node, and peer is<IP, port, node ID>Triple.
8. P2P network routing tables collector as claimed in claim 3, it is characterised in that data storage module functions simultaneously as road
The terminator gathered by table, when the discovery rate of new node is less than setting value, system judges that collection terminates；Data storage module is led to
Know that mixed strategy module is out of service, no longer drive network request sending module detection new node；Then a period of time is stopped, etc.
After the message on network is completely returned to network request receiving module, the data in memory node pond are written to database
In.
9. P2P network routing tables collector as claimed in claim 8, it is characterised in that data storage module functions simultaneously as road
The terminator gathered by table, when the discovery rate of new node is less than 2%, system judges that collection terminates；Data storage module notice is mixed
It is out of service to close policy module, no longer drives network request sending module detection new node；Then stop a period of time, wait net
Message on network is completely returned to after network request receiving module, and the data in memory node pond are written in database.
10. P2P network routing tables collector as claimed in claim 8, it is characterised in that data storage module functions simultaneously as road
The terminator gathered by table, when the discovery rate of new node is less than 2%, system judges that collection terminates；Data storage module notice is mixed
It is out of service to close policy module, no longer drives network request sending module detection new node；Then stop 2 minutes, wait network
On message completely return to after network request receiving module, the data in memory node pond are written in database.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610863784.XA CN107888436A (en) | 2016-09-30 | 2016-09-30 | A kind of P2P network routing tables acquisition method, flow and equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610863784.XA CN107888436A (en) | 2016-09-30 | 2016-09-30 | A kind of P2P network routing tables acquisition method, flow and equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107888436A true CN107888436A (en) | 2018-04-06 |
Family
ID=61769480
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610863784.XA Pending CN107888436A (en) | 2016-09-30 | 2016-09-30 | A kind of P2P network routing tables acquisition method, flow and equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107888436A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111314156A (en) * | 2020-03-02 | 2020-06-19 | 四川大学 | Overlay network snapshot obtaining method and evaluation method facing peer-to-peer network streaming media |
| CN113364730A (en) * | 2021-04-13 | 2021-09-07 | 苏州知微安全科技有限公司 | Progressive node active tracking method and device for P2P botnet |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101247207A (en) * | 2006-12-21 | 2008-08-20 | 财团法人工业技术研究院 | Hybrid sphere decoding method and system |
| WO2014079369A1 (en) * | 2012-11-21 | 2014-05-30 | Hangzhou H3C Technologies Co., Ltd. | Forwarding a packet in a network |
| CN105471094A (en) * | 2014-08-07 | 2016-04-06 | 国家电网公司 | Active power distribution network planning method of transformer substations |
| CN105893697A (en) * | 2016-04-22 | 2016-08-24 | 北京交通大学 | System reliability assessment method based on Bayesian network reasoning |
-
2016
- 2016-09-30 CN CN201610863784.XA patent/CN107888436A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101247207A (en) * | 2006-12-21 | 2008-08-20 | 财团法人工业技术研究院 | Hybrid sphere decoding method and system |
| WO2014079369A1 (en) * | 2012-11-21 | 2014-05-30 | Hangzhou H3C Technologies Co., Ltd. | Forwarding a packet in a network |
| CN105471094A (en) * | 2014-08-07 | 2016-04-06 | 国家电网公司 | Active power distribution network planning method of transformer substations |
| CN105893697A (en) * | 2016-04-22 | 2016-08-24 | 北京交通大学 | System reliability assessment method based on Bayesian network reasoning |
Non-Patent Citations (2)
| Title |
|---|
| NIEYIBIN2010: "KADEMLIA(eMule)P2P", 《新浪爱问共享资料》 * |
| 余杰，李强，李莎莎，马俊，李舟军: "《基于混合双层模型的DHT网络路由表快照算法》", 《计算机科学》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111314156A (en) * | 2020-03-02 | 2020-06-19 | 四川大学 | Overlay network snapshot obtaining method and evaluation method facing peer-to-peer network streaming media |
| CN113364730A (en) * | 2021-04-13 | 2021-09-07 | 苏州知微安全科技有限公司 | Progressive node active tracking method and device for P2P botnet |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Oliveira et al. | The (in) completeness of the observed Internet AS-level structure | |
| EP2742646B1 (en) | A method, apparatus and communication network for root cause analysis | |
| CN108512760A (en) | The method for routing of QoS of survice is ensured based on SDN | |
| CN106340176A (en) | Intelligent electricity meter information sharing method, intelligent electricity meter and acquisition router | |
| CN108055144A (en) | The monitoring method and system of a kind of network equipment | |
| CN103179178B (en) | The method and apparatus of aggregation group member port between extension cluster | |
| CN109618321A (en) | A kind of bluetooth Mesh network Transmission system and method realized based on routing table | |
| CN107277886B (en) | Internet of things equipment ad hoc network method based on WIFI | |
| CN103906136A (en) | Data service traffic managing and controlling method and device | |
| CN101969448A (en) | Method, system and equipment for searching active node in P2P streaming media system | |
| CN107888436A (en) | A kind of P2P network routing tables acquisition method, flow and equipment | |
| CN101500287A (en) | Cell reselection implementing method, apparatus and user terminal | |
| CN115766745B (en) | Method and device for collecting and broadcasting transaction data of block chain link point memory pool | |
| CN101834763B (en) | Multiple-category large-flow parallel measuring method under high speed network environment | |
| CN101212358B (en) | Network performance measuring method | |
| CN107566143A (en) | A kind of vertical stack finds method and apparatus | |
| CN109728959A (en) | A kind of network topology structure automatic analysis method, device and equipment | |
| CN101986608A (en) | Method for evaluating heterogeneous overlay network load balance degree | |
| CN101183998A (en) | Dynamic bidirectional round TCP stream buffer area establishing and executing method with timeliness | |
| CN104065587A (en) | FPGA-based intelligent transformer station network storm processing module and solution | |
| CN101083561A (en) | Method for summarizing and reporting XDSL user connection parameter to network management | |
| Bai et al. | Multi-priority routing algorithm based on source node importance in complex networks | |
| CN109743260A (en) | A kind of device and method that network flow is filtered based on improved ACBM algorithm | |
| CN113595750B (en) | Network topology dividing method and device and network topology management equipment | |
| CN105187264B (en) | A kind of method, communication equipment and the system of direct connected link quality-monitoring |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180406 |
|
| RJ01 | Rejection of invention patent application after publication |