Nothing Special   »   [go: up one dir, main page]

CN1710993B - Business route optimizing method in intelligent light network - Google Patents

Business route optimizing method in intelligent light network Download PDF

Info

Publication number
CN1710993B
CN1710993B CN2004100491777A CN200410049177A CN1710993B CN 1710993 B CN1710993 B CN 1710993B CN 2004100491777 A CN2004100491777 A CN 2004100491777A CN 200410049177 A CN200410049177 A CN 200410049177A CN 1710993 B CN1710993 B CN 1710993B
Authority
CN
China
Prior art keywords
node
business
label switched
switched path
lsp
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
Application number
CN2004100491777A
Other languages
Chinese (zh)
Other versions
CN1710993A (en
Inventor
周阳
陈勇
蔡军州
关良
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN2004100491777A priority Critical patent/CN1710993B/en
Publication of CN1710993A publication Critical patent/CN1710993A/en
Application granted granted Critical
Publication of CN1710993B publication Critical patent/CN1710993B/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

If there are better paths available for selecting or in time of network maintenance, the disclosed method is capable of switching service to better paths seamlessly. Through optimizing signs as well as duplexing transmission and selected reception, the method builds a new LSP within a trouble free LSP. Thus, service can be switched to new LSP seamlessly.

Description

Service path optimization method in the ASON
Technical field
The present invention relates to the communications field, particularly the service path optimisation technique in the ASON.
Background technology
Along with fast development of information technology, the amount of information sharp increase of data service adopts optical technology to expand the common recognition that core transmission network capacity has become Virtual network operator and equipment manufacturers.And be today of explosive increase in information capacity requirements, ASON may rely on its can carry out dynamic assignment Internet resources and high performance-price ratio characteristics, become an important novel communication transmission technology and be used widely.
In the past, widely apply dense wave division multipurpose (the DenseWave Division Multiplexer of point-to-point all size in backbone transport networks, be called for short " DWDM ") system, this network lacks certain flexibility, and implement the comparison difficulty, cost can't satisfy the requirement that new business is provided fast also than higher.Wherein particularly outstanding is that uncertainty and Unpredictability along with professional volatile growth of internetworking agreement (Internet Protocol is called for short " IP ") and IP operation amount itself make to the dynamic assignment requirement of Internet resources more and more urgent.The novel optical-fiber network that this fast-changing service environment requirement has very strong dynamic property is to adapt to the demand of new business.The demand that tradition mainly leans on very difficult adaptation modern network of human configuration method of network connection and quick new business to provide.
ASON impels the optical-fiber network technology of new generation of arising at the historic moment down in such market environment just.ASON is finished the signal routing function to realize the two-forty and the protocol transparency of network by intelligent switching technology.Wherein, core switching device according to different user's requests and routing algorithm, is dynamically set up path end to end for the user under the control of standard signaling.
In existing technology, the foundation of ASON business is by general multiple protocols label exchange (Generalized Multi-Protocol Label Switching, being called for short " GMPLS ") signaling controls and finishes, the GMPLS signaling is finished the foundation of optical network service by setting up broad sense label switched path (Generalized Label SwitchPath is called for short " GLSP ") business.
GMPLS is to the multiprotocol label switching expansion of (MultiProtocol Label Switching is called for short " MPLS "), and its GLSP business also is the professional expansion of label switched path (LabelSwitch Path is called for short " LSP ") to MPLS.The label switched path of the following MPLS of explanation earlier (Label Switch Path is called for short " LSP ") business:
In the switching technology of MPLS, adopt forwarding equivalence class to come the process IP grouping as label, utilize tag distribution protocol to set up LSP, realize the forwarding of IP operation by the label exchange, thereby simplified process by the forwarded grouping.After the IP grouping enters network, at porch LSR (Label Switch Router, being called for short " LSR ") the IP grouping that will meet certain attribute adds a label, on IP divides into groups next jumping LSR, no longer handle and check the IP packets headers, only the label that is carried by grouping is indicated the outlet port of grouping and the table that is connected of new label.When the grouping of tape label is transferred to network egress LSR, remove label process IP grouping more earlier, the IP grouping is only in the fringe node processing like this, at the intermediate node switch label, thereby alleviated the burden of network and node device greatly, improved the performance of network.
And in GMPLS, label is expanded to the broad sense label, promptly cast aside concrete physical mechanism, in existing optical-fiber network, the fiber port in the optical cable, the optical fiber in the optical cable, the wavelength in the optical fiber, the time slot in the wavelength etc. can be issued and exchange as resource in optical-fiber network as label.Broad sense label among the GMPLS can only be distributed and mapping between with class interface, need set up the corresponding link type according to the type of skill that interface adopts separately, as step number word series (Synchronous Digital Hierarchy, be called for short " SDH ") virtual circuit, optical channel, light path etc., all these links are by titled with a public name: broad sense label switched path (GLSP).Yet,, therefore in the aftermentioned explanation, no longer distinguish GLSP and LSP because technical problem solved by the invention does not have important difference in GLSP and LSP.
In the prior art, for availability and the stability that improves network, protection handoff techniques such as 1+1 protection, protection in 1: 1 have been adopted.This means protected LSP route is carried out the preassignment of precomputation and resource, can guarantee LSP connect to lose efficacy or in have no progeny and regain Internet resources fast.The prerequisite that takes place is switched in these protections: 1) manually initiated by webmaster; 2) lsp failure.
Wherein, 1+1 protection uses the backup LSP of a special use to protect as main LSP; at inlet LSR place; main LSP is in the same place with backup LSP bridge joint; flow on the main LSP copies on the backup LSP; be sent to egress LSR simultaneously, egress LSR is according to the value of faulty indication parameter, the flow on the active and standby LSP of selective reception.The two process sending out and select receipts that Here it is.
And the protection of special-purpose back-up LSP as main LSP the time also used in protection in 1: 1, but active and standby LSP does not transmit identical flow simultaneously, and backup LSP can transmit other flow under main LSP prerequisite working properly, and the protection of flow is switched ruling and carried out at inlet LSR.
In actual applications, there is following problem in such scheme: when LSP does not break down as yet, but along with network topology constantly changes, when existing service path may no longer be optimum; Perhaps because network operation, when needing temporary transient some business of migration to the other path, the operation that prior art also is not optimized LSP.
Cause the main cause of this situation to be, lacked the operating process that fault-free LSP business is optimized in the prior art.
Summary of the invention
In view of this, main purpose of the present invention is to provide the optimization method of the service path in a kind of ASON, makes when having more excellent path to select or during at network operation, business seamlessly can be switched on the more excellent path.
For achieving the above object, the invention provides the service path optimization method in a kind of ASON, comprise following steps:
A initiates the foundation request of new label switched path business at the first node of label switched path business to be optimized, comprise in the described foundation request and optimize sign, and the first and last node of described new label switched path business is identical with the first and last node of described label switched path business to be optimized, wherein, described optimization sign comprises the identifier of described label switched path to be optimized;
B receives that each other node of described foundation request identify the described new label switched path business of setting up according to described optimization, and the foundation request that will have described optimization sign is delivered to next node, wherein, whether each node in this new label switched path had both had identical label switched path identifier according to two strip label switching paths by himself, be again to be sent to different nodes, judge whether this node is node of divergence, if carry out at this node then that business is two to distribute into professional bifurcated;
C deletes described label switched path business to be optimized.
Also comprise following substep among the described step C:
The described first node of C1 is initiated the request of the described label switched path business to be optimized of deletion;
After the intermediate node of the described label switched path business to be optimized of C2 and end-node are received described removal request, delete described label switched path business to be optimized.
Described steps A triggers under predetermined condition automatically by manual activation or by described ASON.
The predetermined condition of described automatic triggering can be that variation has taken place the annexation that has increased newly between node or the node in the described ASON.
Be that described first node receives that the new label switched path business that described end-node is returned set up successful response the opportunity that described step C1 carries out.
By finding that relatively technical scheme difference with the prior art of the present invention is, in the fault-free LSP of one section appointment, by optimizing the dual transmitting and receiving of sign and professional node of divergence, sets up a new LSP, business can be seamlessly switched on the new LSP.
Difference on this technical scheme has brought comparatively significantly beneficial effect, and promptly at first, for trouble-free LSP provides optimizational function, the business that makes can switch to more excellent or have on the path that needs; Secondly, switching of the present invention is a kind of seamless switching, makes service outage duration reduce.
Description of drawings
Fig. 1 is an ASON LSP service optimization method flow chart according to an embodiment of the invention;
Fig. 2 is that former LSP according to an embodiment of the invention moves towards schematic diagram;
Fig. 3 is that new LSP according to an embodiment of the invention sets up schematic diagram;
Fig. 4 is the professional schematic diagram that switches of LSP according to an embodiment of the invention.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, the present invention is described in further detail below in conjunction with accompanying drawing.
In the present invention; in order to reduce time of service interruption as far as possible; can adopt similar 1+1 protected dual transmitting and receiving mechanism to be optimized; promptly after the business of the LSP after the optimization is set up successfully; just switching services is come; LSP business before then deletion is optimized again, thus the whole service optimizing process finished.
Below in conjunction with accompanying drawing 1, the flow process of service optimization is described:
At first, enter step 101, select the one section LSP business that needs optimization, promptly specify the entrance and exit of LSP business.Here, the inlet of this section LSP business is called first node, and outlet is called end-node.Before and after one section LSP service optimization, its first node and end-node can not change.
Then, enter step 102, initiate the service optimization request at the first node of former LSP business, a new LSP business is set up in request, and the entrance and exit of new LSP business is identical with former LSP business.This step is by manual activation, or triggered automatically under predetermined condition by described ASON.
When the topology that the automatic predetermined condition that triggers can be an ASON changes.For example when having increased annexation between node or the original node in the ASON newly variation taken place, the first node of former LSP business can be received the notice of network topology change, this moment, original LSP may not be optimum, therefore can trigger the service optimization process automatically.
The technical staff who is familiar with field of the present invention is appreciated that the predetermined condition of automatic triggering also can be arranged to other condition flexibly according to concrete demand, and does not influence the spirit and scope of the invention.
Enter step 103 then, in the foundation request of new LSP business, put on " optimizing " sign, contain the LSP ID (identifier) of former LSP business in the sign, what deserves to be explained is that this sign need be delivered to end-node from first node always.
Then enter step 104, judge whether first node is professional node of divergence, if then enter step 105, otherwise enter step 106.The process of judging professional node of divergence is as follows: when 2 LSP by this node have identical LSP ID, and from different nodes or when being sent to different nodes, judge that this node is a node of divergence.Need carry out two of business in node of divergence.
In step 105, the LSP ID according in " optimizing " sign can find former LSP, carries out two processes of business then, thereby realizes professional bifurcated, also business is passed to next node simultaneously.Two processes of professional two processes described here and aforementioned 1+1 protected are similar, and the business that is about on the former LSP backups on the new LSP simultaneously.Enter step 106 then.
In step 106, judge whether professional node of divergence of intermediate node, if then enter step 107, otherwise enter step 108.Intermediate node described here is meant other nodes except that first node and end-node among one section LSP.The deterministic process of this step is consistent with the deterministic process of step 104.
In step 107, the LSP ID according in " optimizing " sign can find former LSP, carries out two processes of business then, thereby realizes professional bifurcated, also business is passed to next node simultaneously.The processing procedure of this step is consistent with step 105.Enter step 109 then.
In step 108, intermediate node is not professional node of divergence, it is after the foundation request of receiving new LSP business, identify according to " optimizing ", know that this is a LSP business of optimizing, and then finish relevant business and set up process, promptly be similar to and set up a common LSP and set up process: node is local to distribute time slot, local foundation to intersect, inquire about next jumping, send request etc. downstream.Behind the said process, the professional biography to next node.Enter step 109 then.
In step 109, whether decision node is end-node, if then enter step 110, otherwise returns step 106.Step 106 passes to end-node until business to the circulation of step 109.
In step 110, judge whether professional node of divergence of end-node, if then enter step 111, otherwise enter step 112.The deterministic process of this step also deterministic process with step 104 is consistent.
In step 111, end-node is as professional node of divergence, and it will can find former LSP according to the LSP ID in " optimizing " sign, carry out two processes of business then, thereby realize professional bifurcated.Enter step 113 then.
If enter step 112, illustrate that then end-node is not professional node of divergence, when it received the foundation request of new LSP business, according to " optimizing " sign, it knew that this is a LSP business of optimizing, and sets up process thereby finish relevant business.Process is as identical as described in the step 108.After finishing relevant business and setting up process, enter step 113.
In step 113, new LSP business has been set up success, and first node is initiated the service request of the former LSP of deletion, and delete former LSP business this moment, and business is seamlessly switched on the new LSP, finishes optimizing process.When new LSP business has been set up when successful, first node can receive that the new route that end-node is returned sets up successful response, and just can delete original business initiation this moment.
Fig. 2, Fig. 3 and Fig. 4 have showed the process of LSP service optimization in the ASON:
Wherein the dotted arrow among Fig. 2 has been showed the trend of former LSP, and wherein, node A is first node, and node D is an end-node.Illustrated among Fig. 3 and carried out LSP service optimization process, set up new LSP, it moves towards shown in solid arrow among the figure.Detailed process as described in Figure 1.Among Fig. 4, former LSP business is switched on the new LSP, and delete former LSP, finish optimizing process.
Though by reference some preferred embodiment of the present invention, the present invention is illustrated and describes, but those of ordinary skill in the art should be understood that, can do various changes to it in the form and details, and the spirit and scope of the present invention that do not depart from appended claims and limited.

Claims (5)

1. the service path optimization method in the ASON is characterized in that, comprises following steps:
A initiates the foundation request of new label switched path business at the first node of label switched path business to be optimized, comprise in the described foundation request and optimize sign, and the first and last node of described new label switched path business is identical with the first and last node of described label switched path business to be optimized, wherein, guarantee replacement in the described optimization sign identifier of described label switched path to be optimized;
B receives that each other node of described foundation request identify the described new label switched path business of setting up according to described optimization, and the foundation request that will have described optimization sign is delivered to next node, wherein, whether each node in this new label switched path had both had identical label switched path identifier according to two strip label switching paths by himself, be again to be sent to different nodes, judge whether this node is node of divergence, if carry out at this node then that business is two to distribute into professional bifurcated;
C deletes described label switched path business to be optimized.
2. the service path optimization method in the ASON according to claim 1 is characterized in that, also comprises following substep among the described step C:
The described first node of C1 is initiated the request of the described label switched path business to be optimized of deletion;
After the intermediate node of the described label switched path business to be optimized of C2 and end-node are received described removal request, delete described label switched path business to be optimized.
3. the service path optimization method in the ASON according to claim 1 is characterized in that, described steps A triggers under predetermined condition automatically by manual activation or by described ASON.
4. the service path optimization method in the ASON according to claim 3 is characterized in that, the predetermined condition of described automatic triggering can be that variation has taken place the annexation that has increased newly between node or the node in the described ASON.
5. the service path optimization method in the ASON according to claim 4 is characterized in that, be that described first node receives that the new label switched path business that described end-node is returned set up successful response the opportunity that described step C1 carries out.
CN2004100491777A 2004-06-18 2004-06-18 Business route optimizing method in intelligent light network Expired - Fee Related CN1710993B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2004100491777A CN1710993B (en) 2004-06-18 2004-06-18 Business route optimizing method in intelligent light network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2004100491777A CN1710993B (en) 2004-06-18 2004-06-18 Business route optimizing method in intelligent light network

Publications (2)

Publication Number Publication Date
CN1710993A CN1710993A (en) 2005-12-21
CN1710993B true CN1710993B (en) 2010-09-29

Family

ID=35707148

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2004100491777A Expired - Fee Related CN1710993B (en) 2004-06-18 2004-06-18 Business route optimizing method in intelligent light network

Country Status (1)

Country Link
CN (1) CN1710993B (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100558082C (en) * 2007-03-20 2009-11-04 华为技术有限公司 A kind of communication system, LSR and route switching method
CN101170494B (en) * 2007-11-21 2010-06-02 中兴通讯股份有限公司 Soft rerouting method in automatic switching optical network
CN101997753B (en) * 2009-08-20 2015-06-03 中兴通讯股份有限公司 Method and system for protecting double-transmission mechanism of ring network
CN101771904B (en) * 2009-12-31 2014-02-12 中兴通讯股份有限公司 Method and system for carrying out service maintenance in smart optical network
CN104363171B (en) * 2014-10-22 2017-11-24 上海华为技术有限公司 The transmission control method and processing node of a kind of user's message

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1469260A (en) * 2002-06-12 2004-01-21 �ձ�������ʽ���� Route calculating apparatus wiht switchable route selective standard

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1469260A (en) * 2002-06-12 2004-01-21 �ձ�������ʽ���� Route calculating apparatus wiht switchable route selective standard

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
JP特开2004-172713A 2004.06.17
吴梦晓,郭学理,华宇.GMPLS网络中约束最短路径优先算法研究.武汉大学学报50 1.2004,50(1),全文.
吴梦晓,郭学理,华宇.GMPLS网络中约束最短路径优先算法研究.武汉大学学报50 1.2004,50(1),全文. *
姚磊,陈彦辉,李建东.无线移动自组织互联网的QoS路由技术.中兴通讯技术 1.2004,50(1),全文.
姚磊,陈彦辉,李建东.无线移动自组织互联网的QoS路由技术.中兴通讯技术 1.2004,50(1),全文. *

Also Published As

Publication number Publication date
CN1710993A (en) 2005-12-21

Similar Documents

Publication Publication Date Title
CA2358230C (en) Optimized fault notification in an overlay mesh network via network knowledge correlation
EP2464036B1 (en) Route selection apparatus and route selection method for multi-service recovery
US7974183B2 (en) Method for restoration and normalization in a mesh network
US20030117950A1 (en) Link redial for mesh protection
CN100555922C (en) A kind of method that realizes the grid network business recovery
US7590048B2 (en) Restoration and protection method and an apparatus thereof
CN101447849B (en) Network restoration
EP1735950B1 (en) Line-level path protection in the optical layer
EP2503742B1 (en) Method for implementing shared mesh protection, equipment and optical network system
JP2009201155A (en) Network controller
US20070274224A1 (en) Path setting method, node device, and monitoring/control device
CN1331363C (en) Rerouting method based on network entrance node
JP2007500955A (en) Method for transition between fixed connection and destination selection connection in a transmission network
JP2002247038A (en) Method for forming ring in network, method for restoring fault and method for adding node address at the time of forming ring
EP1890436A1 (en) Method and apparatus for managing and transmitting fine granularity services
US20050141415A1 (en) Extending SONET/SDH automatic protection switching
CN101163030A (en) Method for establishing mapping table of divider
CN1981463B (en) Business connection set-up and business recovering protection method in optical network
CN101646105B (en) Method, system and equipment for service recovery
JP2001352342A (en) Network management method and network node unit, and mesh type network
EP1959609A1 (en) A method for service management in an intelligent optical network
US20040252635A1 (en) Restoration in an automatically switched optical transport network
CN1710993B (en) Business route optimizing method in intelligent light network
CN100502528C (en) Method for realizing association between optical interconnection in automatic exchanging optical network
WO2006079286A1 (en) A service rerouting triggering method

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20100929

Termination date: 20160618