CN100442753C - Method and system for obtaining cross-domain loose route - Google Patents
Method and system for obtaining cross-domain loose route Download PDFInfo
- Publication number
- CN100442753C CN100442753C CNB2006100578106A CN200610057810A CN100442753C CN 100442753 C CN100442753 C CN 100442753C CN B2006100578106 A CNB2006100578106 A CN B2006100578106A CN 200610057810 A CN200610057810 A CN 200610057810A CN 100442753 C CN100442753 C CN 100442753C
- Authority
- CN
- China
- Prior art keywords
- loose
- route
- resource
- pcs
- domain
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Abstract
The present invention relates to a method and a system for obtaining a cross-domain loose route, which belongs to the technical field of communication. The method comprises the following steps: firstly, the region ID of a loose resource is determined, and the communication address of a route calculating server which belongs to the region is determined; the topology information of an abstract layer is combined with regional actual link information of the loose resource in order to calculate the cross-domain loose route. The present invention realizes that some link resource and node resource in the domain are designated or eliminated when the cross-domain service route is calculated, and thus, specific requirements of a user for service route selection is achieved. The multiple-try calculation of the route is avoided, the information interaction quantity among the route calculating servers are reduced, the calculating efficiency and the calculating reliability of the loose route are greatly improved.
Description
Technical field
The present invention relates to communication technique field, relate in particular to a kind of route Calculation Method and system.
Background technology
The transmission network of future generation that with the ASON is representative is on the basis of conventional optical network, make it have the function of intelligence by introducing control plane, be that optical transfer network can be according to call request, under the guiding of the route of control plane and signaling mechanism, according to user's business need, finish the foundation of transmission line between source end and the destination automatically.
Along with the continuous increase that transmits network size, manage if all network equipments are placed in the single routed domain, will bring problems to route and connection management etc.For adapting to the demand for development of ASON (ASON) routing architecture, in the G.7715 agreement of ITU-T (International Telecommunication Association's one Standardization Sector), defined the notion of layering route, in certain one deck, network can be divided into a plurality of routed domain, and each routed domain can comprise a plurality of littler routed domain.The calculating of service path can repeatedly be calculated by layering and be finished, and the characteristics that the road is calculated in layering are exactly the topology situation that only needs to consider this floor in the path computing of each floor, as shown in Figure 1.
Owing in the layering route, introduced the notion of abstract topology, this just makes and carries out only need considering that corresponding abstract topology gets final product when route is calculated on the upper strata, and the topology of past more lower floor is just more near practical topology, thus Actual path really rule finish at the bottom.
Based on the mechanism that above-mentioned route is calculated, the realization of some demands that cross-domain professional route is calculated then needs particular processing, for example path separation end to end and the loose calculation of cross-domain business road etc.For the loose calculation road of cross-domain business, that is, specify when calculating the road must through or get rid of the particular network resource, mainly reflect the human intervention that the user selects cross-domain service path, to satisfy user's constraint requirements dissimilar to service path.In this regard, at present main consider be DDRP (territory is to the territory Routing Protocol) node must through with eliminating, domain-to-domain link must through and eliminating, in PCE (route computational entity) communication protocol, this type of demand has been described also, but only framework is described among the PCE, does not provide loose scheme and concrete draft.
Loose for resource in each routed domain, comprise node and link, owing to adopted the model of layering route, cross-domain route is calculated and can only be finished in the abstract topology on upper strata, and since in the territory loose resource invisible in abstract topology, cause between the territory, calculating the loose situation in the consideration territory in the road.
At the problems referred to above, prior art one adopts independently layering route Calculation Method, the route of each layer is calculated and is only considered the constraint relevant with this layer routing property, cross-domain route is calculated and is finished on the upper strata, loose route in the territory is calculated and is considered in the route in computational fields that then concrete performing step is as follows:
At first, carry out cross-domain route calculation in the entrance of cross-domain business, abstracting link in the domain-to-domain link of definite professional process and the territory is not considered loose resource constraint in the territory in this calculates, and only loose resource information is carried down.Afterwards, signaling is carried out the road construction operation according to cross-domain route, the pointwise announcement issues intersection, when signaling arrives each regional entrance, need the Actual path in the further computational fields, in computational fields, in the Actual path,, then when calculating, carry out loose processing in the territory if judge it is territory, loose resource place.If loose route is calculated successfully in the territory, signaling is then carried out the road construction operation, gets nowhere if calculate, and then initiates the quick rollback between the territory, selects an other domain-to-domain link to repeat above process, till cross-domain business is set up successfully.
Resource is loose in the layering route computing method realization territory that above-mentioned prior art one adopts, when calculating the road, level of abstraction can't consider the situation of resource in the territory, the path that may cause calculating is not optimum, may make that also route is calculated failure under the situation of resource abundance, reduce efficient and reliability that route is calculated.
Prior art two adopts the method for many PCE, each zone is all to there being a PCE, each PCE only comprises practical topology information in the territory of its corresponding region, and do not comprise other regional topology informations, it is abstract not carry out route layering and link, route calculating for cross-domain business is mainly finished alternately by the topology information between the PCE, utilize many PCE to carry out loose route when calculating, the topology information of non-ingress for service point region is by the PCE in territory, place, entrance link information in other regional PCE ask the territory in this territory, consider the loose problem in these zones in the territory that obtains this territory on the basis of link information, the communication that this computational process is accompanied by between the PCE finishes up to cross-domain path computing.
By above-mentioned narration as can be known, prior art two is not owing to adopt the layering route, do not carry out abstract to practical topology, when calculating, cross-domain route rely between the PCE each regional topology information of exchange to finish fully, make communication PCE between become very frequent through the zone more the time when professional, and mutual amount of information is very big, has reduced efficient and reliability that route is calculated.
Summary of the invention
The object of the present invention is to provide a kind of method and system that obtain the cross-domain loose route, cross-domain loose route computer system based on the path computation service device, utilize the method for abstracting link and physical link splicing to obtain the cross-domain loose route, improved cross-domain loose route calculation efficient, guaranteed in special domain under the loose constraint, make cross-domain service path reach optimum, avoided occurring repeatedly the phenomenon that rollback is attempted calculating.
The objective of the invention is to be achieved through the following technical solutions:
A kind of system that obtains the cross-domain loose route, each zone of abstract topological place layer comprises a path computation service device PCS at least;
Described each PCS has the practical topology information of one's respective area, having the whole network address resolution function converges the node address and the affiliated area ID of one's respective area, between all PCS, announce, make the PCS in territory under the professional start node obtain the physical link information in territory under the loose resource, calculate the cross-domain loose route in conjunction with the topology information of level of abstraction.
Described each PCS carries out nodes records as the information unit of communicating by letter between PCS with the path record alternately.
A kind of method that obtains the cross-domain loose route comprises:
A, definite loose resource region of specifying, and determine the PCS that described zone is affiliated;
B, obtain the loose resource physical link information in described zone by described PCS, the topology information of level of abstraction is in conjunction with the physical link information calculations cross-domain loose route of described loose resource region.
Described step B specifically comprises:
The method of B1, the neighbor node by adding present node is in conjunction with the physical link information calculations cross-domain loose route of loose resource; Or,
The topology information in territory obtains loose resource physical link information under B2, the loose resource of disposable exchange, calculates the cross-domain loose route.
Described step B1 specifically comprises:
B11, present node select adjacent node in the abstract topology as next jumping in path, judge described adjacent node whether with loose resource at the same area;
If not at the same area, then with this adjacent node as present node, return B11;
If at the same area, then carry out B12;
B12, professional start node are by the physical link information in PCS territory under the PCS in territory under the loose resource obtains loose resource in affiliated territory, and abstract topology information is finished the professional route calculation of whole piece in conjunction with the physical link information in territory under the described loose resource.
The method that the PCS in territory obtains loose resource physical link information under the professional start node among the described step B12 specifically comprises:
The PCS in territory asks the physical link information in PCS territory under actual route topological layer gets access to loose resource in territory under the loose resource under the professional start node, sends the PCS in territory under the professional start node to by the information interaction between the PCS.
The physical link information of the described loose resource of obtaining comprises: the nodes records of loose resource and/or all adjacent link records of node of loose resource therewith.
The situation of the loose resource of described appointment comprises: specifying the eliminating specific resources and specify must be through specific resources.
For specifying the situation of getting rid of specific resources, described step B12 specifically comprises:
The PCS of professional start node by affiliated territory asks the PCS in territory under the loose resource to obtain the physical link information in territory under the loose resource, in conjunction with abstract topology information, the loose resource of getting rid of appointment selects next to jump route in residual resource, up to finishing the professional route calculation of whole piece.
Must be for specifying through the situation of specific resources, described step B12 specifically comprises:
B121, professional start node combine with abstract topology information by the physical link information in PCS territory under the loose resource of PCS acquisition request in territory under the loose resource in affiliated territory;
B122, adopt the method for segmentation route, with specify must through loose resource calculate the destination node on road as this section, utilize under the loose resource that above-mentioned PCS obtains the physical link information in territory to calculate the road, up to being routed to this destination node;
B123, with the start node of this destination node as next section route, continue to select next to jump route, up to finishing the professional route calculation of whole piece.
Described B2 specifically comprises:
The PCS in territory is with the complete topological PCS that announces to territory under the professional start node of region under the loose resource, under professional start node among the PCS in territory with the territory between the practical topology of the loose resource of abstract topological sum region temporarily be stitched together, calculate the cross-domain loose route.
Described method is applicable to link abstract models different in the MPLS-TE network, comprising: full-mesh figure, star-like and spanning tree model.
As seen from the above technical solution provided by the invention, the present invention realized when cross-domain professional route is calculated, can specifying must through or get rid of link and node resource in some territory, to reach the particular requirement that the user selects service path.Avoid the repeatedly trial of route to calculate, also reduced the road information interaction amount between the server as calculated, improved efficient and reliability that loose route is calculated greatly.
Description of drawings
Fig. 1 is the hierarchical network model of prior art based on the abstract topology of full-mesh;
Fig. 2 is the loose calculation road network network model based on PCS;
Fig. 3 is an embodiment of the present invention operational flowchart;
Fig. 4 passes by a kind of embodiment schematic diagram of journey for loose calculation in the territory based on PCS.
Embodiment
Core concept of the present invention provides a kind of method and system that obtain the cross-domain loose route, the method of utilizing the topological abstract of level route to combine with PCS (path computation service device), make route calculating fully satisfy the user service path is carried out the requirement of human intervention, and guarantee the global optimum property of path computing under constraint.
The invention provides a kind of system that obtains the cross-domain loose route, present embodiment is that example describes with two-layer route, as shown in Figure 2:
Practical topology place layer is 0 layer, abstract topological place layer is 1 layer, the 1st layer node is called the inter-domain routing node, it is the DDRP node, be responsible for each zone of inundation and be abstracted into the 1st layer topology information, each DDRP node all has the abstract topology information of whole network, but does not understand other regional practical topology information, according to the difference of link abstract model, each zone has a DDRP node at least.In order to carry out loose route when calculating, practical topology in the abstract topological sum territory is combined, must utilize the information interaction between the PCS, to reach the needs that calculate optimal path, each zone comprises a PCS at least, each PCS has the practical topology information in the one's respective area, but does not have other regional practical topology of abstract topological sum of the whole network.PCS can interactive link and nodes records information, nodes records and path are write down the information unit of communicating by letter as PCS, in addition, PCS has the whole network address resolution function, the node address of one's respective area and affiliated converging between all PCS of area I D are announced, and PCS can judge which zone the address of a certain network node belongs to.
The invention provides a kind of method that obtains the cross-domain loose route, when utilizing many PCE to carry out loose route calculating, the topology information of the first node of non-business region is by the PCE in territory, first node place link information in other regional PCE ask the territory in this territory, consider the loose problem in these zones in the territory that obtains this territory on the basis of link information, the communication that this computational process is accompanied by between the PCE finishes up to cross-domain path computing.
Obtain a kind of embodiment of cross-domain loose route such as Fig. 3, specifically comprise the steps:
Step 1: service originating point computing service path judges whether to exist loose setting;
If there is no loose setting, then execution in step 2, carry out the calculating of inter-domain path by the DDRP node, that is, and normal cross-domain calculation road;
If there is loose setting, then execution in step 3 startups are based on the loose calculation road mechanism of PCS;
Step 4: add the neighbor node of present node, and initiate loose resource Location Request, determine the ID of loose resource region, determine the mailing address of the affiliated PCS in this zone simultaneously to this territory PCS;
Carry out routing algorithm at service originating point based on the abstract topology of the 1st layer of the whole network in the DDRP node, in algorithm, generate optimal path by the neighbor node that adds present node;
Step 5: in adding the process of neighbor node, to this territory PCS request judge the node that adds whether with loose resource in same zone;
Step 6: if neighbor node that adds and loose resource be not at the same area, then continue to use the algorithm of carrying out shortest path in the 1st layer of abstract topology, continue to add optimum adjacent node and jump the path, return step 4 as next, repeat this process, calculate up to the route of whole piece business and finish;
Step 7: if neighbor node that judgement is added and loose resource are in same zone, then notify this territory PCS to ask the physical link information of this node, in response message, comprise the nodes records of this node and all adjacent link records of node therewith to the PCS in this territory, node place;
Step 8: the information interaction of the adjacent link of this node record by PCS is temporarily stored in the topological database of first node, and and the 1st layer of abstract topological combination, make and when searching the neighbor node of next node, use actual link information;
For specifying the eliminating resource in loose to calculate the road and must calculate the road, be divided into two kinds of situations and handle through resource.When needs are got rid of certain territory interior nodes or link, execution in step 9; When needs must be through certain territory interior nodes or link, execution in step 10;
Step 9: practical topology carries out getting rid of in the route calculation process the loose resource of appointment in the territory that obtains in conjunction with PCS, in residual resource, select optimal path, optimal node in the selection present node neighbor node forwards step 5 to as next jumping of path, continues operation;
Step 10: will specify must through node or link calculate the destination node on road as this section, utilize in the territory that PCS obtains Actual path to calculate the road, arrive this destination node up to route, and then with the start node of this node as next section route, repeated execution of steps 5 is calculated up to the route of whole piece business and to be finished.
Describe with instantiation below, as Fig. 4, if in the topology of Fig. 4, set up a cross-domain business, professional first node is the BN1 among 1 (CD1) of zone, professional end-node be the BN10 among regional 3 (CD3), and the non-DDRP node N21 in appointed area 2 (CD2) be cross-domain business must be through node.
At first, the BN1 node is to loose resource position, this territory PCS 1 request location, PCS 1 by and PCS2 and PCS3 between the exchange this domain node address list, orient N21 in CD2, BN1 begins to carry out calculation road algorithm construction path tree in its abstract topological database, N21 is temporary transient as the destination node of calculating the road, then the neighbor node BN3 that it is optimum is added into next jumping in path, and judge that by PCS 1 this node is not in CD2, continue to add the optimum neighbor node of BN3, when BN5 is added the inbound path tree as next jumping, PCS1 predicate node BN5 belongs to CD2, belong to same zone with loose nodes N21, this moment BN1 by PCS1 to the actual adjacent link information of PCS2 requesting node BN5 at the 0th layer, after the adjacent link information that obtains BN5, BN1 splices the link information in this physical link information and the abstract topological database, obtained the topological data of BN1 as shown in Figure 3, on the basis of this information, continue to add the optimum neighbor node of BN5 according to algorithm, be added in the path tree up to N21, and by the actual adjacent link information of PCS1 to PCS2 request N21, because N21 is the destination node in this stage, the calculating of phase I finishes.The path is recorded in the database, be that the first node of calculating the road next stage continues to search next jumping of path then with N21, because N21 is in CD2, so each step in CD2 calculates all will be by PCS1 to the actual link information of PCS2 request, be added in the path tree up to BN8, PCS1 judges this node not in CD2, then directly uses the information in the abstract topological database to calculate, and repeats above step till arriving business purpose Node B N10.
For the loose calculating of getting rid of resource in the territory, the implementation of algorithm roughly with described above must be roughly the same through the process on the loose calculation of resource road, be that whole cross-domain route calculation process does not need to finish stage by stage, but calculating eliminating node region, and by PCS1 in PCS2 request CD2 part territory after the link information, refusal adds the node or the link of designated eliminating in next jumping that adds paths, and repeats this process till arriving business purpose Node B N10.
In the aforesaid operations process, also can adopt the method for topology information in the disposable switching domain, when there is loose setting in step 1 judgement, can the complete topology of loose resource region be announced to the PCS under the first node by PCS, and in this PCS with the territory between the practical topology of the loose resource of abstract topological sum region temporarily be stitched together, utilize constraint to calculate the road algorithm then and once finish the calculation road at first node, this kind way is identical with such scheme in essence, just the mode difference of topology information in the PCS interaction area.
This programme is applicable to the different link abstract models in the MPLS-TE network, as full-mesh figure, star-like or spanning tree etc.
In sum, the method that the present invention utilizes the topological abstract of level route to combine with PCS makes route calculating fully satisfy the user service path is carried out the requirement of human intervention, and guarantees the global optimum property of path computing under constraint.Realized when cross-domain professional route is calculated, can specifying must through or get rid of link and node resource in some territory, to reach the particular requirement that the user selects service path.Avoid the repeatedly trial of route to calculate, also reduced the road information interaction amount between the server as calculated, improved efficient and reliability that loose route is calculated greatly.This programme is equally applicable to general MPLS-TE network.
The above; only for the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, and anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; the variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of claim.
Claims (12)
1, a kind of system that obtains the cross-domain loose route is characterized in that, each zone of abstract topological place layer comprises a path computation service device PCS at least;
Described each PCS has the practical topology information of one's respective area, having the whole network address resolution function converges the node address and the affiliated area ID of one's respective area, between all PCS, announce, make the PCS in territory under the professional start node obtain the physical link information in territory under the loose resource, calculate the cross-domain loose route in conjunction with the topology information of level of abstraction.
2, a kind of system that obtains the cross-domain loose route as claimed in claim 1 is characterized in that, described each PCS carries out nodes records as the information unit of communicating by letter between PCS with the path record alternately.
3, a kind of method that obtains the cross-domain loose route is characterized in that, comprising:
A, definite loose resource region of specifying, and determine the PCS that described zone is affiliated;
B, obtain the loose resource physical link information in described zone by described PCS, the topology information of level of abstraction is in conjunction with the physical link information calculations cross-domain loose route of described loose resource region.
4, a kind of method that obtains the cross-domain loose route as claimed in claim 3 is characterized in that described step B specifically comprises:
The method of B1, the neighbor node by adding present node is in conjunction with the physical link information calculations cross-domain loose route of loose resource; Or,
The topology information in territory obtains loose resource physical link information under B2, the loose resource of disposable exchange, calculates the cross-domain loose route.
5, a kind of method that obtains the cross-domain loose route as claimed in claim 4 is characterized in that described step B1 specifically comprises:
B11, present node select adjacent node in the abstract topology as next jumping in path, judge described adjacent node whether with loose resource at the same area;
If not at the same area, then with this adjacent node as present node, return B11;
If at the same area, then carry out B12;
B12, professional start node are by the physical link information in PCS territory under the PCS in territory under the loose resource obtains loose resource in affiliated territory, and abstract topology information is finished the professional route calculation of whole piece in conjunction with the physical link information in territory under the described loose resource.
6, a kind of method that obtains the cross-domain loose route as claimed in claim 5 is characterized in that, the method that the PCS in territory obtains loose resource physical link information under the professional start node among the described step B12 specifically comprises:
The PCS in territory asks the physical link information in PCS territory under actual route topological layer gets access to loose resource in territory under the loose resource under the professional start node, sends the PCS in territory under the professional start node to by the information interaction between the PCS.
7, as each described a kind of method that obtains the cross-domain loose route in the claim 3 to 6, it is characterized in that the physical link information of the described loose resource of obtaining comprises: the nodes records of loose resource and/or all adjacent link records of node of loose resource therewith.
8, a kind of method that obtains the cross-domain loose route as claimed in claim 3 is characterized in that, the situation of the loose resource of described appointment comprises: specifying the eliminating specific resources and specify must be through specific resources.
9, a kind of method that obtains the cross-domain loose route as claimed in claim 8 is characterized in that, for specifying the situation of getting rid of specific resources, described step B12 specifically comprises:
The PCS of professional start node by affiliated territory asks the PCS in territory under the loose resource to obtain the physical link information in territory under the loose resource, in conjunction with abstract topology information, the loose resource of getting rid of appointment selects next to jump route in residual resource, up to finishing the professional route calculation of whole piece.
10, a kind of method that obtains the cross-domain loose route as claimed in claim 8 is characterized in that, must be for specifying through the situation of specific resources, and described step B12 specifically comprises:
B121, professional start node combine with abstract topology information by the physical link information in PCS territory under the loose resource of PCS acquisition request in territory under the loose resource in affiliated territory;
B122, adopt the method for segmentation route, with specify must through loose resource calculate the destination node on road as this section, utilize under the loose resource that above-mentioned PCS obtains the physical link information in territory to calculate the road, up to being routed to this destination node;
B123, with the start node of this destination node as next section route, continue to select next to jump route, up to finishing the professional route calculation of whole piece.
11, a kind of method that obtains the cross-domain loose route as claimed in claim 4 is characterized in that described B2 specifically comprises:
The PCS in territory is with the complete topological PCS that announces to territory under the professional start node of region under the loose resource, under professional start node among the PCS in territory with the territory between the practical topology of the loose resource of abstract topological sum region temporarily be stitched together, calculate the cross-domain loose route.
12, a kind of method that obtains the cross-domain loose route as claimed in claim 3 is characterized in that, described method is applicable to link abstract models different in the MPLS-TE network, comprising: full-mesh figure, star-like and spanning tree model.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100578106A CN100442753C (en) | 2006-02-27 | 2006-02-27 | Method and system for obtaining cross-domain loose route |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100578106A CN100442753C (en) | 2006-02-27 | 2006-02-27 | Method and system for obtaining cross-domain loose route |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1866902A CN1866902A (en) | 2006-11-22 |
| CN100442753C true CN100442753C (en) | 2008-12-10 |
Family
ID=37425791
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100578106A Expired - Fee Related CN100442753C (en) | 2006-02-27 | 2006-02-27 | Method and system for obtaining cross-domain loose route |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100442753C (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109996131A (en) * | 2019-03-11 | 2019-07-09 | 烽火通信科技股份有限公司 | A kind of route restriction pre-computation methods and system based on control plane resource |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107566268B (en) * | 2016-06-30 | 2021-08-17 | 中兴通讯股份有限公司 | Method and device for acquiring Ethernet path |
| CN109495385B (en) * | 2018-12-04 | 2021-06-18 | 安徽皖兴通信息技术有限公司 | Network flow scheduling method for realizing discontinuous segmented routing domain |
| CN111817959A (en) * | 2020-07-16 | 2020-10-23 | 迈普通信技术股份有限公司 | Network path management method and device, SDN controller and readable storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040215787A1 (en) * | 1999-10-01 | 2004-10-28 | Gibson Mark Robert | Establishing connections across a communications network |
| CN1547362A (en) * | 2003-12-09 | 2004-11-17 | 上海交通大学 | Method for multi-ring interconnection transmission of resilient packet ring network |
| CN1592159A (en) * | 2003-08-29 | 2005-03-09 | 华为技术有限公司 | Method and apparatus for obtaining constrained path of loose routing in intelligent optical network |
| CN1707978A (en) * | 2004-06-11 | 2005-12-14 | 华为技术有限公司 | Method and apparatus for obtaining constrained path of loose routing in intelligent optical network |
-
2006
- 2006-02-27 CN CNB2006100578106A patent/CN100442753C/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040215787A1 (en) * | 1999-10-01 | 2004-10-28 | Gibson Mark Robert | Establishing connections across a communications network |
| CN1592159A (en) * | 2003-08-29 | 2005-03-09 | 华为技术有限公司 | Method and apparatus for obtaining constrained path of loose routing in intelligent optical network |
| CN1547362A (en) * | 2003-12-09 | 2004-11-17 | 上海交通大学 | Method for multi-ring interconnection transmission of resilient packet ring network |
| CN1707978A (en) * | 2004-06-11 | 2005-12-14 | 华为技术有限公司 | Method and apparatus for obtaining constrained path of loose routing in intelligent optical network |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109996131A (en) * | 2019-03-11 | 2019-07-09 | 烽火通信科技股份有限公司 | A kind of route restriction pre-computation methods and system based on control plane resource |
| CN109996131B (en) * | 2019-03-11 | 2021-06-29 | 烽火通信科技股份有限公司 | Routing constraint pre-calculation method and system based on control plane resources |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1866902A (en) | 2006-11-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8082335B2 (en) | Method and system for telecommunications network planning and management | |
| Laporte et al. | Designing robust rapid transit networks with alternative routes | |
| US8897641B2 (en) | Reachability matrices spanning multiple domains in an optical network | |
| JP4837765B2 (en) | Resource management and recursive route calculation method and apparatus necessary for multi-tier resource transfer network route calculation | |
| CN101822003A (en) | Path management control method, path management control program, path management control device and path management control system | |
| CN106302153A (en) | Multiple domain controller, single domain controller, software definition optical network system and method | |
| US8964738B2 (en) | Path computation element protocol support for large-scale concurrent path computation | |
| CN114070854B (en) | Method, system, equipment and medium for sensing and routing calculation force in calculation force network | |
| CN102714621A (en) | Providing feedback to path computation element | |
| CN100583798C (en) | Method and system for multi-domain virtual private network configuration | |
| CN100442753C (en) | Method and system for obtaining cross-domain loose route | |
| CN105007220B (en) | Inter-domain routing manages system, method, field adapter and transmission network | |
| CN107465615B (en) | Routing determination method based on layered multi-domain and controller | |
| US10237202B2 (en) | Network control device, network control method, and recording medium for program | |
| CN103795628A (en) | Provider link state bridging (PLSB) computation method | |
| CN101616073B (en) | Telecommunications system and server apparatus | |
| CN109995580A (en) | VN mapping method based on GA_PSO hybrid algorithm in 5G network slice | |
| CN102136998B (en) | Traffic engineering and server selection joint optimization method, system and related equipment | |
| CN109565468A (en) | Determine the path in communication network | |
| CN105072037A (en) | Dynamic flow generating method for distributed SDN controllers | |
| CN105049222B (en) | For realizing the methods, devices and systems of transmission network inter domain management | |
| US8570875B2 (en) | Determining collocations with an access transport management system (ATMS) | |
| CN106453077A (en) | Tiered routing management method, master controller, subdomain controller and SDN | |
| Gordijn et al. | Generating service value webs by hierarchical configuration: A case in intellectual property rights clearing | |
| CN115695202A (en) | Network detection method, device, equipment and readable storage medium |
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: 20081210 Termination date: 20190227 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |