CN101409665B - Method and apparatus for processing P2P network node route - Google Patents
Method and apparatus for processing P2P network node route Download PDFInfo
- Publication number
- CN101409665B CN101409665B CN2007101756020A CN200710175602A CN101409665B CN 101409665 B CN101409665 B CN 101409665B CN 2007101756020 A CN2007101756020 A CN 2007101756020A CN 200710175602 A CN200710175602 A CN 200710175602A CN 101409665 B CN101409665 B CN 101409665B
- Authority
- CN
- China
- Prior art keywords
- node
- network
- carried out
- route
- module
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a method for processing a route of a P2P network node and a device thereof. The method mainly comprises the following steps: capacity information of the node is acquired according to the diversity coefficient of the node; a routing list of the node is set according to the capacity information of the node; and the node processes the route according to the routing list. With the utilization of the method, the performance of DHT under network disturbance in the P2P network can be improved and the robustness of the P2P network under disturbance is improved with lower maintenance cost.
Description
Technical field
The present invention relates to network communication field, relate in particular to a kind of method and apparatus that the P2P network node is carried out the route processing.
Background technology
Shared service just develops rapidly, uses very extensively.At present, each producer of industry has all dropped into considerable manpower and materials and has carried out P2P (peer-to-peer, peer-to-peer network) system research.A kind of research direction of P2P system is how the P2P algorithm design to be got better, by to the observation of construction network.Important phenomenon be exactly these construction network very high rate of excitation is all arranged, have promptly that very high node adds, the ratio of deviated from network.An important index measuring disturbance is the node session time: promptly add network to the time period the deviated from network from node.Some establishing network the average nodal Session Time in addition have only a few minutes.
DHT (Distributed Hash Table, distributed hashtable) is the key technology of present structured P 2 P network, existing DHT be implemented in rate of excitation when very high decreased performance get very fast.Disturbance inquires about to produce a lot of problems after surpassing certain level in existing system: the time as needs is long especially, inquiry is failed or Query Result is inconsistent.
DHT of the prior art realizes, such as, Kademlia[1], Pastry[13], Bamboo[10], Tapestry[5], Kelips[12], Chord[4] and Koorde[11], when network condition was stablized, all above-mentioned DHT are implemented in storage cost and aspect of performance is all put up a good show.But, if the network disturbance situation of reality is handled badly, rapid variation will often take place in network condition, above-mentioned most of DHT is because itself in the limitation of aspects such as structure, protocol measure index, routing iinformation preservation and maintenance strategy, learning ability, can not handle perturbed problem effectively.
Such as, above-mentioned most of DHT realizes being unable to bear the influence of relatively shorter Session Time, when rate of excitation is very high, after disturbance has surpassed certain level, inquire about in the P2P system of existing DHT formula and will produce a lot of problems: the time as needs is long especially, inquiry is failed or Query Result is inconsistent.Thereby the performance that causes these DHT to realize sharply descends.
Summary of the invention
The purpose of this invention is to provide a kind of method of the P2P network node being carried out the route processing.Thereby solved the problem that DHT in the existing P2P network realizes handling effectively the network disturbance situation.
The objective of the invention is to be achieved through the following technical solutions:
A kind of method that the P2P network node is carried out the route processing comprises:
Obtain the ability information of node according to the diversity coefficient of node, the routing table of node is set according to the ability information of described node, the routing table of described node comprises: light lists, bucket table and at least one in the node table closely, comprise in the described light lists and this node between the P2P network distance less than the node of preset threshold, comprise in the described bucket table and satisfy predetermined conditions and node capacity node greater than pre-set threshold, the distributed hashtable DHT that described predetermined conditions is adopted according to the P2P network realizes determining, comprise in the described closely node table and this node between the IP network distance less than the node of preset threshold;
Determine described light lists, bucket table and the interstitial content of closely preserving in the node table according to the ability of each node, according to described routing table described node is carried out route and handle.
A kind of device that the P2P network node is carried out the route processing comprises:
The node capacity information acquisition module is used to calculate the diversity coefficient of node, obtains the ability information of node according to described diversity coefficient;
Node route list is provided with module, and the ability information that is used for the node that obtained according to described node capacity information acquisition module is provided with the routing table of node;
Node route processing module is used for according to described node route list the set routing table of module being set, and described node is carried out route handle;
Described node route list is provided with module and comprises: light lists be provided with module, bucket table be provided with module and closely node table in the module at least one is set,
Described light lists is provided with module, is used to be provided with the light lists of node, comprise in the described light lists and this node between the P2P network distance less than the node of preset threshold;
Described bucket table is provided with module, be used to be provided with the bucket table of node, comprise in the described bucket table and satisfy predetermined conditions and the node capacity node greater than pre-set threshold, the distributed hashtable DHT that described predetermined conditions is adopted according to the P2P network realizes determining;
Described closely node table is provided with module, is used to be provided with the closely node table of node, comprise in the described closely node table and this node between IP network distance less than the node of preset threshold.
Described node route processing module also is used for determining described light lists, bucket table and the interstitial content preserved of node table closely according to the ability of each node.
As seen from the above technical solution provided by the invention, the present invention passes through the ability according to the diversity coefficient calculations node of node, design the routing table of node according to the ability of node, thereby can be with less maintenance costs, improve the performance of DHT under the network disturbance situation in the P2P network, improve the robustness of P2P net under the disturbance situation.
Description of drawings
Fig. 1 is the process chart of the described method of the embodiment of the invention;
The corresponding relation schematic diagram of the node number that comprises in the light lists of Fig. 2 for the ability of node and this node;
Fig. 3 is the principle schematic of exchange BT list item of the prior art;
Fig. 4 is the principle schematic of the exchange BT list item of the present invention's proposition;
Fig. 5 is the structural representation of the embodiment of the device that the P2P network node carried out route and handle.
Embodiment
The embodiment of the invention provides the method for the robustness of a kind of P2P of raising net under the disturbance situation,
Describe the embodiment of the invention in detail below in conjunction with accompanying drawing, the handling process of the described method of the embodiment of the invention comprises the steps: as shown in Figure 1
Step 1-1: the diversity coefficient of computing node, obtain the ability of node based on the diversity coefficient of node.
Node in the P2P system can be divided into ordinary node and super node according to ability.The embodiment of the invention is according to diversity coefficient H
FObtain the ability of node.
The diversity coefficient H of contact
FBe by considering that the various parameters influence node capacity calculate.Suppose that B is the network bandwidth, T is the uptime of a node in the network, and C is a cpu performance, and M is a memory size, and S is a memory span, then the H of this node
FFor being the function of coefficient with B, T, C, M and S, as:
H
F=func (B, T, C, M, S) formula 1
In above-mentioned formula 1, B, T and S have produced very big influence to HF, because B is a very important aspect of each opposite end in the Internet, T represents the stability of opposite end, and S then represents memory span.If ignore C and M in actual applications to H
FInfluence, thereby obtain formula 2 after the following simplification.
H
F=func (B, T, S) formula 2
In realizing application, can calculate H with following formula 3
F
H
F＝(BW_WEIGHTAGE_FACTOR*node?bandwidth)+(PREVIOUS_UPTIME_WEIGHTAGE_FACTOR*node?previous?Uptime)+(CURRENT_UPTIME_WEIGHTAGE_FACTOR*node?current?Uptime)
Formula 3
In above-mentioned formula 3, the weight of each factor all can be self-defined, determines according to network operation situation.BW_WEIGHTAGE_FACTOR is the node bandwidth weight factor, and node bandwidth is a node bandwidth; PREVIOUS_UPTIME_WEIGHTAGE_FACTOR is the weight factor of node uptime last time, and node previous Uptime is node uptime last time; CURRENT_UPTIME_WEIGHTAGE_FACTOR is the weight factor of this uptime of node, and node current uptime is this uptime of node.
The H that comes out according to aforementioned calculation
FObtain the ability of node, the H of node
FAnd there are certain corresponding relation, H between the ability of node
FBig more ability is also just big more.Such as, can simple defining be H
FAnd directly equate between the ability of node.Ability is bigger, as to surpass preset threshold node is as super node, and all the other nodes are as ordinary node.
Step 1-2, according to node capacity design routing table.
The present invention has proposed following three kinds of routing tables according to the analysis to existing DHT and various results of study.These three kinds of routing tables are being handled the effect of having nothing in common with each other on the perturbed problem.
1, light lists (LPT): comprise and this node between the smaller node of P2P network distance, this P2P network distance refers in the P2P network distance between two nodes, different DHT has different definition modes, is that XOR is XOR as Kademlia, and Chord is clockwise difference.
The ability of a node is big more, the node number that can preserve in the light lists of this node is just many more, the corresponding relation schematic diagram of the node number that comprises in the light lists of Fig. 2 for the ability of node and this node, as shown in Figure 2, node capacity is high more, the height that just is equivalent to beacon is high more, and its scope that can shine (the node number among the corresponding LPT) is just big more.Except study from inquiry, present node is also monitored the situation of the node among the LPT by active probe.By using light lists can realize the single-hop route, that is to say that present node receives a query requests, and the destination node of this query requests is arranged in LPT, present node just can directly be transmitted to this destination node with this query requests so.
2, bucket table (BT): the routing table of each DHT node generally includes a plurality of barrels of tables, preserve peer-to-peer network identifier and its IP address of the node that satisfies certain class condition in each barrel table, this certain class condition is relevant with specific DHT, such as Kademlia, the peer-to-peer network distance of preservation and present node during K bucket shown (XOR of the peer-to-peer network of two nodes sign just) is 2
K-1To 2
KBetween all nodal informations.
The node that satisfies the pairing road network network of said bucket table required distance condition merely is a lot, and improvement of the present invention is to select a bucket table list item according to node capacity, when collecting some both candidate nodes that can put into the bucket table, and preferred which H wherein
FThe node that numeric ratio is bigger enters the bucket table.
3, node table (PT) closely: the routing table that comprises the closer node (possible P2P network distance is far away) of IP network distance (referring to actual time delay of on Internet, communicating by letter between two nodes).Closely the use of node table can reduce the delay in the network.The passive method of study from inquiry is adopted in the maintenance of PT.
In embodiments of the present invention, when the ability of node changed, the size of above-mentioned three kinds of routing tables also will be adjusted accordingly.Above-mentioned diversity coefficient factor H
FIt is the key of the scale of the various routing tables of decision.Node capacity is big more, and the list item of preservation is also just many more.
The processing procedure that the scale of light lists is adjusted is mainly:
Any ability has surpassed the node (super node) of the threshold value of predefine (configurable) and can safeguard light lists.And the scale of its light lists is configurable, and the same to all super nodes.Simply introduce the parameter that disposes in the property file of light lists below:
The Hf threshold value of the super opposite end of #
HF_THRESHOLD＝30
The list item number that allows among the #LPT
LPT_SIZE＝5
According to above-mentioned these attributes, any H
FNode greater than 30 can safeguard that the scale that keeps the LPT of each node all is 5 to light lists, keeps 5 list items in LPT that is:.
The processing procedure that the scale of bucket table is adjusted is mainly:
The BT scale is different and different according to node capacity.The diversity coefficient difference of node, the list item number in each barrel are also different.Below the simple parameter that disposes in the property file of bucket table of introducing:
The node number that keeps at most in each barrel table in the # super node
NO_OF_SUPER_PEER_BUCKET_ENTRIES＝4
The node number that keeps at most in each barrel in the # ordinary node
NO_OF_NORMAL_PEER_BUCKET_ENTRIES＝3
As implied above, super node safeguards that in each barrel table ordinary node of 4 list items then only safeguards 3 list items.
The processing procedure that the scale of PT is adjusted is mainly:
List item number among the PT is configurable, depends on the diversity coefficient of node.Such as, according to following parameter configuration, each node can be safeguarded 5 list items in distance table.
The list item number safeguarded of node table (PT) closely in the # super node
NO_OF_SUPER_PEER_PROXIMITY_TABLE_SIZE＝10
The list item number safeguarded of node table (PT) closely in the # ordinary node
NO_OF_NORMAL_PEER_PROXIMITY_TABLE_SIZE＝5
As implied above, super node safeguards that in PT ordinary node of 10 list items then only safeguards 5 list items.
Node in the network is as follows to the preservation/maintenance needs of above-mentioned three routing tables:
For each ordinary node:
Bucket table (BT): preserve and carry out active maintenance detection means such as (refer to initiatively adopt judge whether still survival of the other side) PING and the passive learning formula is safeguarded (from inquiring about, learning the route).
Node table (PT) closely: preserve, only carry out the passive learning formula and safeguard.
Light lists (LPT): do not preserve.
For each super node on the network:
Bucket table (BT): preservation is identical with ordinary node with maintenance mode, carries out active maintenance and passive learning formula and safeguards.But the node number of preserving in the bucket table is more, means that the expense of maintenance is also bigger.
Node table (PT) closely: only carry out the passive learning formula and safeguard.But the interstitial content among the PT is more.
Light lists (LPT): preserve and carry out active maintenance.
Step 1-3, node carry out route according to the routing table of above-mentioned design to be handled.
Based on the routing table of above-mentioned design, the embodiment of the invention is improved the routing mechanism of agreement, and the high resiliency ability to perturbed problem can be provided with node bandwidth still less.The embodiment of the invention mainly comprises following several sections to the improvement of route aspect:
(1), parallel recurrence formula route;
(2), study from inquiry;
(3), the outmoded list item of master/passive deletion (node that refers to this list item correspondence is from net);
(4), super node utilizes LPT that node closer on the P2P network distance is monitored its existing state;
(5), the information that comprises of the maintain message that exchanges between node of maximization.
Introduce above-mentioned improved various piece below respectively to the route aspect.
One, parallel recurrence formula route, its concrete method for routing comprises following treatment step:
Step 3, query requests (comprising query requests sign, destination node sign, CNL and RHNL) is transmitted to nodes all among the above-mentioned CNL, here the mode of Zhuan Faing depends on concurrent parameter alpha (configurable), if α=1, only above-mentioned query requests is sent to 1 node among the CNL then at every turn, obtain responding or overtime after again in CNL next node send query requests; If α=2 only send to 2 nodes among the CNL with above-mentioned query requests then at every turn, responded or overtime after again in CNL two in all the other nodes send query requests.
Step 4, for the node among each CNL, receive above-mentioned query requests after, carry out following processing:
Checking query requests sign checks whether this query requests once passed through this node.If once passed through this node, end process process then; Otherwise, carry out following processing.
Learn from query requests, the node that will satisfy requirements such as BT, PT from RHNL is inserted in each routing table.
Check whether present node is included among the RHNL.If no, it is added among the RHNL.
Select from each routing table that k is individual to be identified at nearest node on the P2P network distance meaning from destination node, be defined as { Nk}.
Check that previous step obtains whether all nodes all are included among the CNL among the Nk}, if, then CNL and RHNL are added response message, return to query source node s1; Otherwise change next step
Whether check has the node can be by { node among the Nk} replaces among the CNL, check that promptly { the P2P network distance of certain node among the Nk} is nearer from the destination node sign than certain node among the CNL, if there is not such node, then will then CNL and RHNL be added response message, return to query source node s1, the end process process; Otherwise, upgrade with among the Nk} more the node near purpose upgrade CNL, suppose that these nodes are for { CNLnew} changes next step processing.
Seek each at { the node in RHNL among the CNLnew} but not, query requests is sent to these nodes, the CNL that this request comprises query requests sign, destination node sign, upgraded and upgraded RHNL, the CNL update mode is seen previous step, and the update mode of RHNL is for adding { the node among the CNLnew}.
A new node is received query requests, proceeds above-mentioned steps 4.
Monitor method on the source node of initiating query requests comprises following treatment step:
Step 3, reception response message obtain CNL and RHNL.
Step 4, nodal information among the CNL is added MCNL, nodal information among the RHNL is added MRHNL, deletion repeats list item.
Step 5, reach end condition after, if MCNL!=empty set selects k individual from the nearest node of destination node from MCNL, and this has just finished once successful inquiry.
After step 6, the successful inquiring, satisfactory node among MCNL and the MRHNL is joined in three routing tables.
If step 7 MCNL=empty set is returned the CNL that when beginning inquiry use, illustrate that this inquiry do not return than the list item in this node routing table from the nearer nodal information of destination node.
Step 8, inquiry stop the node that the back is checked does not have response.
In actual applications, can carry out the self adaptation adjustment to above-mentioned concurrent parameter alpha, concrete adjustment process is: if the rate of excitation of network is than higher (it is many to show as the request number that query node fails when inquiring about), at this moment, increase the value of α, otherwise then reduce the numerical value of α, the amplitude that increases at every turn or reduce can set in advance, such as being 1.
Two, study from inquiry.
Source node for initiating inquiry after the successful inquiring, has just comprised among the MCNL from the closer node of destination node, has then comprised all among the MRHNL and has successfully handled the node of this query requests.To can preferably be inserted into LPT, BT and PT after these node inspections,, so just realize continual study and optimization from inquiry respectively according to three kinds of desired conditions of routing table.
Through the intermediate node on the path, the node select among the RHNL is added each routing table for the inquiry route.
Three, deletion does not have the node of responding.
Unresponsive node can be discerned and delete to inquiry after stopping.Each inquiry all is to select CNL, node in this set sends request then, whether basis is received to respond and just can be judged whether these nodes survive so, all do not receive that the node of response all is considered to from net, so, these nodes are deleted from corresponding BT, LPT, PT.
Four, routing table maintenance.
In order to handle perturbed problem, list item in must the regular update routing table, the subject matter of existing regular formula renewal technology is to finish this task with the bandwidth of minimum, such as identical routing table update frequency, just may be too slow under the high situation of disturbance, and just may be too under stable situation fast (having wasted bandwidth resources), the present invention proposes a kind of new mechanism of maintaining routing list, makes the routing table update frequency to adjust automatically according to the stable case of routing table.
Introduce the new mechanism of this maintaining routing list below.
1, node stability criterion.
The present invention can inquire about after a node on the network reaches this standard efficiently being defined as a standard.The definition of this standard is: any node that has the individual list item of 2 α (being the twice of concurrent parameter) in the bucket table all can be thought a stable node.2 α are preferred value that obtain in the experiment test, and this numerical value can also be adjusted in actual applications, and the list item in the high more representative routing table of this numerical value is many more, and inquiry is just more efficient so, but the maintenance cost that needs is also just bigger.
2, management BT list item.
The present invention understands the state of whole network by exchange BT list item.The principle schematic of exchange of the prior art BT list item as shown in Figure 3, the principle schematic of the exchange BT list item that the present invention proposes is as shown in Figure 4.
Introduce the exchange BT list item method that the present invention proposes below in detail: the present invention sends to destination node (Node2) together by the BT of affix oneself in the request of initiating at source node (Node1), avoided destination node to send request to source node once more for the BT that obtains source node, each node upgrades the BT of oneself according to the BT list item information of the peer node that receives, for new list item, then insert the BT of oneself, and for the list item that lost efficacy, then the BT with oneself deletes from list item.
In order to utilize bandwidth efficiently, include only the node (comprising the new node that adds the bucket table) that changes recently in the bucket table in the BT message that is exchanged among the present invention, with inefficacy (from the net) node (being called " inefficacy BT node listing ") among the newfound BT, simultaneously, the present invention has designed a configurable parameter MAX_ENTRIES_TO_EXCHANGE, this parametric representation exchanges the nodal information bar number that comprises at most in the BT message at every turn, usually in the network that a hundreds of thousands node is formed, this parameter is arranged on below 100 just can obtains good effect.
In order to utilize bandwidth efficiently, make at Node1 after Node2 inquiry BT information, Node2 can not file a request to Node1 at short notice again, the present invention is provided with a MIN_LAST_QUERY_TIME (from the minimum interval of inquiry last time) configurable parameter, after Node2 had only this time interval like this, just can send request to Node1 again.
In order regularly to remove out-of-date BT list item and to notify other node, the present invention safeguards the node list item in the routing table according to the last time (being called " seeing the time last time ") of communicating by letter with them, utilize current the machine time when at every turn receiving nodal information, come that this " was seen the time last time " and upgrade, regularly carry out following treatment step according to configurable parameter BT_CLEANUP_STEPS then:
Step 3, circulation are carried out the following step (4-9) up to (loopCount＜NO_OF_STALE_ENTRIES_TO_REMOVE) or traveled through all list items among the BT.
Next list item among step 4, the nodeToCheck=BT.
Step 5, " the seeing the time last time " of calculating diff=current time-nodeToCheck
If step 6 diff＜MIN_LAST_SEEN_TIME (configuration parameter) returns 4, otherwise changes 7.
Step 7, PING nodeToCheck are to verify whether this node lives, if still survival, " seeing the time last time " that the nodeToCheck list item then is set is the current time; Otherwise, then think nodeToCheck from net, change 8.
Step 8, execution the following step:
From BT, delete nodeToCheck.
NodeToCheck is added to by in newfound " inefficacy BT node listing ", refresh usefulness for BT.
NodeToQuery=selects one from the nearest movable joint point of nodeToCheck from BT.
Send a BT request to nodeToQuery, respond according to it and fill up among the BT because the vacancy that deletion nodeToCheck forms.
Upgrade nodeToQuery " seeing the time last time ".
Step 9, IoopCount increase 1, carry out above-mentioned steps 4.
3, management PT list item.
Any node in communication, find certain node and own between bandwidth big (it is fast to show as speed of download), time delay little, will put into PT to this node so.
If find not response in certain node communication routine among certain node and the PT, then this node deleted from PT.
Node receives after the failure node tabulation in the BT updating message, checks whether the list item among the PT is arranged in this certificate revocation list, if having then this list item is deleted from PT.
4, management LPT list item.
Super node is safeguarded LPT, just the existing state from the node of its closer (measurement index of using in according to the P2P procotol) is monitored.The purpose of LPT is to utilize the ability of super node, strengthens disturbance rejection (by the renewal of LPT) and improves search efficiency, safeguards that the LPT list item adopts the method for " source node request-be requested node to reply-source node receives and handles ".The same with " seeing the time last time " among the above-mentioned BT, also comprise " query time recently " parameter in each nodal information among the LPT, the local zone time when just the last time successfully inquires about.
The processing procedure that source node sends LPT request (carrying out at source node) comprises the steps:
Step 3, circulation are carried out the following step (4～6) up to (loopCount＜NO_OF_NODES_TO_QUERY_FOR_LPT) or travel through LPT.
Next list item among step 4, the nodeToQuery=LPT.
Step 5, create a LPT who comprises " inefficacy LPT node listing " (comprising MAX_DEL_LPT_ENTRIES_TO_MAINTAIN nodal information at most) and ask, " inefficacy LPT node listing " comprise that those are deleted from LPT from the net node.
Step 6, loopCount increase 1.
The processing procedure that is requested node processing LPT request and replys (carrying out being requested node) comprises the steps:
Step 3, create a LPT list item that comprises present node new LPT to answering message, if this machine is an ordinary node, then current LPT list item is an empty set.
Step 4, this response message sent to the node of initiating inquiry.
Source node receives the processing procedure of handling (carrying out at source node) and comprises the steps:
Whether the checking node exists in LPT, if exist, then upgrades " query time last time " of this node with current machine time; Otherwise, insert node to LPT, and upgrade " query time last time " of this node with current machine time.
Step 3, make regular check on those " query time last time " more outmoded nodes among the LPT, promptly the difference between " query time last time " and current time is greater than parameter L PT_STALE_TIME (node among the LPT, if do not obtain to respond greater than this time period, then think inefficacy), these nodes are put into " inefficacy LPT node listing ".
The structure of the embodiment that the P2P network node is carried out the device that route handles provided by the invention comprises as shown in Figure 5 as lower module:
The node capacity information acquisition module is used to calculate the diversity coefficient of node, obtains the ability information of node according to described diversity coefficient;
Node route list is provided with module, and the ability information that is used for the node that obtained according to described node capacity information acquisition module is provided with the routing table of node.Comprise: light lists be provided with module, bucket table be provided with module and closely node table module is set.
Node route processing module is used for according to described node route list the set routing table of module being set, and described node is carried out route handle.
Described node route list is provided with module and comprises: light lists be provided with module, bucket table be provided with module and closely node table in the module at least one is set,
Wherein, the described light lists that node route list is provided with in the module is provided with module, is used to be provided with the light lists of node, comprise in the described light lists and this node between the P2P network distance less than the node of preset threshold;
Wherein, the described bucket table that node route list is provided with in the module is provided with module, be used to be provided with the bucket table of node, comprise in the described bucket table and satisfy predetermined conditions and the node capacity node greater than pre-set threshold, the distributed hashtable DHT that described predetermined conditions is adopted according to the P2P network realizes determining;
Wherein, the described closely node table that node route list is provided with in the module is provided with module, is used to be provided with the closely node table of node, comprise in the described closely node table and this node between IP network distance less than the node of preset threshold.
In sum, the present invention passes through the ability according to the diversity coefficient calculations node of node, according to the routing table of the ability of node design node, proposed a DHT that can handle perturbed problem effectively and realized improving one's methods, can be applied to various existing DHT and realize.After application the method for the invention was improved Kademlia, under high disturbed conditions, the successful search rate of the Kademlia after the improvement had increased more than 1 times, and bandwidth cost is then less than original Kademlia version in required safeguarding.
The present invention has adopted efficient than higher active and regular Restoration Mechanism, can improve DHT in the P2P network with less maintenance costs and be implemented in performance under the network disturbance situation.Aspect accuracy, resource requirement and the time of inquiry, the net of DHT is opened stability and performance all is greatly improved.Improve the robustness of P2P net under the disturbance situation.
The above; only for the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, and anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; the variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of claim.
Claims (9)
1. the method that the P2P network node is carried out the route processing is characterized in that, comprising:
Obtain the ability information of node according to the diversity coefficient of node, the routing table of node is set according to the ability information of described node, the routing table of described node comprises: light lists, bucket table and at least one in the node table closely, comprise in the described light lists and this node between the P2P network distance less than the node of preset threshold, comprise in the described bucket table and satisfy predetermined conditions and node capacity node greater than pre-set threshold, the distributed hashtable DHT that described predetermined conditions is adopted according to the P2P network realizes determining, comprise in the described closely node table and this node between the IP network distance less than the node of preset threshold;
Determine described light lists, bucket table and the interstitial content of closely preserving in the node table according to the ability of each node, according to described routing table described node is carried out route and handle.
2. the method that the P2P network node is carried out the route processing according to claim 1 is characterized in that the diversity coefficient of described node comprises: at least one item in the uptime of the network bandwidth, node and the memory span.
3. the method that the P2P network node is carried out the route processing according to claim 1 is characterized in that:
Node capacity is preserved described light lists, bucket table and node table closely greater than the node of preset threshold, and described light lists is carried out active maintenance, and described bucket table is carried out active maintenance and passive maintenance, and described closely node table is carried out passive maintenance; The node that node capacity is not more than preset threshold is preserved described bucket table and node table closely, and described bucket table is carried out active maintenance and passive maintenance, and described closely node table is carried out passive maintenance;
Described active maintenance is meant by the node of active in described routing table and sends detection information determine whether the node in the described routing table survives, will delete from described routing table less than the node of survival; Described passive maintenance is meant according to the query messages and/or the route messages that receive determine whether the node in the described routing table survives, will deletes from described routing table less than the node of survival.
4. the method that the P2P network node is carried out the route processing according to claim 3 is characterized in that, the described process that described bucket table is carried out passive maintenance specifically comprises:
Destination node receives the query requests that source node sends, and carries the nodal information of up-to-date variation in the bucket table of described source node in this query requests, and this node sum is less than the numerical value of setting;
Described destination node is upgraded the nodal information in its barrel table according to the nodal information in the described query requests, and described destination node does not send query requests to described source node within the time interval of setting.
5. according to each described method that the P2P network node is carried out the route processing of claim 1 to 4, it is characterized in that described node carries out the route processing according to described routing table and specifically comprises:
Source node sends the query requests that comprises the destination node sign to destination node;
Described destination node is provided with concurrent parameter according to the network disturbance situation, from described routing table, choose respective numbers according to described concurrent parameter and destination node between the P2P network distance less than the node of preset threshold;
Described all nodes of choosing adopt the mode of parallel recurrence formulas to handle described query requests respectively, obtain and destination node between the P2P network distance less than the node of the minimum threshold of setting, and to the main road of destination node by last historical node;
Described all nodes of choosing return to described source node with the described nodal information that obtains by inquiry response.
6. the method that the P2P network node is carried out the route processing according to claim 5 is characterized in that, described node carries out the route processing according to described routing table and also comprises:
Described source node obtains the nodal information that comprises in the described inquiry response, according to this nodal information the node that comprises in its described routing table is upgraded.
7. the method that the P2P network node is carried out the route processing according to claim 5 is characterized in that, described node carries out the route processing according to described routing table and also comprises:
After described source node is not received the inquiry response that certain node returns, then determine the not survival of this certain node, this certain node is deleted from described routing table.
8. the method that the P2P network node is carried out the route processing according to claim 1 is characterized in that, described node carries out the route processing according to described routing table and also comprises:
Node capacity is utilized described light lists greater than the node of preset threshold, and monitoring and the P2P network distance between it are less than the survival condition of the node of preset threshold.
9. the device that the P2P network node is carried out the route processing is characterized in that, comprising:
The node capacity information acquisition module is used to calculate the diversity coefficient of node, obtains the ability information of node according to described diversity coefficient;
Node route list is provided with module, and the ability information that is used for the node that obtained according to described node capacity information acquisition module is provided with the routing table of node;
Node route processing module is used for according to described node route list the set routing table of module being set, and described node is carried out route handle;
Described node route list is provided with module and comprises: light lists be provided with module, bucket table be provided with module and closely node table in the module at least one is set,
Described light lists is provided with module, is used to be provided with the light lists of node, comprise in the described light lists and this node between the P2P network distance less than the node of preset threshold;
Described bucket table is provided with module, be used to be provided with the bucket table of node, comprise in the described bucket table and satisfy predetermined conditions and the node capacity node greater than pre-set threshold, the distributed hashtable DHT that described predetermined conditions is adopted according to the P2P network realizes determining;
Described closely node table is provided with module, is used to be provided with the closely node table of node, comprise in the described closely node table and this node between IP network distance less than the node of preset threshold.
Described node route processing module also is used for determining described light lists, bucket table and the interstitial content preserved of node table closely according to the ability of each node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101756020A CN101409665B (en) | 2007-10-08 | 2007-10-08 | Method and apparatus for processing P2P network node route |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101756020A CN101409665B (en) | 2007-10-08 | 2007-10-08 | Method and apparatus for processing P2P network node route |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101409665A CN101409665A (en) | 2009-04-15 |
| CN101409665B true CN101409665B (en) | 2011-09-21 |
Family
ID=40572465
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007101756020A Expired - Fee Related CN101409665B (en) | 2007-10-08 | 2007-10-08 | Method and apparatus for processing P2P network node route |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101409665B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101645831B (en) * | 2009-05-08 | 2011-12-07 | 中国科学院声学研究所 | Node organization method in P2P system |
| CN101651708B (en) * | 2009-07-07 | 2012-11-14 | 北京大学 | Topological construction method of P2P streaming media network |
| US20160218954A1 (en) * | 2013-09-26 | 2016-07-28 | Hewlett-Packard Development Company, L.P. | Peer nodes in peer to peer networks |
| CN105580320A (en) * | 2013-09-26 | 2016-05-11 | 慧与发展有限责任合伙企业 | Subnetworks of peer to peer networks |
| CN106777321A (en) * | 2017-01-07 | 2017-05-31 | 郑州云海信息技术有限公司 | Using the method and device of KV database realizing data consistencies |
| CN112688870B (en) * | 2020-12-28 | 2022-11-04 | 杭州趣链科技有限公司 | Routing method, routing device and node equipment |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1845524A (en) * | 2006-05-18 | 2006-10-11 | 北京邮电大学 | Peer-to-peer network system realization process using cell dynamic division technology |
| CN1925442A (en) * | 2006-08-01 | 2007-03-07 | 程伟明 | Automatic network-building method for wireless communication terminal in intelligent environment |
| CN101064649A (en) * | 2007-02-02 | 2007-10-31 | 华为技术有限公司 | Method, apparatus and system for selecting super node, searching network node or resource |
-
2007
- 2007-10-08 CN CN2007101756020A patent/CN101409665B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1845524A (en) * | 2006-05-18 | 2006-10-11 | 北京邮电大学 | Peer-to-peer network system realization process using cell dynamic division technology |
| CN1925442A (en) * | 2006-08-01 | 2007-03-07 | 程伟明 | Automatic network-building method for wireless communication terminal in intelligent environment |
| CN101064649A (en) * | 2007-02-02 | 2007-10-31 | 华为技术有限公司 | Method, apparatus and system for selecting super node, searching network node or resource |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101409665A (en) | 2009-04-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101409665B (en) | Method and apparatus for processing P2P network node route | |
| Hsiao et al. | Load rebalancing for distributed file systems in clouds | |
| CN108781188A (en) | Device and method for balancing impromptu net structure | |
| CN104022911B (en) | A kind of contents construction management method of pattern of fusion content distributing network | |
| US20070110063A1 (en) | Apparatus, system, and method for reliable, fast, and scalable multicast message delivery in service overlay networks | |
| JP5719323B2 (en) | Distributed processing system, dispatcher and distributed processing management device | |
| Ying et al. | Distributed operator placement and data caching in large-scale sensor networks | |
| CN111352716B (en) | Task request method, device and system based on big data and storage medium | |
| CN111046065B (en) | Extensible high-performance distributed query processing method and device | |
| CN101437045A (en) | Method for selecting transfer node of P2P system and P2P node | |
| KR20100060304A (en) | Distributed content delivery system based on network awareness and method thereof | |
| CN105681413A (en) | Method and device for cooperative processing of data between CDN (Content Delivery Network) and ISP (Internet Service Provider) | |
| CN102404372A (en) | Method, system and node device for storing content in WEB cache in distributed mode | |
| JP5818263B2 (en) | Data distributed management system, apparatus, method and program | |
| Hassanzadeh-Nazarabadi et al. | Interlaced: Fully decentralized churn stabilization for skip graph-based dhts | |
| CN103001874B (en) | Delay tolerant mobile social network routing method based on node label set | |
| JP4533923B2 (en) | Super-peer with load balancing function in hierarchical peer-to-peer system and method of operating the super-peer | |
| Zöls et al. | The hybrid chord protocol: A peer-to-peer lookup service for context-aware mobile applications | |
| CN103209207A (en) | Peer-to-peer network structure achievement method | |
| CN115622976A (en) | Domain name management system, domain name registration and resolution method, device, equipment and medium | |
| Nikbazm et al. | Agent-based resource discovery in cloud computing using bloom filters | |
| Shen et al. | Hash-based proximity clustering for load balancing in heterogeneous DHT networks | |
| CN112131142B (en) | Method, system, equipment and medium for quickly caching data set | |
| US9621401B1 (en) | Performing dynamic data analysis within a dynamic network | |
| Abe et al. | Aggregation skip graph: A skip graph extension for efficient aggregation query over p2p networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110921 Termination date: 20191008 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |