CN1531278A - Automatic binding method for link corcuit with flow engineering - Google Patents
Automatic binding method for link corcuit with flow engineering Download PDFInfo
- Publication number
- CN1531278A CN1531278A CNA031194176A CN03119417A CN1531278A CN 1531278 A CN1531278 A CN 1531278A CN A031194176 A CNA031194176 A CN A031194176A CN 03119417 A CN03119417 A CN 03119417A CN 1531278 A CN1531278 A CN 1531278A
- Authority
- CN
- China
- Prior art keywords
- link
- verification
- node
- data link
- virtual
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A link automatic bonding method having traffic engineering attribute includes following steps: a) setting a node in the intelligent optical network as local node, setting all the data link which doesn't belong to any TE links as a virtual link, the Link-Id of this virtual link is zero; b) selecting any neighbor node having available control channel, the local node sends information of starting verify to neighbor node; c) the neighbor node judging itself whether or not meeting the condition of verify, if yes, then responding the message of starting verify successfully and executing the step (d), if not, then responding the message of starting verify failure and finishing this verify; d) the local node sends the testing message , if the verify finishes, then ends verify, and separates out the data link which is verified successfully from virtual TE link, bonds more one data links data link into a new TE link according to bonding rules, otherwise the local node repeats step (d).
Description
Technical field
The present invention relates to the ASON technical field, be meant a kind of traffic engineering (te) attribute link method of binding automatically that has especially.
Background technology
TE is a subsidiary attribute of a link, and TE Link is a logical links with TE attribute.In optical-fiber network, have thousands of continuous optical fiber between two nodes.If normally multiplexing, may comprise a plurality of data link again in every optical fiber.If the link information of Routing Protocol diffusion comprises every data link, then the flow of message will be very big.In order to reduce the message flow of Routing Protocol, the a plurality of data link that need to have the TE attribute are bound into an independent specific link bundle, the binding of data link that Here it is, the information mapping that is about to specific resources and comprises their attributes is used for the part of calculating path information in the shortest-path first algorithm (SPF), and this be mapped in the data link two ends must unanimity.After adopting this method, the size of whole chain line state information database can reduce a lot.
In traditional Multi-Protocol Label Switch (MPLS) network, Routing Adjacency is after being activated on the link, and the link attribute of this link and TE Link attribute all will spread out on network.
GMPLS (GMPLS) technology is expansion and the extension of MPLS, more precisely, is the expansion of MPLS-TE.Stipulate that in the GMPLS network data link of crossing over a plurality of nodes in the middle of a label switched path (LSP) can be used as spreads.Simultaneously, in the GMPLS network, also stipulate, control plane and service plane are separated, because not having, the data link in the service plane do not send and receives the message ability, therefore, the TE attribute of data link can't spread by Routing Adjacency in the service plane, has only control plane to unify to spread the information of all data link.In order to reduce the amount of information of diffusion, alleviate the pressure of control plane message flow, then need the data link in the service plane is carried out the TE Link binding.
At present, in ASON, it is to carry out craft and be configured according to the binding principle that a plurality of data link link bundlings are become the process of a TE Link, and it binds principle can be following one of them or combination in any.
1, all assembly links must have identical end node;
2, all assembly Linktypes want consistent;
3, the metric of all assembly links (TE Metric) is identical;
4, all assembly links have identical color;
5, the minimum cross grain of all component link is identical.
Behind link bundling, verify with LMP Link Manager Protocol (LMP) whether the configuration of both link ends is consistent.If configuration is wrong, promptly the result with the LMP checking is inconsistent, and then the user must be configured again.Than higher, and layoutprocedure is more loaded down with trivial details, is unfavorable for the popularization of ASON to user's requirement for the manual configuration TE Link.
Summary of the invention
In view of this, the invention provides the automatically method of binding of a kind of TE of having attribute link, data link in the ASON can be bound automatically have TE attribute link.
Technical scheme of the present invention is achieved in that in order to achieve the above object
A kind of method with the automatic binding of traffic engineering attribute link, this method may further comprise the steps:
A, a node of setting in the ASON are local node, and all data link that do not belong to any traffic engineering (te) link are set to a virtual TE Link on this node, and the link identification that this virtual TE Link is set number is zero;
B, in ASON selected arbitrary neighbor node that available control channel is arranged, this local node sends the beginning verification message to this selected neighbor node;
C, neighbor node require to judge whether himself satisfies the verification condition according to the verification in the beginning verification message, if, execution in step d after local node response beginning verification succeeds response message then, otherwise after local node response beginning verification failure response message, finish this connectivity checking;
D, local node in virtual TE Link not the data link of verification send test post, and judge whether that verification finishes all data link in the virtual TE Link, if, then finish the epicycle verification, and the data link of verification succeeds separated from virtual TE Link, by the binding rule an above data link is bound into a new TE Link, otherwise, repeated execution of steps d.
Preferably, described step b searches the neighbor node that all have available control channel by the mode of poll.
Preferably, the local TE Link identification code in the described beginning verification message of step b is set to zero.
Preferably, the described verification condition of step c comprises transmission mechanism, coding and the transmission speed of test post at least.
Preferably, indicated the verification condition that can't satisfy in the described beginning verification of the step c failed message.
Preferably, described steps d is whether to equal the data link sum that comprised in the virtual TE Link by the number sum of judging the data link that connective successful data link of verification and verification connectedness are failed, and whether verification finishes to determine all data link in the virtual TE Link.
Preferably, described steps d further comprises: judge whether neighbor node receives test post in the given time, if, then the response test success message is given local node, and the corresponding relation, far-end TE Link sign and the remote data link port sign that comprise local data-link interface identification code and neighbor node data link interface identification code in this message, the connectivity checking success of local node record current data link; Otherwise, reply test crash message and give local node, the connectivity checking failure of local node record current data link.
Preferably, this method further comprises: local node is before sending test post, elder generation is according to the attribute information of the neighbor node place equipment that comprises in the described beginning verification of the step c response message, judge whether this equipment can monitor all data link in the virtual TE Link simultaneously, if, then local node in virtual TE Link all not the data link of verification send test post simultaneously; Otherwise, local node in virtual TE Link each bar not the data link of verification send test post one by one.
Preferably, comprise local data-link interface identification code in the described test post.
Preferably, the link-local identification code of new TE Link is identical with the set-up mode of the link id of opposite end described in the steps d.
Preferably, this method further comprises: after finishing the epicycle verification, judge whether also to exist other that neighbor node of available control channel is arranged, and also there is the data link that does not belong to any TE Link, if then the next one there is the neighbor node of available control channel to be chosen to be the neighbours of local node, repeated execution of steps a～steps d, otherwise, finish this checking treatment.
Preferably, this method further comprises: a connectivity checking cycle is set, periodically the node in the ASON is carried out connectivity checking.
Use the present invention, by virtual TE Link being set and supposing that it is the neighbours of data link in the virtual TE Link that the neighbor node of available control channel is arranged, use the LMP agreement connectedness of the data link in the virtual TE Link is carried out verification, data link to the connectivity checking success, demand according to the user is bound into one or more TE Links, thereby improved the intellectuality of ASON, involved loaded down with trivial details work when having avoided the manual configuration TE Link, reduced user's workload, and avoided to a certain extent disposing the problem that causes because of user error.Simultaneously, because binding rule is according to the configuration of user's demand, and can make amendment to binding principle at any time, therefore, improved the flexibility and the practicality of automatic binding.
Embodiment
For making purpose of the present invention, technical scheme and advantage clearer, below with reference to the accompanying drawing embodiment that develops simultaneously, the present invention is described in further details.
The solution of the present invention is: for a node in the optical-fiber network, with virtual TE Link of the temporary transient composition of the data link that does not belong to any TE Link, the chain line (Link_Id) that this virtual TE Link is set is zero; Then this virtual TE Link is carried out connectivity checking, promptly whether the attribute of checking data both link ends is consistent, according to check results and user configured binding rule, will be bound into one or more new TE Links by the data link of verification.
Because the checking procedure of defined is all carried out between a pair of neighbours in the LMP agreement, and the neighbours of a node may more than one.Therefore, the present invention needs to find to have the neighbor node of available control channel by the mode of poll, and supposes that successively it is the pairing neighbours of data link in the virtual TE Link that the neighbor node of available control channel is arranged.Selected neighbours are carried out connectivity checking,, represent that then these data link are connected on this selected neighbor node really for the data link of verification succeeds; For the data link of verification failure, represent that then these data link are not connected on this selected neighbor node, continue to carry out connectivity checking on next neighbor node.
Be example with a node in the optical-fiber network below, and this node is called local node, describe the process that virtual TE Link is carried out verification in detail.
All data link that do not belong to any TE Link on the local node are formed a virtual TE Link, and the Link_Id that this TE Link is set is zero; Selected then arbitrary the neighbor node of available control channel is arranged is the neighbours of local node, and supposes that this neighbor node is exactly the pairing neighbours of data link in the virtual TE Link, and it is carried out connectivity checking, and detailed process is as follows:
1) local node sends beginning verification (BeginVerify) message to the neighbor node of this appointment, comprises the require information relevant with checking procedure in this BeginVerify message, as information such as the transmission mechanism of testing (TEST) message, coding, transmission rates.Simultaneously, the value in link-local sign (local Link_Id) territory is set to zero in this BeginVerify message, and the value in verification link (Verify all Links) territory empties.
2) after neighbor node is received this BeginVerify message, judge whether itself can satisfy the verification requirement, if, then neighbor node is just agreed this verification, and respond one the beginning verification reply (BeginVerifyAck) message, otherwise, neighbor node can not be agreed current verification, and respond beginning verification failure (BeginVerifyNack) message, and after in this BeginVerifyNack message, indicating the requirement that to satisfy, finish this verification.
3) after local node is received the BeginVerifyAck of neighbor node response, according to the information of its response message, obtain the attribute of neighbor node place equipment, this device attribute is meant whether remote equipment can monitor all data link in the virtual TE Link simultaneously.If neighbor node place equipment can once be monitored all data link that virtual TE Link comprises simultaneously, then local node sends TEST message to all data link that virtual TE Link comprises simultaneously, if neighbor node place equipment once can only be monitored a data link in the virtual TE Link, then local node successively all data link in virtual TE Link send TEST message.
4) when certain the bar data link in the virtual TE Link links to each other with this selected neighbor node really, this neighbor node can be received the TEST message that local node sends, and just from TEST message, obtain, and then obtain this ID and this just at the data link of verification corresponding relation at the data link interface ID at neighbor node place in the data link of verification data link interface identification code (ID) at local node.Simultaneously, this neighbor node will be tested successfully (TestStatusSuccess) message to one of local node loopback, announce the connectivity checking success of a data link in the virtual TE Link.Just in TestStatusSuccess message, comprised at the data link of verification corresponding relation, and the far-end TE Link of the data link place TE Link at this neighbor node place sign (remote_Link_Id) and remote data link port identify (remote_interface_Id) at the data link interface ID at the data link interface ID of local node and neighbor node place.
When not having data link to be connected on the neighbor node of this appointment in the virtual TE Link, this neighbor node can't be received the TEST message that local node sends.Wait for the timer expiry of TEST message at neighbor node after, this neighbor node will respond a test crash (TestStatusFailure) message to local node, announce the connectivity checking failure of a data link in the virtual TE Link.
5) when the number sum of the data link of the data link of connectivity checking success and connectivity checking failure equals data link sum that virtual TE Link comprises, represent that this verification finishes.From virtual TE Link separate the data link of verification succeeds according to check results this moment, follows the binding rule more a plurality of data link are bound into one or more TE Link, and this binding rule is that the user disposes according to actual needs.
For the TE Link of new binding, the Link_Id at two ends is also not configuration, so two ends all need to produce automatically Link_Id separately, owing to also must know the corresponding Link_Id in opposite end simultaneously, therefore, for same TE Link, the principle that two ends are provided with Link_Id is necessary consistent.
For instance, TE Link for new binding, its local TE Link sign (local_interface_Id) can equal maximum or minimum local data-link port-mark (local_interface_Id) in all data link that this TE Link comprises, or equals the local_interface_Id sum of all data link that this TE Link comprises.Accordingly, its remote_Link_Id also must equal maximum or minimum remote_interface_Id in all data link that this TE Link comprises, or equals the remote_interface_Id sum of all data link that this TE Link comprises.
6) one is had after the neighbor node verification of available control passage finishes when local node, if the neighbor node that also has other control channel to use, and the data link that does not belong to any actual TE Link in the virtual TE Link in addition, just the next one there is the neighbor node of available control channel to be appointed as the neighbours of this virtual TE Link, repeated execution of steps 1)～6), carry out the next round verification.In virtual TE Link, do not need the data link or the verification of verification to finish till the neighbor node of all hypothesis.
Because the node in the network can not once all be enabled, and network size may increase gradually, and increases new node, therefore, a check-verifying period can be set, regularly virtual TE Link is carried out the binding of connectivity checking and data link.
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 (12)
1, a kind of method with the automatic binding of traffic engineering attribute link is characterized in that this method may further comprise the steps:
A, a node of setting in the ASON are local node, and all data link that do not belong to any traffic engineering (te) link are set to a virtual TE Link on this node, and the link identification that this virtual TE Link is set number is zero;
B, in ASON selected arbitrary neighbor node that available control channel is arranged, this local node sends the beginning verification message to this selected neighbor node;
C, neighbor node require to judge whether himself satisfies the verification condition according to the verification in the beginning verification message, if, execution in step d after local node response beginning verification succeeds response message then, otherwise after local node response beginning verification failure response message, finish this connectivity checking;
D, local node in virtual TE Link not the data link of verification send test post, and judge whether that verification finishes all data link in the virtual TE Link, if, then finish the epicycle verification, and the data link of verification succeeds separated from virtual TE Link, by the binding rule an above data link is bound into a new TE Link, otherwise, repeated execution of steps d.
2, method according to claim 1 is characterized in that, described step b searches the neighbor node that all have available control channel by the mode of poll.
3, method according to claim 1 is characterized in that, the local TE Link identification code in the described beginning verification message of step b is set to zero.
4, method according to claim 1 is characterized in that, the described verification condition of step c comprises transmission mechanism, coding and the transmission speed of test post at least.
5, method according to claim 1 is characterized in that, has indicated the verification condition that can't satisfy in the described beginning verification of the step c failed message.
6, method according to claim 1, it is characterized in that, described steps d is whether to equal the data link sum that comprised in the virtual TE Link by the number sum of judging the data link that connective successful data link of verification and verification connectedness are failed, and whether verification finishes to determine all data link in the virtual TE Link.
7, method according to claim 6, it is characterized in that, described steps d further comprises: judge whether neighbor node receives test post in the given time, if, then the response test success message is given local node, and the corresponding relation, far-end TE Link sign and the remote data link port sign that comprise local data-link interface identification code and neighbor node data link interface identification code in this message, the connectivity checking success of local node record current data link; Otherwise, reply test crash message and give local node, the connectivity checking failure of local node record current data link.
8, method according to claim 1, it is characterized in that this method further comprises: local node is before sending test post, elder generation is according to the attribute information of the neighbor node place equipment that comprises in the described beginning verification of the step c response message, judge whether this equipment can monitor all data link in the virtual TE Link simultaneously, if, then local node in virtual TE Link all not the data link of verification send test post simultaneously; Otherwise, local node in virtual TE Link each bar not the data link of verification send test post one by one.
9, according to claim 1 or 8 described methods, it is characterized in that, comprise local data-link interface identification code in the described test post.
10, method according to claim 1 is characterized in that, the link-local identification code of new TE Link is identical with the set-up mode of the link id of opposite end described in the steps d.
11, method according to claim 1, it is characterized in that, this method further comprises: after finishing the epicycle verification, judge whether also to exist other that neighbor node of available control channel is arranged, and also have the data link that does not belong to any TE Link, if, then the next one there is the neighbor node of available control channel to be chosen to be the neighbours of local node, repeated execution of steps a～steps d, otherwise, this checking treatment finished.
12, method according to claim 1 is characterized in that, this method further comprises: a connectivity checking cycle is set, periodically the node in the ASON is carried out connectivity checking.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031194176A CN100352235C (en) | 2003-03-12 | 2003-03-12 | Automatic binding method for link corcuit with flow engineering |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031194176A CN100352235C (en) | 2003-03-12 | 2003-03-12 | Automatic binding method for link corcuit with flow engineering |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1531278A true CN1531278A (en) | 2004-09-22 |
| CN100352235C CN100352235C (en) | 2007-11-28 |
Family
ID=34285095
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB031194176A Expired - Fee Related CN100352235C (en) | 2003-03-12 | 2003-03-12 | Automatic binding method for link corcuit with flow engineering |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100352235C (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100389578C (en) * | 2006-01-25 | 2008-05-21 | 华为技术有限公司 | Resource distributing method while traditional optical transfer net and intelligent optical network grouping |
| CN102026044A (en) * | 2009-09-14 | 2011-04-20 | 中兴通讯股份有限公司 | Processing method for routing and apparatus thereof |
| CN101427515B (en) * | 2006-12-21 | 2011-05-18 | 中兴通讯股份有限公司 | A method and apparatus for verifying connectivity of a data |
| CN101360348B (en) * | 2008-08-25 | 2012-02-22 | 中兴通讯股份有限公司 | Establishing method for virtual control channel between head and tail node of service |
| CN102857835A (en) * | 2011-06-29 | 2013-01-02 | 中兴通讯股份有限公司 | Flexible grid optical network node and link attribute check method between nodes |
| WO2015054904A1 (en) * | 2013-10-18 | 2015-04-23 | 华为技术有限公司 | Method, controller, forwarding device, and network system for forwarding packets |
| CN113067736A (en) * | 2021-03-31 | 2021-07-02 | 烽火通信科技股份有限公司 | Method and device for controlling plane link display |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2234314C (en) * | 1997-04-09 | 2002-06-04 | Nec Corporation | Fault recovery system and transmission path autonomic switching system |
| JP2001244955A (en) * | 2000-02-29 | 2001-09-07 | Mitsubishi Electric Corp | Method and node device for avoiding erroneous connection on multiplexed ring network |
| US6985443B2 (en) * | 2001-06-12 | 2006-01-10 | Photuris, Inc. | Method and apparatus for alleviating traffic congestion in a computer network |
-
2003
- 2003-03-12 CN CNB031194176A patent/CN100352235C/en not_active Expired - Fee Related
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100389578C (en) * | 2006-01-25 | 2008-05-21 | 华为技术有限公司 | Resource distributing method while traditional optical transfer net and intelligent optical network grouping |
| CN101427515B (en) * | 2006-12-21 | 2011-05-18 | 中兴通讯股份有限公司 | A method and apparatus for verifying connectivity of a data |
| CN101360348B (en) * | 2008-08-25 | 2012-02-22 | 中兴通讯股份有限公司 | Establishing method for virtual control channel between head and tail node of service |
| CN102026044A (en) * | 2009-09-14 | 2011-04-20 | 中兴通讯股份有限公司 | Processing method for routing and apparatus thereof |
| CN102026044B (en) * | 2009-09-14 | 2014-02-05 | 中兴通讯股份有限公司 | Processing method for routing and apparatus thereof |
| CN102857835A (en) * | 2011-06-29 | 2013-01-02 | 中兴通讯股份有限公司 | Flexible grid optical network node and link attribute check method between nodes |
| WO2015054904A1 (en) * | 2013-10-18 | 2015-04-23 | 华为技术有限公司 | Method, controller, forwarding device, and network system for forwarding packets |
| US10021023B2 (en) | 2013-10-18 | 2018-07-10 | Huawei Technologies Co., Ltd. | Packet forwarding method, controller, forwarding device, and network system |
| CN113067736A (en) * | 2021-03-31 | 2021-07-02 | 烽火通信科技股份有限公司 | Method and device for controlling plane link display |
| CN113067736B (en) * | 2021-03-31 | 2022-06-17 | 烽火通信科技股份有限公司 | Method and device for controlling plane link display |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100352235C (en) | 2007-11-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1104791C (en) | Methods for verification of routing table information | |
| US5941992A (en) | Distributed method and system for excluding components from a restoral route in a communications network | |
| CN1659835A (en) | Distinguishing between link and node failure to facilitate fast reroute | |
| CN1551577A (en) | Injecting addresses to enable oam functions | |
| CN100352235C (en) | Automatic binding method for link corcuit with flow engineering | |
| CN101714944A (en) | Method for restoring connections in a network | |
| CN101771604B (en) | Routing detection method, system and intermediate routing device | |
| CN1571417A (en) | Network data re-routing | |
| CN1852141A (en) | Method for realizing upward link back-up | |
| JP3154495B2 (en) | System for testing data communication networks | |
| CN1535516A (en) | Telecommunications network with automatic detection of topology and method for this detection | |
| CN1558621A (en) | Method for recovering route in all-purpose multiple protocol label switched network | |
| CN1829972A (en) | Method and apparatus for providing tandem connection, performance monitoring, and protection architectures over Ethernet protocols | |
| CN112187354A (en) | Stability testing method and system based on multiple ONU (optical network Unit) devices | |
| US20110206058A1 (en) | Automatic Determination of Groupings of Communications Interfaces | |
| US7023793B2 (en) | Resiliency of control channels in a communications network | |
| Chow et al. | Performance analysis of fast distributed link restoration algorithms | |
| CN1105357C (en) | Path managing and testing method for exchange system | |
| CN1674527A (en) | Method for enhancing survivability of automatic exchange optical network | |
| CN110109933A (en) | Information maintenance method, configuration management database system and storage medium | |
| CN102223179B (en) | The collocation method of relay single plate and device | |
| EP2464139A1 (en) | Route determination method and device | |
| CN1705256A (en) | A method for accelerating convergence of link state | |
| CN114040273B (en) | Method and system for automatically adjusting route switching based on fault point | |
| CN115460094B (en) | Determination method and device for physical looping point |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20071128 Termination date: 20150312 |
|
| EXPY | Termination of patent right or utility model |