CN101909223B - Resource-based WDM optical network path protective P-cycle optimized configuration method - Google Patents
Resource-based WDM optical network path protective P-cycle optimized configuration method Download PDFInfo
- Publication number
- CN101909223B CN101909223B CN2009102366863A CN200910236686A CN101909223B CN 101909223 B CN101909223 B CN 101909223B CN 2009102366863 A CN2009102366863 A CN 2009102366863A CN 200910236686 A CN200910236686 A CN 200910236686A CN 101909223 B CN101909223 B CN 101909223B
- Authority
- CN
- China
- Prior art keywords
- business
- route
- node
- destination node
- circle
- 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.)
- Active
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to the field of communication. The embodiment of the invention discloses a resource-based WDM optical network path protective P-cycle optimized configuration method, which mainly comprises the following steps: according to the distribution of source and destination nodes of a service demand matrix, computing a group of protective cycles, making each protective cycle correspond to a service collection protected by the cycle and recording the correspondence at the source/destination node of a protective service for path protection switching when a fault occurs; and when each service in the service matrix has an allocated protective cycle, dividing the work and protective resources in a network according to a computed protective cycle collection.
Description
Technical field
The present invention relates to the communications field, relate in particular to the protection for WDM optical-fiber network link fault.
Background technology
Along with the develop rapidly of optical transport technology, in wavelength division multiplexing (WDM) network, single channel transmission rate and single fiber multipling channel number constantly increase, thereby have caused the sharply expansion of network capacity.Meanwhile, in case in network, break down and will bring serious impact to entire society's life.Therefore, select suitable survivability mechanism extremely important to the WDM network.
The survivability mechanism proposed comprises Shared-path protection, shared subchannel protection, the protection of link P circle, the protection of stream P circle, the protection of RP circle etc.Wherein, the protection of RP circle is based on the guard method of resource, and the basic thought of resource-based guard method is to utilize by the one group of reserved resource calculated, remaining working resource in network to be protected.In above-mentioned guard method, Shared-path protection method resource utilization is high, without fault location, but until fault after occurring just the configuration protection light path connect, protection switch time is longer, can not guarantee to switch the transmission quality of light signal.And all kinds of P circle protection Protection capacities are pre-configured, switch rapidly, and can guarantee to switch optical signal quality, but resource utilization and switched and compared, the reversed process complexity with the path protection that the source/destination node place starts lower than Shared-path protection.Therefore; there is document to propose the concept of Shared-path protection P circle; its basic thought is: by pre-configured guard ring, provide protection for one group of incoherent optical channel of Work route, thereby, when network single fiber or single link failure, guarantee that all affected business can be resumed.Shared-path protection P circle combines two aspect advantages of Shared-path protection method and P circle Protection Code, and comprising: (1) only need switch at sourcesink node starting protection, without fault location; (2) protection channel is pre-configured, and the speed of switching is fast, can guarantee optical signal quality; (3) can provide protection for the connection of transannular, resource utilization is high.
When configuration Shared-path protection P enclosed, a maximum difficult problem was how to find suitable route set and the pairing of candidate P circle, the mutual incoherent passage set of one group of route of namely being protected by same P circle.Existing method mainly is divided into two kinds: (1) first determines one group of mutual incoherent route set in the drawings, and then determines the path protective P-cycle that comprises all route sourcesink nodes in set; (2) first selected circle, as candidate's path protective P-cycle, is then found a route set, and wherein each route sourcesink node is on the P circle, and route is uncorrelated mutually.The existing methods inferior position mainly contains 2 points.At first, due to need, carry out the judgement of business route correlation, two kinds of methods all will be introduced a large amount of variablees and constraints and judge whether the business route is uncorrelated mutually, main amount of calculation will be consumed in to be found in mutual incoherent business route set, so computing time is very long and be difficult to find optimal solution within the limited time; Secondly, judge that the correlation of business route just must be carried out to business the precomputation of route.In existing method, in case guard circle is definite, the vocational work route is also determined thereupon, can't be changed.Therefore; there is defect in existing method in the flexibility of vocational work Route Selection; guard circle and vocational work route are the relation of " binding "; in case the Work route of business changes; need to carry out the planning and configuration again of the whole network reserved resource, be difficult to meet the requirement of network upgrade and business routing change.
Consider afore-mentioned, exist and overcome needs not enough in correlation technique.
Summary of the invention
The object of the present invention is to provide a kind of resource-based WDM optical network path protective P-cycle optimized configuration method, be used to the link failure of WDM optical-fiber network that protection is provided.
The work that resource-based WDM optical network path protective P-cycle optimized configuration method proposed by the invention mainly completes is: (1) is by calculating one group of guard circle, and determine the protection relation between this group guard circle and protected business, and preserve this protection relation for the protection of switching at source, the destination node place of protected business; (2) result is divided in the work and the reserved resource that obtain the whole network.
Resource-based WDM optical network path protective P-cycle optimized configuration method provided by the invention is characterized in that comprising following steps:
The initialization network topology, all Internet resources all are initialized as to working resource, the service request matrix is arranged and is the form of business chained list, business numbering, business source/destination node numbering and the business processing status information of each element of business chained list for preserving a service request;
Searching loop current business chained list, each circulation will calculate a guard circle provides protection for one or more business, and switches for the reserved resource after fault in source node and the destination node place difference record protection relation of business.Each circulation starts to choose backward the business of N_Set business processing status for " untreated " by the business chain gauge outfit, starts the flow process for this N_Set service computation guard circle.Wherein N_Set is positive integer, represents the business number of the multipotency protection of guard circle.While calculating guard circle; the order of choosing according to business; source node by first business starts to call the shortest route that dijkstra's algorithm calculates the next service source node of arrival; route is calculated the shortest route of next service source node to next service source node again after calculating successfully, till the source node that has calculated the penultimate business arrives the shortest route of last service source node.Then calculate the shortest route of the source node of last business to destination node, after calculating, start to start to calculate the shortest route of the destination node of each business to the destination node of previous business by the destination node of last business, calculate the destination node of second business after the shortest route of the destination node of first business, calculated the shortest route of the destination node of first business to source node.Before each route is calculated, need by the preceding paragraph route the node of process and link from the current network topology, leaving out, to guarantee the integrality of coil structures.So far above every section route is end to end, finally will form the loop of a closure, this loop is exactly that the guard circle of protection can be provided for these business.If in each route computational process, route occurs, calculate failed situation, first determine the position of current business in this selected business.If current business is first business, upgrade this selected business, therefrom delete current business, otherwise delete in this route calculating as corresponding that business of the node of destination node.If what then the judgement previous step was deleted is as corresponding that business of the node of destination node during this route is calculated, the route next time after this route is calculated successfully will start to continue to calculate route as the source node of the corresponding business of node of destination node calculating, and calculate otherwise restart route by the order of this selected business after upgrading;
After the protection relation between guard circle set and guard circle and business is determined, the reserved resource in token network.The order of depositing in set according to guard circle during mark is processed successively, and half of every circle uplink capacity is labeled as to protection.Capacity is that symmetrical complement distributes on two-way link, be similar to the capacity method of salary distribution of BLSR.If the circle uplink of the current circle circle uplink of the complete circle of pre-treatment with it overlaps, on this link, capacity distributes constant.
From above technical method, can find out; resource-based WDM optical network path protective P-cycle optimized configuration method proposed by the invention can be applied in the WDM optical-fiber network; for the reserved resource of determining that one group of guard circle forms, the working resource that may take when the route all business in traffic matrix provides path protection end to end.With conventional method, compare, method proposed by the invention reduces the restriction to the business route, and namely in same guard circle, between the different business of this guard circle not being protected, the correlation of route is done restriction.So not only reduced the difficulty of calculating uncorrelated set of routes, also reduced the node of the concrete process of business route and the restriction of link, as long as the use of the Work route of business is the working resource of having divided in network, with regard to one, be protected surely while breaking down.Therefore, method proposed by the invention can meet the requirement of network future upgrading and business routing change.
Other features and advantages of the present invention will be set forth in the following description, and, partly from specification, becoming apparent, perhaps by implementing the present invention, understand, purpose of the present invention and other advantage can be passed through specification, the claims in abbreviation, and in accompanying drawing, the specifically noted structure realizes and obtains.
The accompanying drawing explanation
In conjunction with the accompanying drawing of having described various embodiment of the present invention, according to following detailed description to each invention of the present invention, will be easier to understand above-mentioned and other advantage of the present invention, wherein:
Fig. 1 shows an application example figure of resource-based WDM optical network path protective P-cycle optimized configuration method;
Fig. 2 shows resource-based WDM optical network path protective P-cycle optimized configuration method flow chart;
Embodiment
By with reference to following detailed description for exemplary non-limiting examples and figures, advantages and features of the invention and realize that method of the present invention is easier to understand.Yet the present invention can implement with multiple different form, and the embodiment that should not be construed as limited in this explaination.In addition, thus it will be thoroughly and completely that these embodiment the disclosure are provided.And complete conveyed to those skilled in the art by design of the present invention, the present invention will only be defined by claims.In specification, identical label is indicated the parts of enjoying all the time.
Fig. 1 shows an application example figure of resource-based WDM optical network path protective P-cycle optimized configuration method;
In figure, node means by solid line circle and identifies with letter and number.Supposing in the current business matrix has 6 service request, with the form of " source node-destination node ", is expressed as respectively: S
1-D
1, S
2-D
2, S
3-D
3, S
4-D
3, S
5-D
2, S
5-D
4.According to the thought of path protective P-cycle, need calculate above 6 service request of guard circle protection, and the source, destination node that meet business are all on circle.Here, suppose each service request by a pair of opposite direction but the identical demand of bandwidth forms, equally each guard circle also by a pair of direction complementation but the identical circle in path form, so just can eliminate directional problems.Solution in the past is that first to utilize routing algorithm be each service request evaluation work route, then in these calculated routes, determines one group of mutual incoherent route set, then determines the path protective P-cycle that comprises all routes source, destination node in set; Or first selected circle is as candidate's path protective P-cycle, then from calculated route, finding a route set, wherein each route source, destination node are on the P circle, and route is uncorrelated mutually.Solution in the past all faces two problems, and namely the complicated decision problem of uncorrelated business route and business route are determined in advance problem.In Optimal Configuration Method proposed by the invention, due to the P circle guard method that is based on resource of adopting, therefore needn't require to be subjected to must two pairwise uncorrelateds between the Work route of business of same guard circle protection.Thereby avoided complicated uncorrelated routing decision process, also without the business route is carried out to precomputation, improved the satisfied flexibility of service request and the ability of dredging of network.
At first Optimal Configuration Method proposed by the invention arranges network topological information, then according to the order of service request matrix, finds available guard circle for each service request.The Fig. 1 of take is example, supposes p
1And p
2Represent that Optimal Configuration Method proposed by the invention is two guard circles that above 6 service request calculate.As can be seen from the figure, between the service request set for each guard circle and its protection, need to meet following two constraintss: at first, the source of protected business, destination node must be all on circles; Secondly, the source of protected business, destination node must be symmetric, if namely with dotted line, connect source, the destination node of each service request, non-intersect between dotted line.Here do not require the final route of business non-intersect or uncorrelated (node and link are all uncorrelated), only require the source of service request, destination node to be arranged in order respectively the both sides of circle.Guard circle need carry out the division of network work and Protection capacity after determining.Because the hypothesis network is uniform; therefore the capacity on every link all equates; the distribution of circle uplink capacity is similar to the two fibre two-way multi-section guard rings (BLSR) of SDH, and the circle uplink has the capacity of half as Protection capacity on each direction, and other are all working capacity.In figure, p
1And p
2There is the upper shared link of circle.Resource on shared link is still divided according to the method for half work, half protection, and the reserved resource on shared link is p
1And p
2Share.Shared link has improved the resource utilization of network, has improved the efficiency of protection.
Corresponding relation between working resource and reserved resource is stored and safeguards at service source, destination node place.After work and Protection capacity division, can carry out calculating and the resource allocation process of business route.Now; because guard method is based on resource; and the Work route assigning process of business and protection route assignment process are relations independently; therefore without the irrelevant problem of considering between the business route; so long as the vocational work route calculated in the working capacity of having divided can be effectively protected.If in case break down, affected service source, destination node are inquired about work and the reserved resource corresponding relation that this point is safeguarded at once, complete the path protection process.
Fig. 2 shows resource-based WDM optical network path protective P-cycle optimized configuration method flow chart.
The main thought of resource-based WDM optical network path protective P-cycle optimized configuration method is: distribute according to source, the destination node of business demand matrix; calculate one group of guard circle; make the corresponding collection of services that is subjected to this circle protection of each guard circle; and recording this corresponding relation at the source/destination node place of protected business, the path protection during for fault is switched.After each business in traffic matrix has been distributed guard circle, divide work and the reserved resource in network according to the guard circle set calculated.Finally, the purpose of Optimal Configuration Method proposed by the invention is: (1) be protected circle and corresponding relation of protected business, and record this corresponding relation at source, the destination node place of business; (2) result is divided in the work and the reserved resource that obtain the whole network.The performing step of Optimal Configuration Method proposed by the invention is as shown in Figure 2:
In step 201, flow process starts.
In step 202, the initialization network topology, collecting topology information is also node serial number.All resources all are initialized as to available working resource, the guard circle of initialization simultaneously set P_Set, this set, for all guard circles that storage calculates, is set to sky during initialization;
In step 203, create business chained list Tr, from the service request matrix, sequentially reading successively service requesting information, fill the business chained list.Business numbering, business source/destination node numbering and the business processing status information of each element of business chained list for preserving a service request.After the service request matrix reads, business chain list index Pt is placed in to the Tr top;
In step 204, be N_Set by variable n assignment.N_Set is a positive integer, limits the business number of the multipotency protection of a guard circle;
In step 205, be initialized to number of turns group Cycle[2n] and the upper node chained list P of circle.Lopping array Cycle[2n] be that a size is the interim array of 2n, be used to the sourcesink node serial number of the claimed business of guard circle of depositing this calculating.On circle, node chained list P is the single linked list structure, in chained list by node address on clockwise or circle that counterclockwise sequential storage is all, be used to recording the guard circle of this calculating.During initialization, both are put to sky;
In step 206, by service condition, rearrange Tr, the business of having handled is front, and untreated business is rear.Pt is placed in to the first untreated business place and move afterwards successively the n-1 position (as after move to after the chained list end stops move), just n the business that business needs protection for this calculating of process.Source, the destination node numbering of extracting this n business add size in the lopping array of 2n.The arrangement mode of the source of this n business, destination node numbering is: front n position is by the order in the business chained list source node of record traffic successively, front n position is by the order in the business chained list destination node of record traffic successively, finally the source of each business, the destination node n-1 position that is separated by the lopping array;
In step 207, judge whether the lopping array is empty.If be not empty, continue step 208; Otherwise the business chained list of explanation is handled, or the business chained list is empty, jumps to step 226;
In step 208, it is 0 that this cyclic variable i that calculates the circle circulation is set, and continues step 209;
In step 209, judge whether i is 2n-1.If do not meet, continue step 210; Otherwise, Cycle[i is described] and for last position of lopping array, jump to step 211;
In step 210, in current topology, calling dijkstra's algorithm calculates by node Cycle[i] to node Cycle[i+1] shortest route, if node Cycle[i] with node Cycle[i+1] identical, the route of this calculating be set to sky and record route and calculate successfully, route jumps to step 212 after calculating;
In step 211, in current topology, call dijkstra's algorithm and calculate by node Cycle[i] to node Cycle[0] shortest route, with the loop that forms a closure as guard circle, continuation step 212 after calculating;
In step 212, in judgement, whether step shortest route route is calculated successfully.If success, continue step 213; Otherwise, enter unsuccessfully the route processing flow process, jump to step 218;
In step 213, recording gauge is counted as this section route of merit, extracts the node address information of this route process, inserts the end of the upper node chained list P of circle.This section route is one section arc of guard circle.If being sky, route do not carry out the above operation of this step;
In step 214, judge whether i is 2n-1.If do not meet, continue step 215; Otherwise, illustrate and form guard circle, jump to step 217;
In step 215, from the route that the current network topology, this calculated node and the link of process leave out, make the route of subsequent calculations uncorrelated with this section route, guarantee the formation of coil structures, if route is sky, do not carry out the above operation of this step;
In step 216, cyclic variable i increases certainly, and jumps to next section arc on step 209 continuation calculating guard circle;
In step 217, complete guard circle forms, and needs the protection relation between this guard circle of mark and protected business.On circle now, node chained list P is an end to end list structure, has recorded the complete information of guard circle.Current lopping array is source, the destination node numbering of the business protected of in store this guard circle.The method of mark protection relation is that node chained list P on current circle is saved in the guard circle list that each node of recording in current lopping array safeguards.While breaking down, start path protection and switch, when direct source in business, destination node place, fetch protection circle information, switch business to the reserved resource of enclosing at the end points place of business.After completing mark, need to change service condition, the state that calculates the business of guard circle is set to processed, node and the link information before then recovering, deleted in computational process also add P in guard circle set P_Set;
In step 218, enter unsuccessfully the route processing flow process.Whether the value that judges current cyclic variable i is greater than 2n-3.If meet, continue step 219; Otherwise, jump to step 220;
In step 219, upgrade current lopping array, will be wherein Cycle[i] and Cycle[0] value of two puts sky.Put empty method and need can be put to the value in room and change disabled value into, as infinity or negative.Then jump to step 224;
In step 220, upgrade current lopping array, will be wherein Cycle[i+1] and Cycle[2n-i-2] value of two puts sky.Put empty method with step 219.Then continue step 221;
In step 221, judge whether the value of current cyclic variable i is less than n-1.If be not less than, continue step 222; Otherwise, jump to step 226;
In step 222, i=2n-i-3, continue step 223;
In step 223, start traversal, deletion of node Cycle[i from the linked list head of P] afterwards all records.These record representatives are by node Cycle[i] one section or several sections arcs starting, and before record, in topology, recover successively the information of the corresponding link of these several sections arcs and node in deleting P;
In step 224, i=1, continue step 225;
In step 225, in topology, recover the arc recorded in all P node and the link information of process, empty P, continue step 226;
In step 226, be updated to number of turns group, method is that non-room reach polishing is put to room.The size of now lopping array can reduce two, n=n-1.In addition, cyclic variable i need change along with dwindling of lopping array.While assuming the renewal of number of turns group, Cycle[i] x position, i=i-x have moved forward in array.After renewal, get back to step 209, start the calculating of next section arc;
In step 227, all business are all processed complete, need divide work and the reserved resource in network according to the guard circle set P_Set of this calculating.Because the resource in the initial condition network all is marked as working resource, the resource division main task is the reserved resource in token network.The reserved resource mark is that half of every circle uplink capacity is labeled as to protection.Capacity is that symmetrical complement distributes on two-way link, be similar to the capacity method of salary distribution of BLSR.During division, process successively according to the order of guard circle storage in P_Set.If the circle uplink of the current circle circle uplink of the complete circle of pre-treatment with it overlaps, on this link, capacity distributes constant;
In step 228, flow process finishes.
By path protective P-cycle optimized configuration method provided by the present invention; can calculate a guard circle set according to service request matrix and network topology; make each the teleservice request in the service request matrix in this guard circle set, to find corresponding element (guard circle) for oneself provides reserved resource, provide protection and each guard circle in the guard circle set also corresponds to one or more than one service request.In situation for a plurality of service request of guard circle protection, path protective P-cycle optimized configuration method provided by the present invention can guarantee that the distribution of service source, destination node meets structure shown in Figure 1, has maintained the stability of guard method.In addition, path protective P-cycle optimized configuration method provided by the present invention also is divided into Internet resources two kinds of working resource and reserved resources.After the corresponding relation between guard circle and service request is determined; as long as what the Work route of service request was used is ready-portioned working resource; this service request is effectively protected surely with regard to one when breaking down; need not be to concrete path, namely the business route the concrete link of process do restriction.Specifically when fault occurs, at the two-end-point of influenced business, start path protection and switch, switch the business in the reserved resource of corresponding guard circle circle uplink on idle arbitrarily wavelength.Simultaneously, the method is shared by reserved resource, has improved the resource utilization of network, has improved the efficiency of protection.
Although described by reference to the accompanying drawings embodiments of the present invention, in this area, those skilled in the art can make various distortion or modification within the scope of the appended claims.
Claims (2)
1. resource-based WDM optical network path protective P-cycle optimized configuration method is characterized in that comprising the following steps:
The initialization network topology, all Internet resources all are initialized as to working resource, the service request matrix is arranged and is the form of business chained list, business numbering, business source/destination node numbering and the business processing status information of each element of business chained list for preserving a service request;
Searching loop current business chained list, calculate a guard circle in each the circulation and add the guard circle set, for one or more business provides protection, in source node and the destination node place difference record protection relation of business, switches for the reserved resource after fault simultaneously;
Reserved resource in token network, and by the order of guard circle in described guard circle set, half that successively will every circle uplink capacity is labeled as protection, if certain of current circle is enclosed mark of uplink, mark not;
In wherein said each circulation, calculating a guard circle adds the step of guard circle set mainly to comprise the following steps:
Gauge outfit head by the current business chained list starts to choose successively backward the business of N_Set business processing status for " untreated ", and N_Set is positive integer;
The order of choosing according to business, by first business, started, call the shortest route that dijkstra's algorithm calculates the next service source node of source node arrival of current business, till the source node that has calculated the penultimate business arrives the shortest route of last service source node, each route before calculating, need by the preceding paragraph route the node of process and link from the current network topology, leaving out, if route is calculated unsuccessfully, malloc failure malloc route processing flow process;
From the current network topology, delete the preceding paragraph route node and the link of process, and calculate the shortest route of the source node of last business to destination node, if route calculate unsuccessfully, malloc failure malloc route processing flow process;
From the current network topology, delete the preceding paragraph route node and the link of process, then the order of choosing according to business, beginning starts to calculate the shortest route of the destination node of current business to previous business destination node by the destination node of last business, till the shortest route of destination node that the destination node of second business arrives first business until has calculated, if route is calculated unsuccessfully, malloc failure malloc route processing flow process;
From the current network topology, delete the preceding paragraph route node and the link of process, calculate the shortest route of the destination node of first business to source node, if route calculate unsuccessfully, malloc failure malloc route processing flow process;
Every section route that this circulation calculates is end to end, and the loop of a closure of formation, obtain providing for these business the guard circle of protection.
2. method according to claim 1, wherein, described failed route processing flow process mainly comprises the following steps:
Determine the position of current business in this selected business;
If current business is first business, upgrade this selected business, therefrom delete current business, otherwise delete in this route calculating as corresponding that business of the node of destination node;
If what previous step was deleted is as corresponding that business of the node of destination node during this route is calculated, the route next time after this route is calculated successfully will start to continue to calculate route as the source node of the corresponding business of node of destination node calculating, and calculate otherwise restart route by the order of this selected business after upgrading.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009102366863A CN101909223B (en) | 2009-10-27 | 2009-10-27 | Resource-based WDM optical network path protective P-cycle optimized configuration method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009102366863A CN101909223B (en) | 2009-10-27 | 2009-10-27 | Resource-based WDM optical network path protective P-cycle optimized configuration method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101909223A CN101909223A (en) | 2010-12-08 |
| CN101909223B true CN101909223B (en) | 2013-11-27 |
Family
ID=43264516
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009102366863A Active CN101909223B (en) | 2009-10-27 | 2009-10-27 | Resource-based WDM optical network path protective P-cycle optimized configuration method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101909223B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103259590B (en) * | 2013-05-27 | 2015-12-09 | 重庆邮电大学 | A kind of light multicast static P circle segment protection method of jumping section based on 2 |
| CN103428087B (en) * | 2013-05-31 | 2016-12-28 | 国家电网公司 | The longest path preset protection P using depth of round first traversal encloses generation method |
| CN104935525A (en) * | 2015-05-13 | 2015-09-23 | 北京中经赛博科技有限公司 | Business unblocking scheme based on shaping linear programming process |
| CN106850378A (en) * | 2017-01-05 | 2017-06-13 | 华北电力大学 | A kind of P suitable for electricity needs response business encloses guard method |
| CN114125595A (en) | 2020-08-31 | 2022-03-01 | 中兴通讯股份有限公司 | OTN network resource optimization method, device, computer equipment and medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1968141A (en) * | 2006-08-09 | 2007-05-23 | 华为技术有限公司 | WDM transmission system protection method and apparatus |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101192883A (en) * | 2006-11-21 | 2008-06-04 | 华为技术有限公司 | Multicast protection method in WDM optical network |
-
2009
- 2009-10-27 CN CN2009102366863A patent/CN101909223B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1968141A (en) * | 2006-08-09 | 2007-05-23 | 华为技术有限公司 | WDM transmission system protection method and apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101909223A (en) | 2010-12-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8908674B2 (en) | Method for configuring an optical network | |
| US8565598B2 (en) | Selecting an optical path for a new connection with the minimum number of optical regenerators | |
| Zhu et al. | On-line approaches for provisioning connections of different bandwidth granularities in WDM mesh networks | |
| JP6136836B2 (en) | Routing and wavelength allocation system and method for network virtualization | |
| US20040258409A1 (en) | Optical reroutable redundancy scheme | |
| US20020138645A1 (en) | Protecting route design method in a communication network | |
| US20040246896A1 (en) | Optical network topology databases based on a set of connectivity constraints | |
| JP5523578B2 (en) | Frequency allocation method and apparatus | |
| CN101909223B (en) | Resource-based WDM optical network path protective P-cycle optimized configuration method | |
| US20030018812A1 (en) | Method and apparatus for provisioning working paths in shared protection mesh network | |
| EP1807983A1 (en) | Optical path routing in an optical communications network | |
| JPWO2018066582A1 (en) | Optical network controller and optical path setting method | |
| Zhang et al. | Dynamic service provisioning in space-division multiplexing elastic optical networks | |
| US20090116392A1 (en) | Communication network, path setting method, network management system and node | |
| CN114302267A (en) | Special protection spectrum allocation method and system for space division multiplexing optical network of data center | |
| US20040247317A1 (en) | Method and apparatus for a network database in an optical network | |
| Wuttisittikulkij et al. | Use of spare wavelengths for traffic restoration in a multiwavelength transport network | |
| JP5937978B2 (en) | Network management system and network management method | |
| CN102281201A (en) | route selection and resource distribution method and device | |
| Yamada et al. | Survivable hierarchical optical path network design with dedicated wavelength path protection | |
| Sue | Wavelength routing with spare reconfiguration for all-optical WDM networks | |
| Bakri et al. | An iterative partial path protection-based approach for routing static D-connections in WDM transparent networks with SRLG constraints | |
| JP2013062628A (en) | Path rearrangement method and device | |
| Lowe et al. | Performance of dynamic path optical networks | |
| CN100559742C (en) | The method of grouped data stream in transporting the transmission net of circuit traffic |
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 |