CN104009891B - Based on the method that multiprobe node detects P2P web search focuses - Google Patents
Based on the method that multiprobe node detects P2P web search focuses Download PDFInfo
- Publication number
- CN104009891B CN104009891B CN201410259618.XA CN201410259618A CN104009891B CN 104009891 B CN104009891 B CN 104009891B CN 201410259618 A CN201410259618 A CN 201410259618A CN 104009891 B CN104009891 B CN 104009891B
- Authority
- CN
- China
- Prior art keywords
- kademlia
- search
- chord
- node
- key
- 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
Links
Abstract
The invention discloses a kind of method for detecting P2P web search focuses based on multiprobe node, it is therefore an objective to solve the problems, such as to be difficult to carry out efficient detection to focus is searched in network.Technical scheme is first to build the probe node set being made up of N number of probe node, and each probe node is found to constitute with part is reported by intervalometer, hot pixel threshold setting device, Kademlia logical blocks, Chord logical blocks and focus；Affiliated probe node is added Kademlia networks, Chord logical blocks that probe node is constituted Chord networks according to Chord agreements then according to Kademlia agreements by Kademlia logical blocks；Each probe node is detected to Kademlia web search focuses, count in a distributed manner each search content search source nodes, find search focus, it may be found that focus be reported to central server.Efficient detection can be carried out to focus is searched in network using the present invention.
Description
Technical field
The present invention relates to the method detected to Kademlia web search focuses, espespecially based on multiple probe nodes,
The method for detecting Kademlia web search focuses in a distributed manner.
Background technology
Kademlia agreements are a kind of typical DHT (Distributed Hash Table, distributed Hash table) agreements, extensively
It is general for building extensive, pure distributed P2P (Peer to Peer) network, such as electric donkey, BitTorrent etc..For being based on
The large-scale P2P networks of Kademlia, efficiently perceive its focus and search for content, are conducive to finding what is propagated in P2P networks in time
Fallacious message, and cause Security Officer quickly to take measures to be contained.However, as this P2P networks are pure distributivities mostly
, i.e., no centralized servers, this causes the search focus of efficient detection whole network to become a difficult problem.
Kademlia gives one unique, random mark of each node distribution, i.e. nodeID；Distribute one for each object
Similar mark, i.e. objectID (are also called key).These ID are usually used this one-way hash functions of SHA-1 to generate, ID
The distance between using XOR measuring.
In Kademlia networks, each object is stored in nodeID closest on the K node of its objectID.K
General value is 20.
The routing table of each Kademlia node is made up of L (L is equal to the number of bits of node identification) individual chained list, each chain
Table is referred to as one " K-bucket ", for recording in network to the XOR distance of oneself in interval [2i,2i+1) (i is K-bucket
Sequence number, 0≤i ＜ L) in neighbor node information, every information is with tlv triple ＜ IP address, UDP port number, nodeID ＞
Form is represented and is stored.Kademlia agreements specify that K-bucket length is with K as the upper limit.Come whenever Kademlia nodes are received
From the message of other nodes, it just according to the message sending node to the ＜ IP address in the XOR distance and message of oneself,
UDP port number, updating the record in K-bucket, this is referred to as piggybacking (piggybacking) to nodeID ＞ information.L
K-bucket constitutes the routing table of a Kademlia node, therefore routing table is also referred to as " K-buckets ".In one routing table
L K-bucket is distinguished by continuous sequence number i.
Kademlia agreements are by a kind of four RPC (Remote Process Call, remote procedure call are orders) group
It is PING, STORE, FIND_NODE, FIND_VALUE respectively into, its title, their work is as follows：
PING：It is whether online for detecting a node；
STORE:Indicate that a node stores a ＜ key, value ＞ couple, in order to the data acquisition in future.Key is
Object hashed value, i.e. objectID, value are real data object (or its index)；
FIND_NODE:With ID as parameter, the recipient of FIND_NODE RPC is with ＜ IP address, UDP port number, nodeID
The form of ＞ returns the K node nearest from Target id known to him；
FIND_VALUE：With key as parameter, the corresponding value of key are found.
Chord agreements (are sent out in calendar year 2001 in ACM SIGCOMM international conferences referring to Stoica I and Morris R et al.
Paper " the Chord of table:A scalable peer-to-peer lookup service for Internet
Applications it is a kind of it is extendible, for the point-to-point positioning service of internet, applications ") be MIT put forward based on P2P
Network consultancy service agreement.In Chord agreements, the mark of each node is typically by carrying out Hash operation to node IP address
Obtain.All node identifications are arranged from small to large in an ordered linear table, by node identification modulo operation, by linear list
Join end to end, that is, formed a node identification ring.By Hash operation is carried out to Resource Key, the keyword of m positions is obtained
Mark, carries out aforesaid operations to resource identification, forms a resource identification ring again.Resource identification ring and node identification ring weight
It is folded, it is exactly the basis of the routing algorithm of Chord agreements.
In Chord agreements, nodeID also illustrates that node identification, and object identity objectID (or key) is also referred to as provided
Source key identifies (or key).The all nodes of Chord according to nodeID from small to large arranged clockwise on a ring, object o
The data message of (o is key) is all stored in clockwise direction node identifier on ring and is more than in first node of o identifiers, should
Node is referred to as the descendant node of object o, is denoted by successor (o).Each Chord node maintenance forerunner of oneself and
Follow-up, node forerunner is first nodes of the nodeID less than the node on ring, and it is that nodeID is more than on ring that node is follow-up
First node of the node.
Current Hot Contents cognitive method is primarily directed to the public information such as news report, network topics in the Internet,
Method used is mainly by carrying out pretreatment to these public informations, is then counted using the method for cluster analyses,
And focus is obtained by certain ranking functions.Used as the acentric pure distributed network of one kind, each saves Kademlia networks
The search situation of point is private, therefore existing Hot Contents cognitive method cannot be suitable for.
The content of the invention
For the caused problem because of the pure distributivity of Kademlia networks at present --- it is difficult to focus is searched in network
Efficient detection is carried out, a kind of method that P2P web search focuses are detected based on multiprobe node is proposed.
Probe node is in check node, for perceiving the search activities of Kademlia nodes.
The technical scheme is that：(such as 20, advised depending on Kademlia networks by N is disposed in Kademlia networks
Depending on mould, i.e.,WhereinFor the computing that rounds up, N, S are positive integer, and S is the node in Kademlia networks
Sum) individual probe node, perceive the search activities of each local of Kademlia networks；By disposing on these probe nodes
Chord agreements, realize the distribution of perceived content and converge；By each probe Node distribution formula geo-statistic, each searches for content
Search source nodes, find search focus；The focus that finally will be seen that is reported to central server.Technical solution of the present invention includes
Following steps：
The first step, builds the probe node set being made up of N number of probe node；Applying for electronic mailbox, as maincenter service
Mailbox.Probe node has certain intelligent, also referred to as intelligent node.Each probe node is made up of five parts, respectively
It is intervalometer, hot pixel threshold arranges device, Kademlia logical blocks, Chord logical blocks and focus find and report part.
Intervalometer is found and the module for reporting part to arrange working cycle T for focus.T is typically set to 6 hours.
Hot pixel threshold arranges device to be found and the module for reporting part to arrange threshold value TH for focus.Once in working cycle T
The interior nodes for searching for certain content are considered focus more than TH.The setting of TH is decided as circumstances require, and can typically be set to 10000-
50000。
Kademlia logical blocks are probe nodes according to things such as the request of Kademlia protocol processes nodes, search
The module of business, and the search activities for perceiving are passed to into Chord logical blocks.Kademlia logical blocks are saved for Kademlia
Point provide PING, tetra- remote procedure call functions of STORE, FIND_NODE, FIND_VALUE, for normal response other
The request of Kademlia nodes, in order to avoid affect Kademlia network normal services.According to Kademlia agreements, Kademlia logics
Part is the Kademlia network identity KadNodeID of one 128bit of each probe node distribution.Upon receipt of from net
Network be designated the source node of KadNodeID to certain object identity for the content of Key request FIND_VALUE (Key), will
This search activities information ＜ Key, KadNodeID ＞ give Chord logical blocks.
Chord logical blocks are probe nodes according to Chord protocol processes Chord network organizations, distribution search activities letter
The module of the affairs such as breath.In Chord networks, the network identity length of each probe node is 128bit, each object identity
Length is also 128bit, and the Chord network identities of probe node are identical with the Kademlia network identities of probe node.Chord
The search activities information sent by Kademlia logical blocks is distributed in Chord networks by logical block.According to Chord
Agreement, the search activities information with same search target can be converged on same probe node via Chord networks, the spy
The search activities information of convergence is submitted to focus discovery and reports part by the Chord logical blocks of pin knot point.For example, once connecing
The ＜ Key that Kademlia logical blocks are sent are received, KadNodeID ＞, Chord logical blocks are just issued in Chord networks
＜ Key, KadNodeID ＞.According to Chord agreements, ＜ Key, KadNodeID ＞ can be stored in from Key nearest probe node
On.Therefore for identical search destination object mark Key, the ＜ Key issued by different probe node, KadNodeID ＞ letter
Breath all can be via on Chord protocol convergences to same probe node, and the probe node is referred to as the root node S (key) of Key.
Focus finds and reports part to be to find to search for focus and report the module of central server inside have list item to be ＜
Key values, always search for number, and (item number is equal to the destination object mark of search activities in network to the convergence table of source search node collection ＞
Number, is designated as σ, and σ is integer and σ >=0), and Key values are object identities, as table item index, are the destination object marks of search activities
Know；Total search number is the number of the source node that search is initiated to Key values；Source search node collection have recorded initiates search to the Key
Institute's active node logo collection.If certain list item ＜ Key, SearchNum, { KadNodeID1,KadNodeID2... } ＞
Total search number SearchNum exceedes hot pixel threshold TH, then it is search focus, focus to illustrate that destination object is designated the content of Key
It was found that servicing mailbox, { KadNodeID with reporting part that the list item is sent to maincenter by Email1,KadNodeID2,…}
For the source search node collection of Key, subscript is used to distinguish different source search nodes.
Maincenter service mailbox is responsible for receiving the search hot information reported from all probe nodes, obtains global focus
Information.
Second step, the timer part of all probe nodes arrange cycle T (such as 6 hours), the focus of all probe nodes
Threshold setter part arranges hot pixel threshold TH (such as 10000).
3rd step, Kademlia logical blocks are according to Kademlia agreements by the Kademlia logical blocks affiliated probe section
Point add Kademlia networks, Chord logical blocks then according to Chord agreements by probe node constitute Chord networks (referring to
Paper " the Chord that Stoica I and Morris R et al. were delivered in ACM SIGCOMM international conferences in calendar year 2001:A
Scalable peer-to-peer lookup service for Internet applications one kind is extendible, use
In the point-to-point positioning service of internet, applications ").
4th step, each probe node separately detect the search activities in Kademlia networks, and search focus is sent to
Maincenter services mailbox：
4.1) Kademlia logical blocks and Chord logical blocks monitor message in real time.
4.2) if Kademlia logical blocks receive kademlia network messages, turn 4.3)；If Chord logics
Part receives chord network messages, then turn 4.7)；If probe node receives the exit instruction of system, go to step
4.17)。
4.3) Kademlia logical blocks according to Kademlia agreement normal response kademlia messages (response method referring to
Paper " the Kademlia that Maymounkov P and Mazieres D was delivered in first P2P system international conference in 2002:
A kind of points measured based on XOR of A peer-to-peer information system based on the xor metric
To dot system " 2.3 Kademlia protocol in the 57-59 page).
4.4) Kademlia logical blocks judge whether the kademlia messages are search activities information ＜ key,
KadNodeID ＞, basis for estimation are whether the kademlia messages include source node of the network identity for KadNodeID to certain
Request command FIND_VALUE (Key) of the object identity for the content of Key.If it is, going to step 4.5)；Otherwise, go to step
4.1)。
4.5) Kademlia logical blocks are by this kademlia search activities information ＜ key for being perceived,
KadNodeID ＞ send Chord logical blocks to, and find the responsible key's in Chord networks by Chord logical blocks
Root node S (key) (is delivered in calendar year 2001 in ACM SIGCOMM international conferences referring to Stoica I and Morris R et al.
Paper " Chord:A scalable peer-to-peer lookup service for Internet applications mono-
It is kind extendible, for the point-to-point positioning service of internet, applications ").
4.6) Chord logical blocks issue this Kademlia for perceiving to root node S (key) in Chord networks
4.1) search activities information ＜ key, KadNodeID ＞, go to step.
4.7) Chord logical blocks according to Chord agreement normal response chord messages (referring to Stoica I and Morris
Paper " the Chord that R et al. was delivered in ACM SIGCOMM international conferences in calendar year 2001:A scalable peer-to-peer
Lookup service for internet applications it is a kind of it is extendible, for the point-to-point fixed of internet, applications
Position service ").
4.8) whether Chord logical blocks are believed comprising Kademlia search activities in judging received chord messages
Breath.If comprising by the Kademlia search activities information ＜ key, KadNodeID ＞ send focus to and find and report portion
4.9) part, go to step；Otherwise, go to step 4.1).
4.9) focus finds and whether has had the list item with key as index in reporting part inspection convergence table.If it has,
Go to step 4.10)；Otherwise, go to step 4.14).
4.10) focus finds to check whether the source search node concentration corresponding to key includes with part is reported
KadNodeID.If comprising going to step 4.15)；If do not included, go to step 4.11).
4.11) focus finds to increase into key as the source search node collection of the convergence table list item for indexing with part is reported
KadNodeID, total search number SearchNum add 1.
4.12) focus finds and the total search number SearchNum for reporting part to judge the convergence table list item with key to index
Whether threshold value TH is reached.If it is, going to step 4.13)；Otherwise, go to step 4.15).
4.13) focus find with report part to judge key for search focus, the list item is reported into maincenter by Email
Service mailbox, and the list item is removed, go to step 4.15).
4.14) focus finds to increase ＜ key, a SearchNum, { KadNodeID } in convergence table newly with part is reported
SearchNum is initialized as 1 by ＞.
4.15) focus finds to judge whether this cycle T terminates with part is reported.If it is, going to step 4.16)；Otherwise, turn
Step 4.1).
4.16) focus finds to converge all list item removings of table with part is reported, and (intervalometer is when T to reset intervalometer
Between to reset once, the multiple search of same source search node in T time can be merged as 1 time), go to step 4.1),.
4.17) terminate.
Following technique effect can be reached using the present invention：
1st, the division of labor of structure and five logical blocks of the present invention by first step middle probe node is arranged, and is not only overcome
The distributed nature of P2P networks especially pure distributed P2P networks such as Kademlia, and P2P networks can be effectively utilized
This distributed nature P2P Network focuses are detected；
2nd, by the reasonable setting in second step to timer period and focus threshold values, and 4.16) in repeatedly may
Repeat search merger process etc., it is ensured that the accuracy to P2P web search hot point inspections；
3rd, by the reasonable utilization in the 3rd step to Kademlia and Chord agreements, it is effectively improved and P2P networks is searched
The efficiency detected by rope focus.
Description of the drawings
Fig. 1 is that probe node of the present invention works the network architecture and basic principle schematic to be formed；
Fig. 2 is the building-block of logic of the probe node that the first step of the present invention builds；
General flow charts of the Fig. 3 for this method；
Fig. 4 is the workflow diagram of each probe node in the 4th step of the invention；
Fig. 5 is that focus of the present invention finds and reports the convergence table structural representation in part.
Specific embodiment
Fig. 1 is that probe node of the present invention works the network architecture and basic principle schematic to be formed, by Kademlia
A number of probe node is disposed in network, the search activities of each local of Kademlia networks are perceived；By in these spies
Chord agreements are disposed on pin knot point, the distributed statistics of search activities is realized and is reported to maincenter service mailbox.
Fig. 2 is the building-block of logic of the probe node that the first step of the present invention builds, and probe node includes five logical blocks：
Intervalometer is found and the module for reporting part to arrange working cycle T for focus；Hot pixel threshold arrange device be for focus find with
Report part that the module of threshold value TH is set；Kademlia logical blocks are probe nodes according in Kademlia protocol processes networks
The module of the affairs such as node request, search, and the search activities for perceiving are passed to into Chord logical blocks；Chord logic sections
Part is module of the probe node according to affairs such as Chord protocol processes Chord network organizations, distribution search activities information；Focus
It was found that being discovery search focus and reporting the module that maincenter services mailbox with part is reported.
Fig. 3 is the general flow chart of the present invention：
The first step, builds the probe node set being made up of N number of probe node, application maincenter service mailbox；
Second step, the timer part of all probe nodes arrange cycle T (such as 6 hours), the focus of all probe nodes
Threshold setter part arranges hot pixel threshold TH (such as 10000)；
3rd step, Kademlia logical blocks are according to Kademlia agreements by the Kademlia logical blocks affiliated probe section
Point adds Kademlia networks, Chord logical blocks that probe node is constituted Chord networks according to Chord agreements then；
4th step, each probe node separately detect the search activities in Kademlia networks, and search focus is sent to
Maincenter services mailbox.
Fig. 4 is the workflow diagram of each probe node in the 4th step of the invention：
4.1) Kademlia logical blocks and Chord logical blocks monitor message in real time.
4.2) if Kademlia logical blocks receive kademlia network messages, turn 4.3)；If Chord logics
Part receives chord network messages, then turn 4.7)；If probe node receives the exit instruction of system, go to step
4.17)。
4.3) Kademlia logical blocks are according to Kademlia agreement normal response kademlia messages.
4.4) Kademlia logical blocks judge whether the kademlia messages are search activities information ＜ key,
KadNodeID ＞.If it is, going to step 4.5)；Otherwise, go to step 4.1).
4.5) Kademlia logical blocks are by this kademlia search activities information ＜ key for being perceived,
KadNodeID ＞ send Chord logical blocks to, and find the responsible key's in Chord networks by Chord logical blocks
Root node S (key).
4.6) Chord logical blocks issue this Kademlia for perceiving to root node S (key) in Chord networks
4.1) search activities information ＜ key, KadNodeID ＞, go to step.
4.7) Chord logical blocks are according to Chord agreement normal response chord messages.
4.8) whether Chord logical blocks are believed comprising Kademlia search activities in judging received chord messages
Breath.If comprising by the Kademlia search activities information ＜ key, KadNodeID ＞ send focus to and find and report portion
4.9) part, go to step；Otherwise, go to step 4.1).
4.9) focus finds and whether has had the list item with key as index in reporting part inspection convergence table.If it has,
Go to step 4.10)；Otherwise, go to step 4.14).
4.10) focus finds to check whether the source search node concentration corresponding to key includes with part is reported
KadNodeID.If it is, going to step 4.15)；Otherwise, go to step 4.11).
4.11) focus finds to increase into key as the source search node collection of the convergence table list item for indexing with part is reported
KadNodeID, total search number SearchNum add 1.
4.12) focus finds to judge whether total search number of the convergence table list item with key to index reaches with part is reported
Threshold value TH.If it is, going to step 4.13)；Otherwise, go to step 4.15).
4.13) focus find with report part to judge key for search focus, the list item is reported into maincenter by Email
Service mailbox, and the list item is removed, go to step 4.15).
4.14) focus finds to increase ＜ key, a SearchNum, { KadNodeID } in convergence table newly with part is reported
SearchNum is initialized as 1 by ＞.
4.15) focus finds to judge whether this cycle T terminates with part is reported.If it is, going to step 4.16)；Otherwise, turn
Step 4.1).
4.16) focus finds to converge all list item removings of table with part is reported, and (intervalometer is when T to reset intervalometer
Between to reset once, the multiple search of same source search node in T time can be merged as 1 time), go to step 4.1.
4.17) terminate.
Convergence table list item in Fig. 5 is ＜ Key values, always searches for number, and source search node collection ＞, wherein key values are object marks
Know, as table item index, be the destination object mark of search activities；Total search number SearchNum is to initiate to search for key values
The number of source node；Source search node collection record initiates the logo collection of institute's active node of search to the key.Different list items
Key and SearchNum be distinguish between with subscript, the source search node of different list items is distinguished with first subscript, same list item
In not homologous search node then distinguished with second subscript.
Claims (3)
1. it is a kind of based on multiprobe node detect P2P web search focuses method, it is characterised in that comprise the following steps：
The first step, builds the probe node set being made up of N number of probe node, and N is positive integer；Applying for electronic mailbox, as in
Pivot services mailbox；Each probe node is made up of five parts, is intervalometer respectively, and hot pixel threshold setting device, Kademlia are patrolled
Part is collected, Chord logical blocks and focus find and report part；
Intervalometer is found and the module for reporting part to arrange working cycle T for focus；
Hot pixel threshold arranges device to be found and the module for reporting part to arrange threshold value TH for focus, once search in working cycle T
The nodes of rope certain content are considered focus more than TH；
Kademlia logical blocks are probe nodes according to the request of Kademlia protocol processes nodes, the mould of search affairs
Block, and the search activities for perceiving are passed to into Chord logical blocks；Kademlia logical blocks are provided for Kademlia nodes
Tetra- remote procedure call functions of PING, STORE, FIND_NODE, FIND_VALUE, for other Kademlia of normal response
The request of node；According to Kademlia agreements, Kademlia logical blocks are one 128bit of each probe node distribution
Kademlia network identity KadNodeID；Upon receipt of from network identity for KadNodeID source node to certain object
Request FIND_VALUE (Key) of the ident value for the content of Key, will this search activities information ＜ Key, KadNodeID ＞
Send Chord logical blocks to；Search activities information is represented with two tuple ＜ Key, KadNodeID ＞；
Chord logical blocks are probe nodes according to Chord protocol processes Chord network organizations, distribution search activities information thing
The module of business；In Chord networks the network identity length of each probe node be 128bit, the length of each object identity
For 128bit, the Chord network identities of probe node are identical with the Kademlia network identities of probe node；Chord logic sections
The search activities information sent by Kademlia logical blocks is distributed in Chord networks by part；According to Chord agreements,
Search activities information with same search target is converged on same probe node via Chord networks, the probe node
Chord logical blocks by the search activities information of convergence be submitted to focus find with report part；Search activities information ＜
Key, KadNodeID ＞ is stored on the nearest probe nodes of Key, for identical search destination object mark Key, by not
With the search activities information of probe node issue via on Chord protocol convergences to same probe node, the probe node claims
For the root node S (Key) of Key；
Focus finds and reports part to be to find to search for focus and report the module of central server inside have list item to be ＜ Key
Value, always searches for number, and the convergence table of source search node collection ＞, the item number for converging table are equal to the destination object mark of search activities in network
The number of knowledge, is designated as σ, and σ is for integer and σ >=0, wherein Key values are object identities, as table item index, is the mesh of search activities
Mark object identity；Total search number is the number of the source node that search is initiated to Key values；Source search node collection is have recorded to the Key
Initiate the logo collection of institute's active node of search；Focus finds and the list item for reporting part that total search number is exceeded hot pixel threshold
Maincenter is sent to by Email and services mailbox；
Maincenter service mailbox is responsible for receiving the search hot information reported from all probe nodes, obtains global focus letter
Breath；
Second step, the timer part of all probe nodes arrange cycle T, and the hot pixel threshold of all probe nodes arranges device part
Hot pixel threshold TH is set；
The Kademlia logical blocks affiliated probe node is added by the 3rd step, Kademlia logical blocks according to Kademlia agreements
Enter Kademlia networks, probe node is then constituted Chord networks according to Chord agreements by Chord logical blocks；
4th step, each probe node separately detect the search activities in Kademlia networks, and search focus is sent to maincenter
Service mailbox：
4.1) Kademlia logical blocks and Chord logical blocks monitor message in real time；
If 4.2) Kademlia logical blocks receive kademlia network messages, turn 4.3)；If Chord logical blocks connect
Chord network messages are received, is turned 4.7)；If probe node receives the exit instruction of system, go to step 4.17)；
4.3) Kademlia logical blocks are according to Kademlia agreement normal response kademlia messages；
4.4) Kademlia logical blocks judge whether the kademlia messages are search activities information ＜ Key, KadNodeID
＞, basis for estimation are whether the kademlia messages include source node of the network identity for KadNodeID to certain object identity
For the request command FIND_VALUE (Key) of the content of Key, if it is, going to step 4.5)；Otherwise, go to step 4.1)；
4.5) Kademlia logical blocks are by this kademlia search activities information ＜ Key for being perceived, KadNodeID ＞
Send Chord logical blocks to, and found the root node S of the responsible Key by Chord logical blocks in Chord networks
(Key)；
4.6) Chord logical blocks issue this Kademlia search for perceiving to root node S (key) in Chord networks
4.1) action message ＜ Key, KadNodeID ＞, go to step；
4.7) Chord logical blocks are according to Chord agreement normal response chord messages；
4.8) whether Chord logical blocks include Kademlia search activities information in judging received chord messages, such as
Fruit includes, and by the Kademlia search activities information ＜ Key, KadNodeID ＞ send focus to and find and report part, turn step
It is rapid 4.9)；Otherwise, go to step 4.1)；
4.9) focus finds and whether has had in reporting part inspection convergence table the list item with Key as index, if it has, turning step
It is rapid 4.10)；Otherwise, go to step 4.14)；
4.10) focus finds and reports that part checks that the source search node corresponding to Key is concentrated and whether includes KadNodeID, such as
Fruit includes, and goes to step 4.15)；If do not included, go to step 4.11)；
4.11) focus finds to increase into Key as the source search node collection of the convergence table list item for indexing with part is reported
KadNodeID, total search number SearchNum add 1；
4.12) whether focus finds to judge total search number SearchNum with Key as the convergence table list item of index with part is reported
Threshold value TH is reached, if it is, going to step 4.13)；Otherwise, go to step 4.15)；
4.13) focus find with report part to judge Key for search focus, the list item is reported into maincenter service by Email
Mailbox, and the list item is removed, go to step 4.15)；
4.14) focus finds to increase ＜ Key, a SearchNum in convergence table newly with part is reported, and { KadNodeID } ＞ will
SearchNum is initialized as 1；
4.15) with part is reported, focus discovery judges whether this cycle T terminates, if it is, going to step 4.16)；Otherwise, go to step
4.1)；
4.16) focus finds to converge all list item removings of table with part is reported, and resets intervalometer, goes to step 4.1), described fixed
When device to reset once every T time, the multiple search of same source search node in T time can be merged as 1 time；
4.17) terminate.
2. a kind of method that P2P web search focuses are detected based on multiprobe node as claimed in claim 1, it is characterised in that
T is set to 6 hours.
3. a kind of method that P2P web search focuses are detected based on multiprobe node as claimed in claim 1, it is characterised in that
TH is set to 10000-50000.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410259618.XA CN104009891B (en) | 2014-06-12 | 2014-06-12 | Based on the method that multiprobe node detects P2P web search focuses |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410259618.XA CN104009891B (en) | 2014-06-12 | 2014-06-12 | Based on the method that multiprobe node detects P2P web search focuses |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104009891A CN104009891A (en) | 2014-08-27 |
| CN104009891B true CN104009891B (en) | 2017-04-05 |
Family
ID=51370387
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410259618.XA Active CN104009891B (en) | 2014-06-12 | 2014-06-12 | Based on the method that multiprobe node detects P2P web search focuses |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104009891B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112235401B (en) * | 2020-10-14 | 2021-09-24 | 北京理工大学 | Routing table information searching method and system based on chord algorithm |
| CN112954080B (en) * | 2021-04-13 | 2022-03-04 | 苏州知微安全科技有限公司 | Relay routing pyramid data storage method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2004084030A2 (en) * | 2003-03-18 | 2004-09-30 | Siemens Corporate Research Inc. | A meta-search web service-based architecture for peer-to-peer collaboration and voice-over-ip |
| CN1988518A (en) * | 2006-12-13 | 2007-06-27 | 北京交通大学 | Counterpart network searching method |
| CN101605094A (en) * | 2009-04-29 | 2009-12-16 | 哈尔滨工程大学 | Ring model and routing algorithm thereof based on point to point network |
-
2014
- 2014-06-12 CN CN201410259618.XA patent/CN104009891B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2004084030A2 (en) * | 2003-03-18 | 2004-09-30 | Siemens Corporate Research Inc. | A meta-search web service-based architecture for peer-to-peer collaboration and voice-over-ip |
| CN1988518A (en) * | 2006-12-13 | 2007-06-27 | 北京交通大学 | Counterpart network searching method |
| CN101605094A (en) * | 2009-04-29 | 2009-12-16 | 哈尔滨工程大学 | Ring model and routing algorithm thereof based on point to point network |
Non-Patent Citations (1)
| Title |
|---|
| 基于热点节点搜索方法的P2P流媒体平台的研究与设计;刘艳华;《中国优秀硕士学位论文全文数据库》;20111231;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104009891A (en) | 2014-08-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Li et al. | A FCM-Based peer grouping scheme for node failure recovery in wireless P2P file sharing | |
| Rahimian et al. | Vitis: A gossip-based hybrid overlay for internet-scale publish/subscribe enabling rendezvous routing in unstructured overlay networks | |
| CN102724063A (en) | Log collection server, data packet delivering and log clustering methods and network | |
| Spoto et al. | Analysis of PPLive through active and passive measurements | |
| Viloria Silva et al. | Virtual network level of application composed IP networks connected with systems-(NETS Peer-to-Peer) | |
| Matos et al. | StAN: exploiting shared interests without disclosing them in gossip-based publish/subscribe. | |
| Scheideler et al. | A distributed and oblivious heap | |
| CN104009891B (en) | Based on the method that multiprobe node detects P2P web search focuses | |
| Essaid et al. | Visualising bitcoin’s dynamic p2p network topoogy and performance | |
| Memon et al. | Large-scale monitoring of DHT traffic. | |
| Reddy et al. | Heuristic-based real-time p2p traffic identification | |
| Ruslan et al. | Routing performance of structured overlay in Distributed Hash Tables (DHT) for P2P | |
| Tao et al. | As path inference: From complex network perspective | |
| Hasan et al. | A self adaptive super peer based topology for unstructured P2P system | |
| CN104038547A (en) | Method for effectively resolving multi-Sybil node penetration conflict in P2P network | |
| Hsiao et al. | A tree-based peer-to-peer network with quality guarantees | |
| Kandakur et al. | Survey: Robust Data Aggregation Techniques in Wireless Sensor Networks | |
| Yang et al. | Cocktail method for BitTorrent traffic identification in real time. | |
| Liu et al. | A versatile crawler for Kademlia-based networks and its convergence analysis | |
| Moorhouse et al. | Modelling and simulation of peer-to-peer overlay network protocols using oversim | |
| Hsiao et al. | Building small-world peer-to-peer networks based on hierarchical structures | |
| Banno et al. | Adaptive topology for scalability and immediacy in distributed publish/subscribe messaging | |
| Cai et al. | An analysis of the discovery and elimination algorithm in the P2P environment | |
| Hu et al. | An improved Kademlia resource locating for P2P systems | |
| Yang et al. | Assigning identifications to nodes in unstructured peer-to-peer networks: A novel approach to improving search efficiency |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |