CN101119186B - A Method of Improving the Convergence Performance of Resilient Packet Ring - Google Patents
A Method of Improving the Convergence Performance of Resilient Packet Ring Download PDFInfo
- Publication number
- CN101119186B CN101119186B CN200610104185A CN200610104185A CN101119186B CN 101119186 B CN101119186 B CN 101119186B CN 200610104185 A CN200610104185 A CN 200610104185A CN 200610104185 A CN200610104185 A CN 200610104185A CN 101119186 B CN101119186 B CN 101119186B
- Authority
- CN
- China
- Prior art keywords
- node
- message
- destination node
- ttl
- rpr
- 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
本发明公开了一种提高弹性分组环收敛性能的方法，涉及通信技术领域，解决现有技术中因为发送和接收多余报文而增加RPR的收敛时间的缺陷。本发明首先源节点在有边侧发送生存时间和生存时间初始值都为1的拓扑和保护报文，然后目的节点接收所述报文，最后目的节点进行保护升级。本发明能够减少RPR上需要发送和接收的TP报文，从而减少RPR的收敛时间；并且，本发明能够对边后节点的保护升级状态进行预测、快速保护升级，从而提高RPR的收敛性能。
The invention discloses a method for improving the convergence performance of an elastic packet ring, relates to the technical field of communication, and solves the defect in the prior art that the convergence time of RPR is increased due to sending and receiving redundant messages. In the present invention, the source node firstly sends the topology and protection message whose survival time and initial value of the survival time are both 1 on the edge side, then the destination node receives the message, and finally the destination node performs protection upgrade. The invention can reduce the TP message that needs to be sent and received on the RPR, thereby reducing the convergence time of the RPR; moreover, the invention can predict the protection upgrade state of the edge node and quickly protect the upgrade, thereby improving the convergence performance of the RPR.
Description
Technical field
The present invention relates to communication technical field, especially relate to a kind of method that improves convergence performance of elastic packet ring.
Background technology
RPR (Resilient Packet Ring, Resilient Packet Ring) is a kind of fiber optic ring network based on enhanced scalability and elasticity technology, can transmit packet-based service traffics effectively.This technology is suitable for data, voice and Video Applications.RPR utilizes fair control algolithm, makes each node on the looped network can automatically finish the bandwidth coordination; Each node all has a loop network topological structure, data can be sent to the optical fiber subring, and send to destination node.For preventing that optical fiber or node from causing link down when breaking down, this technology utilization protection algorithm is eliminated corresponding faulty section.
Two subrings of RPR can be saved fiber resource as service aisle.In addition, RPR has kept when ring network fault occurring the characteristic as backup path, and has the effective mechanism that sends the multicast grouping.RPR is reverse dicyclo topological structure; be a kind of new MAC (Medium AccessControl; the medium access control) layer technology; this technology is with SDH (Synchronous DigitalHierarchy; high bandwidth distribution, flexibility and the expandability of carrier class characteristic SDH (Synchronous Digital Hierarchy)) and the data-oriented business of Ethernet effectively merge; utilize functions such as Topology Discovery, Bandwidth Management, protection algorithm can in existing network, increase new node, or from network, remove node.
After the RPR convergence, each node can obtain the site information of other node on the ring at 0 ring and two hoops of 1 ring, and generates local topological database.If the node on the ring breaks down, as SF (Signal Failure appears, Signal Fail), SD (Signal Degrade, Signal Degrade), FS (ForcedSwitch, Forced Switch) and MS (Manual Switch, switch by hand) etc. fault, the node that then detects fault is at first protected upgrading, generate the limit according to the protection updating result, and the initial value TTL-BASE that sends TTL (Time To Live, life span) and TTL is other node on 255 TP (topological sum protection) the message notifying ring; After other node is received the TP message on the ring; whether according to TTL-BASE is that the legitimacy of 255 pairs of TP messages is checked; and TTL subtracted 1; take out the limit state and the guard mode of preserving in the message; protect upgrading then, judge whether that according to this locality protection updating result needs send other website of TP message notifying and upgrade simultaneously.So, when the node on the ring breaks down,, the state of the domain is consistent by transmission, reception and the processing of TP message, RPR is restrained once more.
The structure of a kind of RPR comprises A, B, four nodes of C, D as shown in Figure 1.Wherein, according to clockwise direction, from node A flow to Node B, again from Node B flow to node C, then from node C flow to node D, the data flow that flows to node A from node D at last constitutes 0 ring; According to counterclockwise, from node A flow to node D, again from node D flow to node C, then from node C flow to Node B, the data flow that flows to node A from Node B at last constitutes 1 ring.
If node A detect this node be connected with Node B side 1 the ring on the FS fault appears; then node A at first protects upgrading; and become the limit at this adnation; sending TTL and TTL-BASE respectively at 0 ring and 1 ring then all is 255 TP message, and the TP message of 0 ring and 1 ring is peeled off from encircling when arrival node A.Other node to the processing procedure of this TP message is on the ring:
In 0 ring direction, Node B receives the TP message and this message is handled, and the TTL of this message is 255, and TTL-BASE is 255; Node C receives the TP message and this message is handled, and the TTL of this message is 254, and TTL-BASE is 255; Node D receives the TP message and this message is handled, and the TTL of this message is 253, and TTL-BASE is 255. in 1 ring direction, and node D receives the TP message and this message is handled, and the TTL of this message is 255, and TTL-BASE is 255; Node C receives the TP message and this message is handled, and the TTL of this message is 254, and TTL-BASE is 255; Node B receives the TP message and this message is handled, and the TTL of this message is 253, and TTL-BASE is 255.
Wherein, each node all will be done respective handling after receiving the TP message, comprising: whether according to TTL-BASE is the legitimacy of 255 these TP messages of judgement, takes out guard mode and limit state, calculating neighbours and the distal embolic protection state of the node of representing in the message; update content is protected upgrading etc.
But for 0 ring direction, after Node B received the TP message that node A goes out from 0 environment-development, the limit state and the guard mode of taking out the node A in this message were calculated neighbours and far-end state, and are protected upgrading, become the limit in Node B with the adnation that is connected of node A then; And after node C and node D receive the TP message that node A goes out from 0 environment-development, judge the back of this message from the limit, do not do further processing.So for the processing of 0 ring TP message, node C and node D need not to receive this TP message, and node C and node D receive and when handling this message, can increase the convergence time of RPR, influence the constringency performance of the domain.
Summary of the invention
The problem to be solved in the present invention provides a kind of method of the RPR of raising constringency performance, to overcome in the prior art because send and receive unnecessary message and increase the defective of the convergence time of RPR.
For achieving the above object, the invention provides a kind of method of the RPR of raising constringency performance, may further comprise the steps:
A, source node are 1 topological sum protection message there being avris to send TTL and TTL-BASE to destination node;
B, described destination node are protected upgrading.
According to one aspect of the present invention, also comprising before the steps A: protect upgrading after source node detects fault, and become the limit at the fault adnation.
According to another aspect of the present invention, steps A also comprises: source node all is 255 TP message at non-avris transmission TTL and TTL-BASE.
According to another aspect of the present invention, before step B, also comprise:
Step S, described destination node judge whether described message is legal; If legal, then change step B; Otherwise finish.
According to another aspect of the present invention, step S further comprises:
S1, destination node judge whether the TTL-BASE of described message is 255; If then change step S2; Otherwise change step S3;
The TTL of S2, described message subtracts 1, and transmits described message, changes step B then;
S3, described destination node judge whether the TTL-BASE of described message is 1; If then change step S4; Otherwise finish;
S4, described message are peeled off from described Resilient Packet Ring, and change step B.
According to another aspect of the present invention, step B further comprises:
B1, destination node are taken out the guard mode and the limit state of the source node of representing in the described message;
B2, described destination node are calculated neighbours and distal embolic protection state;
B3, described destination node update content are protected upgrading.
According to another aspect of the present invention, also comprise after the step B3: destination node becomes the limit being connected adnation with source node.
Compared with prior art, the present invention has the following advantages:
The present invention can reduce needs the TP message that sends and receive on the RPR, thereby reduces the convergence time of RPR.
Further, the protection upgrade status that the present invention can the opposite side posterior nodal point is predicted, protection upgrading fast, thereby improves the constringency performance of RPR.
Description of drawings
Fig. 1 is the structure chart of a kind of RPR;
Fig. 2 is the flow chart of a kind of RPR of raising constringency performance of one embodiment of the invention.
Embodiment
Below in conjunction with drawings and Examples, the specific embodiment of the present invention is described in further detail:
The structure of a kind of RPR comprises A, B, four nodes of C, D as shown in Figure 1.Wherein, according to clockwise direction, from node A flow to Node B, again from Node B flow to node C, then from node C flow to node D, the data flow that flows to node A from node D at last constitutes 0 ring; According to counterclockwise, from node A flow to node D, again from node D flow to node C, then from node C flow to Node B, the data flow that flows to node A from Node B at last constitutes 1 ring.
When one embodiment of the invention adopt the structure of RPR shown in Figure 1; if node A detect this node be connected with Node B side 1 the ring on the FS fault appears; then node A is 1 TP message there being avris to send TTL and TTL-BASE at first; Node B receives described message then, and final node B protects upgrading.In the present embodiment, a kind of flow process that improves the RPR constringency performance as shown in Figure 2.With reference to Fig. 2, the present invention includes following steps:
Step s101, source node protect upgrading after detecting fault, and become the limit at the fault adnation.Promptly when node A detect this node be connected with Node B side 1 the ring on the FS fault appears and after, node A protects upgrading, and becomes the limit at this adnation.
Step s102, source node all is 1 TP message there being avris to send TTL and TTL-BASE.To be node A send TTL and TTL-BASE in 0 environment-development all is 1 TP message.
Step s103, source node are 255 TP message at non-avris transmission TTL and TTL-BASE.To be node A send TTL and TTL-BASE in 1 environment-development all is 255 TP message.
Step s104, destination node receives message.TTL that to be Node B receiving node A send in 0 environment-development and TTL-BASE are 1 TP message; TTL that node D receiving node A send in 1 environment-development and TTL-BASE are 255 TP message.
Step s105, destination node judges whether the TTL-BASE of message is 255; If then change step s106; Otherwise change step s107.Because the TTL-BASE of the message that Node B receives is 1, so change step s107; And the TTL-BASE of the message that node D receives is 255, so change step s106.
Step s106, the TTL of message subtracts 1, and E-Packets, and changes step s109 then.Being node D is kept to 254 with the TTL of the message that receives by 255, and this message is sent to node C, changes step s109 then.
Step s107, destination node judges whether the TTL-BASE of described message is 1; If then change step s108; Otherwise finish.Because the TTL-BASE of the message that Node B receives is 1, so change step s108.
Step s108, message is peeled off from RPR, and changes step s109.Be that Node B is peeled off the message that receives from RPR, and change step s109.
Step s109, destination node is taken out the guard mode and the limit state of the source node of representing in the described message.Be guard mode and the limit state that Node B and node D take out the node A that represents in the message that receives separately respectively.
Step s110, destination node is calculated neighbours and distal embolic protection state. and be that Node B and node D calculate neighbours and distal embolic protection state separately respectively.
Step s111, the destination node update content is protected upgrading.Be Node B and node D update content, protect upgrading; And Node B is becoming the limit with the adnation that is connected of node A.
Adopt when of the present invention, in 0 ring direction, Node B receives the TP message and this message is handled, and the TTL of this message is 1, and TTL-BASE is 1; Node C can not receive the TP message, does not handle; Node D can not receive the TP message, does not handle.In 1 ring direction, node D receives the TP message and this message is handled, and the TTL of this message is 255, and TTL-BASE is 255; Node C receives the TP message and this message is handled, and the TTL of this message is 254, and TTL-BASE is 255; Node B receives the TP message and this message is handled, and the TTL of this message is 253, and TTL-BASE is 255.Because on 0 ring, reduced the process that node C and node D received and handled message, so reduced the convergence time of RPR.
And, be 1 by the TTL-BASE of TP message, the present invention can predict the protection updating result.If promptly the TTL-BASE of the TP message received of destination node is 1, then according to the hoop of this TP message, another hoop that obtains source node generates limit, and measurable destination node protection updating result should be that this hoop generates limit.In the present embodiment, the TTL-BASE of the TP message that Node B is received is 1, because the hoop of this message is 0 ring, node A 1 ring that is connected side with Node B has a limit as can be known, and then Node B protection updating result should be 0 to encircle the generation limit what be connected side with node A.
The above only is a preferred implementation of the present invention; should be pointed out that for those skilled in the art, under the prerequisite that does not break away from the principle of the invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (4)
1. a method that improves convergence performance of elastic packet ring is characterized in that, may further comprise the steps:
A, source node are protected upgrading after detecting fault, and become the limit at the fault adnation;
B, source node are 1 topological sum protection message there being avris to send life span and life span initial value to destination node; Described source node all is 255 topological sum protection message at non-avris transmission life span and life span initial value;
C, destination node are taken out the guard mode and the limit state of the source node of representing in the described message; Described destination node is calculated neighbours and distal embolic protection state; Described destination node update content is protected upgrading.
2. improve the method for convergence performance of elastic packet ring according to claim 1, it is characterized in that, before step C, also comprise:
Step S, described destination node judge whether described message is legal; If legal, then change step C; Otherwise finish.
3. as the method for raising convergence performance of elastic packet ring as described in the claim 2, it is characterized in that step S further comprises:
S1, destination node judge whether the life span initial value of described message is 255; If then change step S2; Otherwise change step S3;
The life span of S2, described message subtracts 1, and transmits described message, changes step C then;
S3, described destination node judge whether the life span initial value of described message is 1; If then change step S4; Otherwise finish;
S4, described message are peeled off from described Resilient Packet Ring, and change step C.
5. improve the method for convergence performance of elastic packet ring according to claim 1, it is characterized in that, also comprise after the step C: destination node becomes the limit being connected adnation with source node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200610104185A CN101119186B (en) | 2006-08-04 | 2006-08-04 | A Method of Improving the Convergence Performance of Resilient Packet Ring |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200610104185A CN101119186B (en) | 2006-08-04 | 2006-08-04 | A Method of Improving the Convergence Performance of Resilient Packet Ring |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101119186A CN101119186A (en) | 2008-02-06 |
| CN101119186B true CN101119186B (en) | 2010-05-12 |
Family
ID=39055142
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200610104185A Expired - Fee Related CN101119186B (en) | 2006-08-04 | 2006-08-04 | A Method of Improving the Convergence Performance of Resilient Packet Ring |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101119186B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1303081A2 (en) * | 2001-10-10 | 2003-04-16 | Alcatel | Method for propagating the fault information in a RPR network and corresponding RPR packet |
| CN1479455A (en) * | 2002-08-29 | 2004-03-03 | 华为技术有限公司 | Fast Switchover Method for Resilient Packet Ring Network |
| EP1434393A2 (en) * | 2002-12-16 | 2004-06-30 | Alcatel Canada Inc. | Topology discovery in a dual ring network |
-
2006
- 2006-08-04 CN CN200610104185A patent/CN101119186B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1303081A2 (en) * | 2001-10-10 | 2003-04-16 | Alcatel | Method for propagating the fault information in a RPR network and corresponding RPR packet |
| CN1479455A (en) * | 2002-08-29 | 2004-03-03 | 华为技术有限公司 | Fast Switchover Method for Resilient Packet Ring Network |
| EP1434393A2 (en) * | 2002-12-16 | 2004-06-30 | Alcatel Canada Inc. | Topology discovery in a dual ring network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101119186A (en) | 2008-02-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6697339B1 (en) | High availability spanning tree with rapid reconfiguration with alternate port selection | |
| EP2352253B1 (en) | Method and apparatus for protecting link aggregation group of ethernet ring | |
| US7944815B2 (en) | System and method for network recovery from multiple link failures | |
| CN101471693B (en) | Method and apparatus for sharing grid protection | |
| CN101160836B (en) | Redundancy protection method for bridge mode resilient packet ring | |
| CN1710887B (en) | Method and apparatus for per-service fault protection and restoration in a packet network | |
| EP2495918B1 (en) | Method, system and node device for establishing label switch path | |
| CN102148677B (en) | Method for updating address resolution protocol table entries and core switch | |
| CN100450036C (en) | A method and device for preventing loops when RRPP and local STP network fails to recover | |
| US7660236B2 (en) | System and method of multi-nodal APS control protocol signaling | |
| CN101656630B (en) | A kind of service protecting method and system | |
| CA2317979A1 (en) | Method and apparatus for fast distributed restoration of a communication network | |
| WO2011032608A1 (en) | Recovery of traffic in a connection-oriented network | |
| CN101272310B (en) | Ethernet looped network automatic protection rotation method and device | |
| CN101015176A (en) | Failure recovery method, network device, and program | |
| CN101702658A (en) | Method and system for implementing ring network protection | |
| CN101789879B (en) | Dynamic maintenance method and device for related link circuits | |
| CN100461739C (en) | RPR bridge redundancy protection method and RPR bridge ring equipment | |
| CN101771610A (en) | Transport multiprotocol label switching network (T-MPLS) system for and link protection method | |
| CN102244600A (en) | Method and device for detecting and processing link failure in RRPP (Rapid Ring Protect Protocol) ring network | |
| CN111817881A (en) | Fault processing method and related device | |
| WO2016062165A1 (en) | Method and apparatus for implementing operations, administration and maintenance function | |
| CN1984045A (en) | Method for protecting elastic group circular service | |
| WO2010121459A1 (en) | Method and system for implementing protection and recovery in automatically switching optical network | |
| CN101340377A (en) | A method, device and system for two-layer network data transmission |
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: 20100512 Termination date: 20120804 |