CN101909012A - Route addressing method based on tree network - Google Patents
Route addressing method based on tree network Download PDFInfo
- Publication number
- CN101909012A CN101909012A CN2010102503492A CN201010250349A CN101909012A CN 101909012 A CN101909012 A CN 101909012A CN 2010102503492 A CN2010102503492 A CN 2010102503492A CN 201010250349 A CN201010250349 A CN 201010250349A CN 101909012 A CN101909012 A CN 101909012A
- Authority
- CN
- China
- Prior art keywords
- node
- domain name
- absolute
- absolute domain
- crossover
- 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
- 238000000034 method Methods 0.000 title claims abstract description 36
- 238000000926 separation method Methods 0.000 claims description 3
- 230000000977 initiatory effect Effects 0.000 description 11
- 238000012544 monitoring process Methods 0.000 description 8
- 230000006855 networking Effects 0.000 description 8
- 238000010586 diagram Methods 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 239000000203 mixture Substances 0.000 description 2
- 238000010200 validation analysis Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000002950 deficient Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a route addressing method based on a tree network, comprising the steps of: (1) allocating domain names for each node, wherein the domain name comprises a relative domain name and an absolute domain name; configuring the same relative domain name and absolute domain name for the root node; allocating the only domain name in the same brother nodes as the relative domain name of a child node by a father node; and combining the absolute domain name and the relative domain name of the father node to be taken as the absolute domain name of the child node, wherein all components are separated by separators; and (2) carrying out route addressing according to the domain names: A, acquiring absolute domain name information of a target node from a protocol; B, calculating route path information from a source node to the target node according to the absolute domain names of the source node and the target node; and C, transmitting the protocol to the target node according to the route path information. By the invention, the route addressing method is simplified, and the efficiency of route addressing is increased. The invention can be adaptable to the variation of a network structure dynamically.
Description
[technical field]
The present invention relates to integrated monitoring system, relate in particular to the route addressing method between the multi-stage platform in this system based on tree-shaped networking structure.
[background technology]
For the integrated monitoring system, along with using more and more widely, the terminal use has higher requirement, can allow mutual communication between a plurality of integrated monitoring system that disperses, form a big integrated monitoring platform, allow the user can have access to all monitored devices in this big platform? for the terminal use, if before can being sitting in a computer, control whole integrated monitoring platform and be again good thing only, and whether provide and be indifferent to by different suppliers for the concrete supervisory control system in the platform.
Because in actual applications, platform generally all is classification, and authorities at different levels are not reciprocity, use such as the public security monitoring, province public security bureau has the equipment authority of municipal public security bureau, but the municipal public security bureau can not have the equipment authority of province public security bureau, therefore the more realistic applied environment of tree-shaped networking structure.
At present mainly contain two kinds for implementation method based on the integrated monitoring system interconnect of tree-shaped networking structure:
1, the routed path between the pre-configured platform
At first each platform need have a unique domain name, and when father's platform was registered, whether the domain name of father's platform validation sub-platform was unique in this territory at sub-platform, if father's platform also has father's platform, so also need again uniqueness to father's platform validation domain name of father's platform, by that analogy, checking step by step.Then, in routing table, obtain the routed path of source platform, transmit step by step, until target platform to target platform.
This method is divided timing in domain name, needs the whole network checking uniqueness, and efficient is lower; Routed path need be pre-configured simultaneously, in case networking structure changes, needs the manual path of revising.
2, by souning out step by step to obtain the routed path between the platform
At first each platform also needs to have a unique domain name, and for the data that source platform produces, table of query and routing if comprise the routing iinformation of target platform in the routing table, then sends, otherwise the broadcasting route requests; Receive the node of route requests, judge whether the routing iinformation of target platform according to routing table, if having, routing reply then, otherwise continue in network, to broadcast route requests; Receive the node of routing reply judges whether oneself is source node, if then carry out data and send, otherwise send routing reply to source node.
This method can the dynamically adapting networking structure variation, but need the whole network broadcasting route requests, efficient is lower.
[summary of the invention]
The technical problem that the present invention will solve is to overcome inefficient problem of the routing addressing that exists in the prior art and defective, and a kind of simple and high-efficient route addressing method is provided.
In order to solve the problems of the technologies described above, the technical solution used in the present invention is, a kind of route addressing method based on tree network is provided, and this method comprises:
(1) each node is distributed the step of domain name:
Domain name comprises relative domain name and absolute domain name;
For root node, be its configuration identical relative domain name and absolute domain name;
For child node, distribute the unique relative domain name of this child node in the brother of node by its father node for it, the relative domain name with it of the absolute domain name of its father node is made up as its absolute domain name; And the relative domain name of the absolute domain name of father node and this child node adopts separator to separate in the absolute domain name of current child node, and also adopt separator to separate between the part of the absolute domain name of this father node (being absolute domain name of father node of this father node and the relative domain name of this father node), so may comprise a plurality of separators in the absolute domain name of current child node, and progression-1 in the quantity of separator=this child node place tree network (supposing that root node is positioned at the 1st grade);
(2) carry out the step of routing addressing according to domain name:
A, from source node agreement to be sent, obtain the absolute domain name information of destination node;
B, according to the absolute domain name of source node and the absolute domain name of destination node, calculate source node to the complete routed path information of destination node and this information is added in the described agreement;
C, described agreement is forwarded to destination node according to described routed path information.
Wherein, in the described step (1), when described child node is disposed absolute domain name, the absolute domain name of its father node is placed the left side of its relative domain name.
Wherein, described step B further comprises:
The absolute domain name of B1, reference source node and the absolute domain name of destination node extract the same section that is begun by start-up portion from left to right between the two, obtain the absolute domain name of the crossover node of source node and destination node;
B2, calculate the routed path information of source node to crossover node according to absolute domain name information;
B3, calculate the routed path information of crossover node to destination node according to absolute domain name information;
B4, with the routed path information combination of source node to the routed path information of crossover node, crossover node to destination node, obtain the complete routed path information of source node to destination node.
Wherein, described step B2 comprises:
Whether the absolute domain name of judging the absolute domain name of source node and crossover node is identical, if identical, judges that then source node is identical with destination node, need not route; If inequality, then obtain the quantity m of separator in the absolute domain name of quantity n, source node of separator in the absolute domain name of crossover node, and continue to judge:
If m-n=1 determines that then source node to the routed path information of crossover node is: the absolute domain name of source node-＞the absolute domain name of crossover node;
If m-n＞1, then the absolute domain name of each the intermediate node P between source node and the crossover node is obtained in circulation, determines that source node to the routed path information of crossover node is: the absolute domain name of source node-＞intermediate node P
1Absolute domain name-＞...-＞intermediate node P
jAbsolute domain name-＞the absolute territory of crossover node, and the number j=m-n-1 of the intermediate node P between source node and crossover node.
Wherein, among the described step B2, when m-n＞1, the step that the absolute domain name of each the intermediate node P between source node and the crossover node is obtained in described circulation comprises:
The initial value that 1. the number j of intermediate node P is set is 1, and intermediate node P
jAbsolute domain name in the initial value of number i of separator equal m-1;
2. the position of i+1 separator of search in the absolute domain name of source node obtains the character string on i+1 the separator left side from the absolute domain name of this source node, is recorded as intermediate node P
jAbsolute domain name;
3. j is added 1, after i subtracts 1, if i＜=n, then loop ends, otherwise return step 2..
Wherein, described step B3 further comprises:
Whether the absolute domain name of judging the absolute domain name of crossover node and destination node is identical, if identical, judges that then source node is identical with destination node, need not route; If incomplete same, then obtain the quantity o of separator in the absolute domain name of quantity n, destination node of separator in the absolute domain name of crossover node, and continue to judge:
If o-n=1 determines that then crossover node to the routed path information of destination node is: the absolute domain name of crossover node-＞the absolute domain name of destination node;
If o-n＞1, then the absolute domain name of each the intermediate node Q between crossover node and the destination node is obtained in circulation, determines that crossover node to the routed path information of destination node is: the absolute domain name of crossover node-＞intermediate node Q
1Absolute domain name-＞...-＞intermediate node Q
kAbsolute domain name-＞the absolute territory of destination node, and the number k=o-n-1 of the intermediate node Q between crossover node and destination node.
Wherein, among the described step B3, when o-n＞1, the step that the absolute domain name of each the intermediate node Q between crossover node and the destination node is obtained in described circulation comprises:
(i) initial value that the number k of intermediate node Q is set is 1, and intermediate node Q
kAbsolute domain name in the initial value of number i of separator equal n+2;
(ii) the position of i separator of search in the absolute domain name of destination node obtains the character string on i the separator left side from the absolute domain name of this destination node, is recorded as intermediate node Q
kAbsolute domain name;
After (iii) described i and k being added 1 respectively, if i＞o, then loop ends, otherwise return step (ii).
Wherein, among the described step C, in the process of carrying out the agreement forwarding,
For the present node that receives described agreement, whether the absolute domain name that judgement should have front nodal point is identical with the absolute domain name of destination node in the agreement, if identical, then handles described agreement; As if inequality, then extract the absolute domain name information of next node the complete routed path information from source node to destination node, and described agreement is transmitted to this next node.
Wherein, also comprise step after the described step C:
D, described destination node will be back to source node by former road to the result of agreement.
Wherein, described step also comprises in (1): if described tree network structure changes, then be identical relative domain name of new root node configuration and absolute domain name, and issue domain name change agreement, this child node by this new root node to its child node and issue domain name change agreement to its child node again, all nodes are received domain name change agreement under new root node; And the absolute domain name information that comprises the node that sends this agreement in the domain name change agreement;
For the child node of receiving domain name change agreement, according to the absolute domain name of this this child node of domain name change protocol variation.
The present invention has following beneficial effect:
Adopt the method for the invention, in tree network, can be according to the absolute domain name information of source node and destination node, dynamically get access to two routed path information between the node according to routing algorithm, directly forward the data to destination node from source node then by this routed path information, compared with prior art, need not pre-configured routing iinformation, or the whole network broadcasting route requests, reached the effect of simplifying route addressing method, improving routing addressing efficient, and variation that can the dynamically adapting networking structure.
[description of drawings]
The present invention is further detailed explanation below in conjunction with the drawings and specific embodiments.
Fig. 1 be in one embodiment of the present of invention in the tree network domain name of each node distribute schematic diagram.
Fig. 2 be in one embodiment of the present of invention in the tree network after the expansion domain name of each node distribute schematic diagram.
Fig. 3 is the flow chart of route addressing method in one embodiment of the present of invention.
Fig. 4 is the flow chart of routing addressing algorithm in one embodiment of the present of invention.
[embodiment]
Among the present invention, the domain name of each node composition and the method for salary distribution have been used for reference OID (Object Identifier in the tree network, object, object identifier) naming method, domain name similar on OID structure and the present the Internet, it is a kind of tree, separate with ". " between the different levels, the OID title comprises numeral and two kinds of forms of alphanumeric, the value of numeral title be one greater than 0 less than 16000000 positive integer, the value of alphanumeric name form is a varying length string that is no less than 1 character and is not more than 100 characters, wherein the OID of alphanumeric format only appears at during ASN.1 represents, does not appear in the compunication.
The domain name of each node is made up of two parts: domain name and definitely domain name relatively.Wherein, domain name is the unique domain name of this node in the brother of node relatively, and the brother of node is meant the platform that has same father node; The naming method of the similar OID of composition mode of absolute domain name, absolute domain name by the father node of this node adds that the relative domain name of this node constitutes, middle with ". " separation, also can adopt other various forms of separators to separate in actual applications, as " _ ", " * " or the like, as long as can play compartmentation so that discern different parts in the absolute domain name.
The domain name distribution method may further comprise the steps:
1, the domain name of manual configuration root node, the relative domain name of root node is identical with absolute domain name;
2, root node respectively distributes a unique relative domain name for its all child nodes, the absolute domain name of each child node is made of (in this step the absolute domain name of the father node of this child node and the relative domain name of this child node, the father node of this child node is a root node), middle with ". " separation, and wherein the absolute domain name of father node places the left side of the relative domain name of child node, for example, the absolute domain name of child node B is: the absolute domain name of the father node A of child node B. the relative domain name of child node B.
3, the child node of root node is respectively distributed a unique relative domain name for its all child nodes separately, and mode described in 2 disposes absolute domain name for all child nodes set by step; By that analogy, all nodes all have been assigned with relative domain name and have disposed absolute domain name under root node.
Figure 1 shows that an embodiment of the above-mentioned domain name method of salary distribution, among this figure, the absolute domain name of root node A all is 1 with relative domain name, and the domain name of root node needs pre-configured; B and C node all are the child node of A node, the A node distributes relative domain name by registration order for it, this example assumes B node is registration earlier, C node post-registration, then the A node for the B node distributes relative domain name 1, for the C node distributes relative domain name 2, and then the absolute domain name of B node is 1.1, the absolute domain name of C node is 1.2; The node of back is finished the setting of relative domain name and absolute domain name by that analogy.
In the integrated monitoring system, often there is such situation to occur, first stage of the project has in the past just been disposed supervisory control system in districts and cities' one-level, there is not association between each districts and cities' supervisory control system, new demand has been arranged now, need to set up and economize central monitor system, the information of each districts and cities' supervisory control system can be summarised in the province center, and the equipment between each districts and cities can be visited mutually.
Suppose to have at present two districts and cities' supervisory control systems, networking structure all is trees as shown in Figure 1, needs now to set up to economize central monitor system, and so newly-established networking diagram as shown in Figure 2.Among this figure, root node is a newly-increased platform K, domain name and absolute domain name are set to 1 relatively, the relative domain name that left side A node gets access to from new root node is 1, and absolute domain name changes to 1.1 by original 1, at this moment, left side A node can send domain name change agreement by all the child node platforms under it, child node sends domain name change agreement to its child node again, until leaf node, changes the absolute domain name of all nodes under it; The relative domain name that the right A node gets access to from new root node is 2, absolute domain name changes to 1.2 by original 1, at this moment, the right A node can all child nodes under it send domain name change agreement, child node sends domain name change agreement to its child node again, until leaf node, change the absolute domain name of all nodes under it.
After domain name has assigned, be between a plurality of nodes of tree network mutual communication, also need the routing addressing function to realize, see also Fig. 3, route addressing method may further comprise the steps:
301, obtain the absolute domain name of destination node.The absolute domain name information that has comprised destination node in the agreement that source node is ready for sending.
302, obtain the routing information of source node to destination node
According to the absolute domain name of source node and the absolute domain name of destination node, calculate complete routed path information.
303, judge whether final purpose node of present node
Whether the absolute domain name of judging the absolute domain name of present node and destination node is identical.If identical, then processing protocol request, and result returned to source node; If different, then change step 304 and continue to carry out.
304, connect next node according to routing information
Extract next node information (for the father node of present node or child node) in the routing information that step 302 gets access to, get nowhere if connect, it is unreachable to return target; If successful connection then is transmitted to next node with agreement, changes step 303 then and continue to carry out.
In the above-mentioned steps 302, concrete routing algorithm specifically comprises step as shown in Figure 4:
401, obtain the absolute domain name in crosspoint of source node and destination node
The absolute domain name of reference source node and destination node from left to right, identical part is the absolute domain name in both crosspoints.
For example, as shown in Figure 1, suppose that source node is F, destination node is I, and the absolute domain name of source node F is " 1.1.3 ", and the absolute domain name of destination node I is " 1.1.1.1 ", and the absolute domain name in both crosspoints is exactly " 1.1 " so.
402, obtain the path of source node to crossover node
Whether the absolute domain name of reference source node and crossover node is identical, if identical, explanation is same node, need not route; If different, obtain the number of ". " symbol in the crossover node, be assumed to be n, obtain ". " symbol numbers in the source node, be assumed to be m.
If m-n=1 illustrates that source node can directly connect crossover node, directly return routed path to be: the absolute domain name of source node-＞the absolute domain name of crossover node;
If m-n＞1, illustrate and have at least one intermediate node P between source node and the crossover node, the absolute domain name of intermediate node P is obtained in circulation so: the initial value that the number i of separator in the absolute domain name of intermediate node P is set equals m-1, the position of i ". " symbol of search in the absolute domain name of source node, obtain the character string on i ". " symbol left side in the absolute domain name of this source node, be recorded as intermediate node P
1Absolute domain name, i---, if i＜=n, then loop ends if i＞n then continues to obtain the character string on i ". " symbol left side, is recorded as intermediate node P
2Absolute domain name, by that analogy, until i＜=n, cycle-index is m-n-1 time, returns routed path and is: the absolute domain name of source node-＞intermediate node P
1Absolute domain name-＞...-＞intermediate node P
jAbsolute domain name-＞the absolute territory of crossover node, the total j=m-n-1 of intermediate node P wherein, the order of the intermediate node P that the order of intermediate node P gets access to for circulation.
For example, as shown in Figure 1, suppose that source node is F, destination node is I, the absolute domain name of source node F is " 1.1.3 ", the absolute domain name of destination node I is " 1.1.1.1 ", and the absolute domain name in crosspoint is exactly " 1.1 " so, and the source node F that gets access to is " 1.1.3-＞1.1 " to the path in crosspoint.
403, obtain the path of crossover node to destination node
Relatively whether crossover node is identical to the absolute domain name of destination node, if identical, illustrates that crossover node and destination node are same nodes, then need not route; If different, obtain the number of ". " symbol in the crossover node, be assumed to be n, obtain ". " symbol numbers in the destination node, be assumed to be o.
If o-n=1 illustrates that crossover node can directly connect destination node, directly return routed path to be: the absolute domain name of crossover node-＞the absolute domain name of destination node node;
If o-n＞1, illustrate and have intermediate node Q between crossover node and the destination node, the absolute domain name of intermediate node Q is obtained in circulation so: the number i initial value that separator in the absolute domain name of intermediate node Q is set equals n+2, the position of i ". " symbol of search in the absolute domain name of destination node, obtain the character string on i ". " symbol left side in the absolute domain name of this destination node, be recorded as intermediate node Q
1Absolute domain name, i++, if i＞o, then loop ends if i＜=o then continues to obtain the character string on i ". " symbol left side, is recorded as intermediate node Q
2, by that analogy, until i＞o, cycle-index is o-n-1 time, returns routed path and is: the absolute domain name of crossover node-＞intermediate node Q
1Absolute domain name-＞...-＞intermediate node Q
kAbsolute domain name-＞the absolute territory of destination node, and the number k=o-n-1 of the intermediate node Q between crossover node and destination node, the order of the intermediate node Q that the order of intermediate node Q gets access to for circulation.
For example, as shown in Figure 1, suppose that source node is F, destination node is I, the absolute domain name of source node F is " 1.1.3 ", the absolute domain name of destination node I is " 1.1.1.1 ", and the absolute domain name in crosspoint is exactly " 1.1 ", and the crossover node that gets access to so is " 1.1-＞1.1.1-＞1.1.1.1 " to the path of destination node I.
404, obtain the fullpath of source node to destination node
The path that step 402 and step 403 are got access to merges, and is the fullpath of source node to destination node.
For example, the path that step 402 is obtained is " 1.1.3-＞1.1 ", and the path that step 402 is obtained is " 1.1-＞1.1.1-＞1.1.1.1 ", and the path after merging so is " 1.1.3-＞1.1-＞1.1.1-＞1.1.1.1 ".
Below be an above-mentioned embodiment who carries out the routing addressing process according to domain-name information:
Present embodiment adopts Session Initiation Protocol Data transmission between each node, uses when the route addressing method flow process of Fig. 3 mainly is the request msg agreement.For response protocol, then adopt the Via field in the Session Initiation Protocol head to realize addressing, return according to the former road of request msg agreement.
Illustrate below in Fig. 1, when the user under the CU device request I node of F node during equipment 001, the variation of Session Initiation Protocol head:
The request protocol that F receives, the Session Initiation Protocol head is: REQUEST SIP/2.0Route:001@1.1.1.1From:CUVia:CU@192.168.4.56Max-Fo rwards:16
The absolute domain name of source node F is " 1.1.3 ", the absolute domain name that gets access to destination node I from agreement is " 1.1.1.1 ", obtain source node according to the routing addressing algorithm and be " 1.1.3-＞1.1-＞1.1.1-＞1.1.1.1 " to the routing information of destination node, F is added into routing information in the Route field of protocol header, add a Via field in addition again, segment value is the absolute domain name and the IP address information of this node, in the Route field, obtain next node information then, in the routing table of this node, search for, find that next node is his father's Node B, the Session Initiation Protocol head that is sent to B is:
REQUEST?SIP/2.0
Route:001@1.1.1.1＜1.1.1＜1.1＜1.1.3
From:CU
Via:CU@192.168.4.56
Via:1.1.3@192.168.4.2
Max-Forwards:15
After the B node is received agreement, add the Via field of oneself, and obtain next node information in the Route field, search in the routing table of this node then, find that next node is its child node D, agreement is transmitted to D, the Session Initiation Protocol head is:
REQUEST?SIP/2.0
Route:001@1.1.1.1＜1.1.1＜1.1＜1.1.3
From:CU
Via:CU@192.168.4.56
Via:1.1.3@192.168.4.2
Via:1.1@192.168.3.6
Max-Forwards:14
After D receives, add the Via field of oneself, and obtain next node information in the Route field, search in this node routing table then, find that next node is its child node I, be transmitted to I, the Session Initiation Protocol head is:
REQUEST?SIP/2.0
Route:001@1.1.1.1＜1.1.1＜1.1＜1.1.3
From:CU
Via:CU@192.168.4.56
Via:1.1.3@192.168.4.2
Via:1.1@192.168.3.6
Via:1.1.1@192.168.7.9
Max-Forwards:13
After I receives, find it oneself is the final purpose node, it handled that return result according to former road then, the Session Initiation Protocol head that returns is:
SIP/2.0200?OK
Route:001@1.1.1.1＜1.1.1＜1.1＜1.1.3
From:CU
Via:CU@192.168.4.56
Via:1.1.3@192.168.4.2
Via:1.1@192.168.3.6
Via:1.1.1@192.168.7.9
Max-Forwards:16
After D receives answer, seek Via information, find to comprise oneself, remove the Via information of oneself, seek a Via information then, be transmitted to B, the Session Initiation Protocol head is:
SIP/2.0200?OK
Route:001@1.1.1.1＜1.1.1＜1.1＜1.1.3
From:CU
Via:CU@192.168.4.56
Via:1.1.3@192.168.4.2
Via:1.1@192.168.3.6
Max-Forwards:15
After B receives answer, seek Via information, find to comprise oneself, remove the Via information of oneself, seek a Via information, be transmitted to F, the Session Initiation Protocol head becomes:
SIP/2.0200OK
Route:001@1.1.1.1＜1.1.1＜1.1＜1.1.3
From:CU
Via:CU@192.168.4.56
Via:1.1.3@192.168.4.2
Max-Forwards:14
F receives answer, seeks Via information, finds to comprise oneself, removes the Via information of oneself, seeks a Via information, is transmitted to CU, and the Session Initiation Protocol head becomes:
SIP/2.0200?OK
Route:001@1.1.1.1＜1.1.1＜1.1＜1.1.3
From:CU
Via:CU@192.168.4.56
Max-Forwards:13
CU receives answer.In the answer that CU receives, if Via information, also has other Via except oneself, think that then agreement makes mistakes, abandon.In the transmission course of agreement, every the value of Max-Forwards field can subtract 1 through a node, and the value of Max-Forwards was less than 0 o'clock, and this agreement is dropped.Can prevent loop like this.The initial value of Max-Forwards can be provided with according to the size of tree network, generally is defaulted as 16.
To sum up, when distributing domain name, need not the whole network checking uniqueness among the present invention; Simultaneously,, can directly calculate internodal routed path information, not only have higher efficient, and have stronger adaptability according to the domain name of source node and destination node.
Above embodiment is only unrestricted in order to technical scheme of the present invention to be described, only with reference to preferred embodiment the present invention is had been described in detail.Those of ordinary skill in the art should be appreciated that and can make amendment or be equal to replacement technical scheme of the present invention, and do not break away from the spirit and scope of technical solution of the present invention, all should be encompassed in the middle of the claim scope of the present invention.
Claims (10)
1. the route addressing method based on tree network is characterized in that, this method comprises:
(1) each node is distributed the step of domain name:
Domain name comprises relative domain name and absolute domain name;
For root node, be its configuration identical relative domain name and absolute domain name;
For child node, distribute the unique relative domain name of this child node in the brother of node by its father node for it, with the combination of the relative domain name of the absolute domain name of its father node with it as its absolute domain name, and employing separator separation between the relative domain name of absolute domain name and this child node of father node in this absolute domain name;
(2) carry out the step of routing addressing according to domain name:
A, from source node agreement to be sent, obtain the absolute domain name information of destination node;
B, according to the absolute domain name of source node and the absolute domain name of destination node, calculate source node to the complete routed path information of destination node and this information is added in the described agreement;
C, described agreement is forwarded to destination node according to described routed path information.
2. route addressing method according to claim 1 is characterized in that, in the described step (1), when described child node is disposed absolute domain name, the absolute domain name of its father node is placed the left side of its relative domain name.
3. route addressing method according to claim 2 is characterized in that, described step B further comprises:
The absolute domain name of B1, reference source node and the absolute domain name of destination node extract the same section that is begun by start-up portion from left to right between the two, obtain the absolute domain name of the crossover node of source node and destination node;
B2, calculate the routed path information of source node to crossover node according to absolute domain name information;
B3, calculate the routed path information of crossover node to destination node according to absolute domain name information;
B4, with the routed path information combination of source node to the routed path information of crossover node, crossover node to destination node, obtain the complete routed path information of source node to destination node.
4. route addressing method according to claim 3 is characterized in that, described step B2 comprises:
Whether the absolute domain name of judging the absolute domain name of source node and crossover node is identical, if identical, judges that then source node is identical with destination node, need not route; If inequality, then obtain the quantity m of separator in the absolute domain name of quantity n, source node of separator in the absolute domain name of crossover node, and continue to judge:
If m-n=1 determines that then source node to the routed path information of crossover node is: the absolute domain name of source node-＞the absolute domain name of crossover node;
If m-n＞1, then the absolute domain name of each the intermediate node P between source node and the crossover node is obtained in circulation, determines that source node to the routed path information of crossover node is: the absolute domain name of source node-＞intermediate node P
1Absolute domain name-＞...-＞intermediate node P
jAbsolute domain name-＞the absolute territory of crossover node, and the number j=m-n-1 of the intermediate node P between source node and crossover node.
5. route addressing method according to claim 4 is characterized in that, among the described step B2, when m-n＞1, the step that the absolute domain name of each the intermediate node P between source node and the crossover node is obtained in described circulation comprises:
The initial value that 1. the number j of intermediate node P is set is 1, and intermediate node P
jAbsolute domain name in the initial value of number i of separator equal m-1;
2. the position of i+1 separator of search in the absolute domain name of source node obtains the character string on i+1 the separator left side from the absolute domain name of this source node, is recorded as intermediate node P
jAbsolute domain name;
3. j is added 1, after i subtracts 1, if i＜=n, then loop ends, otherwise return step 2..
6. route addressing method according to claim 3 is characterized in that, described step B3 further comprises:
Whether the absolute domain name of judging the absolute domain name of crossover node and destination node is identical, if identical, judges that then source node is identical with destination node, need not route; If incomplete same, then obtain the quantity o of separator in the absolute domain name of quantity n, destination node of separator in the absolute domain name of crossover node, and continue to judge:
If o-n=1 determines that then crossover node to the routed path information of destination node is: the absolute domain name of crossover node-＞the absolute domain name of destination node;
If o-n＞1, then the absolute domain name of each the intermediate node Q between crossover node and the destination node is obtained in circulation, determines that crossover node to the routed path information of destination node is: the absolute domain name of crossover node-＞intermediate node Q
1Absolute domain name-＞...-＞intermediate node Q
kAbsolute domain name-＞the absolute territory of destination node, and the number k=o-n-1 of the intermediate node Q between crossover node and destination node.
7. route addressing method according to claim 6 is characterized in that, among the described step B3, when o-n＞1, the step that the absolute domain name of each the intermediate node Q between crossover node and the destination node is obtained in described circulation comprises:
(i) initial value that the number k of intermediate node Q is set is 1, and intermediate node Q
kAbsolute domain name in the initial value of number i of separator equal n+2;
(ii) the position of i separator of search in the absolute domain name of destination node obtains the character string on i the separator left side from the absolute domain name of this destination node, is recorded as intermediate node Q
kAbsolute domain name;
After (iii) described i and k being added 1 respectively, if i＞o, then loop ends, otherwise return step (ii).
8. route addressing method according to claim 1 is characterized in that, among the described step C, and in the process of carrying out the agreement forwarding,
For the present node that receives described agreement, whether the absolute domain name that judgement should have front nodal point is identical with the absolute domain name of destination node in the agreement, if identical, then handles described agreement; As if inequality, then extract the absolute domain name information of next node the complete routed path information from source node to destination node, and described agreement is transmitted to this next node.
9. according to claim 1 or 8 described route addressing methods, it is characterized in that, also comprise step after the described step C:
D, described destination node will be back to source node by former road to the result of agreement.
10. route addressing method according to claim 1, it is characterized in that, described step also comprises in (1): if described tree network structure changes, then be identical relative domain name of new root node configuration and absolute domain name, and issue domain name change agreement, this child node by this new root node to its child node and issue domain name change agreement to its child node again, all nodes are received domain name change agreement under new root node; And the absolute domain name information that comprises the node that sends this agreement in the domain name change agreement;
For the child node of receiving domain name change agreement, according to the absolute domain name of this this child node of domain name change protocol variation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102503492A CN101909012B (en) | 2010-08-02 | 2010-08-02 | Route addressing method based on tree network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102503492A CN101909012B (en) | 2010-08-02 | 2010-08-02 | Route addressing method based on tree network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101909012A true CN101909012A (en) | 2010-12-08 |
| CN101909012B CN101909012B (en) | 2012-07-04 |
Family
ID=43264335
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010102503492A Expired - Fee Related CN101909012B (en) | 2010-08-02 | 2010-08-02 | Route addressing method based on tree network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101909012B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102811076A (en) * | 2011-06-03 | 2012-12-05 | 希姆通信息技术（上海）有限公司 | Bluetooth connecting method |
| CN104104602A (en) * | 2014-08-06 | 2014-10-15 | 北京瑞汛世纪科技有限公司 | Method and device for QoS information prediction |
| CN104954415A (en) * | 2014-09-24 | 2015-09-30 | 腾讯科技（深圳）有限公司 | Method and apparatus for carrying out processing on HTTP request |
| CN105827282A (en) * | 2016-05-24 | 2016-08-03 | 卧槽科技（深圳）有限公司 | Bluetooth equipment networking method and device and Bluetooth equipment |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2008165531A (en) * | 2006-12-28 | 2008-07-17 | Internatl Business Mach Corp <Ibm> | Method for failover (restoration) of defective node in computer system having a plurality of nodes |
| CN101616182A (en) * | 2009-07-16 | 2009-12-30 | 浙江理工大学 | A kind of structure has the method for semantic P2P network |
-
2010
- 2010-08-02 CN CN2010102503492A patent/CN101909012B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2008165531A (en) * | 2006-12-28 | 2008-07-17 | Internatl Business Mach Corp <Ibm> | Method for failover (restoration) of defective node in computer system having a plurality of nodes |
| CN101616182A (en) * | 2009-07-16 | 2009-12-30 | 浙江理工大学 | A kind of structure has the method for semantic P2P network |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102811076A (en) * | 2011-06-03 | 2012-12-05 | 希姆通信息技术（上海）有限公司 | Bluetooth connecting method |
| CN104104602A (en) * | 2014-08-06 | 2014-10-15 | 北京瑞汛世纪科技有限公司 | Method and device for QoS information prediction |
| CN104104602B (en) * | 2014-08-06 | 2018-02-09 | 湖南网数科技有限公司 | A kind of method and device of QoS information prediction |
| CN104954415A (en) * | 2014-09-24 | 2015-09-30 | 腾讯科技（深圳）有限公司 | Method and apparatus for carrying out processing on HTTP request |
| CN104954415B (en) * | 2014-09-24 | 2019-06-21 | 腾讯科技（深圳）有限公司 | Handle the method and device of HTTP request |
| CN105827282A (en) * | 2016-05-24 | 2016-08-03 | 卧槽科技（深圳）有限公司 | Bluetooth equipment networking method and device and Bluetooth equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101909012B (en) | 2012-07-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100566328C (en) | Network resolve method in the territory with the user distribution server, reach relevant telecommunication system | |
| CN101523858B (en) | Method for the routing of multimedia communication related signaling in a communication system | |
| CN200990619Y (en) | Routing device | |
| KR101464452B1 (en) | Processing method, proxy processing agent, system and method for filling a routing table of a dht client node, router and dht client node | |
| CN100586098C (en) | Block communication system and IP address selecting method of mobile node | |
| WO2006136193A1 (en) | Arrangement and method relating to load distribution | |
| CN103493436A (en) | Methods, systems, and computer readable media for configurable diameter address resolution | |
| AU2003237736A1 (en) | Method for routing a service request in a telecommunication system, using e.164 numbers and a dns | |
| CN101006707A (en) | Method for switching Ip packets between client networks and Ip provider networks by means of an access network | |
| CN101909012B (en) | Route addressing method based on tree network | |
| CN103546304A (en) | Business processing method, equipment and system | |
| CN107645413A (en) | Intelligent switched telephone network core side accesses the full-automatic configuration platform in side and method | |
| CN101102325A (en) | Method and device for notifying boundary connection information of autonomous system | |
| CN104378270A (en) | Data center system and data center method for networks | |
| CN111478793B (en) | Service request processing method and device, terminal equipment and storage medium | |
| CN102075438A (en) | Unicast data frame transmission method and device | |
| CN101013994A (en) | Providing services over hybrid networks | |
| CN101090398B (en) | Detection of loops within a sip signalling proxy | |
| CN102763377A (en) | Method for distributing routing information for redundant connections | |
| KR101375983B1 (en) | Ims architecture using a distributed hash table | |
| EP1366606B1 (en) | Apparatus and methods for establishing virtual private networks in a broadband network | |
| US20180262355A1 (en) | Method for multicast packet transmission in software defined networks | |
| CN101656762B (en) | Method, apparatus and system for transmitting domain name server information | |
| CN101904156A (en) | Exchanging control codes between SIP/IMS and UPnP network element | |
| CN102215231A (en) | Data forwarding method and gateway |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120704 |