CN1392686A - Recoverable path selectino set-up method of automatic exchanging optical network - Google Patents

Recoverable path selectino set-up method of automatic exchanging optical network Download PDF

Info

Publication number
CN1392686A
CN1392686A CN02123980A CN02123980A CN1392686A CN 1392686 A CN1392686 A CN 1392686A CN 02123980 A CN02123980 A CN 02123980A CN 02123980 A CN02123980 A CN 02123980A CN 1392686 A CN1392686 A CN 1392686A
Authority
CN
China
Prior art keywords
path
link
information
node
service
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
Application number
CN02123980A
Other languages
Chinese (zh)
Other versions
CN1312863C (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.)
Beijing University of Posts and Telecommunications
Original Assignee
Beijing University of Posts and Telecommunications
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 Beijing University of Posts and Telecommunications filed Critical Beijing University of Posts and Telecommunications
Priority to CNB021239800A priority Critical patent/CN1312863C/en
Publication of CN1392686A publication Critical patent/CN1392686A/en
Application granted granted Critical
Publication of CN1312863C publication Critical patent/CN1312863C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Abstract

This invention discloses a method for setting up automatic exchange optical network resumable route selection containing the following steps: A, originating node crossed connection equipments accept a request of setting up resumable route connection; B, selecting a route with the maximum product of applied probability weighting as the service route; C, service route preserving information delivery; D, selecting a route with the smallest sum of link value weighting as the resumed route to balancing the flow and reducing blocking rate of requests; E, renewing service routes and related resumed routes information; and carrying out the resumed route set-up, if line link faults happen to the service routes according to the forward parallel line link set-up protocol to reduce the resumed route time delay.

Description

A kind of recoverable path selectino set-up method of automatic exchanging optical network
Technical field
The present invention relates to optical communication network, but relate in particular to the distributed restoration path selection method for building up of ASON.
Background technology
At present, fast development along with Networks of Fiber Communications, it has become the main carrier of message transmission, simultaneously because its huge transmission capacity, make that also the generation of fault can cause tremendous loss and influence on it, therefore the fault recovery around Networks of Fiber Communications in the industry cycle has a series of relevant draft standards.Be based on the static protection fault recovery mode of network management configuration in the standard recommendation more; when setting up service path, configure a restoration path; after service path breaks down; carry out error protection according to fault message announcement and switch program, with the switching services on the fault service path to restoration path.It is big that said method has a resource occupation, is difficult to adapt to complicated mesh (network structure) network and professional drawbacks such as dynamic property requirement.Meanwhile, current core transport network, to the direction evolution of ASON, being introduced as of ASON ASON (automatically switched optical network) distributed route of control plane and signaling protocol realizes fast, dynamic fault recovery, the existence performance that improves network provides condition, and existing Path selection method for building up does not utilize it.
Many employings of routing resource standard shortest path first of prior art come search node between the physics route, adopt the routing algorithm of basic weight sum minimum, therefore when selecting the path, will on weight and less several paths, concentrate, cause the raising of respective paths connection request blocking probability.
Summary of the invention
The object of the present invention is to provide a kind of based on the distributed control protocol of ASON control plane, take all factors into consideration flow equalization, connection request blocking rate, recover performance index such as resource-sharing rate and restoration path setup delay, realize the service path of dynamic connection request and the selection method for building up of restoration path.
For achieving the above object, the method that the present invention adopts is: a kind of recoverable path selectino set-up method of automatic exchanging optical network is characterized in that: this method comprises the steps:
But A, source node intersection connected device OXC accept restoration path and connect the request of foundation;
B, selection service path;
C, service path obligate information transmit;
D, selection restoration path;
E, renewal service path and corresponding restoration path information;
If F service path generation link failure is carried out restoration path and is set up;
In the topology information of network, comprise following record: the port number n of link i iService path on the link i is counted n s[ i]; Along service path P sAny link occurs fault the time, for the maximum bandwidth T[i that realizes that fault recovery needs on link i]; Expression link i goes up the bandwidth reserved R that reserves the bandwidth summation of using as fault recovery i
In described step B, select a link probability of use weight w sThe long-pending maximum path of [i] is as service path, and link probability of use weight is calculated according to following formula: w s [ i ] = [ n i - n s [ i ] n i ] W [ i ] Wherein, the basic weights W of link [i] is the basic weight of path logic of every link of representative jumping figure;
In described step D, select a link cost weight w rThe path of [i] sum minimum is as restoration path, and the link cost weight is calculated according to following formula:
Wherein, b is the amount of bandwidth of current connection request, and ε represents minimum.
Because n iBe link i port number, n s[ i] be service path number on the link i, they are collected renewal in signaling procedure, and be maintained in the host node of link, so-called host node is a physical node of being responsible for the maintenance link local information in two end points of a link, optional physical identifiers little as host node.w sThe physical significance of [i] can be understood as current link can be by the probability of any Route Selection, if the selecteed probability of this link is big more more at least for the number of active lanes of passing through on a certain link.Follow the long-pending maximum principle of each link probability of use weight of path process, can obtain traffic engineering ability preferably, reduce blocking probability, it is even as far as possible that passage is distributed.
Link cost weight w rThe physical significance of [i] is under the current bandwidth reserved situation of link that when new connection request arrived, needs how many extra bandwidth resources satisfied the recovery bandwidth demand of new connection request, and it has following several situation:
(1) as i ∈ p s, illustrating that restoration path and the service path selected are in same link, this discontented service path and the non-conterminous condition of restoration path that can restoration path be so provide the cost that needs for infinitely great if want to realize restoration path on this link.
(2) work as T[i]+b-R[i]<0 and i do not belong to service path P sSituation under, illustrate that bandwidth reserved can satisfy the fault recovery request of existing service path and current connection request, so do not need extra bandwidth demand, the link cost weight is a minimum.
(3) work as T[i]+b-R[i]>0 and i do not belong to P sSituation under, illustrate that the link bandwidth reserved is difficult to satisfy the requirement of fault recovery, need be from current link available bandwidth A iIn obtain extra additional bandwidth min (b, T[i]+b-R[i]).
When utilizing this cost weight to select restoration path, follow the principle of weight sum minimum, can realize that the efficient restoration path of non-conterminous service path is shared.
Under the distributed control plane environment of ASON ASON, link-state information can be distributed by Routing Protocol, realizes transmitting and upgrading.
Embodiment
The inventive method comprises following key step:
But A, source node intersection connected device OXC accept restoration path and connect the request of foundation;
B, selection service path;
C, service path obligate information transmit;
D, selection restoration path;
E, renewal service path and corresponding restoration path information;
If F service path generation link failure is carried out restoration path and is set up;
In step B, select a link probability of use weight w sThe long-pending maximum path of [i] in step D, is selected a link cost weight w as service path rThe path of [i] sum minimum is as restoration path.
In concrete the enforcement, can safeguard following information at the host node of link: being reflected at link k upward is the needed bandwidth Fail of fault recovery that guarantees other link i Other(k) [i], reaction link i go up the bandwidth demand Fail that reserves for the fault recovery of link k self Self(k) [i],
Described step C may further comprise the steps:
If the C1 service path is selected successfully, then generate a path obligate information (PATHRESV message) at source node, transmit to destination node along service path, and in transport process, collect resource information through link;
C2, after destination node receives path obligate information (PATHRESV message), resource information to PATHRESV message information search is analyzed, if satisfy the path reservation conditions, then generate a confirmation (RESVACKmessage), wherein carry formation n in destination node s[i] and T[i]; Otherwise, generate and reserve failure information (RESVFAIL message);
If what C3 generated in step C2 is to reserve failure information (RESVFAILmessage), then return this information to source node along service path, notification path is reserved failure and is finished;
If that C4 generates in step C2 is confirmation (RESVACK message), then in destination node to formation n s[i] and T[i] carry out the initialization of all elements initialize zero;
C5, transmit confirmation (RESVACKmessage) from destination node to source node along service path, in the host node of each process to already present n s[i] and T[i] element in the formation upgrades, and it is as follows to upgrade operation:
For n s[i] carries out n s[i]=n s[i]+1,
For T[i], carry out T[i]=max (T[i], Fail Self(k) [i);
Until the n that is updated to source node s[i] and T[i];
The content of described step e comprises: generate two path obligate informations (PATHRESV message) simultaneously at source node, one is transmitted along service path, is used to upgrade local link-state information, wherein carry restoration path the list of link of process; Another transmits along restoration path, is used to reserve shared recovery bandwidth, wherein the bearer service path the list of link of process;
The Fail that the path obligate information (PATHRESV message) that transmits along restoration path is safeguarded local node according to the list of link in institute bearer service path the host node of the link k of restoration path Other(k) following renewal is carried out in [i] formation: if link i on service path, Fail then Other(k) [i]=Fail Other(k) [i]+b;
The performed renewal operation of path obligate information (PATHRESV message) that transmits along service path is: when link i is on restoration path, at the host node of link k to Fail Self(k) [i] carries out following renewal: Fail Self(k) [i]=Fail Self(k) [i]+b.
Traditional restoration path creates a mechanism as follows: after source node had determined route, source node was sent a RESERVE (reservation) information to next jumping, will detect and request resource at each intermediate node.If resource can be used, node is jumped with reserved resource and to next and is sent RESERVE, otherwise this node will return a RESERVE-NACK (reserving refusal) information to source node.RESERVE information forwarded hop-by-hop, after destination node receives RESERVE information, it will check whether idle resource is arranged, it will generate RESERVE-ACK (reservation confirmation) information and will send to last node if idling-resource is arranged, if there is not idling-resource, destination node will be sent a RESERVE-NACK information to last node, after previous node is received RESERVE-ACK information, node will carry out the configuration of optical cross connect, this node is transmitted RESERVE-ACK information to last node more then, after receiving RESERVE-ACK information, source node illustrates then that the path successfully set up, just can carry out the transmission of data for service path, just can carry out the bridge joint of end node for restoration path and switch the execution fault recovery, because this kind link establishment protocols is to be configured in the transmission course of source node by destination node in RESERVE-ACK information, and back one node waits until after the interconnection configuration is finished to adjacent last node forwarding RESERVE-ACK informational needs and just can carry out that the link establishment protocols of this class.path is that the back is to serial link setup agreement BSLSP (Backward Serial Lightpath Setup Protocol).
The factor that BSLSP influences the restoration path time delay mainly contains following several respects: the signaling information processing time of going to return required time of twice signaling information transmission, node interconnection settling time, end node bridge joint switching time and each node place between the restoration path two-end-point.The node number of supposing the restoration path process is N, and then number of links is N-1, is T at this mean transit delay of setting every link Link, the cross-over configuration time of each node is T Set, the bridge joint switching time of end node is T Switch, also having the signaling information processing time of each node in addition is T Info, it comprises two parts, the one, and the RESERVE message processing time T of forward direction Info-fInspection as resource status; The 2nd, afterwards to RESERVE-ACK information generates processing time T Info-b, arrive OXC (optical cross-connection equipment) switching fabric required time as information analysis and OCC (optical link controller), establish T for simplicity Info=T Info-f=T Info-bThen the restoration path link establishment time is:
T d=2(N-1)T link+2NT info+NT set+2T switch (1)
At long deficiency of restoration path link establishment time in the above-mentioned protocol mode, the present invention makes following further improvement, and described step F may further comprise the steps:
F1, source node send obligate information RESERVE to the destination node hop-by-hop, the parallel cross-coupled foundation of assignment;
After F2, obligate information RESERVE arrived destination node, destination node was sent reservation confirmation information RESERVE-ACK to source node;
F3, after receiving reservation confirmation information RESERVE-ACK, source node calls service path and thereby the restoration path bridge joint program of switching is finished the foundation in fault recovery path.
By above-mentioned improvement, restoration path link setup agreement is changed into the parallel link setup agreement (FPLSP:Forward Parallel Lightpath SetupProtocol) of forward direction by the back to serial link setup agreement BSLSP, reduce the settling time of restoration path.
Under FPLSP link setup agreement, RESERVE information is not waited for cross-coupled configuration at each node, because information processing and interconnection configuration at each node are parallel processings, therefore all can be included within the signaling information processing delay setup time in the node interconnection before the purpose end points, and only carry out the wait that node connects configuration in destination node.Forward direction processing delay in destination node is T Info-f+ T Set, the back is T to processing delay Info-b, overall delay is 2T Info+ T Set, and in this time delay, each node of front all can be finished the cross-coupled configuration of OXC, so, in FPLSP link setup agreement, only need to consider a node configuration time delay, so total restoration path link setup time delay is in the FPLSP link setup agreement:
T d=2 (N-1) T Link+ 2NT Info+ T Set+ 2T Switch(2) calculate BSLSP link setup agreement restoration path T settling time of gained with respect to formula (1) d, FPLSP link setup agreement has lifting preferably on restoration path setup delay performance.

Claims (3)

1, a kind of recoverable path selectino set-up method of automatic exchanging optical network is characterized in that: this method comprises the steps:
But A, source node intersection connected device OXC accept restoration path and connect the request of foundation;
B, selection service path;
C, service path obligate information transmit;
D, selection restoration path;
E, renewal service path and corresponding restoration path information;
If F service path generation link failure is carried out restoration path and is set up;
In the topology information of network, comprise following record: the port number n of link i iService path on the link i is counted n s[i]; Along service path P sAny link occurs fault the time, for the maximum bandwidth T[i that realizes that fault recovery needs on link i]; Expression link i goes up the bandwidth reserved R that reserves the bandwidth summation of using as fault recovery i
In described step B, select a link probability of use weight w sThe long-pending maximum path of [i] is as service path, and link probability of use weight is calculated according to following formula: w s [ i ] = [ n i - n s [ i ] n i ] W [ i ] Wherein, the basic weights W of link [i] is the basic weight of path logic of every link of representative jumping figure;
In described step D, select a link cost weight w rThe path of [i] sum minimum is as restoration path, and the link cost weight is calculated according to following formula:
Wherein, b is the amount of bandwidth of current connection request, and ε represents minimum.
2, recoverable path selectino set-up method of automatic exchanging optical network as claimed in claim 1 is characterized in that: safeguard following information at the host node of link: being reflected at link k upward is the needed bandwidth Fail of fault recovery that guarantees other link i Other(k) [i], reaction link i go up the bandwidth demand Fail that reserves for the fault recovery of link k self Self(k) [i],
Described step C may further comprise the steps:
If the C1 service path is selected successfully, then generate a path obligate information (PATHRESV message) at source node, transmit to destination node along service path, and in transport process, collect resource information through link;
C2, after destination node receives path obligate information (PATHRESV message), resource information to PATHRESV message information search is analyzed, if satisfy the path reservation conditions, then generate a confirmation (RESVACKmessage), wherein carry formation n in destination node s[i] and T[i]; Otherwise, generate and reserve failure information (RESVFAIL message);
If what C3 generated in step C2 is to reserve failure information (RESVFAILmessage), then return this information to source node along service path, notification path is reserved failure and is finished;
If that C4 generates in step C2 is confirmation (RESVACK message), then in destination node to formation n s[i] and T[i] carry out the initialization of all elements initialize zero;
C5, transmit confirmation (RESVACKmessage) from destination node to source node along service path, in the host node of each process to already present n s[i] and T[i] element in the formation upgrades, and it is as follows to upgrade operation:
For n s[i] carries out n s[i]=n s[i]+1,
For T[i], carry out T[i]=max (T[i], Fail Self(k) [i]);
Until the n that is updated to source node s[i] and T[i];
The content of described step e comprises: generate two path obligate informations (PATHRESV message) simultaneously at source node, one is transmitted along service path, is used to upgrade local link-state information, wherein carry restoration path the list of link of process; Another transmits along restoration path, is used to reserve shared recovery bandwidth, wherein the bearer service path the list of link of process;
The Fail that the path obligate information (PATHRESV message) that transmits along restoration path is safeguarded local node according to the list of link in institute bearer service path the host node of the link k of restoration path Other(k) following renewal is carried out in [i] formation: if link i on service path, Fail then Other(k) [i]=Fail Other(k) [i]+b;
The performed renewal operation of path obligate information (PATHRESV message) that transmits along service path is: when link i is on restoration path, at the host node of link k to Fail Self(k) [i] carries out following renewal: Fail Self(k) [i]=Fail Self(k) [i]+b.
3, recoverable path selectino set-up method of automatic exchanging optical network as claimed in claim 1 or 2 is characterized in that: described step F may further comprise the steps:
F1, source node send obligate information (RESERVE) to the destination node hop-by-hop, the parallel cross-coupled foundation of assignment;
After F2, obligate information (RESERVE) arrived destination node, destination node was sent reservation confirmation information (RESERVE-ACK) to source node;
F3, when source node receive reservation confirmation (RESERVE-ACK) thus after call service path and the restoration path bridge joint program of switching is finished the foundation in fault recovery path.
CNB021239800A 2002-07-11 2002-07-11 Recoverable path selectino set-up method of automatic exchanging optical network Expired - Fee Related CN1312863C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB021239800A CN1312863C (en) 2002-07-11 2002-07-11 Recoverable path selectino set-up method of automatic exchanging optical network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB021239800A CN1312863C (en) 2002-07-11 2002-07-11 Recoverable path selectino set-up method of automatic exchanging optical network

Publications (2)

Publication Number Publication Date
CN1392686A true CN1392686A (en) 2003-01-22
CN1312863C CN1312863C (en) 2007-04-25

Family

ID=4745279

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB021239800A Expired - Fee Related CN1312863C (en) 2002-07-11 2002-07-11 Recoverable path selectino set-up method of automatic exchanging optical network

Country Status (1)

Country Link
CN (1) CN1312863C (en)

Cited By (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2006058458A1 (en) * 2004-12-01 2006-06-08 Zte Corporation Recovering method in a complex optical network
WO2007009360A1 (en) * 2005-07-15 2007-01-25 Huawei Technologies Co., Ltd. Method for restoring link failure and apparatus thereof
WO2007071189A1 (en) * 2005-12-22 2007-06-28 Huawei Technologies Co., Ltd. A method and device for recovering the share mesh network
WO2008011778A1 (en) * 2006-07-20 2008-01-31 Huawei Technologies Co., Ltd A method and system for quality guarantee of end to end
CN100369419C (en) * 2005-07-14 2008-02-13 广东省电信有限公司研究院 Method for realizing connected reinforced main-apparatus protection in automatic exchange optical network
CN100417086C (en) * 2005-04-28 2008-09-03 华为技术有限公司 Dynamic optical network resource management
CN100431314C (en) * 2005-05-08 2008-11-05 中兴通讯股份有限公司 Method for maintaining and controlling plane attainable information in automatic exchanging optical network
CN100446472C (en) * 2006-05-15 2008-12-24 华为技术有限公司 Method for returning service route
CN100452719C (en) * 2005-11-25 2009-01-14 北京邮电大学 Shared network protection method of automatic switched optical network based on reserve capacity mechanism
CN100574226C (en) * 2004-01-04 2009-12-23 华为技术有限公司 The method of commencing business based on a plurality of network element address on the ASON network element
CN1764323B (en) * 2005-11-11 2010-04-14 中兴通讯股份有限公司 Method for avoiding congenetic burst service resource collision in automatic switched optical network
CN1787418B (en) * 2004-12-10 2010-05-05 北京邮电大学 Method for reducing information distortion in ASON layering network topological abstract
CN1816217B (en) * 2005-02-06 2010-06-02 华为技术有限公司 Route setting method based on node address changing
WO2011009380A1 (en) * 2009-07-21 2011-01-27 北京邮电大学 Parallel cross-domain failure recovery method and device for multi-layer multi-domains distributed optical network
CN101383759B (en) * 2008-09-12 2011-05-11 东北大学 Protection method dividing management region in optical network
CN101030814B (en) * 2006-03-03 2011-06-22 中兴通讯股份有限公司 Method for protecting and restoring packet service channel in ASON network
CN101459551B (en) * 2007-12-12 2011-11-02 华为技术有限公司 Method, apparatus for path recovery and path computing unit
WO2012065491A1 (en) * 2010-11-16 2012-05-24 中兴通讯股份有限公司 Method for protection switching in complicated optical network and network management system
CN102026046B (en) * 2009-09-10 2013-06-26 华为技术有限公司 Path processing method, optical communication device and optical communication system for optical network
CN103534961A (en) * 2013-02-27 2014-01-22 华为技术有限公司 Protection switching method, system and node
CN105763246A (en) * 2013-02-27 2016-07-13 华为技术有限公司 Protection switching method, system and nodes
CN106452980A (en) * 2013-06-28 2017-02-22 华为技术有限公司 Time-based business processing method and apparatus

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5986783A (en) * 1997-02-10 1999-11-16 Optical Networks, Inc. Method and apparatus for operation, protection, and restoration of heterogeneous optical communication networks
US7426179B1 (en) * 2000-03-17 2008-09-16 Lucent Technologies Inc. Method and apparatus for signaling path restoration information in a mesh network
US7095956B2 (en) * 2000-06-08 2006-08-22 Tellabs Operations, Inc. Method and apparatus for validating a path through a switched optical network

Cited By (31)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100574226C (en) * 2004-01-04 2009-12-23 华为技术有限公司 The method of commencing business based on a plurality of network element address on the ASON network element
US7848502B2 (en) 2004-01-04 2010-12-07 Huawei Technologies Co., Ltd. Method for implementing services on a network element based on multiple IDs
WO2006058458A1 (en) * 2004-12-01 2006-06-08 Zte Corporation Recovering method in a complex optical network
CN1787418B (en) * 2004-12-10 2010-05-05 北京邮电大学 Method for reducing information distortion in ASON layering network topological abstract
CN1816217B (en) * 2005-02-06 2010-06-02 华为技术有限公司 Route setting method based on node address changing
CN100417086C (en) * 2005-04-28 2008-09-03 华为技术有限公司 Dynamic optical network resource management
CN100431314C (en) * 2005-05-08 2008-11-05 中兴通讯股份有限公司 Method for maintaining and controlling plane attainable information in automatic exchanging optical network
CN100369419C (en) * 2005-07-14 2008-02-13 广东省电信有限公司研究院 Method for realizing connected reinforced main-apparatus protection in automatic exchange optical network
WO2007009360A1 (en) * 2005-07-15 2007-01-25 Huawei Technologies Co., Ltd. Method for restoring link failure and apparatus thereof
CN100446467C (en) * 2005-07-15 2008-12-24 华为技术有限公司 Restoring method for link fault
CN101160761B (en) * 2005-07-15 2011-05-11 华为技术有限公司 Link failure restoring method and apparatus
CN1764323B (en) * 2005-11-11 2010-04-14 中兴通讯股份有限公司 Method for avoiding congenetic burst service resource collision in automatic switched optical network
CN100452719C (en) * 2005-11-25 2009-01-14 北京邮电大学 Shared network protection method of automatic switched optical network based on reserve capacity mechanism
WO2007071189A1 (en) * 2005-12-22 2007-06-28 Huawei Technologies Co., Ltd. A method and device for recovering the share mesh network
US7787362B2 (en) 2005-12-22 2010-08-31 Huawei Technologies Co., Ltd. Method and device for recovering a shared mesh network
CN101030814B (en) * 2006-03-03 2011-06-22 中兴通讯股份有限公司 Method for protecting and restoring packet service channel in ASON network
CN100446472C (en) * 2006-05-15 2008-12-24 华为技术有限公司 Method for returning service route
WO2008011778A1 (en) * 2006-07-20 2008-01-31 Huawei Technologies Co., Ltd A method and system for quality guarantee of end to end
CN101459551B (en) * 2007-12-12 2011-11-02 华为技术有限公司 Method, apparatus for path recovery and path computing unit
CN101383759B (en) * 2008-09-12 2011-05-11 东北大学 Protection method dividing management region in optical network
WO2011009380A1 (en) * 2009-07-21 2011-01-27 北京邮电大学 Parallel cross-domain failure recovery method and device for multi-layer multi-domains distributed optical network
CN101715149B (en) * 2009-07-21 2013-01-23 北京邮电大学 Method and device for restoring parallel cross-domain fault of multilayer and multi-domain distributed optical network
CN102026046B (en) * 2009-09-10 2013-06-26 华为技术有限公司 Path processing method, optical communication device and optical communication system for optical network
WO2012065491A1 (en) * 2010-11-16 2012-05-24 中兴通讯股份有限公司 Method for protection switching in complicated optical network and network management system
CN103534961A (en) * 2013-02-27 2014-01-22 华为技术有限公司 Protection switching method, system and node
WO2014131155A1 (en) * 2013-02-27 2014-09-04 华为技术有限公司 Protection switching method, system, and node
CN105763246A (en) * 2013-02-27 2016-07-13 华为技术有限公司 Protection switching method, system and nodes
CN103534961B (en) * 2013-02-27 2017-02-08 华为技术有限公司 Protection switching method, system and node
CN105763246B (en) * 2013-02-27 2018-07-20 华为技术有限公司 Pretection switch method, system and node
CN106452980A (en) * 2013-06-28 2017-02-22 华为技术有限公司 Time-based business processing method and apparatus
CN106452980B (en) * 2013-06-28 2019-11-15 华为技术有限公司 Time-based method for processing business and device

Also Published As

Publication number Publication date
CN1312863C (en) 2007-04-25

Similar Documents

Publication Publication Date Title
CN1392686A (en) Recoverable path selectino set-up method of automatic exchanging optical network
CN1277375C (en) Switching method between permanent connection and exchage connection in optical network
US7545829B2 (en) Layered network node, network incorporating the same, node, and layered network
US7113481B2 (en) Informed dynamic path protection for optical networks
CN102238072B (en) Method for dynamically selecting routing and CLOS (Charles Clos) switching network system
WO2014077905A1 (en) Multi-hop error recovery
CN101517985A (en) Method for determining routing path and determination unit for routing path
CN102394925A (en) Communication method and device for remote monitoring diagnosis center and area regulation center
CN1647471A (en) Multiplexing of managed and unmanaged traffic flows over a multi-star network
CN1691550A (en) Service protection device in optical communication network and method thereof
CN1674527A (en) Method for enhancing survivability of automatic exchange optical network
CN1180654C (en) Euivalent switching method for transmission devices in MPLS networks
CN1128553C (en) Dynamically controlled routing
CN1812360A (en) Intelligent optical network business re-routing trigging method
CN1235369C (en) Method for realizing route distribution in multi-business optimization of photo synchronous digital transmission network
CN101047546A (en) Route information maintaining method of automatic exchange optical network
CN1424825A (en) Shared test device and its control method for optical network link circuit connecting verification
CN1512715A (en) Method for establishing distributively controlled dynamic link in optical Internet
CN103188163A (en) Load balancing method and device
CN1753336A (en) Mehtod of improving ring network combination of business restore ability and business protection method
CN1420651A (en) Routing in transmission network
CN101753450A (en) Method for joint optimization of resources in three-layered network
Li et al. Reconfigurable Bandwidth Service based on optical network state for inter-data center communication
CN1208934C (en) Method for realizing interworking between wideband and narrowband signaling networks
JP5651175B2 (en) ASON service routing path separation 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: 20070425

Termination date: 20130711