CN103139081A - Update method and nodes for distributed hash table routing lists - Google Patents
Update method and nodes for distributed hash table routing lists Download PDFInfo
- Publication number
- CN103139081A CN103139081A CN201110384912XA CN201110384912A CN103139081A CN 103139081 A CN103139081 A CN 103139081A CN 201110384912X A CN201110384912X A CN 201110384912XA CN 201110384912 A CN201110384912 A CN 201110384912A CN 103139081 A CN103139081 A CN 103139081A
- Authority
- CN
- China
- Prior art keywords
- routing table
- node
- overlay network
- cryptographic hash
- nodes
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/021—Ensuring consistency of routing table updates, e.g. by using epoch numbers
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention discloses an update method and nodes for distributed hash table routing lists, wherein the method comprises the steps of updating routing lists when nodes in an overlay network detect adjustment of the overlay network, informing triggered routing list update cause information and updated harsh values of the routing lists to other nodes of the overlay network, updating local routing lists according to the triggered routing list update cause information by the other nodes, calculating hash values of the updated local routing lists, exchanging the routing lists among nodes sending the triggered routing list update cause information when identifying that the calculated hash values and the received routing list hash values are not conform, contrasting differences of the exchanged routing lists between the other nodes and the nodes sending the triggered routing list update cause information, detecting the different areas of the overlay network, and modifying the routing lists when identifying that the local routing lists are required to be modified. The update method and the nodes for distributed hash table routing lists are capable of automatically eliminating the desynchronized phenomenon of the routing lists among the nodes, and therefore diffusion of wrong routing lists is avoided, and routing properties of the overlay network are not reduced.
Description
Technical field
The present invention relates to distributed hashtable (DHT, Distributed Hash Table) technology, relate in particular to a kind of distributed hashtable routing table update method and node based on the DHT technology.
Background technology
Distributed hashtable (DHT, Distributed Hash Table) technology is that a kind of distributed resource that is widely used in equity (P2P, Peer to Peer) network is searched technology.To be each node be positioned at overlay network on IP network according to what certain topological structure formed to the DHT overlay network, and it is responsible for the storage of a part of resource and the route of message etc.DHT the aspect such as shares in exchange files, Distributed Calculation, service and has fully demonstrated its powerful technical advantage.
In the DHT overlay network, the keyword of each node and resource all has unique sign, and wherein node identification is the mapping to node address, and the Resource Key sign is the mapping to this Resource Key.When sign length was the m bit, the span of sign was [0,2^m-1].The space that is comprised of these signs can be considered an end to end DHT ring.Common DHT algorithm has Chord, Pastry, Kademlia etc., these algorithm dictates in DHT ring each node be responsible for interval division methods, and the method for routing of P2P message etc.Take the Chord algorithm as example, each overlay network node is responsible for the resource of storage key sign between this section point identification and precursor node identification, and the hop count that sends P2P message is generally O (log N), and wherein N is the number of node in overlay network.
Along with the demonstration effect of P2P technology, the DHT technology also is introduced in other technical system, be used for building high-performance, extendible distributed data base system etc., as the Dynamo system of Amazon etc.
In these distributed data base systems, node (peer-to-peer) is all better in the performance of the aspects such as calculating, storage, and the adding and withdraw from strictly controlledly of each node, and the overlay network adjustment is not frequent.But these systems have relatively high expectations to the router efficiency that sends P2P message, require P2P message to arrive destination node at fixing jumping figure.Therefore the suitable employing single-hop of this type systematic DHT algorithm, namely each node is all preserved full routing table, grasps all nodes of overlay network and is responsible for interval situation, and the P2P message of transmission only needs a jumping can arrive destination node.Yet if adopt single-hop DHT, when the overlay network node was many, routing table was larger.
Under heterogeneous network environment, single-hop DHT can also be further combined with cutting apart sign, dummy node even load equalization methods, and what namely each node was responsible for conforming to self-ability cuts apart or the dummy node number, to bear suitable load.Like this, except storage physical node information, also need store the mapping relations of cutting apart between sign or dummy node and physical node in each node route list, routing table is more huge.
Adopt single-hop DHT, require the routing table of each node storage in overlay network to keep synchronizeing or basic synchronization with the overlay network actual conditions.
Fig. 1 is the schematic diagram of DHT ring, as shown in Figure 1, and the logical network that overlay network 101 is comprised of all kinds of peer-to-peers (also referred to as the overlay network node) of undertaking different role; Reciprocity overlay network node 102 in overlay network is the element in overlay network, and being to provide storage and to transmit the overlay network node of service for other overlay network node in same overlay network.Arbitrary overlay network node in the DHT ring all exists a precursor node and a descendant node.
Fig. 2 is the flow chart that node adds overlay network, and as shown in Figure 2, node adds overlay network specifically to comprise the steps:
Step 201 adds ingress and acquires self node identification; Add the mode that ingress can be by searching self configuration information or obtain self node identification to modes such as server requests;
Step 202 adds ingress and sends Attach Request message to the arbitrary node of its known overlay network;
Step 203, the node that receives Attach Request message is transmitted to message the responsible node that adds ingress;
Step 204 is to step 205, and responsible node sends and adheres to response message, and this adheres to response message and is forwarded to and adds ingress;
Step 206, responsible node sends the routing update request message to adding ingress, contains the current overlay network full routing table of self storing in this routing update request message;
Step 207 adds ingress by routing update request message initialization self routing table, and replys the routing update response to responsible node;
Step 208 adds ingress and adds the overlay network request message to the responsible node transmission;
Step 209, responsible node is replied and to be added the overlay network response message to adding ingress, so far, adds ingress and responsible node is completed negotiation, determines that responsible node is to the interval that adds the ingress migration data;
Step 210, responsible node constantly send the storage data request information to adding ingress, add ingress and reply response message after completing the data storage; This process lasts till that data migration process completes;
Step 211 adds ingress and completed the preparation of taking over partial data between the migration area this moment, and its responsible node sends the routing update request message to all other nodes of overlay network; This routing update request message can adopt the forms such as broadcasting or hierarchical broadcast to send;
Step 212, each node of overlay network are upgraded the routing table of local storage by the routing update request message, and reply the routing update response message to responsible node.
Cut apart sign or dummy node even load equalization algorithm if adopt, newly added node may need to be responsible for the DHT interval from a plurality of the adapter at the net node, needs with a plurality of mutual at the net node therefore add ingress, carries out respectively above-mentioned steps 208 to step 212.
If two or more nodes add overlay network in close moment request, because the Data Migration time is longer, adition process can exist overlapping.Fig. 3 is that two nodes add the flow chart of overlay network in the close time, and as shown in Figure 3, this example hypothesis overlay network only comprises node A and Node B at the existing node of net, and is respectively newly added node C and node D is responsible node.Flow process shown in Figure 3 specifically comprises the following steps:
Step 301 adds ingress C and has completed to the attaching process of responsible node A;
Step 302, responsible node A sends the routing update request message to node C, comprises full routing table in this routing update request message, and routing table comprises the relevant information of node A, B;
Step 303, node C is according to request initialization local routing table, and sends the routing update response message to node A;
Step 304, node C sends to node A and adds the overlay network request message;
Step 305, node A sends to node C and adds the overlay network response message, so far, adds ingress and responsible node is completed negotiation, determines that responsible node is to the data interval that adds the ingress migration;
Step 306, node A sends data to node C, carries out Data Migration;
Step 307 adds the preparation that ingress C has completed becomes the overlay network member this moment, and responsible node A sends the routing update request message to other all nodes of overlay network (Node B is only arranged at present), and C has added overlay network with the notice node;
Step 308, Node B is upgraded local routing table, and sends the routing update response message to node A;
Step 309 is slightly later to node C, in the close moment, adds ingress D and has completed to the attaching process of responsible node B;
Step 310, responsible node B sends the routing update request message to node D, comprises full routing table in this routing update request message, and routing table comprises the relevant information of node A, B;
Step 311, node D is according to routing update request message initialization local routing table, and sends the routing update response message to Node B;
Step 312, node D sends to Node B and adds the overlay network request message;
Step 313, Node B send to node D and add the overlay network response message, so far, add ingress and responsible node is completed negotiation, determine that responsible node is to the data interval that adds the ingress migration;
Step 314, Node B sends data to node D, carries out Data Migration;
Step 315 adds the preparation that ingress D has completed becomes the overlay network member this moment, and responsible node B sends the routing update request message to node A, and notice node D has added overlay network;
Step 316, node A upgrades local routing table, and sends the routing update response message to Node B;
Step 317, Node B has known that node C adds the information of overlay network before this, therefore responsible node B sends the routing update request message to node C, notice node D has added overlay network;
Step 318, node C upgrades local routing table, and sends the routing update response message to Node B.
After above step was completed, newly added node D was not because can receive that when it does not become the overlay network member its routing table is asynchronous with the overlay network actual conditions about adding the routing update request message of ingress C.
The nonsynchronous node of routing table can mail to P2P message wrong destination node, and the routing table that receives the local storage of querying node of P2P message is obtained the down hop of this destination address, and this P2P message is forwarded.Like this, P2P message finally still can arrive correct destination node, but has increased hop count.Follow-up, if the nonsynchronous node of routing table is responsible for adding of new node, the routing table of its preservation can be delivered to newly added node.Incorrect routing table is diffusion therefore, causes the overlay network performance constantly to descend.
Summary of the invention
In view of this, main purpose of the present invention is to provide a kind of distributed hashtable routing table update method and node, can eliminate the nonsynchronous phenomenon of routing table between node, thereby avoids wrong routing table diffusion, avoids the overlay network routing performance to descend.
For achieving the above object, technical scheme of the present invention is achieved in that
A kind of distributed hashtable routing table update method comprises:
When in overlay network, node detects described overlay network generation adjustment, carry out routing table update, and will trigger the routing table update cause information and upgrade other nodes that rear routing table cryptographic Hash is notified described overlay network.
Preferably, after the routing table cryptographic Hash was notified other nodes of described overlay network with triggering routing table update cause information and after upgrading, described method also comprised:
Described other nodes carry out local routing table according to described triggering routing table update cause information to be upgraded, and the cryptographic Hash of routing table after the calculating local update, when determining that institute's cryptographic Hash of calculating and received routing table cryptographic Hash are inconsistent, and carry out routing table between the node of transmission triggering routing table update cause information and exchange;
The node that described other nodes and described transmission trigger the routing table update cause information determines whether needs correction local routing table according to the routing table that exchanges, and carries out the routing table correction when needing.
Preferably, the node that described other nodes and described transmission trigger the routing table update cause information determines whether needs correction local routing table according to the routing table that exchanges, and carries out the routing table correction when needing, for:
The node that described other nodes and described transmission trigger the routing table update cause information contrast according to the routing table of obtaining from the other side respectively and self routing table between difference, the node that causes routing table difference is surveyed, when definite needs self are revised routing table, carry out the local routing table correction according to result of detection.
Preferably, described overlay network is adjusted, for: new node adds described overlay network and/or has node to withdraw from described overlay network.
Preferably, described triggering routing table update cause information comprises at least a of following information:
New node adds described overlay network, node to withdraw from described overlay network, node is responsible for interval the variation;
Described routing table cryptographic Hash is the cryptographic Hash of each routing table segmentation in routing table cryptographic Hash complete in node or node.
Preferably, described method also comprises:
Be routing table or routing table subsection setup counter;
When cryptographic Hash that described other node determinations calculate and received routing table or routing table segmentation cryptographic Hash are inconsistent, described counter is added one; When the count value of determining described counter reaches setting threshold, and described transmission triggers between the node of routing table update cause information and carries out the routing table exchange.
Preferably, when described routing table cryptographic Hash was the cryptographic Hash of each routing table segmentation in node, described method also comprised:
Described other nodes carry out local routing table according to described triggering routing table update cause information to be upgraded, when after determining to upgrade, the cryptographic Hash of certain routing table segmentation is inconsistent with the cryptographic Hash of certain the routing table segmentation that receives, and only carry out inconsistent routing table segment exchange between the node of described transmission triggering routing table update cause information.
A kind of overlay network node comprises detecting unit, updating block and notification unit; Wherein:
Whether detecting unit is adjusted for detection of described overlay network, triggers updating block during generation;
Updating block is used for carrying out routing table update;
Notification unit is used for triggering the routing table update cause information and upgrading other nodes that rear routing table cryptographic Hash is notified described overlay network.
Above-mentioned node also comprises crosspoint and amending unit, wherein:
Crosspoint is used for carrying out the routing table exchange with described other nodes;
Amending unit, be used for according to the routing table of obtaining from described other nodes contrast and described node self routing table between difference, the node that causes routing table difference is surveyed, when determining to need described node self to revise routing table, carried out the local routing table correction.
Wherein, described overlay network is adjusted, for: new node adds described overlay network and/or has node to withdraw from described overlay network;
Described triggering routing table update cause information comprises at least a of following information:
New node adds described overlay network, node to withdraw from described overlay network, node is responsible for interval the variation;
Described routing table cryptographic Hash is the cryptographic Hash of each routing table segmentation in routing table cryptographic Hash complete in node or node.
A kind of overlay network node comprises receiving element, updating block, computing unit and determining unit; Wherein:
Receiving element is used for receiving triggering routing table update cause information and the rear routing table cryptographic Hash of renewal that other nodes send;
Updating block is used for carrying out local routing table according to described triggering routing table update cause information and upgrades;
Computing unit is used for calculating the cryptographic Hash of routing table after described node local update;
Determining unit, be used for to determine the cryptographic Hash of calculating whether consistent with received routing table cryptographic Hash.
Above-mentioned node also comprises crosspoint and amending unit, wherein:
Described determining unit is determined institute's cryptographic Hash of calculating and received routing table cryptographic Hash when inconsistent, the triggering crosspoint;
Crosspoint is used for carrying out the routing table exchange with described other nodes;
Amending unit, be used for according to the routing table of obtaining from described other nodes contrast and described node self routing table between difference, the node that causes routing table difference is surveyed, when determining to need described node self to revise routing table, carried out the local routing table correction.
Wherein, described triggering routing table update cause information comprises at least a of following information:
New node adds described overlay network, node to withdraw from described overlay network, node is responsible for interval the variation;
Described routing table cryptographic Hash is the cryptographic Hash of each routing table segmentation in routing table cryptographic Hash complete in node or node.
In the present invention, when node determination has new node to add or have node to withdraw from overlay network, after described node carries out the local routing renewal, can trigger the routing table update cause information and upgrade other nodes that rear routing table cryptographic Hash is notified described overlay network; Described other nodes carry out local routing table according to described triggering routing table update cause information to be upgraded, and the cryptographic Hash of routing table after the calculating local update, determine when inconsistent with self received routing table cryptographic Hash, described other nodes and described transmission trigger between the node of routing table update cause information carries out the routing table exchange; Described other nodes and described transmission trigger the node of routing table update cause information and according to the difference between the routing table information of obtaining and local storage routing table, overlay network are surveyed respectively, when need determining self to revise routing table, carry out the local routing table correction.Like this, technical scheme of the present invention can be eliminated the nonsynchronous phenomenon of routing table between node automatically when having node to carry out routing table update, thereby has avoided wrong routing table diffusion, can not cause the overlay network routing performance to descend; Only adopt cryptographic Hash to carry out the verification of routing table in the present invention, just carry out the routing table exchange between node when finding that check value is inconsistent, the expense of eliminating the routing table asynchrony phenomenon is less.
Description of drawings
Fig. 1 is the schematic diagram of DHT ring;
Fig. 2 is the flow chart that node adds overlay network;
Fig. 3 is that two nodes add the flow chart of overlay network in the close time;
Fig. 4 is the first pass figure that in the embodiment of the present invention, node carries out routing update and carries out routing table verification and correction;
Fig. 5 is the second flow chart that in the embodiment of the present invention, node carries out routing update and carries out routing table verification and correction;
Fig. 6 is the 3rd flow chart that in the embodiment of the present invention, node carries out routing update and carries out routing table verification and correction;
Fig. 7 is the 4th flow chart that in the embodiment of the present invention, node carries out routing update and carries out routing table verification and correction;
Fig. 8 is a kind of composition structural representation of embodiment of the present invention overlay network node;
Fig. 9 is that the another kind of embodiment of the present invention overlay network node forms structural representation.
Embodiment
Basic thought of the present invention is: when node determination has new node to add or have node to withdraw from overlay network, after described node carries out the local routing renewal, can trigger the routing table update cause information and upgrade other nodes that rear routing table cryptographic Hash is notified described overlay network; Described other nodes carry out local routing table according to described triggering routing table update cause information to be upgraded, and the cryptographic Hash of routing table after the calculating local update, determine when inconsistent with self received routing table cryptographic Hash, described other nodes and described transmission trigger between the node of routing table update cause information carries out the routing table exchange; Described other nodes and described transmission trigger the node of routing table update cause information and according to the difference between the routing table information of obtaining and local storage routing table, overlay network are surveyed respectively, when need determining self to revise routing table, carry out the local routing table correction.
For making purpose of the present invention, technical scheme and advantage are clearer, and by the following examples and with reference to accompanying drawing, the present invention is described in more detail.
Fig. 4 is the first pass figure that in the embodiment of the present invention, node carries out routing update and carries out routing table verification and correction.Overlay network adopts the resource of similar Chord algorithm to be responsible for distribution form, and namely each node is responsible for the Hash space between this node identification and precursor node identification.In this example, suppose that the routing table information of node D preservation is imperfect, it does not know the existence of node C; The responsible node of node D is Node B.As shown in Figure 4, the node of this example flow process of carrying out routing update and carrying out routing table verification and correction specifically comprises the following steps:
Step 401, Node B receive that nodes X withdraws from the overlay network request message, or find that by detection of connectivity nodes X lost efficacy, and it need to be with the failed information broadcasting of nodes X to whole overlay network;
Step 402, Node B sends the routing update request message to node D, wherein contain the information that nodes X leaves and upgrade after the cryptographic Hash of full routing table;
Step 403, node D upgrades routing table according to request, calculates the cryptographic Hash of full routing table after upgrading, and sends the routing table update response message to Node B, and comprises above-mentioned calculating gained cryptographic Hash;
Cryptographic Hash in the response message that step 404, Node B relatively receive and local storage calculated value are found both not to be inconsistent;
Step 405, Node B sends full routing table to node D, and requesting node D returns to full routing table;
Step 406, node D sends full routing table to Node B;
Step 407, Node B contrast that receive with routing table this locality storage, lack node C in the routing table of finding to receive;
Step 408, Node B sends connective probe requests thereby to node C;
Step 409, node C sends connective probe response message to Node B, and Node B confirms that node C at net, need not to revise local routing table;
Step 410, the routing table that node D contrast receives and the routing table of local storage have more node C in the routing table of finding to receive;
Step 411, node D sends connective probe request message to node C;
Step 412, node C sends connective probe response message to node D;
Step 413, node D confirms that node C at net, revises local routing table.
Fig. 5 is the second flow chart that in the embodiment of the present invention, node carries out routing update and carries out routing table verification and correction.In this example, overlay network adopts based on the load-balancing algorithm of cutting apart, Hash space and is divided into some cutting apart, and each node is responsible for the number of cutting apart that conforms to self-ability.In this example, suppose that node D preserves asynchronous with the current network situation about the responsible interval situation of node C.Node D is the responsible node of node Y, also comprises Node B in overlay network.As shown in Figure 5, the node of this example flow process of carrying out routing update and carrying out routing table verification and correction specifically comprises the following steps:
Step 501, node D is the responsible node that node Y adds overlay network, and completes to the data migration process of node Y, it needs to be responsible for interval change message and is broadcast to whole overlay network;
Step 502, node D sends the routing update request message to Node B, includes the cryptographic Hash that node Y is responsible for the interval information that changes and upgrades rear full routing table in this routing update request message;
Step 503, Node B is upgraded routing table according to the routing update request message, calculates the cryptographic Hash of full routing table after upgrading, and sends the routing table update response message to node D, and comprises above-mentioned calculating gained cryptographic Hash;
Step 504, node D relatively receives the cryptographic Hash and local storage calculated value in response, finds both not to be inconsistent;
Step 505, node D sends full routing table to Node B, and requesting node B returns to full routing table;
Step 506, Node B sends full routing table to node D;
Step 507, Node B contrast that receive with routing table this locality storage, in the routing table of finding to receive, C is responsible for intervally not being inconsistent with local record;
Step 508, Node B send to node C and are responsible for interval probe request message;
Step 509, node C sends to Node B and is responsible for interval probe response message, should be responsible for comprising in interval probe response message this node and be responsible for interval situation, it is correct that Node B confirms that local storage routing table is responsible for interval record about node C, need not to revise routing table;
Step 510, node D contrast that receive with routing table this locality storage, in the routing table of finding to receive, C is responsible for intervally not being inconsistent with local record;
Step 511, node D sends to node C and is responsible for interval probe request message;
Step 512, node C sends to node D and is responsible for interval probe response message, and this is responsible for comprising in interval probe response message this node and is responsible for interval situation;
Step 513, node D confirms locally to be responsible for the interval about node C and to record wrongly, and routing table is revised.
For accelerating the discovery of routing table difference, reduce the expense of switching and routing table between node, can carry out segmentation to routing table, the cryptographic Hash of subsidiary each segmentation in routing update request and response message.The segmentation of routing table should be undertaken by agreement, will obtain identical segmentation cryptographic Hash for verification to guarantee identical routing table is calculated.Fig. 6 is the 3rd flow chart that in the embodiment of the present invention, node carries out routing update and carries out routing table verification and correction.Overlay network adopts the resource of similar Chord algorithm to be responsible for interval distribution form, and namely each node is responsible for the Hash space between this node identification and precursor node identification.In this example, the routing table information that node M is preserved is imperfect, and it is not known node P and has left overlay network, also comprises node N in overlay network.As shown in Figure 6, the node of this example flow process of carrying out routing update and carrying out routing table verification and correction specifically comprises the following steps:
Step 601, node M meet the situation that needs the broadcast table to upgrade;
Step 602, node M sends the routing table update request message to node N, contains in this routing table update request message relevant for overlay network to adjust the information of situation and the cryptographic Hash of each routing table segmentation;
Step 603, node N upgrades routing table according to above request, and calculates the cryptographic Hash of upgrading rear each routing table segmentation, sends the routing table update response message to node M, comprises the above-mentioned cryptographic Hash of calculating in this routing table update response message;
Step 604, node M relatively receive the cryptographic Hash and local storage calculated value in response message, find that certain section cryptographic Hash is not inconsistent;
Step 605, node M sends to node N the routing table that cryptographic Hash is not inconsistent part, and requesting node N returns to this section routing table;
Step 606, node N sends to node M the routing table that cryptographic Hash is not inconsistent part;
Step 607, node N contrast that receive with routing table this locality storage, lack node P in the routing table of finding to receive;
Step 608, node N sends connective probe request message to node P;
Step 609, the routing table that the node M contrast receives and the routing table of local storage have more node P in the routing table of finding to receive;
Step 610, node M sends connective probe request message to node P;
Step 611, node N request timer does not then receive the probe response message of node P, and probe requests thereby is overtime, confirms that node P lost efficacy, need not to revise routing table;
Step 612, node M request timer does not then receive the probe response message of node P, and probe requests thereby is overtime, confirms that node P lost efficacy, revised routing table.
For avoiding the situations such as single-point overload, after node finds that in routing update request and response message, contained cryptographic Hash is not inconsistent, can be not switching and routing table immediately, but corresponding counter is added 1, after counter reaches setting threshold, then carry out the routing table exchange and further process with other node.In this example, overlay network comprises node Q, node M and node N.Fig. 7 is the 4th flow chart that in the embodiment of the present invention, node carries out routing update and carries out routing table verification and correction, and as shown in Figure 7, the flow process that the node of this example carries out routing update and carries out routing table verification and correction specifically comprises the following steps:
Step 701, node Q meets the situation that needs to upgrade routing table;
Step 702, node Q sends the routing update request message to node M, and subsidiary routing table segmentation cryptographic Hash;
Step 703, node M is upgraded routing table by the routing update request message, calculates the cryptographic Hash of routing table after upgrading, and sends the routing update response message to node Q, and subsidiary above-mentioned calculating gained cryptographic Hash;
Step 704, node M find that routing table section cryptographic Hash and local record are not inconsistent, and this segment counter value is added 1, and counter result and setting threshold are compared, and do not reach setting threshold;
Overlay network continues operation a period of time;
Step 705, node M meet the situation that needs to upgrade routing table;
Step 706, node M sends the routing update request message to node N, and subsidiary routing table segmentation cryptographic Hash;
Step 707, node N upgrades routing table by the routing update request message, calculates the cryptographic Hash of routing table after upgrading, and sends the routing update response message to node M, and subsidiary above-mentioned cryptographic Hash;
Step 708, node M find that routing table section cryptographic Hash and local record are not inconsistent, and this segment counter value is added 1, and counter result and setting threshold are compared, and do not reach setting threshold;
Step 709, node M sends the routing update request message to node P, and subsidiary routing table segmentation cryptographic Hash;
Step 710, node P upgrades routing table by the routing update request message, calculates the cryptographic Hash of routing table after upgrading, and sends the routing update response message to node M, and subsidiary above-mentioned cryptographic Hash;
Step 711, node M find that routing table section cryptographic Hash and local record are not inconsistent, and this segment counter value is added 1, and counter result and setting threshold are compared, and do not reach setting threshold;
Overlay network continues operation a period of time;
Step 712, node M with certain node carry out the routing update requests/response messages mutual after, reach setting threshold after certain segment counter value adds 1.Node M and this this section of node switching routing table to the difference place surveying, and are carried out respective handling, and this segment counter of resetting is 0.
Fig. 8 is a kind of composition structural representation of embodiment of the present invention overlay network node, and as shown in Figure 8, the overlay network node of this example comprises detecting unit 80, updating block 81 and notification unit 82; Wherein:
Whether detecting unit 80 is adjusted for detection of described overlay network, triggers updating block 81 during generation;
Updating block 81 is used for carrying out routing table update;
Notification unit 82 is used for triggering the routing table update cause information and upgrading other nodes that rear routing table cryptographic Hash is notified described overlay network.
On the basis of overlay network node shown in Figure 8, the overlay network node of this example also comprises crosspoint (not shown in Fig. 8) and amending unit (not shown in Fig. 8), wherein:
Crosspoint is used for carrying out the routing table exchange with described other nodes;
Amending unit, be used for according to the routing table of obtaining from described other nodes contrast and described node self routing table between difference, the node that causes routing table difference is surveyed, when determining to need described node self to revise routing table, carried out the local routing table correction.
Described overlay network is adjusted, for: new node adds described overlay network and/or has node to withdraw from described overlay network;
Above-mentioned triggering routing table update cause information comprises at least a of following information:
New node adds described overlay network, node to withdraw from described overlay network, node is responsible for interval the variation.
Above-mentioned routing table cryptographic Hash is the cryptographic Hash of each routing table segmentation in routing table cryptographic Hash complete in node or node.
Fig. 9 is that the another kind of embodiment of the present invention overlay network node forms structural representation, and as shown in Figure 9, the overlay network node of this example comprises receiving element 90, updating block 91, computing unit 92 and determining unit 93; Wherein:
Receiving element 90 is used for receiving triggering routing table update cause information and the rear routing table cryptographic Hash of renewal that other nodes send;
Updating block 91 is used for carrying out local routing table according to described triggering routing table update cause information and upgrades;
Computing unit 92 is used for calculating the cryptographic Hash of routing table after described node local update;
Determining unit 93, be used for to determine the cryptographic Hash of calculating whether consistent with received routing table cryptographic Hash.
On the basis of overlay network node shown in Figure 9, the overlay network node of this example also comprises crosspoint (not shown in Fig. 9) and amending unit (not shown in Fig. 9), wherein:
Crosspoint is used for carrying out the routing table exchange with described other nodes;
Amending unit, be used for according to the routing table of obtaining from described other nodes contrast and described node self routing table between difference, the node that causes routing table difference is surveyed, when determining to need described node self to revise routing table, carried out the local routing table correction.
Described overlay network is adjusted, for: new node adds described overlay network and/or has node to withdraw from described overlay network.
Above-mentioned triggering routing table update cause information comprises at least a of following information:
New node adds described overlay network, node to withdraw from described overlay network, node is responsible for interval the variation.
Above-mentioned routing table cryptographic Hash is the cryptographic Hash of each routing table segmentation in routing table cryptographic Hash complete in node or node.
The practical function that it will be appreciated by those skilled in the art that the each processing unit in the overlay network node shown in Fig. 8 and Fig. 9 can be with reference to the associated description of the distributed hashtable routing table update method of earlier figures 4 to Fig. 7 and is understood.The function that it will be appreciated by those skilled in the art that each processing unit in Fig. 8 and overlay network node shown in Figure 9 can realize by the program that runs on processor, also can realize by concrete logical circuit.
The above is only preferred embodiment of the present invention, is not for limiting protection scope of the present invention.
Claims (13)
1. a distributed hashtable routing table update method, is characterized in that, described method comprises:
When in overlay network, node detects described overlay network generation adjustment, carry out routing table update, and will trigger the routing table update cause information and upgrade other nodes that rear routing table cryptographic Hash is notified described overlay network.
2. method according to claim 1, is characterized in that, after the routing table cryptographic Hash was notified other nodes of described overlay network with triggering routing table update cause information and after upgrading, described method also comprised:
Described other nodes carry out local routing table according to described triggering routing table update cause information to be upgraded, and the cryptographic Hash of routing table after the calculating local update, when determining that institute's cryptographic Hash of calculating and received routing table cryptographic Hash are inconsistent, and carry out routing table between the node of transmission triggering routing table update cause information and exchange;
The node that described other nodes and described transmission trigger the routing table update cause information determines whether needs correction local routing table according to the routing table that exchanges, and carries out the routing table correction when needing.
3. method according to claim 1 and 2, it is characterized in that, the node that described other nodes and described transmission trigger the routing table update cause information determines whether needs correction local routing table according to the routing table that exchanges, and carries out the routing table correction when needing, for:
The node that described other nodes and described transmission trigger the routing table update cause information contrast according to the routing table of obtaining from the other side respectively and self routing table between difference, the node that causes routing table difference is surveyed, when definite needs self are revised routing table, carry out the local routing table correction according to result of detection.
4. method according to claim 1 and 2, is characterized in that, described overlay network is adjusted, for: new node adds described overlay network and/or has node to withdraw from described overlay network.
5. method according to claim 1 and 2, is characterized in that, described triggering routing table update cause information comprises at least a of following information:
New node adds described overlay network, node to withdraw from described overlay network, node is responsible for interval the variation;
Described routing table cryptographic Hash is the cryptographic Hash of each routing table segmentation in routing table cryptographic Hash complete in node or node.
6. method according to claim 5, is characterized in that, described method also comprises:
Be routing table or routing table subsection setup counter;
When cryptographic Hash that described other node determinations calculate and received routing table or routing table segmentation cryptographic Hash are inconsistent, described counter is added one; When the count value of determining described counter reaches setting threshold, and described transmission triggers between the node of routing table update cause information and carries out the routing table exchange.
7. method according to claim 6, is characterized in that, when described routing table cryptographic Hash was the cryptographic Hash of each routing table segmentation in node, described method also comprised:
Described other nodes carry out local routing table according to described triggering routing table update cause information to be upgraded, when after determining to upgrade, the cryptographic Hash of certain routing table segmentation is inconsistent with the cryptographic Hash of certain the routing table segmentation that receives, and only carry out inconsistent routing table segment exchange between the node of described transmission triggering routing table update cause information.
8. an overlay network node, is characterized in that, described node comprises detecting unit, updating block and notification unit; Wherein:
Whether detecting unit is adjusted for detection of described overlay network, triggers updating block during generation;
Updating block is used for carrying out routing table update;
Notification unit is used for triggering the routing table update cause information and upgrading other nodes that rear routing table cryptographic Hash is notified described overlay network.
9. node according to claim 8, is characterized in that, described node also comprises crosspoint and amending unit, wherein:
Crosspoint is used for carrying out the routing table exchange with described other nodes;
Amending unit, be used for according to the routing table of obtaining from described other nodes contrast and described node self routing table between difference, the node that causes routing table difference is surveyed, when determining to need described node self to revise routing table, carried out the local routing table correction.
10. according to claim 8 or 9 described nodes, is characterized in that, described overlay network is adjusted, for: new node adds described overlay network and/or has node to withdraw from described overlay network;
Described triggering routing table update cause information comprises at least a of following information:
New node adds described overlay network, node to withdraw from described overlay network, node is responsible for interval the variation;
Described routing table cryptographic Hash is the cryptographic Hash of each routing table segmentation in routing table cryptographic Hash complete in node or node.
11. an overlay network node is characterized in that described node comprises receiving element, updating block, computing unit and determining unit; Wherein:
Receiving element is used for receiving triggering routing table update cause information and the rear routing table cryptographic Hash of renewal that other nodes send;
Updating block is used for carrying out local routing table according to described triggering routing table update cause information and upgrades;
Computing unit is used for calculating the cryptographic Hash of routing table after described node local update;
Determining unit, be used for to determine the cryptographic Hash of calculating whether consistent with received routing table cryptographic Hash.
12. node according to claim 11 is characterized in that, described node also comprises crosspoint and amending unit, wherein:
Described determining unit is determined institute's cryptographic Hash of calculating and received routing table cryptographic Hash when inconsistent, the triggering crosspoint;
Crosspoint is used for carrying out the routing table exchange with described other nodes;
Amending unit, be used for according to the routing table of obtaining from described other nodes contrast and described node self routing table between difference, the node that causes routing table difference is surveyed, when determining to need described node self to revise routing table, carried out the local routing table correction.
13. according to claim 11 or 12 described nodes is characterized in that, described triggering routing table update cause information comprises at least a of following information:
New node adds described overlay network, node to withdraw from described overlay network, node is responsible for interval the variation;
Described routing table cryptographic Hash is the cryptographic Hash of each routing table segmentation in routing table cryptographic Hash complete in node or node.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110384912.XA CN103139081B (en) | 2011-11-28 | 2011-11-28 | Distributed hashtable routing table update method and node |
| PCT/CN2012/077457 WO2013078852A1 (en) | 2011-11-28 | 2012-06-25 | Routing table updating method and node for distributed hush table |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110384912.XA CN103139081B (en) | 2011-11-28 | 2011-11-28 | Distributed hashtable routing table update method and node |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103139081A true CN103139081A (en) | 2013-06-05 |
| CN103139081B CN103139081B (en) | 2017-08-11 |
Family
ID=48498408
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110384912.XA Active CN103139081B (en) | 2011-11-28 | 2011-11-28 | Distributed hashtable routing table update method and node |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN103139081B (en) |
| WO (1) | WO2013078852A1 (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103986649A (en) * | 2014-05-28 | 2014-08-13 | 杭州华三通信技术有限公司 | Border gateway protocol smooth restart method and routing equipment |
| CN104683415A (en) * | 2013-12-02 | 2015-06-03 | 乐视网信息技术（北京）股份有限公司 | Method and device for transmitting deleted data notification message in peer-to-peer network |
| CN104702503A (en) * | 2015-03-26 | 2015-06-10 | 中国电子科技集团公司第七研究所 | Network routing method and network routing system |
| CN105915457A (en) * | 2016-04-29 | 2016-08-31 | 清华大学 | Route verification based boarder gateway protocol route updating method |
| CN107181686A (en) * | 2016-03-09 | 2017-09-19 | 阿里巴巴集团控股有限公司 | Synchronous method, the apparatus and system of routing table |
| CN107734008A (en) * | 2017-09-27 | 2018-02-23 | 柏科数据技术（深圳）股份有限公司 | Method, apparatus, node device and the storage medium of a kind of troubleshooting in data-storage system |
| CN109361625A (en) * | 2018-10-24 | 2019-02-19 | 新华三技术有限公司合肥分公司 | Verify the method, apparatus and controller of forwarding-table item |
| CN112104576A (en) * | 2020-08-14 | 2020-12-18 | 中国科学院声学研究所 | Resident flow table storage and calibration method and system of SDN switch |
| CN112822224A (en) * | 2021-04-19 | 2021-05-18 | 国网浙江省电力有限公司 | Safe transmission method for financial data query |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102037704A (en) * | 2008-05-23 | 2011-04-27 | 爱立信电话股份有限公司 | Maintaining distributed hash tables in an overlay network |
| CN102057647A (en) * | 2008-06-12 | 2011-05-11 | 爱立信电话股份有限公司 | Maintenance of overlay networks |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101442479B (en) * | 2007-11-22 | 2011-03-30 | 华为技术有限公司 | Method, equipment and system for updating route in P2P peer-to-peer after node failure |
| CN101505263B (en) * | 2008-02-05 | 2011-10-26 | 华为技术有限公司 | Method and device for maintaining routing information |
| JP2010028551A (en) * | 2008-07-22 | 2010-02-04 | Brother Ind Ltd | Content distributed storage system, node device, node processing program, and address information change notifying method |
| CN101984605B (en) * | 2010-11-12 | 2016-04-13 | 中兴通讯股份有限公司 | Diameter node in routing discovering method and indirectly connected diameter system |
-
2011
- 2011-11-28 CN CN201110384912.XA patent/CN103139081B/en active Active
-
2012
- 2012-06-25 WO PCT/CN2012/077457 patent/WO2013078852A1/en active Application Filing
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102037704A (en) * | 2008-05-23 | 2011-04-27 | 爱立信电话股份有限公司 | Maintaining distributed hash tables in an overlay network |
| CN102057647A (en) * | 2008-06-12 | 2011-05-11 | 爱立信电话股份有限公司 | Maintenance of overlay networks |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104683415A (en) * | 2013-12-02 | 2015-06-03 | 乐视网信息技术（北京）股份有限公司 | Method and device for transmitting deleted data notification message in peer-to-peer network |
| CN103986649B (en) * | 2014-05-28 | 2017-08-11 | 新华三技术有限公司 | A kind of Border Gateway Protocol smooth restarting method and routing device |
| CN103986649A (en) * | 2014-05-28 | 2014-08-13 | 杭州华三通信技术有限公司 | Border gateway protocol smooth restart method and routing equipment |
| CN104702503A (en) * | 2015-03-26 | 2015-06-10 | 中国电子科技集团公司第七研究所 | Network routing method and network routing system |
| CN104702503B (en) * | 2015-03-26 | 2018-05-18 | 中国电子科技集团公司第七研究所 | Network route method and system |
| CN107181686B (en) * | 2016-03-09 | 2020-06-23 | 阿里巴巴集团控股有限公司 | Method, device and system for synchronizing routing table |
| CN107181686A (en) * | 2016-03-09 | 2017-09-19 | 阿里巴巴集团控股有限公司 | Synchronous method, the apparatus and system of routing table |
| US10826817B2 (en) | 2016-03-09 | 2020-11-03 | Alibaba Group Holding Limited | Routing table synchronization method, apparatus, and system |
| CN105915457A (en) * | 2016-04-29 | 2016-08-31 | 清华大学 | Route verification based boarder gateway protocol route updating method |
| CN105915457B (en) * | 2016-04-29 | 2018-12-11 | 清华大学 | A kind of route renewing method of the Border Gateway Protocol based on routing check |
| CN107734008A (en) * | 2017-09-27 | 2018-02-23 | 柏科数据技术（深圳）股份有限公司 | Method, apparatus, node device and the storage medium of a kind of troubleshooting in data-storage system |
| CN109361625A (en) * | 2018-10-24 | 2019-02-19 | 新华三技术有限公司合肥分公司 | Verify the method, apparatus and controller of forwarding-table item |
| CN112104576A (en) * | 2020-08-14 | 2020-12-18 | 中国科学院声学研究所 | Resident flow table storage and calibration method and system of SDN switch |
| CN112822224A (en) * | 2021-04-19 | 2021-05-18 | 国网浙江省电力有限公司 | Safe transmission method for financial data query |
| CN112822224B (en) * | 2021-04-19 | 2021-06-22 | 国网浙江省电力有限公司 | Safe transmission method for financial data query |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2013078852A1 (en) | 2013-06-06 |
| CN103139081B (en) | 2017-08-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103139081A (en) | Update method and nodes for distributed hash table routing lists | |
| US12015666B2 (en) | Systems and methods for distributing partial data to subnetworks | |
| US8732298B2 (en) | Method and apparatus for maintaining routing information | |
| CN102790963B (en) | Mobile ad hoc network system based on Android cell phone and construction method thereof | |
| US20070230468A1 (en) | Method to support mobile devices in a peer-to-peer network | |
| US10693967B2 (en) | Data connection establishment method, server, and mobile terminal | |
| US9069761B2 (en) | Service-aware distributed hash table routing | |
| CN103209108A (en) | Dynamic virtual private network (DVPN)-based route generation method and equipment | |
| CN102075359A (en) | Network coordinate-based server deployment method and device | |
| KR20140125224A (en) | Method and node apparatus for collecting information in contents network based on information centric networking | |
| CN105656978A (en) | Resource sharing method and device | |
| CN112243243B (en) | Network slice implementation method, entity and system | |
| CN103139076A (en) | Distributive hash table intercommunicative network system, inter-domain nodes and implement method | |
| CN108632125B (en) | Multicast table item management method, device, equipment and machine readable storage medium | |
| US20110252129A1 (en) | Apparatus and method for registering node and searching for floating internet protocol address using distributed network | |
| Gottron et al. | A cluster-based locality-aware mobile peer-to-peer architecture | |
| CN102035663B (en) | Multi-domain routing maintenance method and system | |
| WO2011150741A1 (en) | Point to point (p2p) overlay network, data resources operation method and new node join method thereof | |
| CN102685005B (en) | Method for routing and router | |
| KR101940802B1 (en) | System for calculating the number of the local triangular using the terminal resources and method thereof | |
| US20180176129A1 (en) | Communication method, control device, and system | |
| AU2023203129B2 (en) | Systems and methods for distributing partial data to subnetworks | |
| KR100872170B1 (en) | Multiple routing method on p2p network | |
| CN111211985B (en) | Forwarding table item updating method, device and system | |
| CN110958182B (en) | Communication method and related equipment |
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 |