CN100426774C - Ring-closure determining method and device for resilient packet ring - Google Patents
Ring-closure determining method and device for resilient packet ring Download PDFInfo
- Publication number
- CN100426774C CN100426774C CNB2006100568087A CN200610056808A CN100426774C CN 100426774 C CN100426774 C CN 100426774C CN B2006100568087 A CNB2006100568087 A CN B2006100568087A CN 200610056808 A CN200610056808 A CN 200610056808A CN 100426774 C CN100426774 C CN 100426774C
- Authority
- CN
- China
- Prior art keywords
- ring
- message
- node
- closed loop
- search
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Landscapes
- Small-Scale Networks (AREA)
Abstract
The invention provides a closed loop determining method, for determining whether a loop in a reverse double-loop topology is a closed loop, where the topology comprises opposite first and second loops, and plural nodes connected with the first and second loops, the distance between adjacent nodes is 1 hop; the method comprises the steps of: a. one node in sequence receives messages from the other nodes, where the message includes loop direction and address to other nodes and information about hop number distant from a node; b. searching whether there are first and second messages in the received messages, where information of the first message indicates the first message comes from the first hop of the first loop and that of the second message indicates the second message comes from the second loop and they both indicate the same node address; and c. if the first and second messages are searched, determining the topology composes a closed loop.
Description
Technical field
The present invention relates to the communications field, more specifically, the present invention relates to a kind ofly be used for apace determining whether the ring of Resilient Packet Ring is closed loop, and the method and apparatus of when being defined as closed loop, determining the node number of Resilient Packet Ring apace.
Background technology
Along with the rapid expansion of data service, concerning most of telecom operators, the data-handling capacity that the metropolitan area transmits net becomes the focus that everybody pays close attention to.And no matter be IP over ATM (Asynchronous Transfer Mode, asynchronous transfer mode), IP over SDH (Synchronous Digital Hierarchy, SDH (Synchronous Digital Hierarchy)), still metropolitan area Ethernet, weak point is separately all arranged.Adopt the weak point of the ethernet ip data service of transfer mechanism as possible to be to lack flexibility, to lack QoS (Quality of Service, Service Quality Management) assurance and good Bandwidth Management; The technology very ripe while weak point of firmly controlling the SDH technology in telecom operation field again is that bandwidth availability ratio is not high, can not adapt to paroxysmal data service well.Therefore, a kind of for optimizing new MAC (the Media Access Control of IP data packet transmission, the medium access control) layer protocol, promptly, RPR (Resilient Packet Transport) is brought into schedule, this technology has shown its special advantages with the advance of its technology, the validity of investment, the superiority of performance, the diversity of supporting business.
Resilient packet ring technology is a kind of two layers of looped network technology, it provides a good networking plan for broadband IP metropolitan area network operator, it adopts two fine oppositely topological structures of Optical Fiber Transmission ring, can transmit data or control grouping simultaneously with positive counter-clockwise direction respectively on two optical fiber.On an optical fiber, both can send data during the Resilient Packet Ring operation, can transmit simultaneously in the same way control signal and not rely on anti-phase optical fiber, therefore inside and outside two optical fiber of Resilient Packet Ring can transmit data or control signal simultaneously, and utilization ratio increases.Fairness in the Resilient Packet Ring and daynamic bandwidth managment characteristic can guarantee that the node (station) in the Resilient Packet Ring shares the bandwidth resources of whole looped network liberally.By the fair management of automatic topological discover, looped network bandwidth, the synergy of reliable protection switching technique, Resilient Packet Ring can intelligently be adjusted the net for catching fish or birds running status automatically, guarantees the normal transmission of Packet data service among the RPR.IEEE 802.17 working groups are carrying out the standardization effort of Resilient Packet Ring at present.
Below describe Resilient Packet Ring in detail referring to figs. 1 through Fig. 4.
Fig. 1 shows a kind of topological structure of typical Resilient Packet Ring.
With reference to Fig. 1, RPR is reciprocal dicyclo topological structure, and the external a pair of optical fiber of each rpr interface on the equipment forms dicyclo, and every section light path on the ring is operated on the same speed.Different is, the dicyclo of RPR can both transmit data, two rings be hereinafter referred to as 0 ring (Ringlet0, clockwise) and 1 ring (Ringlet 1, and is counterclockwise).
The data transmission direction of RPR 0 ring is a clockwise direction, and the data transmission direction of 1 ring is counterclockwise.Each RPR node is corresponding with the RPR physical interface of equipment, needs the MAC Address of one 48 of configurations, and network layer distributes an IP address as sign simultaneously.
Node number in the ring promptly should encircle the number of going up node.
The type of ring can be divided into open loop and closed loop on topology, if ring has disconnected then is called open loop, if the closed closed loop that then is called.
When ring disconnected, the node at breakpoint place had produced limit (edge), shows that promptly this ring does not reconstruct closed loop.
Node serial number is since 0, and node 0 is this node, or is called source node, start node etc.Node can be various calculation elements.
Being referred to as 1 from a node to its next node on ring jumps.For example node 0 is 1 jumping on 0 ring to node 1, is 5 jumpings on 1 ring.
Fig. 2 shows the schematic diagram that RPR realizes that unicast data transmits.
With reference to Fig. 2, it is as follows that RPR realizes that unicast data transmits: at the source node place, ring operation in the employing makes in Data-carrying to 0 ring or 1 ring; Destination node is carried out ring and data rejecting operation under the data; And intermediate node is only carried out data and is crossed ring operation.
The data processing of RPR comprises following operation::
Last ring (insert): node device is inserted into the message that forwards from other interfaces the data flow of RPR;
Following ring (copy): node device receives data from the data flow of RPR, give the father of node and handle accordingly;
Cross ring (transit): will continue to be forwarded to next node by way of the data flow of this node;
Reject (strip): the data of this node of approach are no longer down transmitted.
Fig. 3 shows the processing when link breaks down among the RPR.
RPR can realize that a major reason of carrier level reliability is exactly that its fault self-recovery ability is very strong, can realize that the error protection in the 50ms time is switched.
With reference to Fig. 3, when two internodal links broke down, the intra-node at faulty link two ends linked together 0 ring and 1 ring (handoff procedure is less than 50ms), forms a new looped network again, can not influence the transmission of data.
Fig. 4 shows the data frame format of RPR.
RPR relies on target MAC (Media Access Control) address to E-Packet, and promptly searches to transmit by target MAC (Media Access Control) address in rpr interface to obtain outgoing interface, and forwarding-table item is (similar with switch) of setting up by the method for study MAC Address.
The method of the type of node number in the detection Resilient Packet Ring of correlation technique and ring is described according to Fig. 5 below.
Generation topological database when Fig. 5 shows Resilient Packet Ring closed loop in the method for type of node number in the detection Resilient Packet Ring of correlation technique and ring.
Resilient Packet Ring about the ring type have following topological property: if the ring is closed loop, then 0 the ring with 1 link count identical, left-right symmetric; If ring is open loop, then 0 ring is counted not necessarily identically with 1 link, does not have the repetition website.Correlation technique, is set up topological database and is judged the type of encircling in the Resilient Packet Ring by nodes all on the traversal ring according to above topological property.Specifically, after the RPR protocol convergence, each node can be learnt the site information of all other nodes on the ring at 0 ring and two hoops of 1 ring, and generates local topological database.For closed loop, exist ring to go up other all nodes respectively for 0 ring and 1 ring in the topological database, each website all is legal and reachable state; Website outside these legal nodes all is illegal and inaccessible state.
Correlation technique is just according to above characteristic, judges node number in the Resilient Packet Ring by the data item of analyzing all nodes in the topological database, and and then judges the type of ring.Particularly, the method of correlation technique is sequentially to receive TP message from the distant place node from detection node, utilizes the data of extracting from these TP messages, is that Resilient Packet Ring is set up topological database as shown in Figure 5, this database as can see from Figure 5, when topological convergence, during closed loop, supposing has n node on the ring, then for 0 ring and 1 ring, 1～n node all is legal and can reaches, and for n+1～255, then all is illegal and unreachable.The method of correlation technique is analyzed the data item of all nodes in the topological database according to above-mentioned characteristic then, judges the node number in the Resilient Packet Ring thus, and and then judges the type of ring.
Yet, in above-mentioned correlation technique, when topology changes, when perhaps first generation is topological, no matter encircle open loop or closed loop, all need sequentially to travel through node, when finding the end of ring, be not easy to judge whether to arrive the limit, do not determine as yet because ring is gone up the node number; Only depend on this moment and receive that ring goes up TP (topological sum protection) message that all nodes are sent, could judge and encircle upward node number, and then could judge to encircle and whether restrain, this has influenced constringency performance.
In other words, in correlation technique, can't accurately judge the limit of ring during topological convergence, and need depend on and receive all TP messages and depend on message acceptance order can judge just whether ring stops, thereby judge the type of Resilient Packet Ring.
Therefore, need a kind of method and apparatus, can determine apace whether the ring in the Resilient Packet Ring is closed loop, and the node number of when being defined as closed loop, determining Resilient Packet Ring apace.
Summary of the invention
The present invention aims to provide one or more problems that a kind of limitation and defective that has solved basically owing to prior art cause, be used for determining apace whether the ring of Resilient Packet Ring is closed loop, and the method and apparatus of when being defined as closed loop, determining the node number of Resilient Packet Ring apace.
To achieve these goals, according to a first aspect of the invention, a kind of closed loop determining method is provided, be used for determining whether the Resilient Packet Ring of reverse dicyclo topological structure is closed loop, wherein, oppositely the dicyclo topological structure comprises first ring and second ring and a plurality of node that direction is opposite, and a plurality of nodes are connected on first and second rings simultaneously, and the distance between the adjacent node is 1 jumping; This closed loop determining method may further comprise the steps: step a, node sequence ground in a plurality of nodes receives the message from other node, message comprise the hoop of indicating other node, MAC Address and and node between the information of jumping figure of distance; Step b, whether search exists first message and second message in the message that receives, the information of first message is indicated first message to come from the 1st of first ring and is jumped, and the information of second message indicates second message to come from second ring, and the information of first message and second message is all indicated the MAC Address of same node; And step c, if in step b, search first and second messages, determine that then reverse dicyclo topological structure constitutes closed loop.
Closed loop determining method can also may further comprise the steps: steps d, if search first and second messages in step b, the indicated jumping figure of information that the node number of then determining reverse dicyclo topological structure equals second message adds 1.
Step a can may further comprise the steps: step a1 receives to a node sequence message from other node; Step a2 reads the MAC Address in the received message; And step a3, the MAC Address that is read is saved in the topological database.
Step b can may further comprise the steps: step b1, and search first message from received message is if search then execution in step b2; And step b2, search second message from received message.
Step b can may further comprise the steps: step b3, and search first message from topological database is if search then execution in step b4; Step b4, search second message if search then execution in step c, if do not search, then proceeds to step b5 from topological database; Step b5, a node continues sequentially to receive the message that comes from each node; And step b6, from next received message, search for second message then, if search then execution in step c.
Message can comprise whether instructs node has the information on limit, and wherein to indicate reverse dicyclo topological structure be open loop on the limit.
This closed loop determining method can also may further comprise the steps: between step a and step b, judge whether instructs node has the limit for information in the received message, if be otherwise continue execution in step c, if for being then determine that reverse dicyclo topological structure is open loop, and the closed loop determining method end.
Closed loop determining method can also may further comprise the steps: between step b5 and step b6, judge whether instructs node has the limit for information in the received message, if be otherwise continue execution in step b6, if for being then determine that reverse dicyclo topological structure is open loop, and the closed loop determining method end.
Closed loop determining method can also may further comprise the steps: between step a and step b, judge whether received message legal, if for being then continue execution in step c, if for otherwise get back to step a.
Closed loop determining method can also may further comprise the steps: between step b5 and step b6, judge whether received message legal, if for being then continue execution in step b6, if for otherwise get back to step b5.
Oppositely the dicyclo topological structure can be a Resilient Packet Ring of observing RPR protocol.
Message can be the TP message of observing RPR protocol.
First ring can be clockwise 0 ring of Resilient Packet Ring, and second ring can be anticlockwise 1 ring of Resilient Packet Ring.
First ring can be anticlockwise 1 ring of Resilient Packet Ring, and second ring can be clockwise 0 ring of Resilient Packet Ring.
According to a further aspect in the invention, provide a kind of closed loop to determine device, be used for determining whether the Resilient Packet Ring of reverse dicyclo topological structure is closed loop, wherein, oppositely the dicyclo topological structure comprises first ring and second ring and a plurality of node that direction is opposite, a plurality of nodes are connected on two rings simultaneously, and the distance between the adjacent node is 1 jumping; This closed loop determines that device comprises: receiver module, it is connected to search module, be used for making a node sequence ground of a plurality of nodes to receive message from other node, message comprise the hoop of indicating other node, MAC Address and and node between the information of jumping figure of distance; Search module, it is connected to the closed loop determination module, be used for whether having first message and second message in the message search that receives, the information of first message is indicated first message to come from the 1st of first ring and is jumped, and the information of second message indicates second message to come from second ring, and the information of first message and second message is all indicated the MAC Address of same node; And the closed loop determination module, if be used for searching first and second messages, determine that then reverse dicyclo topological structure constitutes closed loop at search module.
Closed loop determines that device can also comprise: node is counted determination module, it is connected to search module, if be used for searching first and second messages at search module, the indicated jumping figure of information that the node number of then determining reverse dicyclo topological structure equals second message adds 1.
Receiver module can comprise: first receiver module, and it is connected to read module, is used to make the message of a node sequence ground reception from other node; Read module, it is connected to topological database, is used for reading the information of received message; And topological database, be used to store the information that is read.
Search module can comprise: first search module, and it is connected to second search module, is used for from received message search first message, if search then carry out second search module; And second search module, be used for from received message search second message.
Search module can comprise: the 3rd search module, and it is connected to the 4th search module, is used for from topological database search first message, if search then carry out the 4th search module; The 4th search module, it is connected to second receiver module, is used for from topological database search second message.If search then carry out the closed loop determination module,, then proceed to second receiver module if do not search; Second receiver module, it is connected to the 5th search module, is used to make a node to continue sequentially to receive the message that comes from each node; And the 5th search module, be used for then from next received message search second message, if search then carry out the closed loop determination module.
Message can comprise whether instructs node has the information on limit, and wherein to indicate reverse dicyclo topological structure be open loop on the limit.
Closed loop determines that device can also comprise: first judge module, it is connected between receiver module and the search module, judge whether instructs node has the limit for information in the received message, if be otherwise continuation execution closed loop determination module, if for being then determine that reverse dicyclo topological structure is open loop, and closed loop determines that device finishes.
Closed loop determines that device can also comprise: second judge module, it is connected between second receiver module and the 5th search module, be used for judging whether instructs node has the limit for the information of received message, if be otherwise continuation execution the 5th search module, if for being then determine that reverse dicyclo topological structure is open loop, and closed loop determines that device finishes.
Closed loop determines that device can also comprise: the 3rd judge module, it is connected between receiver module and the search module, is used to judge whether received message legal, if for being then continue to carry out the closed loop determination module, if for otherwise get back to receiver module.
Closed loop determines that device can also comprise: the 4th judge module, it is connected between second receiver module and the 5th search module, be used to judge whether received message legal, if for being then continue to carry out the 5th search module, if for otherwise get back to second receiver module.
Oppositely the dicyclo topological structure can be a Resilient Packet Ring of observing RPR protocol.
Message can be the TP message of observing RPR protocol.
First ring can be clockwise 0 ring of Resilient Packet Ring, and second ring can be anticlockwise 1 ring of Resilient Packet Ring.
First ring can be anticlockwise 1 ring of Resilient Packet Ring, and second ring can be clockwise 0 ring of Resilient Packet Ring.
By technique scheme, the present invention has realized following technique effect:
The invention solves the problem that when topological convergence, can't accurately judge the limit of ring, can not rely on and receive all TP messages, also do not rely on message acceptance order, just can judge accurately that rapidly ring stops, the rate of convergence that this can accelerate to encircle.
Other features and advantages of the present invention will be set forth in the following description, and, partly from specification, become apparent, perhaps understand by implementing the present invention.Purpose of the present invention and other advantages can realize and obtain by specifically noted structure in the specification of being write, claims and accompanying drawing.
Description of drawings
Accompanying drawing described herein is used to provide further understanding of the present invention, constitutes the application's a part, and illustrative examples of the present invention and explanation thereof are used to explain the present invention, do not constitute improper qualification of the present invention.In the accompanying drawings:
Fig. 1 shows a kind of topological structure of typical Resilient Packet Ring;
Fig. 2 shows the schematic diagram that RPR realizes that unicast data transmits;
Fig. 3 shows the processing when link breaks down among the RPR;
Fig. 4 shows the data frame format of RPR;
Generation topological database when Fig. 5 shows Resilient Packet Ring closed loop in the method for type of node number in the detection Resilient Packet Ring of correlation technique and ring;
Fig. 6 shows according to of the present invention to be used for apace determining whether the ring of Resilient Packet Ring is closed loop, and the principle of method and apparatus of determining the node number of Resilient Packet Ring when being defined as closed loop apace;
Fig. 7 shows according to of the present invention to be used for apace determining whether the ring of Resilient Packet Ring is closed loop, and the flow chart of principle of method of determining the node number of Resilient Packet Ring when being defined as closed loop apace;
Fig. 8 shows to be used for apace determining whether the ring of Resilient Packet Ring is closed loop, and the flow chart of method of determining the node number of Resilient Packet Ring when being defined as closed loop apace according to an exemplary embodiments of the present invention;
Fig. 9 shows the topological database that the method according to this invention generates during for closed loop when Resilient Packet Ring;
Figure 10 shows according to of the present invention to be used for apace determining whether the ring of Resilient Packet Ring is closed loop, and the block diagram of principle of device of determining the node number of Resilient Packet Ring when being defined as closed loop apace; And
Figure 11 shows to be used for apace determining whether the ring of Resilient Packet Ring is closed loop, and the block diagram of device of determining the node number of Resilient Packet Ring when being defined as closed loop apace according to an exemplary embodiments of the present invention.
Embodiment
Describe the present invention in detail referring now to accompanying drawing.
The principle of the method according to this invention and device is described below in conjunction with Fig. 1 and Fig. 6.
Fig. 1 shows a kind of topological structure of typical Resilient Packet Ring; And Fig. 6 shows according to of the present invention to be used for apace determining whether the ring of Resilient Packet Ring is closed loop, and the principle of method and apparatus of determining the node number of Resilient Packet Ring when being defined as closed loop apace.
Topological structure to RPR shown in Figure 1 is analyzed, suppose from node 0 and receive TP message from node 2, then can find the distant place node of this TP message indication from 2 hop distances, 2 node number is 3 and from node 0 to node, just in time equal 2+1, can release node number=jumping figure+1 at an easy rate.
When the ring of Resilient Packet Ring was closed loop, if determine that then a TP message is the final jump that comes from a ring, and it was that n jumps, and then can release the total node number of Resilient Packet Ring and equal n+1.For example, in Fig. 1, suppose that receiving one from node 0 is from final jump from 5 nodes of jumping, and can determine that then it is that 5+1 equals 6 that this link is counted.
When the ring of Resilient Packet Ring is closed loop, from Fig. 1, can find in addition, will point to node 1 from the MAC Address that node 0 receives, and also will point to node 1 from the MAC Address that node 0 receives from the 15 TP messages of jumping that encircle from the 01 TP message of jumping that encircles.
From above-mentioned situation, can derive a phenomenon at an easy rate: the message that comes from the distant place node that receives from a node, if there are two messages, one comes from the 1st of first ring and jumps, and another n that comes from second ring jumps, and these two messages all point to same node, can determine that then these nodes have constituted closed loop, and the node number of these nodes equal n+ 1.
Utilize above-mentioned discovery, can construct method of the present invention, as long as be used for finding two messages that satisfy above-mentioned condition, can judge apace and be similar to the such topological structure of Resilient Packet Ring and whether constituted closed loop, and judge the node number on the ring.
Particularly, as shown in Figure 6, construct such method, from the TP message that receives (S10), find and satisfy such condition, i.e. the MAC Address of the TP that jumps from the n of another ring of MAC Address=of the TP that jumps from first of a ring, two TP messages (S20), the type that just can show the ring of this Resilient Packet Ring is a closed loop, and then can be in the hope of the node number=n+1 (S30) of this Resilient Packet Ring.
From above principle, specifically construct the method according to this invention and device, be used for determining apace whether the ring of Resilient Packet Ring is closed loop, and the node number of when being defined as closed loop, determining Resilient Packet Ring apace.
The principle of the method according to this invention is described below with reference to Fig. 7.
Fig. 7 shows according to of the present invention to be used for apace determining whether the ring of Resilient Packet Ring is closed loop, and the flow chart of principle of method of determining the node number of Resilient Packet Ring when being defined as closed loop apace.
This method begins,
In step S102, begin to receive TP message from node 0 from the distant place node, proceed to step S104 then;
In step S104, judge in the TP message receive whether run into the message that instructs node has the limit, if for being then proceed to step S112, if be otherwise proceed to step S106;
In step S106, in the TP message that receives, find 1st TP that jump of indication from a ring, proceed to step S108 then;
In step S108, in the TP message that receives, find a TP from another ring, the MAC Address of this TP equals the MAC Address from first TP that jumps of a ring, and promptly these two TP messages point to same node, proceed to step S110 then;
In step S110, the type of determining the ring of this Resilient Packet Ring is a closed loop, and the node number of this Resilient Packet Ring is above-mentionedly to add 1 from the indicated jumping figure of the TP of another ring, finishes this method then; And
In step S112, the type of determining the ring of this Resilient Packet Ring is open loop rather than closed loop, finishes this method then.
Fig. 8 shows to be used for apace determining whether the ring of Resilient Packet Ring is closed loop, and the flow chart of method of determining the node number of Resilient Packet Ring when being defined as closed loop apace according to an exemplary embodiments of the present invention; And Fig. 9 shows the topological database that the method according to this invention generates during for closed loop when Resilient Packet Ring.
This method begins,
In step S202, begin to receive TP message from node 0 from the distant place node, proceed to step S204 then;
In step S204, judge whether the TP message receive is legal, if for being then proceed to step S206;
In step S206, judge in the TP message receive whether run into the message that instructs node has the limit, if for being then proceed to step S226, if be otherwise proceed to step S208;
In step S208, read the MAC Address of the TP message that receives, and MAC Address is saved in the topological database, proceed to step S210 then;
In step S210, in the TP message that receives, find 1st TP that jump of indication from a ring, proceed to step S212 then;
In step S212, from topological database, search and whether have the TP of an indication from another ring, its MAC Address equals the MAC Address of the above-mentioned TP that jumps from first of a ring, be that these two TP messages point to same node, if for otherwise proceed to step S214, if for being then proceed to step S222.
In step S214, continue sequentially to receive TP message from the distant place node from node 0, proceed to step S216 then;
In step S216, judge whether the TP message receive is legal, if for being then proceed to step S218;
In step S218, judge in the TP message receive whether run into the message that instructs node has the limit, if for otherwise proceed to step S220, if for being then proceed to step S226;
In step S220, in the TP message that receives, find the TP of an indication from another ring, its MAC Address equals the MAC Address of the above-mentioned TP that jumps from first of a ring, and promptly these two TP messages point to same node, proceed to step S222 then;
In step S222, read indicated jumping figure among the above-mentioned TP from another ring, proceed to step S224 then;
In step S224, the type of determining the ring of this Resilient Packet Ring is a closed loop, and the node number of this Resilient Packet Ring is above-mentionedly to add 1 from the indicated jumping figure of the TP of another ring, finishes this method then, finishes this method then; And
In step S226, the type of determining the ring of this Resilient Packet Ring is open loop rather than closed loop, finishes this method then.
In other words, above-mentioned process is concrete to realize like this in Resilient Packet Ring: when topology changes, or first when generating topology, receive the TP message that certain node is sent, at first judge message validity, extract the information among the TP then, upgrade the topology information of the node of corresponding jumping figure; Judge whether indicate among the TP at a distance that node has the limit then, if the west to or east orientation the limit is arranged, illustrate that ring should be open loop, then carry out the processing of TP parse state machine, then protect upgrading according to open loop; If indication is boundless among the TP, explanation may be a closed loop, then judge that according to the hoop of this TP (still receiving) the node whether MAC of the source node of this TP jumped with another hoop 1 is identical from 1 ring from 0 ring, if the node that another hoop 1 is jumped is legal and MAC is identical, then as can be known this TP from the ring final jump, next jumpings of then upgrading the final jump of this hoop is the MAC of local node, be provided with legal with can reach, it is false that the limit state is set, and it is idle that protected mode is set; If this TP jumps from first of ring; then search all legal websites in another ring traversal; see and whether have the node of the identical MAC of source node of TP therewith; if exist; think that then another hoop final jump can determine that next jumping of then upgrading another hoop final jump is the MAC of local node, be provided with legal and can reach; it is false that the limit state is set, and it is idle that protected mode is set.Like this, do not rely on and receive all TP, do not rely on TP acceptance order yet, the accurately termination of marker loop rapidly; When intermediate node was reached the standard grade, the number of ring is actual to change, and repeats this flow process, upgraded next jumping of the final jump of current ring again.
Promptly, when the needs traversal ring, when judging whether that ring has been restrained, this moment, the node number still unknownly (can not be judged node number the ring from final jump, because encircle on the possible intermediate stations, cause the node number to change), if the traversal node run into a node be legal reach and the MAC of node identical with this locality, think that then this ring traversal finishes, and be closed loop; Stop otherwise meet first limit, then think open loop.
According to method shown in Figure 8, when topological convergence, during closed loop, supposing has n node on the ring, and the topological database that then obtains encircles for 0 ring and 1 as shown in Figure 9, and 1～n+1 node all is legal and can reaches, and for n+2～255, all is illegal and unreachable.
To describe according to device of the present invention according to Figure 10 and Figure 11 below.
Figure 10 shows according to of the present invention to be used for apace determining whether the ring of Resilient Packet Ring is closed loop, and the block diagram of principle of device 100 of determining the node number of Resilient Packet Ring when being defined as closed loop apace.
This device 100 comprises:
Figure 11 shows to be used for apace determining whether the ring of Resilient Packet Ring is closed loop, and the block diagram of device 200 of determining the node number of Resilient Packet Ring when being defined as closed loop apace according to an exemplary embodiments of the present invention.
This device 200 comprises:
The 3rd judge module 212, it is connected to second receiver module 214 and read module 222, be used for searching whether there be the TP of an indication from another ring from topological database 208, its MAC Address equals the MAC Address of the above-mentioned TP that jumps from first of a ring, be that these two TP messages point to same node, if for otherwise carry out second receiver module 214, if for being then carry out read module 222.
The 4th judge module 216, it is connected to the 5th judge module 218, is used to judge whether the TP message that receives is legal, if for being then carry out the 5th judge module 218;
The 5th judge module 218, it is connected to second search module 220 and second output module 226, be used for judging whether the TP message that receives runs into the message that instructs node has the limit, if for otherwise carry out second search module 220, if for being then carry out second output module 226;
Read module 222, it is connected to first output module 224, is used for reading the above-mentioned indicated jumping figure of the TP from another ring;
It should be apparent that the topological structure that can use method and apparatus of the present invention can be a Resilient Packet Ring, also can be any topological structure that satisfies reverse dicyclo topological structure.
It should be apparent that the message that can use method and apparatus of the present invention can be the TP message that satisfies RPR protocol, also can anyly comprise the message of hoop information, side information, hop-information and node M AC address information.
By technique scheme, can see that the present invention has following advantage:
The invention solves the problem that when topological convergence, can't accurately judge the limit of ring, do not rely on and receive all TP messages, do not rely on message acceptance in proper order yet, as long as just can satisfy such condition but find, the i.e. MAC Address of the TP that jumps from the n of another ring of MAC Address=of the TP that jumps from first of a ring, two TP messages, the type that just can show the ring of this Resilient Packet Ring is a closed loop, and then can be in the hope of the node number=n+1 of this Resilient Packet Ring, judge quickly and accurately that promptly ring stops the rate of convergence that this can accelerate to encircle.
The above is the preferred embodiments of the present invention only, is not limited to the present invention, and for a person skilled in the art, the present invention can have various changes and variation.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (18)
1. closed loop determining method, be used for determining whether the Resilient Packet Ring of reverse dicyclo topological structure is closed loop, wherein, described reverse dicyclo topological structure comprises first ring and second ring and a plurality of node that direction is opposite, described a plurality of node is connected on described first and second rings simultaneously, and the distance between the adjacent described node is 1 jumping; Described closed loop determining method is characterised in that and may further comprise the steps:
Step a, node sequence ground in described a plurality of nodes receives the message from other node, described message comprise the hoop of indicating described other node, MAC Address and and a described node between the information of jumping figure of distance;
Step b, whether search exists first message and second message in the message that receives, the information of described first message is indicated described first message to come from the 1st of described first ring and is jumped, and the information of described second message indicates described second message to come from described second ring, and the information of described first message and second message is all indicated the MAC Address of same node; And
Step c if search described first and second messages in described step b, determines that then described reverse dicyclo topological structure constitutes closed loop.
2. closed loop determining method according to claim 1 is characterized in that, described closed loop determining method is further comprising the steps of:
Steps d, if search described first and second messages in described step b, the indicated jumping figure of information that the node number of then determining described reverse dicyclo topological structure equals described second message adds 1.
3. closed loop determining method according to claim 1 is characterized in that, described step a may further comprise the steps:
Step a1, described node sequence ground receives the message from other node;
Step a2 reads the MAC Address in the received message; And
Step a3 is saved in the MAC Address that is read in the topological database.
4. closed loop determining method according to claim 1 is characterized in that, described step b may further comprise the steps:
Step b1, described first message of search from received message is if search then execution in step b2; And
Described step b2, described second message of search from received message.
5. closed loop determining method according to claim 3 is characterized in that, described step b may further comprise the steps:
Step b3, described first message of search from described topological database is if search then execution in step b4;
Described step b4, described second message of search if search then carry out described step c, if do not search, then proceeds to step b5 from described topological database;
Described step b5, a described node continues sequentially to receive the message that comes from each described node; And
Step b6, described second message of search from next received message then is if search then carry out described step c.
6. closed loop determining method according to claim 5 is characterized in that, described message comprises whether the described node of indication has the information on limit, and it is open loop that described reverse dicyclo topological structure is indicated on wherein said limit.
7. closed loop determining method according to claim 6 is characterized in that, and is further comprising the steps of:
Between described step a and described step b, judge whether the information in the received message indicates described node that the limit is arranged, if be otherwise continue carry out described step c, if for being then determine that described reverse dicyclo topological structure is open loop, and the end of described closed loop determining method.
8. closed loop determining method according to claim 7 is characterized in that, and is further comprising the steps of:
Between described step b5 and described step b6, judge whether the information in the received message indicates described node that the limit is arranged, if be otherwise continue carry out described step b6, if for being then determine that described reverse dicyclo topological structure is open loop, and the end of described closed loop determining method.
9. closed loop determining method according to claim 5 is characterized in that, and is further comprising the steps of:
Between described step a and described step b, judge whether received message legal, if for being then continue to carry out described step c, if for otherwise get back to described step a.
10. closed loop determining method according to claim 9 is characterized in that, and is further comprising the steps of:
Between described step b5 and described step b6, judge whether received message legal, if for being then continue to carry out described step b6, if for otherwise get back to described step b5.
11., it is characterized in that described message comprises whether the described node of indication has the information on limit, and it is open loop that described reverse dicyclo topological structure is indicated on wherein said limit according to claim 3 or 4 described closed loop determining method.
12., it is characterized in that described message is the TP message of observing described RPR protocol according to each described closed loop determining method in the claim 1 to 10.
13., it is characterized in that described first ring is clockwise 0 ring of described Resilient Packet Ring according to each described closed loop determining method in the claim 1 to 10, described second ring is anticlockwise 1 ring of described Resilient Packet Ring.
14., it is characterized in that described first ring is anticlockwise 1 ring of described Resilient Packet Ring according to each described closed loop determining method in the claim 1 to 10, described second ring is clockwise 0 ring of described Resilient Packet Ring.
15. closed loop determining method according to claim 11 is characterized in that, described message is the TP message of observing described RPR protocol.
16. closed loop determining method according to claim 11 is characterized in that, described first ring is clockwise 0 ring of described Resilient Packet Ring, and described second ring is anticlockwise 1 ring of described Resilient Packet Ring.
17. closed loop determining method according to claim 11 is characterized in that, described first ring is anticlockwise 1 ring of described Resilient Packet Ring, and described second ring is clockwise 0 ring of described Resilient Packet Ring.
18. a closed loop is determined device, be used for determining whether the Resilient Packet Ring of reverse dicyclo topological structure is closed loop, wherein, described reverse dicyclo topological structure comprises first ring and second ring and a plurality of node that direction is opposite, described a plurality of node is connected on described two rings simultaneously, and the distance between the adjacent described node is 1 jumping; Described closed loop is determined that device is characterised in that and is comprised:
Receiver module, it is connected to search module, be used for making a node sequence ground of described a plurality of nodes to receive message from other node, described message comprise the hoop of indicating described other node, MAC Address and and a described node between the information of jumping figure of distance;
Described search module, it is connected to the closed loop determination module, be used for whether having first message and second message in the message search that receives, the information of described first message is indicated described first message to come from the 1st of described first ring and is jumped, and the information of described second message indicates described second message to come from described second ring, and the information of described first message and second message is all indicated the MAC Address of same node; And
Described closed loop determination module if be used for searching described first and second messages at described search module, determines that then described reverse dicyclo topological structure constitutes closed loop.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100568087A CN100426774C (en) | 2006-03-03 | 2006-03-03 | Ring-closure determining method and device for resilient packet ring |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100568087A CN100426774C (en) | 2006-03-03 | 2006-03-03 | Ring-closure determining method and device for resilient packet ring |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1937561A CN1937561A (en) | 2007-03-28 |
| CN100426774C true CN100426774C (en) | 2008-10-15 |
Family
ID=37954838
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100568087A Expired - Fee Related CN100426774C (en) | 2006-03-03 | 2006-03-03 | Ring-closure determining method and device for resilient packet ring |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100426774C (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104320302A (en) * | 2014-10-30 | 2015-01-28 | 杭州华三通信技术有限公司 | Detecting method and device for RPR topology inconformity |
| CN107995309A (en) * | 2017-12-18 | 2018-05-04 | 苏州蜗牛数字科技股份有限公司 | A kind of coordination approach and system of distributed data node |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040103179A1 (en) * | 2002-11-26 | 2004-05-27 | Alcatel Canada Inc. | Topology management of dual ring network |
| CN1691629A (en) * | 2004-04-30 | 2005-11-02 | 华为技术有限公司 | Method for implementing layer-2 equipment interconnection in resilient packet ring (RPR) based network |
| CN1725724A (en) * | 2004-07-22 | 2006-01-25 | 中兴通讯股份有限公司 | Automatic discovering method of resilient packet ring (RPR) equipment |
-
2006
- 2006-03-03 CN CNB2006100568087A patent/CN100426774C/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040103179A1 (en) * | 2002-11-26 | 2004-05-27 | Alcatel Canada Inc. | Topology management of dual ring network |
| CN1691629A (en) * | 2004-04-30 | 2005-11-02 | 华为技术有限公司 | Method for implementing layer-2 equipment interconnection in resilient packet ring (RPR) based network |
| CN1725724A (en) * | 2004-07-22 | 2006-01-25 | 中兴通讯股份有限公司 | Automatic discovering method of resilient packet ring (RPR) equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1937561A (en) | 2007-03-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101132320B (en) | Method for detecting interface trouble and network node equipment | |
| US7619987B2 (en) | Node device | |
| CN100391191C (en) | Routing switch for dynamically reroutng traffic due to detection of faulty link | |
| CN100417080C (en) | Method for detecting network chain fault and positioning said fault | |
| US7898942B2 (en) | Ring network system, failure recovery method, failure detection method, node and program for node | |
| US7724644B2 (en) | Node redundancy method, interface card, interface device, node device, and packet ring network system | |
| CN102164051B (en) | Service-oriented fault detection and positioning method | |
| CN102035694A (en) | Link detection device and method | |
| CN101272310B (en) | Ethernet looped network automatic protection rotation method and device | |
| CN100563145C (en) | Bundle interface among the RPR and its implementation and device | |
| CN100375435C (en) | Alarm correlation analysis of light synchronous transmitting net | |
| CN101321095A (en) | Communication system implementing link measurement and its link measuring method | |
| CN101729350B (en) | Realizing method of PTN forward compatible MSTP ring network service channel protection | |
| CN107547365A (en) | A kind of message transmissions routing resource and device | |
| CN102611602B (en) | Looped network system and method for networking looped networks | |
| CN116319549B (en) | Distributed flow scheduling method and device | |
| CN101527645A (en) | Method, system and relevant device for collecting network topology information | |
| CN101834757B (en) | Methods for automatically detecting topology of optical transmission monitoring networks and implementation device | |
| CN100426774C (en) | Ring-closure determining method and device for resilient packet ring | |
| CN101043433B (en) | Method for aging MAC address learning list of bridge mode resilient packet ring | |
| CN112911420A (en) | Rerouting method based on Flexe network, electronic device and readable storage medium | |
| CN101453412A (en) | Method and apparatus for automatic topology discovery and resource management in PBB network | |
| CN109787838B (en) | Method for avoiding fault relay node in multi-hop network | |
| CN100375461C (en) | Method for carrying out VPR protection inversion in network | |
| CN100461737C (en) | Elastic packet link point internal connection fault processing method and apparatus |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20081015 Termination date: 20120303 |