CN1848791A - Method for obtaining tree group network topological structure and address distributing method - Google Patents
Method for obtaining tree group network topological structure and address distributing method Download PDFInfo
- Publication number
- CN1848791A CN1848791A CN 200510064241 CN200510064241A CN1848791A CN 1848791 A CN1848791 A CN 1848791A CN 200510064241 CN200510064241 CN 200510064241 CN 200510064241 A CN200510064241 A CN 200510064241A CN 1848791 A CN1848791 A CN 1848791A
- Authority
- CN
- China
- Prior art keywords
- node
- hop
- numbering
- next stage
- self
- 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
Landscapes
- Small-Scale Networks (AREA)
Abstract
A method for obtaining topological structure of tree multinetwork includes setting Hop number of each slave node by applying preset unified coding rule according to Hop number of previous node (PN) and cascade port number between each slave node and PN, retransmitting its own Hop to father node if Hop sent from subnode is not received by slave node, obtaining each level of node from slave node to master node by master node according reported Hop through means of using numbering rule to carry out reverse level by level recurrence. The address distribution manner based on said method is also disclosed.
Description
Technical field
The present invention relates to the technology of obtaining of network topology structure in the communication system, be meant the acquisition methods of topological structure in the communication system of tree group network especially, and network node address distribution method on its basis.
Background technology
In the transport communication system, there is multiple networking mode, as: star-like, chain, ring-like and tree type etc.For every kind of networking, its network management system is generally taken on by host node (MN, Master Node), must for each from node (SN, Slave Node) allocate communications address, and must know that each is from the position of node topological structure.
In the networking of various topological structures, tree group network is a kind of more commonly used, also is a kind of networking mode of more complicated.In this networking, host node mainly contains following two kinds for the scheme of distributing the address to take at present from node:
First kind for acting on behalf of scheme step by step, and the address assignment of this scheme is carried out from top to bottom step by step.Each of tree topology grade node is when distributing the address for its downstream site, distribute the address according to the address information that host node issues for its downstream site, and report the topology location of its downstream site and the downstream site address of being distributed, host node is according to the address and the topology location of this downstream site, be the node assigned address of next stage more, and this address information is issued to described downstream site, by this downstream site be its next stage node its distribute address.Later on for convenience of description, claim the child node of the next stage node of a certain node, claim the father node of the even higher level of node of a certain node for this node for this node.
The shortcoming of this scheme is owing to can only serial distribute the address step by step, makes the system start-up time long, in case and even higher level of node is restarted or fault, and then must obtain the topology location of the downstream site of malfunctioning node again, and carry out address assignment again.
Second kind of scheme is to represent node by the hardware address of node self, and obtains the position of each node in topological diagram.Hardware address can realize by toggle switch, also can be the fixed sequence program that is provided with when dispatching from the factory of node device number.Like this, have which hardware address as long as host node is known the network kind, the topological structure that just can obtain networking by the mode of broadcast scan also is different hardware address assign logical addresses.
But the shortcoming of this scheme is when carrying out system group network and configuration, must obtain the topology location and the hardware address of each node in advance, and must rely on the setting of hardware address fully, causes system maintainability poor.
Summary of the invention
In view of this, main purpose of the present invention is to provide the acquisition methods of topological structure in a kind of tree group network communication system, and host node can be detected respectively automatically apace from the topology location of node, obtains network topology structure, improves the maintainability of system.
Acquisition methods based on topological structure in above-mentioned purpose a kind of tree group network communication system provided by the invention comprises:
A) according to each from Hop of node even higher level of node numbering and and even higher level of node between the cascade port numbers, by the unified coding rule that pre-establishes each Hop from node is set and numbers;
B) each judges whether to receive effective Hop numbering of sending from the next stage node from node, if, then this Hop numbering is transmitted to even higher level of node, otherwise, self Hop numbering is sent to even higher level of node;
C) be forwarded to host node from the Hop of node numbering after, host node according to receive from node Hop numbering, by the pairing nodes at different levels on from node to path between the host node of reverse each Hop numbering that obtains reporting of increasing by degrees of described unified coding rule.
This method step a) comprising:
Host node in the tree group network issues the Hop numbering to the next stage of self from node;
In the tree group network each from node after receiving the Hop numbering that even higher level of node issues, the Hop numbering that this Hop is numbered self is set, and unified coding rule by pre-establishing, by self Hop numbering and and the next stage node between subordinate's cascade port numbers calculate the Hop numbering of this each node of node next stage, be issued to corresponding subordinate's cascade port respectively.
This method step a) comprising: each node in the tree group network to the next stage node issue self Hop numbering and and the next stage node between the cascade port numbers; The next stage node calculates the Hop numbering according to Hop numbering and the cascade port numbers received by the unified coding rule that pre-establishes, and the Hop that obtains numbering is set to the Hop numbering of self.
The described coding rule of this method is: the Hop numbering * 2 of the Hop numbering=even higher level of node of next stage node
kCascade port numbering between+upper level and this next stage node, wherein, k is an integer, and 2
kHigher limit more than or equal to the port numbering of cascade described in the system;
Described host node by the reverse method of increasing by degrees of described fixed number rule is: the move to right result of gained behind the k position of current Hop numbering is defined as the Hop numbering of the even higher level of node of current Hop numbering corresponding node.
This method described 2
kLucky higher limit more than or equal to the port numbering of cascade described in the system.
Further comprise after the described step c) of this method: host node is preserved the Hop numbering from node of final stage on every paths;
When carrying out path detection, each on the detected path judges whether to receive effective Hop numbering of sending from the next stage node from node, if, then this Hop numbering is transmitted to even higher level of node, otherwise, self Hop numbering is sent to even higher level of node;
Host node obtains on the path current final stage and judges from the Hop numbering of node whether the Hop numbering of current final stage node is saved from the Hop numbering that obtains, if judge that then path, current final stage node place does not change; Otherwise, superior node Hop numbering by the current final stage node of the reverse derivation of described unified coding rule, judge whether to be saved, if, judge that then current final stage node is a downstream site newly-increased on the final stage nodal basis of original path, replace original Hop numbering of being preserved on the respective path with this Hop numbering; Otherwise, by the reverse superior node Hop numbering of deriving the Hop numbering corresponding node of preservation of described unified coding rule, judge whether gained superior node Hop numbering is consistent with current final stage node Hop numbering, if, judge that then path, present node place is unavailable below node from this, replace original Hop numbering of being preserved on the respective path with present node Hop numbering, otherwise, judge that then present node is a final stage node newly-increased beyond the original route, and preserve the Hop numbering of present node.
Further comprise after the described step c) of this method: host node is preserved the Hop numbering from node of final stage on every paths;
When carrying out path detection, each in the tree group network judges whether to receive effective Hop numbering of sending from the next stage node from node, if, then this Hop numbering is transmitted to even higher level of node, otherwise, self Hop numbering is sent to even higher level of node;
Host node obtains on the path final stage and upgrades original Hop numbering of preserving from the Hop numbering of node with the new Hop numbering that obtains from the Hop numbering that obtains.
This method further is provided with 0xFF and represents invalid Hop numbering;
Describedly judge whether to receive that the method for the effective Hop numbering that the next stage node is sent comprises: if receive that Hop numbering and this numbering that the next stage node is sent are not 0xFF, judge that then the Hop that receives is numbered effectively, otherwise it is invalid to judge that the Hop that receives is numbered.
The described Hop numbering of this method is carried in the physical frame of communication.
Another main purpose of the present invention is to provide the distribution method of node address in a kind of tree group network communication system, makes address assignment more flexibly fast, improves address assignment efficient, increases the maintainability of network.
Distribution method based on node address in this purpose a kind of tree group network communication system provided by the invention comprises:
A) according to each from Hop of node even higher level of node numbering and and even higher level of node between the cascade port numbers, by the unified coding rule that pre-establishes each Hop from node is set and numbers;
B) host node obtains the Hop numbering from node of address to be allocated, binds together from address of node and the Hop numbering of being somebody's turn to do from node distributing to this, sends by the form of broadcasting;
C) receive the address of described broadcasting from node after, whether the Hop numbering of judging address binding and the Hop of self number consistent, if be self address with this address setting then.
This method step a) comprising:
Host node in the tree group network is that the next stage of self distributes the Hop numbering from node;
In the tree group network each is from the unified coding rule of node by pre-establishing, by self Hop numbering and and the next stage node between the cascade port numbers calculate the Hop numbering of this each node of node next stage, the Hop numbering that obtains is distributed to the next stage node of cascade port correspondence respectively.
This method step a) comprising: each node in the tree group network to the next stage node issue self Hop numbering and and the next stage node between the cascade port numbers; The next stage node calculates the Hop numbering according to Hop numbering and the cascade port numbers received by the unified coding rule that pre-establishes, and the Hop that obtains numbering is set to the Hop numbering of self.
This method step b) described host node obtains address to be allocated and comprises from the process of node Hop numbering:
Each judges whether to receive effective Hop numbering of sending from the next stage node from node, if, then this Hop numbering is transmitted to even higher level of node, otherwise, self Hop numbering is sent to even higher level of node;
After being forwarded to host node from the Hop of node numbering, host node is preserved the Hop numbering of receiving, therefrom finds out the Hop numbering from node of address to be allocated; If the Hop from node of address to be allocated numbers not the Hop numbering that reports, then obtain the Hop numbering from node of address to be allocated by reverse the increasing by degrees of described unified coding rule.
The described coding rule of this method is: the Hop numbering * 2 of the Hop numbering=even higher level of node of next stage node
kCascade port numbering between+upper level and this next stage node, wherein, k is an integer, and 2
kHigher limit more than or equal to the port numbering of cascade described in the system.
This method further comprises: if the numbering of the Hop from node detection to self changes, the address of then putting self is initial invalid value.
This method further comprises: changing if host node detects from the topology location of node, is to distribute the address from node again.
From above as can be seen, the acquisition methods of topological structure is by setting up unified coding rule in the tree group network communication system provided by the invention, make and obtain the numbering of this node automatically from node in the tree group network network, the topological structure that host node obtains automatically, and further can detect automatically the topologies change and the fault of system, thereby accelerated the acquisition speed of network topology, improved the maintainability and the configuration flexibility of system greatly.The distribution method of node address in the tree group network communication system that the present invention proposes on this basis, realized the concurrency of address assignment, address assignment efficient is obviously improved, and at any time can be according to the variation of network topology structure, reset logical address, improved the maintainability of network.
Description of drawings
Fig. 1 is the Hop numbering schematic diagram of each node of tree group network of preferred embodiment of the present invention;
Fig. 2 numbers distribution and reports schematic diagram for the Hop of the tree group network of preferred embodiment of the present invention;
Fig. 3 is a network topology testing process schematic diagram in the embodiment of the invention.
Embodiment
The present invention program comprises: numbering (Hop) field that increases node in the cascade network in the physical frame of communication.Wherein, the physical frame here is equivalent to the ground floor (L1) of open system interconnection (OSI) model (OSI) layer 7 model, but realization of the present invention is not limited to increase this field at L1, also can increase this field in other message frame, the byte number of Hop field can be determined according to the size of real network scale.And pre-establish fixing Hop coding rule, make in the tree group network each node as long as with self the Hop numbering and self bring the Hop that this coding rule that pre-establishes just can draw this child node into and number with the cascade port numbering between its child node.
When the concrete Hop of distribution numbers, can adopt two kinds of schemes:
Scheme one, each node in the tree group network comes for its next stage node distributes the Hop numbering by physical frame, and detailed process is as follows:
Host node in the tree group network issues the Hop numbering to its next stage from node.In the networking each, is provided with this Hop and is numbered the Hop numbering of self after receiving the Hop numbering that even higher level of node issues from node; Simultaneously by specified coding rule,, and be handed down to the child node of correspondence respectively by Hop numbering and the subordinate's cascade port numbers Hop numbering that calculates self each child node of self; So until the final stage leaf node.
Scheme two, each node is handed down to its next stage node with self Hop numbering by physical frame in the tree group network, calculates self Hop by the next stage node according to the unified coding rule of appointment and numbers, and detailed process is as follows:
Each node that comprises host node in the tree group network to the next stage node issue self Hop numbering and and the next stage node between the cascade port numbers; The next stage node according to the Hop numbering of the even higher level of node received and and this even higher level of node between the cascade port numbers, calculate the Hop numbering by the unified coding rule that pre-establishes, the Hop that the Hop that calculates numbering is set to self numbers; And then to self next stage node issue self Hop numbering and with the internodal cascade port numbers of next stage, so until the final stage leaf node.
Each judges whether to receive that effective Hop that its child node is sent numbers, if then the Hop numbering of receiving is transmitted to its father node after finishing the Hop numbering of self from node in setting; Otherwise, the Hop numbering of oneself is issued its father node, like this, make and have only final stage node on every paths, just report the Hop of self to number.Host node is according to the Hop numbering that reports from node, carry out reverse derivation by described coding rule and just can calculate this Hop numbering from the father node of node, again the Hop numbering of this father node is carried out the Hop numbering that reverse derivation just can obtain the even higher level of node of this father node by coding rule, so, reverse increasing by degrees, just can obtain this nodes at different levels on from node to path between the host node, and then, just obtain the topology of whole networking by calculating to numbering from node Hop on the different paths.
The present invention is further described in more detail below in conjunction with drawings and the specific embodiments.
In preferred embodiment of the present invention, the numbering of Hop is deferred to following rule:
Hop * 2 of its father node of Hop=of child node
kCascade port numbers between+father node and child node.
Wherein, k is an integer, and the cascade port number in the value of k and the network between the node is relevant, repeats 2 for fear of the Hop numbering
kShould be more than or equal to the higher limit of each cascade port numbers in the system; As can be seen, this Hop coding rule makes the Hop of the child node k position (bit) that moves to right, promptly Hop＞＞k, just can obtain the Hop of its father node.
The byte number of Hop field determines that according to the scale of network the byte number of Hop field just should be big at most for node in the network, and leaving sufficient leeway, otherwise then the byte number of Hop field just can be less.For fear of the waste of Hop field resource, 2
kPreferable value be just more than or equal to the higher limit of each cascade port numbering in the system.
Above coding rule only is a preferred embodiment of the present invention, and those skilled in the art should be easy to expect also having much other coding rules, such as: Hop * 2 of its father node of Hop=of child node
kCascade port numbers between+father node and child node+certain natural number; or the like, as long as this coding rule can be adopted from node by in the tree group network all, and can not cause problems such as the Hop numbering repeats; all applicable to the present invention, and within protection scope of the present invention.
In addition, can stipulate that all bytes are 0xFF and represent invalid Hop; 0 keeps not usefulness, can think the Hop of host node.Here, those skilled in the art should be easy to expect that described invalid Hop and host node Hop also can use other value representation.
Referring to tree group network shown in Figure 1, to suppose to hang 7 nodes at most down below each node in this network, the cascade range of port number is 0～6, then can get k=3; According to this networking scale, selecting the length of Hop field is 2 bytes, this is because 2 byte lengths are 16, again by k=3 as can be known every node layer of topological tree take 3 of field, therefore 16/3 can represent at least that altogether the Hop of 5 node layers numbers, enough for 4 layers of tree group network shown in Figure 1.Certainly, if expansion needs the Hop numbering also can get bigger k value and longer field length after considering.
Can know the SN that directly links to each other with MN according to above-mentioned coding rule
1Hop=1, also can specify arbitrarily for its Hop numbering of the SN that directly links to each other with MN in addition; The Hop=Hop father of other SN * 8+ cascade port numbers, wherein, the span of cascade port numbers here is 0～6.The numbering of each SN can be referring to shown in Figure 1, and the Hop of SN1.0 numbers Hop
SN1.0=Hop
SN1* 8+0=8, the Hop numbering Hop of SN1.0.1
SN1.0.1=Hop
SN1.0* 8+0=8 * 8+1=65 ..., the numbering of other SN can calculate according to this rule.
Referring to tree group network shown in Figure 2, be that example is specifically described with the Hop coding assignment process of such scheme one.
Down direction:
For MN,, therefore when sending physical frame, fill out 1 all the time on the Hop field because it has only a child node.
For SN, receive the physical frame of sending from self father node, extract the Hop field, be the Hop of this node with wherein Hop encoding setting; According to coding rule this Hop be multiply by 8, add respectively and its child node between cascade port numbers 0 ..., 6 be issued to subordinate's cascade port of port numbers correspondence by physical frame, be about to Hop * 8+0 and be forwarded to port 0, Hop * 8+1 is forwarded to port one ....
For example: SN1.1 receives the physical frame that its father node SN1 sends, and therefrom extracts the Hop coding 9 that is distributed, with 9 Hop that are set to self.Calculate the Hop of its child node simultaneously according to coding rule respectively, obtain Hop=9 * 8+0=72 of SN1.1.0, this Hop numbering is placed on to issue in the physical frame by cascade port 0 is handed down to SN1.1.0; Obtain Hop=9 * 8+1=73 of SN1.1.1, this Hop numbering is placed on to issue in the physical frame by the cascade port one is handed down to SN1.1.1, other node by that analogy.Specifically can be referring to shown in Figure 2, wherein dotted line is represented downlink path, and solid line is represented up path.
Up direction:
For SN, SN is after the child node of self distributes Hop, can judge whether to receive the effective Hop numbering that reports, be not numbered invalid numbering if receive Hop numbering that child node sends (this Hop number not necessarily child node) or the Hop that sends, promptly form, then the Hop of this locality is sent to the father node of self by physical frame by 0xFF.Because under the normal condition, have only the final stage SN on the every paths of tree group network, promptly leaf node just can be received the Hop coding that the SN of subordinate reports, what therefore final MN received will be the Hop numbering of all leaf nodes on the tree topology.Wherein, after preventing to cause owing to the time delays that child node reports Hop to number the misjudgment of father node, can be provided with to distribute the Hop coding under the SN, delay a period of time is carried out above-mentioned judgement again; Or be arranged on judgement repeatedly in a period of time, if still do not receive effective Hop, then report the Hop of self again.
For MN, the Hop that reports is recorded in the Hop tabulation.Here, preferred version is MN the Hop with leaf node, be recorded in the Hop tabulation, wherein, for ensureing that preserve in the Hop tabulation whole are leaf nodes, MN can screen the Hop numbering that reports, and the method for screening leaf node Hop can have a lot, such as: the current Hop that obtains is numbered the k position that moves to left, be Hop＜＜k, more whether have to have same field with it in the numbering of having obtained, if having, the node that the current Hop correspondence of obtaining is described is not a leaf node, this Hop is abandoned, otherwise the node that the current Hop correspondence of obtaining is described is the final stage of certain paths in the node that obtains Hop, it can be preserved.After the Hop of all nodes in network assigning process all finished, according to the Hop tabulation, MN just can obtain whole topology of networks like this.
When network topology structure changes, MN by with current detection to the Hop of leaf node and the Hop tabulation in preserve leaf node Hop and compare, just can detect at an easy rate, and know the topological structure that network is new.
Being example with tree group network shown in Figure 2 still below describes the testing process of network topology.
At the topological tree of k=3 shown in Figure 2, the Hop of the leaf node of preserving among MN tabulation, ginseng is shown in Table 1:
| 64 | 576 | 584 |
Table 1
It is a lot of to carry out the trigger mechanism that network topology detects, such as: before opening a certain business, MN can with once shake hands from node, require to report self Hop numbering from node on certain paths.Report the Hop process can adopt scheme same as described above, be that on the detected path each judges whether to receive effective Hop numbering of sending from the next stage node from node, if, then this Hop numbering is transmitted to even higher level of node, otherwise, the Hop numbering of self is sent to even higher level of node, thereby guarantee that the Hop numbering that host node is received under the normal condition all is a leaf node.After this process is referring to shown in Figure 3:
Step 301～303, after MN receives the Hop numbering that reports, for ensureing that preserve in the Hop tabulation whole are leaf nodes, can screen the Hop numbering that reports, find out leaf node wherein, whether the Hop that judges current leaf node lists in the Hop tabulation, if illustrate that then this path, leaf node place does not change.
Step 304, if the Hop of current certain leaf node that reports is not in Hop tabulates, the Hop of the father node of this leaf node of then deriving numbering, promptly calculate:
Hop
The father=Hop＞＞k (k bit moves to right)
The Hop that obtains is judged in step 305～306
The fatherWhether in current leaf node Hop tabulation, if illustrate that then this node is to have increased a node under the original leaf node newly, the Hop of the original leaf node of deletion and the Hop of this node is saved in the leaf node Hop tabulation from the Hop tabulation; Otherwise, further Hop to obtaining
The fatherThe k position of continuing to move to right, and with the Hop tabulation in Hop relatively.
If after repeatedly moving to right, in the Hop tabulation, can not find the Hop numbering consistent all the time with it, illustrate that then this Hop corresponding node is not the new node that increases under known leaf node, need to judge that whether this Hop corresponding node is the node on the original route this moment, if, original leaf node chain rupture or deletion then are described, its father node has become leaf node; Otherwise, illustrate that this leaf node is a leaf node newly-increased beyond original route.Specifically comprise step 307～310.
Step 307～310, the Hop numbering of the father node of leaf node is promptly carried out above-mentioned right-shift operation Hop to the Hop in the Hop tabulation in the derivation Hop tabulation
The father=Hop＞＞k (k bit moves to right), if find that the leaf Hop (its Hop is greater than new detected Hop) in certain tabulation is identical with the Hop that should newly detect behind one or more k gts, judge that then path, present node place is unavailable below node from this, may be original leaf node chain rupture or deleted this moment, the leaf node Hop deletion that this path in the Hop tabulation is original, and replace with new leaf node Hop; Otherwise, judge that this new Hop is the new node that increases beyond the original route, only need in the Hop tabulation, increase new leaf node this moment and get final product.
In addition, also having a kind of situation is exactly or the deleted or chain rupture of part leaf node in a plurality of leaf nodes that are connected on the same father node, at this moment, MN can't accurately detect by such scheme, this situation MN can detect by another set of method: host node is by regularly detecting, all SN in the requirement network carry out the process that reports of top described up direction again, MN rebuilds the leaf node formation, by the whether identical leaf node that increases and reduce in the network found of the leaf node formation in newer leaf node formation and the original Hop tabulation, and replace the Hop formation of former Hop in tabulating with new Hop formation.
Above-described detection scheme is just given an example, and those skilled in the art should be easy to expect and its similar other scheme; And owing to made up the Hop tabulation, MN has just been known whole topology of networks, therefore, and the existing detection that respectively has detection method also can be used the change in topology that realizes networking of the present invention at present.
The basic enterprising row address that distributes at Hop distributes, and the address of node assigning process is simplified greatly, and concrete distribution method comprises:
When node SN obtained the Hop of oneself, host node had also obtained topology of networks at all.At this moment, host node just can be the address of each child node assignment logic link concurrently, to set up the second layer (L2) link.Address assignment adopts broadcast mode, and MN is to whole Web broadcast address assignment message, and message content comprises the node address that distributed and the Hop of this node, and node address and node Hop bind together; SN after receiving address assignment message, Hop in Hop of this node and the address assignment message relatively, if Hop is identical, then this Hop corresponding address is set to the logical address of this node, otherwise, abandon.
When reasons such as inserting or deleted the SN node owing to the node front caused that node location changes, the Hop that SN will detect self changed, and the logical address that put self this moment is initial invalid value, waits for that MN redistributes; When the topology location that detects SN as MN changes, rebulid connection for the SN assign logical addresses and for SN again.
The above only is preferred embodiment of the present invention, and is in order to restriction the present invention, within the spirit and principles in the present invention not all, any modification of being done, is equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (16)
1, the acquisition methods of topological structure in a kind of tree group network communication system is characterized in that, comprising:
A) according to each from Hop of node even higher level of node numbering and and even higher level of node between the cascade port numbers, by the unified coding rule that pre-establishes each Hop from node is set and numbers;
B) each judges whether to receive effective Hop numbering of sending from the next stage node from node, if, then this Hop numbering is transmitted to even higher level of node, otherwise, self Hop numbering is sent to even higher level of node;
C) be forwarded to host node from the Hop of node numbering after, host node according to receive from node Hop numbering, by the pairing nodes at different levels on from node to path between the host node of reverse each Hop numbering that obtains reporting of increasing by degrees of described unified coding rule.
2, method according to claim 1 is characterized in that, step a) comprises:
Host node in the tree group network issues the Hop numbering to the next stage of self from node;
In the tree group network each from node after receiving the Hop numbering that even higher level of node issues, the Hop numbering that this Hop is numbered self is set, and unified coding rule by pre-establishing, by self Hop numbering and and the next stage node between subordinate's cascade port numbers calculate the Hop numbering of this each node of node next stage, be issued to corresponding subordinate's cascade port respectively.
3, method according to claim 1 is characterized in that, step a) comprises: each node in the tree group network to the next stage node issue self Hop numbering and and the next stage node between the cascade port numbers; The next stage node calculates the Hop numbering according to Hop numbering and the cascade port numbers received by the unified coding rule that pre-establishes, and the Hop that obtains numbering is set to the Hop numbering of self.
4, according to any described method of claim 1 to 3, it is characterized in that described coding rule is: the Hop numbering * 2 of the Hop numbering=even higher level of node of next stage node
kCascade port numbering between+upper level and this next stage node, wherein, k is an integer, and 2
kHigher limit more than or equal to the port numbering of cascade described in the system;
Described host node by the reverse method of increasing by degrees of described fixed number rule is: the move to right result of gained behind the k position of current Hop numbering is defined as the Hop numbering of the even higher level of node of current Hop numbering corresponding node.
5, method according to claim 4 is characterized in that, described 2
kLucky higher limit more than or equal to the port numbering of cascade described in the system.
6, method according to claim 1 is characterized in that, further comprises after the described step c): host node is preserved the Hop numbering from node of final stage on every paths;
When carrying out path detection, each on the detected path judges whether to receive effective Hop numbering of sending from the next stage node from node, if, then this Hop numbering is transmitted to even higher level of node, otherwise, self Hop numbering is sent to even higher level of node;
Host node obtains on the path current final stage and judges from the Hop numbering of node whether the Hop numbering of current final stage node is saved from the Hop numbering that obtains, if judge that then path, current final stage node place does not change; Otherwise, superior node Hop numbering by the current final stage node of the reverse derivation of described unified coding rule, judge whether to be saved, if, judge that then current final stage node is a downstream site newly-increased on the final stage nodal basis of original path, replace original Hop numbering of being preserved on the respective path with this Hop numbering; Otherwise, by the reverse superior node Hop numbering of deriving the Hop numbering corresponding node of preservation of described unified coding rule, judge whether gained superior node Hop numbering is consistent with current final stage node Hop numbering, if, judge that then path, present node place is unavailable below node from this, replace original Hop numbering of being preserved on the respective path with present node Hop numbering, otherwise, judge that then present node is a final stage node newly-increased beyond the original route, and preserve the Hop numbering of present node.
7, method according to claim 1 is characterized in that, further comprises after the described step c): host node is preserved the Hop numbering from node of final stage on every paths;
When carrying out path detection, each in the tree group network judges whether to receive effective Hop numbering of sending from the next stage node from node, if, then this Hop numbering is transmitted to even higher level of node, otherwise, self Hop numbering is sent to even higher level of node;
Host node obtains on the path final stage and upgrades original Hop numbering of preserving from the Hop numbering of node with the new Hop numbering that obtains from the Hop numbering that obtains.
8, according to claim 1,6,7 any described methods, it is characterized in that, 0xFF further is set represents invalid Hop numbering;
Describedly judge whether to receive that the method for the effective Hop numbering that the next stage node is sent comprises: if receive that Hop numbering and this numbering that the next stage node is sent are not 0xFF, judge that then the Hop that receives is numbered effectively, otherwise it is invalid to judge that the Hop that receives is numbered.
9, method according to claim 1 is characterized in that, described Hop numbering is carried in the physical frame of communication.
10, the distribution method of node address in a kind of tree group network communication system is characterized in that, comprising:
A) according to each from Hop of node even higher level of node numbering and and even higher level of node between the cascade port numbers, by the unified coding rule that pre-establishes each Hop from node is set and numbers;
B) host node obtains the Hop numbering from node of address to be allocated, binds together from address of node and the Hop numbering of being somebody's turn to do from node distributing to this, sends by the form of broadcasting;
C) receive the address of described broadcasting from node after, whether the Hop numbering of judging address binding and the Hop of self number consistent, if be self address with this address setting then.
11, method according to claim 10 is characterized in that, step a) comprises:
Host node in the tree group network is that the next stage of self distributes the Hop numbering from node;
In the tree group network each is from the unified coding rule of node by pre-establishing, by self Hop numbering and and the next stage node between the cascade port numbers calculate the Hop numbering of this each node of node next stage, the Hop numbering that obtains is distributed to the next stage node of cascade port correspondence respectively.
12, method according to claim 10 is characterized in that, step a) comprises: each node in the tree group network to the next stage node issue self Hop numbering and and the next stage node between the cascade port numbers; The next stage node calculates the Hop numbering according to Hop numbering and the cascade port numbers received by the unified coding rule that pre-establishes, and the Hop that obtains numbering is set to the Hop numbering of self.
13, method according to claim 10 is characterized in that, the described host node of step b) obtains address to be allocated and comprises from the process that node Hop numbers:
Each judges whether to receive effective Hop numbering of sending from the next stage node from node, if, then this Hop numbering is transmitted to even higher level of node, otherwise, self Hop numbering is sent to even higher level of node;
After being forwarded to host node from the Hop of node numbering, host node is preserved the Hop numbering of receiving, therefrom finds out the Hop numbering from node of address to be allocated; If the Hop from node of address to be allocated numbers not the Hop numbering that reports, then obtain the Hop numbering from node of address to be allocated by reverse the increasing by degrees of described unified coding rule.
14, according to any described method of claim 10 to 13, it is characterized in that described coding rule is: the Hop numbering * 2 of the Hop numbering=even higher level of node of next stage node
kCascade port numbering between+upper level and this next stage node, wherein, k is an integer, and 2
kHigher limit more than or equal to the port numbering of cascade described in the system.
15, method according to claim 10 is characterized in that, further comprises: if the numbering of the Hop from node detection to self changes, the address of then putting self is initial invalid value.
16, method according to claim 10 is characterized in that, further comprises: changing if host node detects from the topology location of node, is to distribute the address from node again.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100642413A CN100387018C (en) | 2005-04-12 | 2005-04-12 | Method for obtaining tree group network topological structure and address distributing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100642413A CN100387018C (en) | 2005-04-12 | 2005-04-12 | Method for obtaining tree group network topological structure and address distributing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1848791A true CN1848791A (en) | 2006-10-18 |
| CN100387018C CN100387018C (en) | 2008-05-07 |
Family
ID=37078162
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005100642413A Expired - Fee Related CN100387018C (en) | 2005-04-12 | 2005-04-12 | Method for obtaining tree group network topological structure and address distributing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100387018C (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102034166A (en) * | 2010-12-27 | 2011-04-27 | 用友软件股份有限公司 | Method and device for acquiring material changing range |
| CN102185749A (en) * | 2011-06-07 | 2011-09-14 | 北京交通大学 | Method for avoiding routing loop by adopting tree topology relationship |
| CN101730088B (en) * | 2008-10-15 | 2012-08-08 | 京信通信系统（中国）有限公司 | Method for automatically acquiring radio remote unit connection relation |
| CN101656766B (en) * | 2009-09-29 | 2012-10-10 | 中兴通讯股份有限公司 | Method and system for allotting logical address to subordinate equipment |
| WO2012159299A1 (en) * | 2011-06-27 | 2012-11-29 | 华为技术有限公司 | Method, system and radio frequency controller for controlling radio frequency bypass switch |
| CN104539485A (en) * | 2015-01-04 | 2015-04-22 | 成都盟升科技有限公司 | Automatic topology identification method of point-to-point bidirectional link |
| CN106102017A (en) * | 2016-05-31 | 2016-11-09 | 厦门纵行信息科技有限公司 | The network-building method of a kind of tree-shaped multihop network and Wireless Telecom Equipment |
| CN106506723A (en) * | 2016-11-22 | 2017-03-15 | 防灾科技学院 | A kind of node preparation method and device for tree network |
| CN107071076A (en) * | 2016-12-23 | 2017-08-18 | 京信通信技术(广州)有限公司 | Device address collocation method in communication system, device and system |
| CN110247997A (en) * | 2019-06-26 | 2019-09-17 | 三维通信股份有限公司 | The method, apparatus and storage medium of IP address distribution and Topology Management in DAS system |
| CN113014691A (en) * | 2021-03-16 | 2021-06-22 | 中国科学技术大学 | Method and device for distributing node addresses |
| CN113347646A (en) * | 2021-07-08 | 2021-09-03 | 博为科技有限公司 | Mesh networking management method and related equipment |
| CN114257594A (en) * | 2021-12-21 | 2022-03-29 | 四川灵通电讯有限公司 | Method for distributing network resources to user network side in distributed system |
| CN114710532A (en) * | 2022-04-02 | 2022-07-05 | 中国科学院水生生物研究所 | Museum safety electricity utilization alarm suppression method and device |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| FI103544B (en) * | 1996-03-25 | 1999-07-15 | Nokia Telecommunications Oy | Procedure for determining addresses in a data network node |
| US5940396A (en) * | 1996-08-21 | 1999-08-17 | 3Com Ltd. | Method of routing in an asynchronous transfer mode network |
| GB2367917A (en) * | 2000-10-12 | 2002-04-17 | Qas Systems Ltd | Retrieving data representing a postal address from a database of postal addresses using a trie structure |
| JP3842250B2 (en) * | 2003-07-08 | 2006-11-08 | インターナショナル・ビジネス・マシーンズ・コーポレーション | Route control apparatus, route control method and program thereof |
| CN1277386C (en) * | 2003-12-09 | 2006-09-27 | 上海交通大学 | Implement method for automatic topology discovery of resilient packet multi-ring interconnection network |
-
2005
- 2005-04-12 CN CNB2005100642413A patent/CN100387018C/en not_active Expired - Fee Related
Cited By (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101730088B (en) * | 2008-10-15 | 2012-08-08 | 京信通信系统（中国）有限公司 | Method for automatically acquiring radio remote unit connection relation |
| CN101656766B (en) * | 2009-09-29 | 2012-10-10 | 中兴通讯股份有限公司 | Method and system for allotting logical address to subordinate equipment |
| CN102034166A (en) * | 2010-12-27 | 2011-04-27 | 用友软件股份有限公司 | Method and device for acquiring material changing range |
| CN102185749A (en) * | 2011-06-07 | 2011-09-14 | 北京交通大学 | Method for avoiding routing loop by adopting tree topology relationship |
| WO2012159299A1 (en) * | 2011-06-27 | 2012-11-29 | 华为技术有限公司 | Method, system and radio frequency controller for controlling radio frequency bypass switch |
| CN102971973A (en) * | 2011-06-27 | 2013-03-13 | 华为技术有限公司 | Method, system and radio frequency controller for controlling radio frequency bypass switch |
| CN102971973B (en) * | 2011-06-27 | 2015-09-09 | 华为技术有限公司 | Radio frequency bypass-switching contr method, system and rf control unit |
| CN104539485A (en) * | 2015-01-04 | 2015-04-22 | 成都盟升科技有限公司 | Automatic topology identification method of point-to-point bidirectional link |
| CN106102017A (en) * | 2016-05-31 | 2016-11-09 | 厦门纵行信息科技有限公司 | The network-building method of a kind of tree-shaped multihop network and Wireless Telecom Equipment |
| CN106506723B (en) * | 2016-11-22 | 2021-11-19 | 防灾科技学院 | Node compiling method and device for tree network |
| CN106506723A (en) * | 2016-11-22 | 2017-03-15 | 防灾科技学院 | A kind of node preparation method and device for tree network |
| CN107071076A (en) * | 2016-12-23 | 2017-08-18 | 京信通信技术(广州)有限公司 | Device address collocation method in communication system, device and system |
| CN107071076B (en) * | 2016-12-23 | 2020-07-03 | 京信通信系统（中国）有限公司 | Equipment address configuration method, device and system in communication system |
| CN110247997A (en) * | 2019-06-26 | 2019-09-17 | 三维通信股份有限公司 | The method, apparatus and storage medium of IP address distribution and Topology Management in DAS system |
| CN113014691A (en) * | 2021-03-16 | 2021-06-22 | 中国科学技术大学 | Method and device for distributing node addresses |
| CN113014691B (en) * | 2021-03-16 | 2022-05-13 | 中国科学技术大学 | Method and device for distributing node addresses |
| CN113347646A (en) * | 2021-07-08 | 2021-09-03 | 博为科技有限公司 | Mesh networking management method and related equipment |
| CN113347646B (en) * | 2021-07-08 | 2023-03-24 | 博为科技有限公司 | Mesh networking management method and related equipment |
| CN114257594A (en) * | 2021-12-21 | 2022-03-29 | 四川灵通电讯有限公司 | Method for distributing network resources to user network side in distributed system |
| CN114257594B (en) * | 2021-12-21 | 2023-12-01 | 四川灵通电讯有限公司 | Method for distributing network resource to user network side in distributed system |
| CN114710532A (en) * | 2022-04-02 | 2022-07-05 | 中国科学院水生生物研究所 | Museum safety electricity utilization alarm suppression method and device |
| CN114710532B (en) * | 2022-04-02 | 2023-10-03 | 中国科学院水生生物研究所 | Method and device for suppressing security electricity utilization alarm of museum |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100387018C (en) | 2008-05-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1848791A (en) | Method for obtaining tree group network topological structure and address distributing method | |
| CN1237755C (en) | Subgroup multicasting in communications network | |
| CN1166118C (en) | A method and apparatus for routing messages in a network of nodes | |
| CN1943190A (en) | Flooding suppression method | |
| CN1314240C (en) | Wireless sensor network system and method supporting task reconfiguration | |
| CN1437355A (en) | Management method of multicast users in mobile network | |
| CN1574777A (en) | Apparatus and method for detecting duplicate IP addresses in mobile ad hoc network environment | |
| CN102546728A (en) | Peer-to-peer network resource downloading method | |
| CN101064631A (en) | Method and system for scanning topological structure | |
| CN1770705A (en) | Network management apparatus and method | |
| CN1859304A (en) | Method for realizing neighbour discovery | |
| CN1848807A (en) | Group broadcasting business realizing method | |
| CN103457852A (en) | Invulnerability mapping method of multicast virtual network | |
| CN1777123A (en) | SNMP-based IPv6 sensor network node management method | |
| CN1852261A (en) | Method for maintenance of neighbor entry | |
| CN107277886A (en) | A kind of internet of things equipment ad hoc network method based on WIFI | |
| CN101047660A (en) | Method for transmitting data | |
| CN1722664A (en) | Method for realizing high-usability of network security equipment under cluster mode | |
| CN1152508C (en) | Method for retransmission of information and apparatus thereof | |
| CN1723731A (en) | Radio access network control method and radio access network | |
| CN1969512A (en) | Communication network, communication apparatus, communication control method and communication control program | |
| CN1941927A (en) | Data distribution to nodes of a telecommunication network | |
| CN1770713A (en) | Addressing system for cascade networking and its method | |
| CN106793117B (en) | elastic virtual subnet mapping method in wireless mesh network | |
| CN1946051A (en) | Method for selecting repeat path in repeat control separating system |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080507 Termination date: 20170412 |