CN101997755B - Method for exchanging mapping information and mapping node - Google Patents
Method for exchanging mapping information and mapping node Download PDFInfo
- Publication number
- CN101997755B CN101997755B CN2009100918169A CN200910091816A CN101997755B CN 101997755 B CN101997755 B CN 101997755B CN 2009100918169 A CN2009100918169 A CN 2009100918169A CN 200910091816 A CN200910091816 A CN 200910091816A CN 101997755 B CN101997755 B CN 101997755B
- Authority
- CN
- China
- Prior art keywords
- mapping
- mapping node
- node
- address
- map information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Abstract
The invention discloses a method for exchanging mapping information and a mapping node, belonging to the technical field of a core network and an IP (Internet Protocol) of a communication industry. The method for exchanging mapping information and the mapping node are applied to a Multi-homing scene of an extensible routing framework. In the method for exchanging mapping information and the mapping node of all embodiments of the invention, other mapping nodes which have the same ID (Identification) as the mapping node are searched by an iterative algorithm on the basis of a Kademlia protocol and exchange mapping information with the mapping node. The invention can realize the application of an LISP-DHT (Locator/ID Separation Protocol-Distributed Hash Table) in the Multi-homing scene.
Description
Technical field
The present invention relates to communications industry core net and IP technical field, relate in particular to the method and the mapping node of map information exchange.
Background technology
Along with the continuous development of Internet technology, kernel route table scale rapid expansion causes the expense of advertising of route and calculating to increase, and the routing convergence time is elongated.Being widely used of technology such as Multi-homing (many hosts), Traffic Engineering (traffic engineering) destroyed the polymerizability of address prefix, caused the expansion of kernel route table.So-called Multi-homing holds network to insert a plurality of ISP (Internet Service Provider, ISP) simultaneously exactly, and such as can connecting CERNET and commercial network simultaneously, but the end network still uses same network ip address.
In order to address the above problem; Study Internet task groups (Internet Research TaskForce; Abbreviation IRTF) route research work group (Routing Research Group; Abbreviation RRG) multiple solutions such as APT, LISP has been proposed, the thought of all separating of these schemes, the route matrix of employing map addresses and encapsulation based on the address.Under this route matrix; Need set up a new mapping service system mapping service is provided; With LISP is example; Different concrete schemes such as LISP-DHT, LISP-ALT, LISP-CONS, LISP-NERD are arranged under its basic framework, and difference is that mainly they have adopted different mapping service systems respectively.
Existing LISP-DHT adopts distributed hashtable (Distributed Hash Table is called for short DHT) to come the distributed storage mapping table, specifically based on the Chord agreement.The Chord agreement adopts the ChordID of k position to indicate as node, and ID forms an end to end ring.LISP-DHT is that unit is that the edge net distributes the address with the address block, and promptly every subscriber's main station in the edge net is all got an address and used from this address block.
In the LISP-DHT mapped system, mainly contain two kinds of roles: the server of mapping and the tunnel router of query mappings are provided; Wherein tunnel router comprises tunnel portal router (Ingress Tunneling Router again; Be called for short ITR) and tunnel outlet router (EgressTunneling Router is called for short ETR).Whole system can be regarded as mixes the PUSH/PULL model: mode distributed storage in the Chord ring of PUSH is adopted in mapping, and when tunnel router need shine upon, can send request to mapping server with the mode explicitly of PULL.
The network owner need control autonomous territory and be responsible for the mapping to its edge net address is provided, and does not allow any server to be responsible for this mapping.So can be not any for node distributes ID as Chord in LISP-DHT, for example distribute through certain Hash function.
In realizing process of the present invention, the inventor finds that prior art LISP-DHT does not provide the technical scheme that is applied to the Multi-homing scene.
Summary of the invention
The objective of the invention is to solve the defective that LISP-DHT scheme in the prior art can not be applied to the Multi-homing scene; A kind of method and mapping node of map information exchange are proposed; Employing can realize the application of LISP-DHT scheme under the Multi-homing scene based on the LISP-DHT technology of Kademlia agreement.
For realizing above-mentioned purpose; According to an aspect of the present invention, a kind of method of map information exchange is provided, has been applied to expand the Multi-homing scene of routing framework; Adopt the Kademlia agreement, each mapping node is all safeguarded the mapping relations table of self in the core network; The mapping relations table comprises the ID distance of map information and self mapping node and other mapping nodes of other mapping nodes; Map information comprises the ID of mapping node; Reach mapping node place mapping server in the network address of core network, the ID distance is the result of the ID XOR of two mapping nodes; When increasing the mapping node X identical newly, comprising with the ID of existing mapping node Y in the core network: steps A, mapping node X obtains the network address of the core network of the mapping node W that is present in core network; Step B according to the map information of mapping node, is a starting point with mapping node W, on the ID distance, approaches mapping node Y gradually through convergence algorithm, and until finding mapping node Y, step C: mapping node X obtains the network address with the core network of mapping node Y.
In the present technique scheme, when having the identical mapping node of ID a plurality of and mapping node Y in the network, step C is specially: mapping node Y is sent to mapping node X with the map information of self map information and the mapping node identical with the ID of mapping node Y; Mapping node X is sent to mapping node Y and the identical mapping node of ID a plurality of and mapping node Y with self map information.
In the present technique scheme, the mapping relations table is the K-bucket table; The K-bucket table is made up of the preset capable chained list of T, wherein, and the figure place of 0≤T＜mapping node ID; The capable chained list of i is preserved and this mapping node distance is 2
i～2
I+1The information of mapping node.
In the present technique scheme, the ID of mapping node is 160, when the IP address of the corresponding edge network of mapping node is the IPv4 type, and maximum IP address in low 32 corresponding edge network address blocks of mapping node ID, everybody is 0 for all the other; When the IP address of the corresponding edge network of mapping node is the IPv6 type, maximum IP address in low 128 corresponding edge network address blocks of mapping node ID, everybody is 0 for all the other.
In the present technique scheme, step B specifically comprises: step B1: according to the map information of mapping node W, mapping node X is to mapping node W query mappings node Y; Step B2: mapping node W judges whether self is mapping node Y, in this way, and execution in step C, otherwise, execution in step B3; Step B3: mapping node W obtains self ID distance to mapping node Y; Step B4: according to ID distance and preset function; From the K-bucket table of mapping node W, obtain α the nearly mapping node that satisfies convergence algorithm; And the map information of α nearly mapping node is sent to mapping node X, inferior nearly mapping node to the ID distance of mapping node Y than mapping node W to the ID of mapping node Y apart from weak point; Step B5: replace mapping node W, execution in step B1-B5 with α nearly mapping node respectively.
Preferably, in the present technique scheme, preset function is " [Log
2D] ", " [] " expression rounds downwards, and d is the ID distance of mapping node W to mapping node Y.
Preferably, in the present technique scheme, also comprise after the step C: step D: mapping node X sends probe message to other mapping nodes identical with self ID; Step e: when not receiving the response of other mapping nodes identical, delete other mapping nodes identical with self ID with self ID.
In the present technique scheme, mapping node X, Y, W and other mapping nodes are present in one or more mapping servers.
In the present technique scheme, among the step C, the message of exchange map information comprises between the mapping node: core network address field, the network address that is used to store core network; The mapping node id field is used for the ID of Storage Mapping node; AS Number field is used for the corresponding AS of mark mapping node place mapping server.
Preferably, in the present technique scheme, above-mentioned message can also comprise: Address Len field is used for the effective length of mark mapping node core network address field; The Prior field is used for the priority of this core network address correspondence mappings of mark;
In the present technique scheme, message can also comprise: the TAF field is used for the type of the network address of mark core network; When the type of the network address was the IPv4 form, the core network address field was 32, or when the type of the network address was the IPv6 form, the core network address field was 128.
For realizing above-mentioned purpose, according to another aspect of the present invention, a kind of mapping node is provided; Be applied to expand the Multi-homing scene of routing framework; Adopt the Kademlia agreement, comprising: memory module is used to store and safeguard self mapping relations table; The mapping relations table comprises the ID distance of map information and self mapping node and other mapping nodes of other mapping nodes; Map information comprises the ID of mapping node, reaches mapping node place mapping server in the network address of core network, and the ID distance is the result of the ID " XOR " of two mapping nodes; Enquiry module is used for when adding core network, in core network, is starting point with known mapping node, in core network, inquires about other mapping nodes identical with the ID of self through convergence algorithm; Switching Module is used for other mapping node exchange map informations identical with the ID of self.
In the present technique scheme, the mapping relations table is the K-bucket table; The K-bucket table is made up of the preset capable chained list of T, wherein, and 0≤T＜160; The capable chained list of i is preserved and this mapping node distance is 2
i～2
I+1The information of mapping node.
Preferably, in the present technique scheme, when having the identical mapping node of ID a plurality of and said mapping node in the network: Switching Module is used to receive the map information of said a plurality of mapping node identical with mapping node ID; And self map information is sent to said a plurality of mapping node identical with mapping node ID.
In the present technique scheme, according to the address block of corresponding edge network, obtain the ID of said mapping node, wherein, the figure place of said mapping node ID is 160; When the IP address of the corresponding edge network of said mapping node is the IPv4 type, maximum IP address in low 32 said edge network address blocks of correspondence of said mapping node ID, everybody is 0 for all the other; When the IP address of the corresponding edge network of said mapping node is the IPv6 type, maximum IP address in low 128 said edge network address blocks of correspondence of said mapping node ID, everybody is 0 for all the other.
Preferably; In the present technique scheme; Mapping node can also comprise: detecting module, be used for sending probe message when not receiving the response of other mapping nodes identical with self ID to other mapping nodes identical with self ID, and delete other mapping nodes identical with self ID.
The method and the mapping node of the map information exchange of various embodiments of the present invention are sought other mapping nodes identical with self ID through iterative algorithm, and are exchanged map information with it.Therefore, various embodiments of the present invention adopt the LISP-DHT technology based on the Kademlia agreement, can realize the application of LISP-DHT scheme under the Multi-homing scene.
Other features and advantages of the present invention will be set forth in specification subsequently, and, partly from specification, become obvious, perhaps understand through embodiment of the present invention.The object of the invention can be realized through the structure that in the specification of being write, claims and accompanying drawing, is particularly pointed out and obtained with other advantages.
Through accompanying drawing and embodiment, technical scheme of the present invention is done further detailed description below.
Description of drawings
Accompanying drawing is used to provide further understanding of the present invention, and constitutes the part of specification, is used to explain the present invention jointly with embodiments of the invention, is not construed as limiting the invention.In the accompanying drawings:
Fig. 1 is the Organization Chart based on the routing framework expanded of address separation;
Fig. 2 is the flow chart of the embodiment of the invention one map information switching method;
Fig. 3 is the sketch map of the embodiment of the invention two K-bucket list data structure;
Fig. 4 is the flow chart of the embodiment of the invention two map information switching methods;
Fig. 5 is the sketch map of map information message format under the embodiment of the invention three IPv4 forms;
Fig. 6 is the sketch map of map information message format under the embodiment of the invention three IPv6 forms.
Embodiment
Below in conjunction with accompanying drawing embodiments of the invention are described, should be appreciated that embodiment described herein only is used for explanation and explains the present invention, and be not used in qualification the present invention.
Embodiment one
The present invention is based on the routing framework expanded that separate the address.Fig. 1 is the Organization Chart based on the routing framework expanded of address separation.As shown in Figure 1.In this framework; Address space is divided into core network space (CoreSite Address Space) and edge network space (EdgeSiteAddress Space); The packet that from edge network, produces can not directly be transmitted in core network; Need encapsulate at ITR (Ingress Tunneling Router, inlet tunnel router), the source address in its outside packet header is the network address of the core net of ITR; Destination address is the network address of the core net of the pairing ETR in the inner packet head's address (Egress Tunneling Router, exit tunnel router).And obtaining of the network address of these core net need be accomplished through inquiring about a mapping service system that is deployed in the core net: submit query requests to by the mapping server of ITR in the mapping service system; Then in the formed Overlay of mapping server, find corresponding map information according to DHT (DistributedHash Table, distributed hashtable) mode.Among present embodiment and following each embodiment, mapping node is a logical node, and it forms Kademlia Overlay logic net according to the Kademlia agreement on core net.
The present invention adopts and comes the distributed storage map information based on the DHT mode of Kademlia agreement.In the Kademlia agreement; (XOR) is distance metric with XOR, sets up a kind of brand-new DHT topological structure, and every mapping is stored among the Kademlia Overlay on the mapping node; Mapping relations are man-to-man, and can hold a plurality of mapping nodes on every mapping server.There are 5 customer edge network to be respectively A, B, C, D, E like certain ISP lower end; Its edge network address block prefix is respectively a, b, c, d, e; The network address of corresponding core net is v, w, x, y, z; The network address of edge network address block prefix and core net is shone upon one by one, and these 5 mappings will form 5 mapping nodes, and these 5 mapping nodes may be present on one or more mapping servers that this ISP administered with combination in any physics.
The method that present embodiment proposes is applied to expand the Multi-homing scene of routing framework, adopts the Kademlia agreement.In the core network, each mapping node is all safeguarded the mapping relations table of self; The mapping relations table comprises the ID distance of map information and self mapping node and other mapping nodes of other mapping nodes; Map information comprises the ID of mapping node; Reach mapping node place mapping server in the network address of core network, the ID distance is the result of the ID " XOR " of two mapping nodes.Fig. 2 is the flow chart of the embodiment of the invention one map information switching method.As shown in Figure 2, when increasing the mapping node X identical with the ID of existing mapping node Y in the core network newly, present embodiment comprises:
Step S102: mapping node X obtains the network address of the core network of the mapping node W that is present in core network;
Step S104: according to the map information of mapping node, be starting point, on the ID distance, approach mapping node Y gradually, until finding mapping node Y through convergence algorithm with mapping node W;
Step S106: mapping node X obtains the network address of the core network of mapping node Y.
In the present embodiment, the mapping relations table is the K-bucket table; K-bucket table is made up of the preset capable chained list of T, wherein, and the figure place of 0≤T＜mapping node, 160 of the figure place positions of defining node in the Kademlia agreement; The capable chained list of i is preserved and this mapping node distance is 2
i～2
I+1The information of mapping node.
Among the present embodiment step S106, the exchange map information can be that at first mapping node Y sends map information to X between the mapping node, then receives the map information of mapping node X; Also can be that at first mapping node X sends map information to Y, then receive the map information of mapping node Y.
When having the identical mapping node of ID a plurality of and mapping node Y in the network, step C is specially: mapping node Y is sent to mapping node X with the map information of self map information and the mapping node identical with the ID of mapping node Y; Mapping node X is sent to mapping node Y and the identical mapping node of ID a plurality of and mapping node Y with self map information.In the present embodiment, mapping node X, Y, W are present in one or more mapping servers.In the present embodiment, can also comprise after the step C:
Step S108: mapping node X sends probe message to other mapping nodes identical with self ID;
Step S110: when not receiving the response of other mapping nodes identical, delete other mapping nodes identical with self ID with self ID.
The method that present embodiment proposes; Be linked into when certain edge network under the situation of a plurality of ISP (being the Multi-homing scene); The main mapping node X of new map information can inquire another mapping node Y that has this ID in Kadmelia Overlay when joining new map information in the mapped system, different with basic Kadmelia method is; At this moment can't produce " ID conflict " mistake; But new map information is informed mapping node Y, and obtain its stored mapping information from Y, thus X and Y all learn all map informations that arrive the purpose edge network.Whether and also can whenever spy the other side each other at a distance from one-period between X and the Y survives.
Present embodiment proposes the method for a kind of map information exchange, searches the mapping node identical with self ID in the existing core network to be implemented in, and with its exchange map information, thereby make the LISP-DHT technology can be applied to the Multi-homing scene.
Embodiment two
In order to realize in core network, searching the mapping node identical with self ID among the embodiment one, on the basis of embodiment one, present embodiment provides the lookup method based on convergence algorithm.
In the present embodiment; Each mapping node all can be assigned with one 160 value and be used as ID; We adopt maximum in an edge network address block IP address to be used as this ID, and this IP address is not assigned to edge hosts as the reservation address in the edge network.Like certain edge network address prefix is 162.137.2/24; The network address that is mapped to core network is 134.121.3.56; Then low 32 usefulness 16 systems of the ID of the mapping node of this mapping correspondence are expressed as A28902FE and are expressed as 162.137.2.254 with dotted decimal notation, remain 128 and are 0.And this mapping will leave in this main mapping node and with nearest several of its ID, recommend more than or equal to 1, on the mapping node, above-mentioned ID distance is the result of the ID " XOR " of two mapping nodes.
Each Kademlia node can be safeguarded an own exclusive K-bucket table, preserves the ID of other mapping nodes and the network address of core net.Fig. 3 is the sketch map of the embodiment of the invention two K-bucket list data structure.As shown in Figure 3, the map information of each mapping node comprises the ID of mapping node, and mapping node place mapping server is in the network address of core network.The K-bucket table is made up of 160 row chained lists, and the capable chained list of i (0＜=i＜160) is preserved and this nodal distance is the information of some nodes of 2^i～2^ (i+1).When i was very big, in order to limit the size of table, the mapping node number of preservation was no more than preset K, for example K=4.
In the present embodiment; Be linked into when certain edge network under the situation of a plurality of ISP (being the Multi-homing scene); The main mapping node X of new map information can inquire another mapping node Y that has this ID in Kadmelia Overlay when joining new map information in the mapped system.Fig. 4 is the flow chart of the embodiment of the invention two map information switching methods.As shown in Figure 4, the method for present embodiment map information exchange comprises:
Step S202: know a mapping node W who is present among the Kadmelia Overlay, it is joined in the K-bucket table of X;
Step S204: call FIND_NODE, ID is the mapping node information of X to the W inquiry;
Step S206: mapping node W receives the FIND_NODE that X sends and calls, calculate from W to X apart from d (d=W XOR X);
Step the S208: [log from the K-bucket table of mapping node W
2D] take out nearly mapping node in the individual chained list α time, inferior nearly mapping node to the ID distance of mapping node Y than mapping node W to the ID of mapping node Y apart from weak point;
Step S210: whether mapping node W inspection oneself is that ID is the mapping node of X.If, execution in step S216, otherwise execution in step S212;
Step S212: the map information that returns this α nearly mapping node to mapping node X;
Step S214: mapping node X calls FIND_NODE, and α the nearly mapping node inquiry ID that continues to return to W is the mapping node of X, and repeating step S206-S212 is up to finding that ID is another mapping node Y of X, i.e. Y=X;
Step S216: receive the map information that mapping node Y sends, be kept in the mapping table of oneself;
Step S218: mapping node X sends the map information of self to mapping node Y.
If relevant this ID is mapped with variation, for example bind the network address of another core net again, then photos and sending messages notice all " Multi-homing partners " helps their to upgrade the map information of being preserved.Because the ISP that edge network inserts generally can be not too many, and the map bindings relation can be very not frequent yet, so the mode of this PUSH can be upgraded efficiently.Adopt Transmission Control Protocol to carry out the map information exchange between " Multi-homing partner ", to guarantee reliability.
In the present embodiment, provided the concrete steps of searching the mapping node identical with self ID through concrete convergence algorithm, present embodiment has whole beneficial effects of embodiment one, and exploitativeness is stronger.
In the present embodiment, adopt the distributed storage mode based on the Kademlia agreement, search efficiency is higher, and the mapped system extensibility is stronger.In addition, when certain or certain several mapping nodes lost efficacy,, just can not influence effectively providing of mapping service, need not human configuration on the one hand, reduce the work complexity of network manager as long as there is a mapping node online; Can the redundancy backup server be set specially on the other hand, under the prerequisite that does not reduce system availability, can reduce the ISP input cost.
Embodiment three
For the exchange of the map information of realizing the mapping node that ID is identical among the embodiment one, on the basis of embodiment one, present embodiment provides a kind of message structure.
In the present embodiment, the message of exchange map information comprises between the mapping node: core network address field, the network address that is used to store core network; The mapping node id field is used for the ID of Storage Mapping node; AS Number field is used for the corresponding autonomous territory of mapping server, mark mapping node place.
In addition, in the present embodiment, message can also comprise: Address Len field is used for the effective length of mark mapping node id field; The Prior field is used for the priority of this core network address correspondence mappings of mark; The TAF field is used for the type of the network address of mark core network; When the type of the network address was the IPv4 form, the core network address field was 32, or when the type of the network address was the IPv6 form, the core network address field was 128.
Fig. 5 is the sketch map of map information message format under the embodiment of the invention three IPv4 forms.Fig. 6 is the sketch map of map information message format under the embodiment of the invention three IPv6 forms.Like Fig. 5 and shown in Figure 6, message comprises with the lower part:
1, TAF (Transit Address Family) field is consistent with the definition of AFI (Address Family Identifier) in the RFC1700 standard, and what use at present is TAF=1 and 2, representes that respectively the address family that core network uses is IPv4 and IPv6.
2, Address Len field is represented the effective length of mapping node core network address field, and unit is Octet.Because later on if expansion, Core Address can be not the agreement of IPv4 and IPv6 only, so its length need show in field.
3,8 after the Address Len field are for keeping the position.
4, ensuing is 160 mapping node ID, i.e. Mapping Node ID.
5, after this be the network address fields of mapping node in core net, i.e. Core Address field, length depend on the value of TAF field, if TAF=1, then the length of Core Address is 32; If TAF=2, then the length of Core Address is 128.
6, AS Number field identifies the pairing autonomous territory of mapping server that above-mentioned mapping node belongs to;
7, Priority field is used for indicating the priority of this core network address correspondence mappings respectively.
Technical scheme that present embodiment is further perfect.In the present embodiment, provided through concrete map information message structure, present embodiment has whole beneficial effects of embodiment one, and exploitativeness is stronger.
Embodiment four
Present embodiment provides a kind of mapping node; Be applied to expand the Multi-homing scene of routing framework; Based on the Kademlia agreement, comprising: memory module is used to store and safeguard self mapping relations table; The mapping relations table comprises the ID distance of map information and self mapping node and other mapping nodes of other mapping nodes; Map information comprises the ID of mapping node, reaches mapping node place mapping server in the network address of core network, and the ID distance is the result of the ID " XOR " of two mapping nodes; Enquiry module is used for when adding core network, in core network, is starting point with known mapping node, in core network, inquires about other mapping nodes identical with the ID of self through convergence algorithm; Switching Module is used for other mapping node exchange map informations identical with the ID of self.
In the present embodiment, when having the identical mapping node of a plurality of and said mapping node ID in the network, above-mentioned Switching Module is used to receive the map information of said a plurality of mapping node identical with mapping node ID; And self map information is sent to said a plurality of mapping node identical with mapping node ID.
The method that present embodiment is realized can be with reference to the related description of embodiment one-three, and has whole beneficial effects of embodiment one, no longer repeats here.
Embodiment five
Present embodiment further specifies mapping node on the basis of embodiment four.Mapping node can also comprise: detecting module, be used for sending probe message when not receiving the response of other mapping nodes identical with self ID to other mapping nodes identical with self ID, and delete other mapping nodes identical with self ID.
The mapping node of present embodiment is based on the Kademlia agreement; The mapping relations table is the K-bucket table; The K-bucket table is made up of the preset capable chained list of T, wherein, and 0≤T＜160; The capable chained list of i is preserved and this mapping node distance is 2
i～2
I+1The information of mapping node.The ID distance is the result of the ID " XOR " of two mapping nodes.In the present embodiment, the message that the exchange map information can provide for embodiment three between the mapping node.
The method that present embodiment is realized can be with reference to the related description of embodiment one-three, and has whole beneficial effects of the foregoing description, no longer repeats here.
One of ordinary skill in the art will appreciate that: all or part of step that realizes said method embodiment can be accomplished through the relevant hardware of program command; Aforesaid program can be stored in the read/write memory medium; This program the step that comprises said method embodiment when carrying out; And aforesaid storage medium comprises: various media that can be program code stored such as ROM, RAM, magnetic disc, CD, network node, scheduler.
What should explain at last is: the above is merely the preferred embodiments of the present invention; Be not limited to the present invention; Although the present invention has been carried out detailed explanation with reference to previous embodiment; For a person skilled in the art, it still can be made amendment to the technical scheme that aforementioned each embodiment put down in writing, and perhaps part technical characterictic wherein is equal to replacement.All within spirit of the present invention and principle, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (10)
1. the method for map information exchange is applied to expand the Multi-homing scene of routing framework, it is characterized in that adopt the Kademlia agreement, each mapping node is all safeguarded the mapping relations table of self in the core network; Said mapping relations table comprises the ID distance of map information and self mapping node and other mapping nodes of other mapping nodes; Said map information comprises the ID of mapping node, and said mapping node place mapping server is in the network address of said core network; Said ID distance is the result of the ID XOR of two mapping nodes; When increasing the mapping node X identical newly, comprising with the ID of existing mapping node Y in the core network:
Steps A: mapping node X obtains the network address of the core network of the mapping node W that is present in said core network;
Step B: according to the map information of mapping node, be starting point, on the ID distance, approach said mapping node Y gradually, until finding mapping node Y through convergence algorithm with said mapping node W;
Step C: mapping node X obtains the network address of the core network of said mapping node Y;
Wherein, said step B specifically comprises:
Step B1: according to the map information of mapping node W, mapping node X is to mapping node W query mappings node Y;
Step B2: mapping node W judges whether self is mapping node Y, in this way, and execution in step C, otherwise, execution in step B3;
Step B3: mapping node W obtains self ID distance to mapping node Y;
Step B4: according to said ID distance and preset function; From the K-bucket table of mapping node W, obtain preset α nearly mapping node; And the map information of said α nearly mapping node is sent to mapping node X; Wherein, said time nearly mapping node to the ID distance of mapping node Y than mapping node W to the ID of mapping node Y apart from weak point;
Step B5: replace said mapping node W with said α nearly mapping node respectively, carry out said step B1-B5.
2. method according to claim 1 is characterized in that, when having the identical mapping node of ID a plurality of and mapping node Y in the said core network, said step C comprises:
Mapping node Y is sent to mapping node X with the map information of self map information and the mapping node identical with said self ID;
Mapping node X is sent to mapping node Y and the identical mapping node of said ID a plurality of and mapping node Y with self map information.
3. method according to claim 2 is characterized in that, said K-bucket table is formed the figure place of 0＜T≤mapping node ID by the preset capable chained list of T; The capable chained list of i is preserved and the ID distance of this mapping node is 2
i～2
I+1The information of mapping node.
4. method according to claim 3 is characterized in that, the figure place of said mapping node ID is 160; According to the address block of corresponding edge network, obtain the ID of said mapping node, wherein:
When the IP address of the corresponding edge network of said mapping node is the IPv4 type, maximum IP address in low 32 said edge network address blocks of correspondence of said mapping node ID, everybody is 0 for all the other;
When the IP address of the corresponding edge network of said mapping node is the IPv6 type, maximum IP address in low 128 said edge network address blocks of correspondence of said mapping node ID, everybody is 0 for all the other.
5. method according to claim 4 is characterized in that, said preset function is " [Log
2D] ", said " [] " expression rounds downwards, and d is the ID distance of mapping node W to mapping node Y.
6. according to each described method among the claim 1-5, it is characterized in that, also comprise after the said step C:
Step D: mapping node X sends probe message by predetermined period to other mapping nodes identical with self ID;
Step e: when not receiving the response of said other mapping nodes identical, delete said other mapping nodes identical with self ID with self ID.
7. according to each described method among the claim 1-5, it is characterized in that said mapping node X, Y, W are present in one or more mapping servers.
8. according to each described method among the claim 1-5, it is characterized in that among the said step C, the message of exchange map information comprises between the mapping node:
The core network address field, the network address that is used to store core network;
The mapping node id field is used for the ID of Storage Mapping node;
AS Number field is used for the corresponding AS of the said mapping node of mark place mapping server.
9. method according to claim 8 is characterized in that, said message also comprises:
Address Len field is used for the effective length of mark core network address field;
The Prior field is used for the priority of the said core network of mark address correspondence mappings.
10. method according to claim 9 is characterized in that, also comprises: the TAF field is used for the type of the network address of mark core network;
When the type of the said network address was the IPv4 form, said core network address field was 32; Or when the type of the said network address was the IPv6 form, said core network address field was 128.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100918169A CN101997755B (en) | 2009-08-28 | 2009-08-28 | Method for exchanging mapping information and mapping node |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100918169A CN101997755B (en) | 2009-08-28 | 2009-08-28 | Method for exchanging mapping information and mapping node |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101997755A CN101997755A (en) | 2011-03-30 |
| CN101997755B true CN101997755B (en) | 2012-08-15 |
Family
ID=43787379
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009100918169A Active CN101997755B (en) | 2009-08-28 | 2009-08-28 | Method for exchanging mapping information and mapping node |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101997755B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102201986A (en) * | 2011-05-10 | 2011-09-28 | 苏州两江科技有限公司 | Zonal routing method for non-relational database Cassandra |
| CN108924223B (en) * | 2018-06-29 | 2020-11-06 | 北京金山安全软件有限公司 | Node synchronization method and device for block chain |
| CN109525678B (en) * | 2018-12-25 | 2022-09-27 | 众安信息技术服务有限公司 | Block chain network system and corresponding node device discovery method |
| CN112217856A (en) * | 2019-07-11 | 2021-01-12 | 华为技术有限公司 | Address acquisition method, device, equipment and storage medium of application example |
| CN110493555B (en) * | 2019-08-22 | 2022-01-14 | 视联动力信息技术股份有限公司 | Request processing method, user terminal, core server, device and storage medium |
| CN112507032B (en) * | 2020-12-22 | 2022-05-27 | 正链科技(深圳)有限公司 | K-bucket structure improvement method of kademlia protocol |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101483670A (en) * | 2009-02-25 | 2009-07-15 | 南京邮电大学 | Regional P2P computation data consistency maintenance method based on distributed hash table |
-
2009
- 2009-08-28 CN CN2009100918169A patent/CN101997755B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101483670A (en) * | 2009-02-25 | 2009-07-15 | 南京邮电大学 | Regional P2P computation data consistency maintenance method based on distributed hash table |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101997755A (en) | 2011-03-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101997755B (en) | Method for exchanging mapping information and mapping node | |
| CN102014043B (en) | Address mapping system, data transmission method and address mapping maintenance method | |
| CN101656765B (en) | Address mapping system and data transmission method of identifier/locator separation network | |
| US10027623B2 (en) | Internet protocol address resolution | |
| CN107078960B (en) | Optimization method of network function link based on flow | |
| US8792360B2 (en) | Duplicate packet suppression | |
| US20110149973A1 (en) | Packet Forwarding In A Network | |
| KR101240708B1 (en) | Method for providing mobility of device in wireless sensor network based on 6LoWPAN | |
| CN102136917B (en) | Ethernet multicast method and device | |
| CN101729391B (en) | Method, node and system for acquiring link aggregation group information | |
| CN102123091B (en) | Method, device and network equipment for generating multilink transparent transmission interconnection forwarding table | |
| CN102802227B (en) | Based on the data processing method of base station direct connection framework, equipment and system | |
| US7991006B2 (en) | Filtering redundant packets in computer network equipments | |
| CN101908998A (en) | Path calculation method, path calculation unit and path calculation system | |
| CN105072030A (en) | NDN (Named Data Networking) route system based on content clustering, and clustering query method therefor | |
| CN109600326A (en) | Data or method, node and the system of message forwarding | |
| CN102088407B (en) | Mobility managing system and method for integrated identifier network as well as routing method | |
| CN102546419B (en) | Routing method, routing device, packet forwarding method and packet forwarding system | |
| JP4251148B2 (en) | In-group communication method, system, and recording medium | |
| CN103139076A (en) | Distributive hash table intercommunicative network system, inter-domain nodes and implement method | |
| CN103209128A (en) | Datagram and virtual circuit simultaneously supporting data forwarding method and router | |
| CN111464441A (en) | Communication method and device | |
| US8111635B2 (en) | Server, terminal, and method for supporting mobility | |
| CN102487386B (en) | The blocking-up method of identity position separation network and system | |
| CN102045668B (en) | Method and system for processing short message status report |
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 |