CN1592160A - Method for obtaining path with protective body in intelligent optical network - Google Patents
Method for obtaining path with protective body in intelligent optical network Download PDFInfo
- Publication number
- CN1592160A CN1592160A CN 03159210 CN03159210A CN1592160A CN 1592160 A CN1592160 A CN 1592160A CN 03159210 CN03159210 CN 03159210 CN 03159210 A CN03159210 A CN 03159210A CN 1592160 A CN1592160 A CN 1592160A
- Authority
- CN
- China
- Prior art keywords
- link
- node
- protection
- path
- time slot
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J14/00—Optical multiplex systems
- H04J14/02—Wavelength-division multiplex systems
- H04J14/0287—Protection in WDM systems
- H04J14/0293—Optical channel protection
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J14/00—Optical multiplex systems
- H04J14/02—Wavelength-division multiplex systems
- H04J14/0227—Operation, administration, maintenance or provisioning [OAMP] of WDM networks, e.g. media access, routing or wavelength allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J14/00—Optical multiplex systems
- H04J14/02—Wavelength-division multiplex systems
- H04J14/0278—WDM optical network architectures
- H04J14/0284—WDM mesh architectures
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
This invention discloses a method for acquiring paths with protection entities in the intelligent optical network including the following steps: setting up different TE links for data links of different protection kinds, setting up a same TE link for the data links having the same protection attribute and belonging to the same protect entity, carrying out flooding of the protection entity information to diffuse the protection entity information in the entire route zone and acquiring paths with protection entities in the network according to the information.
Description
Technical field
The present invention relates to ASON, be specifically related to a kind of route method that in ASON, obtains to have the protection entity.
Background technology
Present transmission network mainly is based on SDH (SDH (Synchronous Digital Hierarchy))/SONET (Synchronous Optical Network) technology, and in the equipment operation of reality, business configuration is mainly according to client's needs manual configuration end to end.In order to improve the manageability of transmission network, the notion of ASON has been proposed in the world, its major function is exactly the end-to-end automatic configuration of supporting business.For professional allocative abilities automatically is provided on transmission network, intelligent optical network equipment must have optimizes the automatic computing capability of service path end to end.Original transmission network itself has perfect protective capability, provides protective capability based on the multiplex section protective ring of APS agreement such as transmission network, intelligent optical network equipment need can compatible original transmission network protection ability.
Routing is the core of ASON, because optical-fiber network is exactly the intelligence that needs to increase the light net automatically, makes the light tunnel of point-to-point become resilient manageable light net.It is main in present path calculation method that what use is CSPF algorithm (Constraint Shortest Path First computational methods) in the traffic engineering technology, CSPF is a kind of improved shortest-path first algorithm, it is a kind of when the shortest path that calculates by network, the algorithm that specific constraint is also taken into account.The basic ideas of this algorithm are not protect in the physical network, calculate optimal path end to end by using the shortest path first based on constraint.The constraint of its consideration mainly comprises: bandwidth, management group, forbid node etc.Rudimentary algorithm is as follows:
The CSPF algorithm uses the database of two PATHS by name (path) and TENT (trial path).Preserve the information of shortest path tree among the PATHS, and comprised the information of the trial node before finding shortest path among the TENT.Only when having found the shortest path that arrives a node, this node just can be put into the PATHS database.
The step of CSPF algorithm computation is as follows:
1. source node is put into TENT, in TENT, choose the node of minimum cost and put into PATHS.
2. when a node is placed into PATHS, check the link of this node, the attribute and the constraints of link are mated, and neighbor node is carried out the coupling of constraints to each neighbor node.If the match is successful in constraint, if then neighbours are Already among the PATHS, the expression new route is long path, at this moment ignores new route; If neighbours are present among the TENT, and new route is shorter, then replaces the footpath, old road with new route.If the path among new route and the TENT is long equally, then neighbours have path of equal value.If neighbor node not in TENT, then before node is moved on to TENT, is reduced the link and the node that do not satisfy LSP constraints, and the link corresponding node that satisfies LSP constraints is put into TENT.
3. will there be the node of minimum cost to put into PATHS among the TENT.
4. be destination node when TENT has the node of minimum cost when empty or among the TENT, route is calculated and is finished, output result of calculation; Otherwise, jump to step 2.
In network, if protection entity (mainly referring to multiplex section protective ring) has been passed through in the path, the link in the protection entity need keep the consistency of time slot, and the business that could guarantee like this is protected in the protection entity.And in the existing path calculation method, do not consider the specific (special) requirements that the protection entity is chosen TE Link in the network.
Summary of the invention
The objective of the invention is to overcome the above-mentioned shortcoming of prior art, a kind of route method that obtains to have the protection entity in ASON is provided, be used for the optimum service path that exists the network of protecting entity to obtain to satisfy customer requirements at.The method comprising the steps of:
Set up different TE Link (flow engineering link) for the data link of difference protection type, have identical protection attribute and the data link that belongs in the identical protection entity is created as same TE Link;
Carry out the inundation of described protection entity information, spread the protection entity information in the whole Routing Area;
According to described protection entity information, obtain to have in the described network path of protection entity.
Alternatively; described data link for different protection types are set up different TE Link (flow engineering link), have identical protection attribute and belong to the step that data link in the identical protection entity is created as same TE Link to comprise: the different attribute according to time slot protection type in the described ASON is set up described different TE Link.
Preferably, described different attribute according to time slot protection type in the described ASON step of setting up described different TE Link comprises:
To be used for Working service and have corresponding protection link to its TE Link of protecting as protected TE Link;
To be used to protect the TE Link of the TE Link of described protected TE Link as protection;
To be used for Working service and do not have corresponding protection link to its TE Link of protecting as unshielded TE Link.
Preferably, the described inundation that carries out described protection entity information, the step that spreads the protection entity information in the whole Routing Area comprises step:
Carry out the Link State issue (LSA) of various described different TE Link types, have the protection type and the Time Slot Occupancy information of described TE Link among the described LSA;
Carry out the Link State issue (LSA) of route-type, have protection entity informations different on each smart machine in the described network among the described LSA;
Obtain protection entity information in the whole Routing Area according to different protection entity information on each smart machine in the protection type of above-mentioned TE Link and Time Slot Occupancy information and the described network.
Particularly, different protection entity informations comprises on each smart machine in the described network: interface index that advances TE Link and the interface index that goes out TE Link during the above TE Link of the described smart machine of each guard ring entity process.
Preferably, described according to described protection entity information, the step that obtains to have in the described network path of protection entity comprises:
A, the source node that obtains the path of described network, destination node and the set of potential next-hop node;
B, from described potential next-hop node set, choose the node that link arrived of link cost minimum, utilize the path of the described source node of CSPF (Constraint Shortest Path First) algorithm computation to described cost minimum node, and determine the time slot consistency that this link is chosen by last link, make up SPF (SPF) path;
C, choosing next cost minimum node from described potential next-hop node set, repeat above-mentioned steps b, is described destination node up to described cost minimum node;
After d, described SPF path successfully construct, recall, determine the time slot consistency of last link by a back link information from the destination node in described SPF path.
Especially, above-mentioned steps b comprises:
Judge whether matching constraint condition of link that described cost minimum node arrives neighbor node;
If do not match, then ignore this link;
If coupling is then chosen this link, and is determined the time slot consistency that this link is chosen by last link;
Described neighbor node is put into described potential next jumping set.
Preferably, if described coupling is then chosen this link, and determine that by last link the conforming step of time slot that this link is chosen comprises:
If described link is the link on the guard ring, then determine the time slot that described link is chosen by last link;
If link on many guard rings is arranged, and can't determine time slot that described link chooses by last link the time, then described neighbor node mark is determined the sign of link to described neighbor node.
Preferably, describedly described neighbor node put into described potential next step of jumping set comprise:
If described neighbor node is then ignored in described SPF path;
If described neighbor node then relatively arrives the path that described neighbor node the old and new path size determines to arrive described neighbor node in described potential next jumping set;
If described neighbor node is then put into described neighbor node described potential next jumping set not in described potential next jumping set.
Preferably, after the described SPF of above-mentioned steps d path successfully constructs, recall from the destination node in described SPF path, the conforming step of time slot of determining last link by a back link information comprises:
Recall from the destination node in described SPF path,, then determine path and the time slot of its front nodal point to the link of its posterior nodal point to described present node by described present node if present node is marked with the described sign of not determining link; If can not determine, then described its front nodal point of picked at random is to the path of described present node, and its time slot and described present node are consistent to the time slot of the link of its posterior nodal point.
Utilize the present invention, can obtain to satisfy the shortest path of constraints, and, reduce the number of times of double counting effectively, improved network efficiency by obtaining the method for protection topology in advance based on the intrinsic protection type of transmission network.
Description of drawings
Fig. 1 is the embodiment of the invention obtains to have the route method of protecting entity in ASON a flow chart;
Fig. 2 is a link channel protection schematic diagram under the two-direction duplexing section protection of two wires;
Fig. 3 utilizes the CSPF algorithm to make up the detail flowchart of the step in SPF path in the inventive method flow process shown in Figure 1;
Fig. 4 is an ASON topology schematic diagram;
Fig. 5, Fig. 6, Fig. 7, Fig. 8, Fig. 9, Figure 10 are respectively the different process schematic diagrames that ASON topological structure shown in Figure 4 makes up the path in the process of SPF path;
Figure 11 is that ASON topological structure shown in Figure 4 makes up the process schematic diagram of determining to choose link in the protection entity in the process of SPF path by backtrack mechanism.
Embodiment
In order to make those skilled in the art person understand the present invention better, the present invention is described in further detail below in conjunction with drawings and embodiments.
At first several Key Terms of using among the present invention are done the explanation of some necessity:
TE Link: flow engineering link is to be formed by the data link binding that identical TE attribute is arranged.In ASON, data link can be understood as the minimum bandwidth granularity, can be VC-4, VC-12.TE Link can be an optical fiber, multifiber or the part time slot in optical fiber just, is a notion in logic.
Protection entity: refer in transmission network, for the special networks topological entity of realizing the defencive function of business is set up, as Linear multiplex section, multiplex section protective ring etc.
With reference to Fig. 1, Fig. 1 shows the embodiment of the invention obtains to have the route method of protecting entity in ASON flow chart:
Step 101: set up different TE Link (flow engineering link) for the data link of difference protection type, have identical protection attribute and the data link that belongs in the identical protection entity is created as same TE Link.Specifically can be undertaken by the division and the method for building up of following TE Link:
A) protected TE Link: be used for the TE Link of Working service, have corresponding protection link that it is protected;
B) Bao Hu TE Link: be used to protect the TE Link of described protected TE Link, can transmit extra traffic, but can be occupied when protection;
C) unshielded TE Link: be used for the TE Link of Working service, but do not protect link that it is protected, and can not be by any other service occupation.
Time slot in the general optical fiber has identical attribute, just is created as a TE Link and carries out inundation.So-called inundation is meant in Routing Area, spreads a certain Link State, with the LSD between distribution and the synchronous router.But following situation needs special processing:
1) if some time slot in optical fiber link is in the protection entity, some time slot is not in the protection entity, that is to say the protection type attribute difference of time slot.In this case, need be created as different TE Links to the time slot of protection types different in the same optical fiber link and carry out inundation, guarantee the attribute unanimity of each TE Link.For example in the optical fiber in the two-fibre two-way multi-section guard ring, half time slot is used for work, and half time slot is used for protection.This just need be created as two TE Links to an optical fiber link and carry out inundation.
2) if all time slots in optical fiber all belong in the protection entity, have identical protection type, but belong in the different protection entity.For example, a part of time slot belongs in certain Linear multiplex section in the optical fiber, a part of time slot belongs in MSP 1 ring, and a part of time slot belongs in MSP 2 rings.In this case, though the protection type of all time slots all is 1: 1, can not set up a TE Link.Need set up different TE Links respectively for the time slot that is in the different protection entities, that is to say and to set up three TE Link information for an above-mentioned optical fiber.
Below by a concrete example this is further described:
With reference to Fig. 2, Fig. 2 is a link channel protection schematic diagram under the two-direction duplexing section protection of two wires: wherein the 1-3,5 of 16 passages, 8 passages are protected passages; 9-11,13,16 passages are protection passages, protect the protected passage of front in order, can load extra traffic on these passages, and these business will be seized when this two-way shared multiplex section loses efficacy; 4,6,7,12,14,15 in other passages are the unprotect passages, can carry the unprotect business on these passages.According to above TE Link division rule, { 1,2,3,5,8} is bundled into a TE Link to passage, and the protection attribute is 1: 1; { 9,10,11,13,16} is bundled into a TE Link to passage, and the protection attribute is the protection link, can carry extra traffic; Other passages 4,6,7,12,14,15} is bundled into a TE Link, protection attribute unprotect, business can not be seized.
Refer again to Fig. 1, step 102: protect the inundation of entity information, spread the protection entity information in the whole Routing Area.Because being the inundation process by Routing Protocol (OSPF, IS-IS etc.), the topology information diffusion of protection entity realizes.The topology information of protection entity mainly is included among the LSA of the LSA of TE Link type and route-type.Below this LSA of two types is elaborated:
The LSA of TE Link type is newly-increased a kind of LSA for inundation TE Link information.In this LSA, comprise the bandwidth information of TE Link, the situation etc. that takies of protection type, time slot.The information relevant with the protection entity is protection type and Time Slot Occupancy situation.The protection type is 1+1 protection, protection in 1: 1, perhaps unprotect (Linear multiplex section, multiplex section ring all are 1: 1 protection types).The Time Slot Occupancy situation of TE Link can be used 8 byte representations, and whether 1 time slot of each expression of each byte uses 0/1 this time slot of expression available.8 bytes then can be represented 64 time slots, the promptly maximum TE Link that can represent the 10G bandwidth.
Except top TE Link information or not enough, also need to know guard ring information.Ring information is to go to organize by each equipment in the network.Each equipment in certain network may belong to a lot of different guard ring entities, and the link that is to say a lot of guard rings promptly has into link and the link that goes out by this equipment.So just can on each equipment, organize the information of ring, the information that each should comprise by the ring information of this equipment: advance the TE Link interface, go out the TE Link interface.
Behind the inundation of protection type, Time Slot Occupancy situation and the guard ring information of the TE Link more than having had, in whole Routing Area, just can know the protection entity information in the whole zone on each smart machine, promptly obtain to carry out the data basis that route is calculated.
Step 103: source node, destination node and the set of potential next-hop node of obtaining the path of network.
Step 104: the node M that link arrived of from potential next-hop node set, choosing the link cost minimum.
Step 105: judge whether M is NULL (not having node) or destination node.If M is not NULL and neither destination node, then enters step 106, otherwise enter step 108.
Step 106: utilize the path of CSPF (Constraint Shortest Path First) algorithm computation source node, and determine the time slot consistency that this link is chosen, make up SPF (SPF) path by last link to cost minimum node M.Detailed process will be described in detail as shown in Figure 3 in the back.
Step 107: current cost minimum node as source node, and is chosen next cost minimum node M from the set of potential next-hop node, return step 105 then.
Step 108: judge whether M is NULL (not having node).
If then enter step 109: return error message.
If not, then enter step 110: show that the SPF path successfully constructs, at this moment need to recall, determine the time slot consistency of last link by a back link information from the destination node in SPF path.If when promptly dating back to node N, found not determine the sign of link, then determine path and the time slot of N-1 node to the link of N+1 node to the N node by the N node, if can not determine, picked at random path then.
Then, enter step 111: return path information.
With reference to Fig. 3, Fig. 3 shows the detailed process that utilizes the CSPF algorithm to make up the step in SPF path in the inventive method flow process shown in Figure 1:
At first, judge whether matching constraint condition of link that cost minimum node M arrives neighbor node in step 301;
If do not match, then enter step 302, ignore this link;
If coupling then enters step 303, choose this link, and determine the time slot consistency that this link is chosen by last link.Concrete grammar is: (1) then determines the time slot that this link is chosen by last link if this link is the link on the guard ring.If when promptly being the path on the guard ring to the path of the node of putting into the SPF path, when choosing the TE Link of neighbor node, when if the link on same guard ring is arranged, then preferentially choose this link, and choose and a last node between the identical time slot of TE Link; (2), and can't determine time slot that this link chooses by last link the time, then the neighbor node mark is determined the sign of link if link on many guard rings is arranged to neighbor node.That is to say; after node M is put into the SPF path; it has the TE Link that belongs to more than two or two on the different guard rings to certain neighbor node; just two rings or the tangent situation of a plurality of ring are arranged at point-to-point transmission; and be not on certain guard ring, (perhaps to be Linear multiplex section to the link of M node; perhaps this node is exactly a source node); in the time of can't determining to choose the link of which protection entity by the link that arrives the M node; do not carry out concrete link selection, but write down a sign.After SPF path structure is finished, recall to source node from last node again, after running into sign, concrete link and time slot are determined in the path of node from behind, guarantee the time slot consistency (referring to the step 110 of Fig. 1) of guard ring uplink.Below with reference to Fig. 4 to this for example explanation.
Then, enter step 304, neighbor node is put into potential next jumping set, in this process, need to defer to following principle: in the SPF path if neighbor node is then ignored; If neighbor node then relatively arrives the path that neighbor node the old and new path size determines to arrive neighbor node in potential next jumping set; If neighbor node is then put into neighbor node potential next jumping set not in potential next jumping set.
With reference to Fig. 4, Fig. 4 has described an ASON topology schematic diagram: wherein, { 2,3,4,5,6} is a multiplex section ring; { 3,4,8,7} is another multiplex section ring.
Promptly according to the network topology situation shown in this figure, time slot was consistent on the maintenance protection entity ring when step 303 in the above-mentioned flow process shown in Figure 3 was chosen TE Link illustrates below:
Suppose that 1-3,4-9 are Linear multiplex sections.
Calculate 1: 1 protection shortest path of 1-5 if desired.When node 3 joins in the SPF path, can't be determined to 4 link.If select wrong path, when node 4 lost efficacy, business had no idea to obtain the protection of multiplex section ring.After the SPF path successfully constructs, recall from node 5, arrive node 4, utilize link between node 4 and the node 5 to determine link and time slot between node 3 and the node 4.
If calculate 1-9 1: 1 protection shortest path.The 3-4 node path just can picked at random.
In order to make those skilled in the art person understand the present invention better, refer again to the building process that Fig. 4 illustrates SPF path in the inventive method below.Among the figure, 2 MPS rings (multiplex section protective ring) are arranged: 2,3,4,5,6} and 3,4,8,7}.
Suppose between node 1 and the node 2 it is a Linear multiplex section, need to set up from 1 to 8, the protection type is 1: 1 route.Do you extremely scheme below by Fig. 5? describe the building process in SPF path in detail.The representation of binary tree method is used in the SPF path among the figure, and wherein, P represents parent pointer; C represents sub-pointer; S represents fraternal pointer.
1) as shown in Figure 5: node 1 is put into path tree, choose neighbors 2 in potential next jumping set by link simultaneously.Because from 1 to 2 link is a multiplex section, meet 1: 1 protection constraints.
2) as shown in Figure 6: from potential next jumping set, choose 2 and add in the SPF path trees, choose neighbor node simultaneously and put into potential next jumping set.Because the path of arrival node 2 is not the path in the guard ring,, 3,6 nodes are put into potential next jumping set so when choosing link, just there is not the conforming requirement of time slot.Notice that the link that arrives 3,6 nodes this moment is the link on the guard ring.
3) as shown in Figure 7: from potential next jumping set, choose the shortest cost node 6 and put into the SPF path tree, choose neighbor node simultaneously and put into potential next jumping set.Because arrive the road of node 6
The footpath is the path in the guard ring, so the conforming requirement of time slot need be arranged when choosing link, because the link of the link of arrival node 5 and arrival node 6 all belongs to the link on the same guard ring, therefore chooses identical time slot.Node 5 is put into potential next jumping set.
4) as shown in Figure 8: from potential next jumping set, choose the shortest cost node 3 and add in the SPF path trees, choose neighbor node simultaneously and put into potential next jumping set.Because the path of arrival node 3 is the paths in the guard ring, so the conforming requirement of time slot need be arranged when choosing link.Arriving neighbor node 4 has 2 links, must select and the link that arrives on the node 3 same guard rings, and choose time slot identical in the link.4 nodes are put into potential next jumping set.
5) as shown in Figure 9: from potential next jumping set, choose the shortest cost node 4 and put into the SPF path tree, choose neighbor node simultaneously and put into potential next jumping set.Because node 5 is in potential next jumping set, and original route is shorter than from the path of node 4 arrival, so it is constant to keep original route.Because the link of the link of arrival neighbor node 8 and arrival node 4 is not in same guard ring, so there is not the conforming requirement of time slot.Node 4 is put into potential next jumping set.
6) as shown in figure 10: from potential next jumping set, choose the shortest cost node 8 and add in the SPF path trees.Arrive destination node and calculate end.
More than be a general computational process, but also have a kind of special circumstances to need special consideration.If qualified link more than 2 is arranged from a node 1 to neighbors 2, and these links belong in the different guard ring.At this moment need to determine to choose any bar link and arrive node 2 according to the path that arrives node 1, but the link that arrives node 1 is not (such as being Linear multiplex section) on any ring, do not carry out concrete link selection this moment, but after having found destination node by the time, by recalling, determine concrete link selection again from destination node.So just can guarantee to choose the link on the same guard ring, and guarantee the time slot consistency.Figure 11 has described this kind situation.
With reference to Figure 11, Figure 11 is that ASON topological structure shown in Figure 4 makes up the process schematic diagram of determining to choose link in the protection entity in the process of SPF path by backtrack mechanism.Calculating is 5 shortest path (protection in 1: 1) from node 3 to node.
At first select node 3 to be put in the path tree, definite simultaneously neighbor node is put into potential next jumping set, and 2,7 node ratios are easier to determine link, have only a link because arrive 2,7.But arrive node 4 two links are arranged, belong to 2 links on the guard ring respectively, and meet constraints, cost is identical.Can not determine to choose which link, because the SPF path tree through which guard ring, so only make a mark of not determining link at this node, is continued to make up then in the path that can't determine now to arrive destination node by node 4.After structure is finished, recall from destination node.Date back to node 4, find the above-mentioned mark of not determining link, so utilize from node 4 to node 5 path to determine 4 links of selecting on which ring from node 3 to node.If node 3 is chosen mistake to the path of node 4, when node 4 lost efficacy, business just had no idea to be protected.
Though described the present invention by embodiment, those of ordinary skills know, the present invention has many distortion and variation and do not break away from spirit of the present invention, wish that appended claim comprises these distortion and variation and do not break away from spirit of the present invention.
Claims (10)
1, a kind of route method that obtains to have the protection entity in ASON is characterized in that described method comprises step:
Set up different TE Link (flow engineering link) for the data link of difference protection type, have identical protection attribute and the data link that belongs in the identical protection entity is created as same TE Link;
Carry out the inundation of described protection entity information, spread the protection entity information in the whole Routing Area;
According to described protection entity information, obtain to have in the described network path of protection entity.
2, the method for claim 1; it is characterized in that; described data link for different protection types are set up different TE Link (flow engineering link), have identical protection attribute and belong to the step that data link in the identical protection entity is created as same TE Link to comprise: the different attribute according to time slot protection type in the described ASON is set up described different TE Link.
3, method as claimed in claim 2 is characterized in that, the step that described different attribute according to time slot protection type in the described ASON is set up described different TE Link comprises:
To be used for Working service and have corresponding protection link to its TE Link of protecting as protected TE Link;
To be used to protect the TE Link of the TE Link of described protected TE Link as protection;
To be used for Working service and do not have corresponding protection link to its TE Link of protecting as unshielded TE Link.
4, the method for claim 1 is characterized in that, the described inundation that carries out described protection entity information, and the step that spreads the protection entity information in the whole Routing Area comprises step:
Carry out the Link State issue (LSA) of various described different TE Link types, have the protection type and the Time Slot Occupancy information of described TE Link among the described LSA;
Carry out the Link State issue (LSA) of route-type, have protection entity informations different on each smart machine in the described network among the described LSA;
Obtain protection entity information in the whole Routing Area according to different protection entity information on each smart machine in the protection type of above-mentioned TE Link and Time Slot Occupancy information and the described network.
5, method as claimed in claim 4; it is characterized in that protection entity informations different on each smart machine in the described network comprise: interface index that advances TE Link and the interface index that goes out TE Link during the above TE Link of the described smart machine of each guard ring entity process.
6, the method for claim 1 is characterized in that, and is described according to described protection entity information, and the step that obtains to have in the described network path of protection entity comprises:
A, the source node that obtains the path of described network, destination node and the set of potential next-hop node;
B, from described potential next-hop node set, choose the node that link arrived of link cost minimum, utilize the path of the described source node of CSPF (Constraint Shortest Path First) algorithm computation to described cost minimum node, and determine the time slot consistency that this link is chosen by last link, make up SPF (SPF) path;
C, choosing next cost minimum node from described potential next-hop node set, repeat above-mentioned steps b, is described destination node up to described cost minimum node;
After d, described SPF path successfully construct, recall, determine the time slot consistency of last link by a back link information from the destination node in described SPF path.
7, method as claimed in claim 6 is characterized in that, described step b comprises:
Judge whether matching constraint condition of link that described cost minimum node arrives neighbor node;
If do not match, then ignore this link;
If coupling is then chosen this link, and is determined the time slot consistency that this link is chosen by last link;
Described neighbor node is put into described potential next jumping set.
8, method as claimed in claim 7 is characterized in that, if described coupling is then chosen this link, and determines that by last link the conforming step of time slot that this link is chosen comprises:
If described link is the link on the guard ring, then determine the time slot that described link is chosen by last link;
If link on many guard rings is arranged, and can't determine time slot that described link chooses by last link the time, then described neighbor node mark is determined the sign of link to described neighbor node.
9, method as claimed in claim 7 is characterized in that, describedly described neighbor node is put into described potential next step of jumping set comprises:
If described neighbor node is then ignored in described SPF path;
If described neighbor node then relatively arrives the path that described neighbor node the old and new path size determines to arrive described neighbor node in described potential next jumping set;
If described neighbor node is then put into described neighbor node described potential next jumping set not in described potential next jumping set.
10, method as claimed in claim 8 is characterized in that, after the described SPF of described steps d path successfully constructs, recalls from the destination node in described SPF path, and the conforming step of time slot of determining last link by a back link information comprises:
Recall from the destination node in described SPF path,, then determine path and the time slot of its front nodal point to the link of its posterior nodal point to described present node by described present node if present node is marked with the described sign of not determining link; If can not determine, then described its front nodal point of picked at random is to the path of described present node, and its time slot and described present node are consistent to the time slot of the link of its posterior nodal point.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031592104A CN1306738C (en) | 2003-09-02 | 2003-09-02 | Method for obtaining path with protective body in intelligent optical network |
| PCT/CN2004/001009 WO2005022823A1 (en) | 2003-09-02 | 2004-09-01 | A method for achieving a path with protection entity in the intelligent optical network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031592104A CN1306738C (en) | 2003-09-02 | 2003-09-02 | Method for obtaining path with protective body in intelligent optical network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1592160A true CN1592160A (en) | 2005-03-09 |
| CN1306738C CN1306738C (en) | 2007-03-21 |
Family
ID=34240937
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB031592104A Expired - Fee Related CN1306738C (en) | 2003-09-02 | 2003-09-02 | Method for obtaining path with protective body in intelligent optical network |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN1306738C (en) |
| WO (1) | WO2005022823A1 (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007085173A1 (en) * | 2006-01-25 | 2007-08-02 | Huawei Technologies Co., Ltd. | A method for processing network resource, a network unit in an intelligent optical network thereof |
| WO2008040253A1 (en) * | 2006-09-26 | 2008-04-10 | Huawei Technologies Co., Ltd. | A method for processing the resource information of the traffic engineering link |
| CN100382504C (en) * | 2005-07-14 | 2008-04-16 | 广东省电信有限公司研究院 | Cross-over end-to-end connection setting method for main apparatus protection in automatic exchange optical network |
| CN100454848C (en) * | 2007-03-07 | 2009-01-21 | 华为技术有限公司 | Network structure topology layout method and network management device |
| CN101163090B (en) * | 2006-10-09 | 2010-08-04 | 华为技术有限公司 | Service path calculating method |
| CN101145963B (en) * | 2007-07-27 | 2010-08-18 | 中兴通讯股份有限公司 | A topology discovery method of protective sub-network |
| CN101146099B (en) * | 2007-06-12 | 2011-12-28 | 中兴通讯股份有限公司 | Automatic generation and maintenance method for inter-domain routing protocol traffic engineering link |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103647598B (en) * | 2013-11-05 | 2016-01-06 | 国家电网公司 | A kind of communication many hierarchical protection method based on ASON |
| CN111651844B (en) * | 2019-12-04 | 2023-04-11 | 台州学院 | Method for calculating multiple bus paths between two bus stops |
| CN111787436A (en) * | 2020-07-02 | 2020-10-16 | 中国电子科技集团公司第三十四研究所 | Method for automatic searching and planning of optical network communication path |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6515966B1 (en) * | 2000-05-05 | 2003-02-04 | Fujitsu Network Communications, Inc. | System and method for application object transport |
| WO2002082720A2 (en) * | 2001-04-04 | 2002-10-17 | Roke Manor Research Limited | Automated network with tunnels and method of data routing |
-
2003
- 2003-09-02 CN CNB031592104A patent/CN1306738C/en not_active Expired - Fee Related
-
2004
- 2004-09-01 WO PCT/CN2004/001009 patent/WO2005022823A1/en active Application Filing
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100382504C (en) * | 2005-07-14 | 2008-04-16 | 广东省电信有限公司研究院 | Cross-over end-to-end connection setting method for main apparatus protection in automatic exchange optical network |
| WO2007085173A1 (en) * | 2006-01-25 | 2007-08-02 | Huawei Technologies Co., Ltd. | A method for processing network resource, a network unit in an intelligent optical network thereof |
| CN100389578C (en) * | 2006-01-25 | 2008-05-21 | 华为技术有限公司 | Resource distributing method while traditional optical transfer net and intelligent optical network grouping |
| WO2008040253A1 (en) * | 2006-09-26 | 2008-04-10 | Huawei Technologies Co., Ltd. | A method for processing the resource information of the traffic engineering link |
| CN101163090B (en) * | 2006-10-09 | 2010-08-04 | 华为技术有限公司 | Service path calculating method |
| CN100454848C (en) * | 2007-03-07 | 2009-01-21 | 华为技术有限公司 | Network structure topology layout method and network management device |
| CN101146099B (en) * | 2007-06-12 | 2011-12-28 | 中兴通讯股份有限公司 | Automatic generation and maintenance method for inter-domain routing protocol traffic engineering link |
| CN101145963B (en) * | 2007-07-27 | 2010-08-18 | 中兴通讯股份有限公司 | A topology discovery method of protective sub-network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1306738C (en) | 2007-03-21 |
| WO2005022823A1 (en) | 2005-03-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1094008C (en) | Packet routing | |
| CN1300965C (en) | Notifying type dynamic path protection for optical network | |
| CN1309216C (en) | Method for controlling plane participation protective rotation in ASON network | |
| CN1306738C (en) | Method for obtaining path with protective body in intelligent optical network | |
| CN1362813A (en) | General-purpose group frame, program frame transmission apparatus and method | |
| CN1272924C (en) | Method for determining abstract topological link attribute for optical network hierarchical route | |
| CN1635754A (en) | An Ethernet transmission equipment and method having characteristics of rapid protection and fairness | |
| CN103986661B (en) | A kind of multicast route method for supporting network code | |
| CN1254052C (en) | Transmission network restraint path calculating method | |
| CN101420321A (en) | SDH network planning design method for multi-modularized optical fiber | |
| ATE281033T1 (en) | ROUTING OF MANAGEMENT INFORMATION MESSAGES IN A TRANSMISSION NETWORK | |
| CN104486094B (en) | Multicast service leading method based on the amendment of physical topology light tree | |
| CN1661984A (en) | Method for treating multiplexing segments of loop chain in automatic switching optical network | |
| CN1780188A (en) | Multi-rate radio communication system and dynamic code distributing method | |
| CN1503532A (en) | Diffusion method for flow engineering link state | |
| CN1815975A (en) | End-to-end business automatic configurating and restoring method in ASON network | |
| CN1306737C (en) | Method and apparatus for obtaining constrained path of loose routing in intelligent optical network | |
| CN1881914A (en) | Method for managing data service network of MAN | |
| CN101030814A (en) | Method for protecting and restoring packet service channel in ASON network | |
| CN1440163A (en) | Ethernet service enhancing transmission by SDH/SONET net | |
| CN1747432A (en) | Discovery of link type | |
| CN101243723B (en) | Route selecting method for automatic switching optical network multicast service | |
| CN1642123A (en) | Business promoting method based on multi element address for automatic switch optical nework element | |
| CN1187994C (en) | Automatic exchange control method of mixed light network in multiple granularities | |
| CN101051992A (en) | Method for calculating customer layer service soute in multilayer network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20070321 Termination date: 20170902 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |