CN102014073A - Polymerization method of multi-domain optical network topology - Google Patents
Polymerization method of multi-domain optical network topology Download PDFInfo
- Publication number
- CN102014073A CN102014073A CN2010106003128A CN201010600312A CN102014073A CN 102014073 A CN102014073 A CN 102014073A CN 2010106003128 A CN2010106003128 A CN 2010106003128A CN 201010600312 A CN201010600312 A CN 201010600312A CN 102014073 A CN102014073 A CN 102014073A
- Authority
- CN
- China
- Prior art keywords
- domain
- topology
- territory
- link
- cost
- 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
Abstract
The invention discloses a polymerization method of a multi-domain optical network topology. Firstly, a full connection abstract mode is utilized to obtain a full connection topology, and on the basis of the full connection topology, the peaks and edges of a polymer topology are obtained through a link-boundary node conversion mechanism; and secondly, the peaks of the polymer topology are named by using a mode of boundary node ID of domain ID + boundary node ID of domain ID, the link state is mapped on the basis, and the peak cost and edge cost calculation is performed in a father path communication element (PCE) to obtain the peak cost of the peaks and the edge cost of the edges of the polymer topology, thereby polymerizing a multi-domain optical network topology to a single-domain network so as to complete the multi-domain process in one network and effectively simplify the processing procedure of the PEC. Meanwhile, as the link states in domains and among domains are considered for the polymer topology, the calculated paths are ensured in the aspect of optimization.
Description
Technical field
The invention belongs to networking technology area, more specifically say, relate to a kind of under layering PCE framework, the polymerization of multiple domain optical-fiber network topology.
Background technology
Along with fast development of information technology, various novel business such as video request program, videoconference, broadband are rented etc. and to be continued to bring out.This has also brought it has been transmitted the higher requirement of network when providing bright prospects for internet development.Because the unpredictability of novel business makes traditional static network be difficult to satisfy the demand of business development.
International Telecommunications Union (ITU-T) transmits network with the whole world that ASON (Automatically Switched Optical Network is called for short ASON) is positioned a new generation.The problem of route and management between the thousands of when the time comes equipment will produce great challenge to the control plane technology of ASON especially route technology.Manage if all-network equipment all is placed in the routed domain, each node all needs to safeguard a huge routing database, the renewal of these information and safeguard and will bring white elephant to signaling network.Therefore, the extensibility of single domain network, flexibility all is the problem of a sternness, the multiple domain selection that is inevitable.
ITU-T has proposed the multiple domain layered architecture in calendar year 2001, the network configuration of multiple domain layering makes operator can shield interior details, network configuration in the territory, route and signaling can independently be set simultaneously to be realized, and do not influence other territory, the fault of network is also isolated mutually, thus the reliability and the fail safe that have improved network.In the multiple domain optical-fiber network, each routed domain of the autgmentability of network and security requirement mutual link-state information be selectable.Therefore, each territory must take certain mechanism that the routing iinformation in this territory is compressed arrangement, and the routing iinformation after the compression is distributed to the foundation that calculate as route in other territories.2006, Q Liu, MA Kok, people such as N Ghani have proposed topological abstract mode in three kinds of territories, and wherein full ways of connecting can reduce the domain-to-domain link blocking rate effectively.
In large-scale, multiple domain, multilayer optical-fiber network, the route amount is very huge; Owing to the desired various restrictive conditions of service quality (QoS), it is very complicated that path computing will become simultaneously.And when a large amount of cpu resources apply in the path computing, the stability and the stablizing of whole network of the network equipment have all been caused certain impact.In order to address this problem, IETF has proposed based on the path-calculating element framework of (Path Computation Element is called for short PCE).PCE is an entity of being responsible for path computing in the network specially, and it is based on known network topology structure and constraints, calculates an optimal path that satisfies constraints according to the request of path computing client (Path Computation Client is called for short PCC).Communicate by letter by special path computation protocols (PCE Communication Protocol is called for short PCEP) between PCC and the PCE and between PCE and the PCE, submit to path computing request also to obtain the path computing result.
In path computing, the calculating in cross-domain path is a very crucial problem.IETF has proposed the framework of layering PCE, and in this framework, the calculating in cross-domain path is finished by father PCE.Father PCE safeguards whole topology of networks, comprises abstracted information and domain-to-domain link state information in the territory that each subdomain submits to.In the draft " draft-king-pce-hierarchy-fwk-04.txt " of definition layering PCE, the calculating in cross-domain path is divided into two processes: at first, determine the path the order in territory of process, i.e. territory sequence; Secondly, according to fixed territory sequence, utilize backward recursive BRPC (Backward Recursive PCE-basedComputation) algorithm or other concrete paths of follow-on algorithm computation.
As the basis of cross-domain path computing, the selection of territory sequence has decisive influence for path computing, has caused a lot of people's concern.Luca Buzzi, people such as Matteo Conforto Bardellini have proposed a kind of with different levels path calculation method, however this method is not considered Link State in the territory on the determining of territory sequence, can cause the non-optimization in last path; Xin Wan, people such as Yue Chen have proposed a kind of dynamic territory sequence and have determined method, the link abstract in the territory, link matches and obtains the territory sequence between same area, but need close fit between each PCE, can increase the burden of each PCE, to such an extent as to PCE traffic load (PCEcommunication traffic load) is excessive.
In the world about the scheme of cross-domain path computing, be the flow process that adopts " determine the territory sequence earlier, utilize the BRPC algorithm again " basically at present.And in this process, there are above-mentioned many deficiencies in territory sequence problem identificatioin.This mainly is because this cross-domain path processing procedure is based on the topological structure of multiple domain, that is to say, is separate between each territory logically, thereby can not comprehensive understanding be arranged to whole multiple-domain network.
Summary of the invention
The objective of the invention is to overcome the deficiencies in the prior art, a kind of polymerization of multiple domain optical-fiber network topology is provided, be single domain network with the topology aggregation of multiple domain optical-fiber network, thereby the processing of multiple domain optical-fiber network can be finished a network internal.
For achieving the above object, the polymerization of multiple domain optical-fiber network topology of the present invention may further comprise the steps:
(1), connect entirely abstract
In the multiple domain optical-fiber network, with the abstract information that becomes between this territory boundary node of the link-state information in each territory, territory, adopt full ways of connecting to link to each other between each territory boundary node, father PCE will obtain information between the boundary node and the full connection situation of each territory boundary node gathers, and obtain the full connection topology of multiple domain optical-fiber network;
(2), link-boundary node transforms
In father PCE, the domain-to-domain link and two the associated boundary nodes of domain-to-domain link that connect adjacent domains in the topology entirely are converted into a point, corresponding to a summit of polymerization topology, connect the limit that link in the territory of boundary node in the topology is converted into the polymerization topology entirely;
(3), name
In father PCE, adopt the mode of ID boundary node ID+ territory, territory ID boundary node ID that the summit of polymerization topology is named,
(4), Link State mapping
In father PCE, carry out summit cost and limit cost and calculate
A, summit cost
The domain-to-domain link cost that connects topology is entirely composed to corresponding summit, as the summit cost;
B, limit cost
If the territory ID on two summits that the limit of b1 polymerization topology is associated is inequality fully, then the cost of this edge is+∞;
If the territory ID on two summits that the limit of b2 polymerization topology is associated have one identical, then:
1., when the boundary node ID of same domain ID is also identical, the limit cost is 0;
2., when the boundary node ID of same domain ID is inequality, the limit cost is the link cost between two boundary nodes of same domain, finds from the sub-PCE of same domain submits to the information of father PCE;
If the territory ID on two summits that the limit of b3 polymerization topology is associated is identical, then:
1., when the boundary node ID of same domain ID is also identical, the limit cost is 0;
2., the boundary node ID of one of them same domain ID not simultaneously, the cost on limit is made as+∞.
Goal of the invention of the present invention is achieved in that
At first adopt Q Liu, MA Kok, people such as N Ghani propose the complete abstract mode that connects in " Application of topology abstraction techniques in multi-domain optical networks ", obtain a full topology that connects, and on the basis of full connection topology, by " link-boundary node transforms " mechanism, obtain the summit and the limit of polymerization topology.Then, adopt the mode of ID boundary node ID+ territory, territory ID boundary node ID that the summit of polymerization topology is named, and carry out Link State mapping on this basis, in father PCE, carry out summit cost and limit cost and calculate, obtain the summit cost on each summit of polymerization topology and the limit cost of Ge Bian, thereby be a single domain network multiple domain optical-fiber network topology aggregation, thereby the processing of multiple domain can be finished a network internal, and simplified the processing procedure of PCE effectively.Because the polymerization topology has been considered the link circuit condition in the territory and between the territory, the path that calculates has also obtained guarantee aspect optimization simultaneously.
Description of drawings
Fig. 1 is the topological diagram of a multiple domain optical-fiber network;
Fig. 2 is the full connection topological diagram of multiple domain optical-fiber network shown in Figure 1;
Fig. 3 is the polymerization topological diagram of multiple domain optical-fiber network shown in Figure 1;
Fig. 4 is a Link State mapping flow chart;
Fig. 5 is a CERNET backbone network topological diagram;
Fig. 6 is the full connection topological sum polymerization topological diagram of CERNET;
Fig. 7 is the request topology of CERNET;
Fig. 8 is based on the cross-domain path computing flow chart that the polymerization topology among the present invention is carried out.
Embodiment
Below in conjunction with accompanying drawing the specific embodiment of the present invention is described, so that those skilled in the art understands the present invention better.What need point out especially is that in the following description, when perhaps the detailed description of known function and design can desalinate main contents of the present invention, these were described in here and will be left in the basket.
Embodiment
Below in conjunction with embodiment, just each step in the polymerization of multiple domain optical-fiber network topology of the present invention describes:
One, connect entirely abstract
Full connection is abstract, is meant the abstract information that becomes between the boundary node of the link-state information in the territory, wherein adopts full ways of connecting to link to each other between the boundary node.This abstract mode can provide link information in the comparatively complete territory, can reduce the blocking rate of domain-to-domain link effectively.Transform details as shown in Figure 1, 2.
Fig. 1 is the topological diagram of a multiple domain optical-fiber network.As shown in Figure 1, in the present embodiment, the multiple domain optical-fiber network comprises A, B, four territories of C, D, and wherein the A territory has four boundary nodes, B territory to have two boundary nodes, C territory to have three boundary nodes, D territory that a boundary node is arranged.According to the framework requirement of layering PCE, a sub-PCE is arranged in each territory, be responsible for maintenance field internal state information as the PCE A～D among the figure, connection request in the processing domain; Have a father PCE to be associated with the sub-PCE in each territory in addition, as shown in phantom in Figure 1, the topology information of being responsible for each sub-PCE is uploaded gathers, and handles cross-domain connection request.
Fig. 2 is the full connection topological diagram of multiple domain optical-fiber network shown in Figure 1.
In the present embodiment, the domain-to-domain link of being represented by heavy line between the adjacent domains links to each other, and the cost of domain-to-domain link is by the online other mark of boldface type.Wherein there are four boundary nodes in the A territory, and A1-4 represents with label, and as shown in phantom in Figure 2, link is through connecting abstract four virtual links that dot that become entirely in the territory in A territory, and the cost of every virtual link marks on the dotted line next door.The method for expressing in B～D territory is identical with the A territory in addition.
This polymerization procedure carries out in each inside, territory, the PCE in each territory, be that sub-PCE utilizes link-state algorithm, calculate the shortest path cost between each boundary node in this territory, obtain a boundary node and count the * boundary node and count the Critical Matrices storage of size and be submitted to father PCE as Dijkstra.Father PCE will obtain information between the boundary node and the full connection situation of each territory boundary node gathers, and obtain the full connection topology of multiple domain optical-fiber network as shown in Figure 2.But under the abstract model of this full connection, network remains the set of a plurality of subnets, still has the some shortcomings of introducing in the background technology aspect domain-to-domain link calculating.Invent a kind of " link-boundary node transforms " mechanism in the present invention, multiple-domain network can be converted into single domain network.
Two, link-boundary node transforms
1, domain-to-domain link and two the associated boundary nodes of domain-to-domain link that connect adjacent domains in the topology entirely are converted into a point.This point has comprised a pair of boundary node and a domain-to-domain link, corresponding to a summit of polymerization topology, as the black circle mark among Fig. 3.
In Fig. 3, the link between the boundary node 1 in A territory and the boundary node 1 in B territory is through transforming the summit A1B1 that just becomes in the polymerization topology.
2, connect the limit that is converted into the polymerization topology in the topology through link in the abstract territory entirely.Connection status according to the boundary node in each territory in the multiple domain optical-fiber network couples together the summit in the polymerization topology.
In Fig. 3, the connection status in the polymerization topology between summit A1B1 and the summit A4C3 is corresponding to the connection status between the A territory boundary node 1 and 4 in the full connection topology; Being that summit A1B1 just equals corresponding to being connected the link cost between the A territory boundary node 1 and 4 in the topology entirely with link cost between the A4C3 of summit in the polymerization topology, is 2.
This step is carried out in father PCE, and father PCE is according to the connection situation in each territory, becomes a summit with every domain-to-domain link is abstract.As shown in Figure 3, in the present embodiment, 6 summits are arranged.
Three, name
Because two boundary nodes and a domain-to-domain link in the multiple domain optical-fiber network topology are represented in a summit in the polymerization topology, need to introduce a kind of more complete naming mechanism here and distinguish each summit and represent the content that each summit comprises.
In the present invention, the method that adopts " ID boundary node ID+ territory, territory ID boundary node ID " to combine.Because the full boundary node that connects topology belongs to different territories, so IncFlds ID and boundary node ID are answered in the statement of the boundary node in each territory; Owing to each summit in the polymerization topology has comprised complete two boundary nodes that connect topology, corresponding, the name on summit just should comprise this two boundary nodes in the polymerization topology simultaneously.
In Fig. 3, the link between the boundary node 1 in boundary node 1 and the B territory in the A territory, the summit called after A1B1 of correspondence in the polymerization topology.
This naming mechanism not only can be represented the implication on each summit comparatively completely, and mapping also has important effect for link-state information.
This step is carried out in father PCE equally, and father PCE is according to the territory ID and the boundary node ID on the summit of every domain-to-domain link association, for naming on six summits that the last step transforms out.
Four, Link State mapping
Because the full link in domain-to-domain link in the topology and the territory that is connected has been represented on summit in the polymerization topology and limit respectively, defines two kinds of link costs in the present invention, i.e. summit cost and limit cost.Fig. 3 is the polymerization topology after the polymerization, and the summit in the polymerization topology is represented with the black circle mark, summit cost black matrix numeral, and the limit represents that with solid line the limit cost is illustrated in the solid line next door.
1, summit cost
In the polymerization topology, a summit has comprised complete a pair of boundary node and domain-to-domain link that connects topology.Therefore, the domain-to-domain link cost that connects topology is entirely composed to corresponding summit in the polymerization topology.
The domain-to-domain link that has six heavy lines to represent in the full connection topology of Fig. 2, link cost is respectively 1-6.The summit that six black circles are arranged in the polymerization topology of Fig. 3, six domain-to-domain links in the corresponding diagram 2 respectively.Domain-to-domain link cost among Fig. 2 just is endowed six summits in 3, becomes the summit cost of polymerization topology.
2, limit cost
Link in the abstract territory has been represented on limit in the polymerization topology, gets final product so only need compose link cost in the corresponding territory to limit in the polymerization topology.We represent every limit with the summit to (), carry out the Link State mapping in conjunction with above-mentioned naming mechanism, and concrete mapping process can be divided into three kinds of situations:
(1), the territory ID on associated two summits, limit is inequality fully, in the present embodiment, as (A*B*, C*D*).In this case, four boundary nodes of two domain-to-domain link associations belong to four different territories, do not have in the direct territory link link to each other between wantonly one or two boundary node, so the cost of this edge are+∞.
In Fig. 3, if solid line of no use links to each other between two summits, then to represent not have link in the abstract field that directly links to each other between these two summits, cost is+∞.
(2), the territory ID on associated two summits, limit have one identical, in the present embodiment, as (A*Bm, BnC*).The similarities and differences according to the boundary node ID of same domain ID can be divided into two kinds of subcases again:
1., the same domain node ID is identical, i.e. m=n, these two domain-to-domain links are direct-connected so, link in the territory is so the limit cost is 0;
As (A2B2 among Fig. 3, B2C1) and (A3C1, B2C1) path represented in Fig. 2, these two limits is respectively (boundary node 2-C territory, boundary node 2-B territory, A territory boundary node 1) and (boundary node 1-B territory, boundary node 3-C territory, A territory boundary node 3), directly link to each other by domain-to-domain link, the cost on these two limits need not through link in the territory, so should be made as 0
2., the border ID of same domain ID is inequality, in the present embodiment promptly, m ≠ n, these two domain-to-domain links are linked to each other by link in the territory so, the cost of this edge is the link cost between B territory inner boundary node m and the n just, can find from sub-PCE submits to the information of father PCE.
Is exactly to be connected the abstracting link cost between the A territory boundary node 1 and 3 in the topology entirely as summit A1B1 among Fig. 3 with link cost between the A3C1 of summit, can from submitting to the information of father PCE, PCE-A find, and be 4
(3), the territory ID on associated two summits, limit is identical, as (A*B*, A*B*).Whether identical according to boundary node ID, can be divided into two kinds of situations again:
1., when the boundary node ID of same domain ID is also identical, be same summit obviously, in adjacency matrix, the cost between summit and he itself is generally 0;
In Fig. 3, obviously, each summit and his the limit cost of self are 0;
The boundary node ID difference that 2. a same domain ID is arranged, perhaps the boundary node ID of two same domain ID is all different.In this case, the limit is represented is loop between two domain-to-domain links of two adjacent domains, shown in two loopbacks among Fig. 2.This situation is a kind of insignificant loop in the actual calculation process, should avoid occurring this loop.So the cost on limit should be made as+∞.
As the loopback between domain-to-domain link A1B1 and the A2B2 among Fig. 2, and the loopback between A3C1 and the A4C3, in Fig. 3, being illustrated by the broken lines, link cost is+∞.
Fig. 4 is a Link State mapping flow chart.
For the link cost mapping process is described better, provided Link State mapping flow chart at this, its step does not repeat them here as previously mentioned.
Father PCE is according to this flow process, and each territory that utilizes sub-PCE to submit connects link information between abstracted information and territory entirely, calculates the link cost between each summit in the polymerization topology, forms the adjacency matrix of polymerization topology.
Through top four steps, we can be reduced to single domain network with a multiple domain optical-fiber network, and the cross-domain path computing request in the multiple domain optical-fiber network just can be carried out in single domain network.But in the polymerization topology that polymerization obtains, multiple domain optical-fiber network domain-to-domain link cost is converted into the summit cost, and traditional link-state algorithm can not be handled the computation requests that has the node cost as dijkstra's algorithm.We need do a bit little change to dijkstra's algorithm:
In the link-state algorithm implementation process, when certain node is traversed, except connecting the link cost of this node, the summit cost at the place of this node is added in total cost in the lump.Concrete change is as follows:
False code the tenth five-element as implied above add the blackboard branch, and promptly "+cost[v] " for changing part.Dijkstra's algorithm belongs to prior art, does not repeat them here.
After the polymerization topology that father PCE obtains shining upon through link cost, just can utilize the dijkstra's algorithm of change to handle cross-domain connection request, concrete steps are as follows:
One, generates the request topology
When father PCE receives cross-domain path computing request from sub-PCE,, on the polymerization topology, add source node and destination node according to the territory, source in the solicited message, source node and purpose territory, destination node; And the point that respectively boundary node in source node, destination node and territory, source, purpose territory is aggregated into couples together, and just obtained the request topology.Because source node or destination node are very little to the shared component in whole cross-domain path cost of the link cost between the boundary node in its territory, place, almost can ignore, therefore the link cost with these connecting lines is made as 0.
Two, utilize the dijkstra's algorithm of changing to calculate cross-domain path
Obtained request topology and adjacency matrix thereof, father PCE just can utilize the dijkstra's algorithm of change to carry out path computing, obtains the cross-domain path of an optimum.
Because each is put not only IncFlds ID but also comprises node ID in the polymerization topology, therefore the cross-domain path that obtains not only can indicate cross-domain path the territory sequence of process, and can indicate the entrance and exit boundary node in approach territory.Father PCE is distributed to the territory that needs approach respectively with the routing information that calculates, and the sub-PCE in each territory can calculate the path in this territory, road construction then according to the Link State in this territory.
The present invention combines link information between abstracted information in the territory and territory, the cross-domain path method more in the past that draws has greatly improved aspect reliability, and can realize parallel computation and the foundation of cross-domain path in each territory, save the time of calculating road and road construction.
Embodiment
In this example, be example with the CERNET backbone network, illustrate that the polymerization topology that obtains based on the present invention carries out the step of path computing.Fig. 5 is a CERNET backbone network topological diagram, and Shenyang, Beijing, Xi'an, Chengdu, Wuhan, Nanjing, eight cities in Shanghai and Guangzhou are arranged on backbone network.As shown in Figure 8, may further comprise the steps
1, eight territories are regarded as in these eight cities, i.e. territory S, B, X, C, W, N, H and G, each territory links to each other with other territories by boundary node, and link is connected by the abstract mode of full connection in the territory, obtains the abstract topology of full connection of CERNET.Shown in Fig. 6 (a), the dotted line connecting line is the full abstracting link that connects in the territory, and the solid line connecting line is a domain-to-domain link.
2, will connect topology entirely through " link-boundary node transforms " and " name " two steps, detail provides in implementation method one, and is no longer burdensome, just obtained the topology after the polymerization, shown in Fig. 6 (b).In this topology, the summit representative connects a pair of boundary node in the topology entirely and this is to the domain-to-domain link between the boundary node.Obtain after the polymerization topology, we also must calculate the link cost between each summit, and this just need carry out the Link State mapping.
Aspect concrete operations, each sub-PCE in father PCE submits own territory to abstract connection status and with the connection status of adjacent domains.Father PCE is a material with these state informations, utilizes the 3rd step " Link State mapping " in the summary of the invention, calculates the link cost between each summit, and stores with the form of adjacency matrix.Like this, with the angle of father PCE, the topology of multiple domain has been converted into a single network topology, can handle the domain-to-domain link request more conveniently.The summit quantity of polymerization topology simultaneously, is lacked than the full node number that connects in the topology.
3, when cross-domain path request arrives, the PCE that is responsible for this territory submits to father PCE with request, and father PCE adds source node and destination node on the basis of polymerization topology, generates a request topology, as shown in Figure 7.The source node and the destination node of adding are connected on the boundary node in this territory, node place, the node cost is made as 0, and the link cost between the boundary node also is made as 0, this is because generally, calculate in the process of cross-domain link, can ignore source node and destination node link cost to territory, place boundary node.
4, obtained after the request topology, just can utilize foregoing middle dijkstra's algorithm to calculate a link from the source node to the destination node through change.
Although above the illustrative embodiment of the present invention is described; so that the technical staff of present technique neck understands the present invention; but should be clear; the invention is not restricted to the scope of embodiment; to those skilled in the art; as long as various variations appended claim limit and the spirit and scope of the present invention determined in, these variations are conspicuous, all utilize innovation and creation that the present invention conceives all at the row of protection.
Claims (1)
1. the polymerization of a multiple domain optical-fiber network topology is characterized in that, may further comprise the steps:
(1), connect entirely abstract
In the multiple domain optical-fiber network, with the abstract information that becomes between this territory boundary node of the link-state information in each territory, territory, adopt full ways of connecting to link to each other between each territory boundary node, father PCE will obtain information between the boundary node and the full connection situation of each territory boundary node gathers, and obtain the full connection topology of multiple domain optical-fiber network;
(2), link-boundary node transforms
In father PCE, the domain-to-domain link and two the associated boundary nodes of domain-to-domain link that connect adjacent domains in the topology entirely are converted into a point, corresponding to a summit of polymerization topology, connect the limit that link in the territory of boundary node in the topology is converted into the polymerization topology entirely;
(3), name
In father PCE, adopt the mode of ID boundary node ID+ territory, territory ID boundary node ID that the summit of polymerization topology is named,
(4), Link State mapping
In father PCE, carry out summit cost and limit cost and calculate
A, summit cost
The domain-to-domain link cost that connects topology is entirely composed to corresponding summit, as the summit cost;
B, limit cost
If the territory ID on two summits that the limit of b1 polymerization topology is associated is inequality fully, then the cost of this edge is+∞;
If the territory ID on two summits that the limit of b2 polymerization topology is associated have one identical, then:
1., when the boundary node ID of same domain ID is also identical, the limit cost is 0;
2., when the boundary node ID of same domain ID is inequality, the limit cost is the link cost between two boundary nodes of same domain, finds from the sub-PCE of same domain submits to the information of father PCE;
If the territory ID on two summits that the limit of b3 polymerization topology is associated is identical, then:
1., when the boundary node ID of same domain ID is also identical, the limit cost is 0;
2., the boundary node ID of one of them same domain ID not simultaneously, the cost on limit is made as+∞.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010106003128A CN102014073B (en) | 2010-12-22 | 2010-12-22 | Polymerization method of multi-domain optical network topology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010106003128A CN102014073B (en) | 2010-12-22 | 2010-12-22 | Polymerization method of multi-domain optical network topology |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102014073A true CN102014073A (en) | 2011-04-13 |
| CN102014073B CN102014073B (en) | 2012-07-25 |
Family
ID=43844094
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010106003128A Expired - Fee Related CN102014073B (en) | 2010-12-22 | 2010-12-22 | Polymerization method of multi-domain optical network topology |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102014073B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102215080A (en) * | 2011-06-13 | 2011-10-12 | 南京邮电大学 | Dynamic protection method for multi-domain optical network |
| CN106161106A (en) * | 2016-08-24 | 2016-11-23 | 北京奇艺世纪科技有限公司 | A kind of node aggregation method and device being applied to oriented topological diagram |
| CN108574628A (en) * | 2017-03-13 | 2018-09-25 | 中兴通讯股份有限公司 | The method for building up and device, system of domain grade topology |
| CN108966053A (en) * | 2018-06-22 | 2018-12-07 | 烽火通信科技股份有限公司 | A kind of cross-domain route computing method of multiple-domain network dynamic domain sequence and device |
| CN109417508A (en) * | 2016-07-06 | 2019-03-01 | 华为技术有限公司 | The connection and access of hierarchical path computing unit (PCE) |
| CN114567594A (en) * | 2020-11-13 | 2022-05-31 | 瞻博网络公司 | Filtering topology for path computation in large-scale networks |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101515886A (en) * | 2008-11-07 | 2009-08-26 | 西安交通大学 | Multi-domain optical network survivability method based on identification of reliable service |
| CN101552934A (en) * | 2009-05-07 | 2009-10-07 | 电子科技大学 | Optical internet cross-domain reliable route calculating method based on PCE backtracking recursion |
| WO2010105698A1 (en) * | 2009-03-16 | 2010-09-23 | Telefonaktiebolaget Lm Ericsson (Publ) | Inter-domain advertisements in multi-domain networks |
-
2010
- 2010-12-22 CN CN2010106003128A patent/CN102014073B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101515886A (en) * | 2008-11-07 | 2009-08-26 | 西安交通大学 | Multi-domain optical network survivability method based on identification of reliable service |
| WO2010105698A1 (en) * | 2009-03-16 | 2010-09-23 | Telefonaktiebolaget Lm Ericsson (Publ) | Inter-domain advertisements in multi-domain networks |
| CN101552934A (en) * | 2009-05-07 | 2009-10-07 | 电子科技大学 | Optical internet cross-domain reliable route calculating method based on PCE backtracking recursion |
Non-Patent Citations (1)
| Title |
|---|
| 《计算机工程》 20091031 肖尚德等 一种适合多域WDM光网络的拓扑聚合算法 全文 1 第35卷, 第20期 * |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102215080B (en) * | 2011-06-13 | 2013-12-04 | 南京邮电大学 | Dynamic protection method for multi-domain optical network |
| CN102215080A (en) * | 2011-06-13 | 2011-10-12 | 南京邮电大学 | Dynamic protection method for multi-domain optical network |
| US11405283B2 (en) | 2016-07-06 | 2022-08-02 | Futurewei Technologies, Inc. | Connections and accesses for hierarchical path computation element (PCE) |
| US11909596B2 (en) | 2016-07-06 | 2024-02-20 | Futurewei Technologies, Inc. | Connections and accesses for hierarchical path computation element (PCE) |
| CN109417508A (en) * | 2016-07-06 | 2019-03-01 | 华为技术有限公司 | The connection and access of hierarchical path computing unit (PCE) |
| US10728098B2 (en) | 2016-07-06 | 2020-07-28 | Futurewei Technologies, Inc. | Connections and accesses for hierarchical path computation element (PCE) |
| CN109417508B (en) * | 2016-07-06 | 2022-04-22 | 华为技术有限公司 | Method and device for constructing hierarchical Path Computation Element (PCE) network topology |
| CN106161106A (en) * | 2016-08-24 | 2016-11-23 | 北京奇艺世纪科技有限公司 | A kind of node aggregation method and device being applied to oriented topological diagram |
| CN106161106B (en) * | 2016-08-24 | 2019-08-09 | 北京奇艺世纪科技有限公司 | A kind of node aggregation method and device applied to oriented topological diagram |
| CN108574628A (en) * | 2017-03-13 | 2018-09-25 | 中兴通讯股份有限公司 | The method for building up and device, system of domain grade topology |
| CN108574628B (en) * | 2017-03-13 | 2022-09-27 | 中兴通讯股份有限公司 | Method, device and system for establishing domain-level topology |
| CN108966053A (en) * | 2018-06-22 | 2018-12-07 | 烽火通信科技股份有限公司 | A kind of cross-domain route computing method of multiple-domain network dynamic domain sequence and device |
| CN114567594A (en) * | 2020-11-13 | 2022-05-31 | 瞻博网络公司 | Filtering topology for path computation in large-scale networks |
| US11824763B2 (en) | 2020-11-13 | 2023-11-21 | Juniper Networks, Inc. | Filtering topologies for path computation in massively scaled networks |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102014073B (en) | 2012-07-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102014073B (en) | Polymerization method of multi-domain optical network topology | |
| US20210360020A1 (en) | Cyberspace coordinate system creation method and apparatus based on autonomous system | |
| CN106130796B (en) | SDN network topology traffic visualization monitoring method and control terminal | |
| CN102694732B (en) | Method and system for constructing virtual network based on local virtualization | |
| CN104038418B (en) | Method for routing, path detection mechanism and Message processing mechanism for mixed type topology data center | |
| CN104253765B (en) | A kind of packet-switching method, apparatus and access switch and exchange system | |
| CN103346967B (en) | A kind of data center network topology structure and method for routing thereof | |
| CN107634912A (en) | Load-balancing method, device and equipment | |
| CN104518899A (en) | Network routing traffic simulation method and device | |
| CN106549779A (en) | A kind of maximum non-intersect double route collocation method of multiple constraint energy communication service | |
| CN101667961B (en) | Policy-routing system based on grid service and dynamic policy-generating method | |
| CN105812372A (en) | Single-packet tracing method based on label switching | |
| CN105763449A (en) | Single packet source-tracing method based on storage resource adaptive adjustment | |
| CN107040605A (en) | Cloud platform scheduling of resource and management system and its application process based on SDN | |
| CN106100964A (en) | The method and apparatus that a kind of virtual network maps | |
| CN101330411B (en) | Method and system for simulating large-scale network topological | |
| CN103281211B (en) | Large-scale network node system for managing in groups and management method | |
| CN102065006B (en) | Method for recovering inter-domain failure of cross-domain label switched path | |
| CN106685816A (en) | Routing calculation method based on SDN, SDN controller, and system | |
| CN108966053A (en) | A kind of cross-domain route computing method of multiple-domain network dynamic domain sequence and device | |
| CN106961400A (en) | A kind of method and system for realizing cloud platform virtual port mirror image | |
| CN101707554A (en) | Method and device for obtaining flow distribution of network | |
| CN102447640B (en) | Method for carrying out aggregate routing in IRF (intelligent resilient framework) system and machine frame switch | |
| CN101494574B (en) | Performance test system and method for double-layer virtual special access backbone network | |
| CN108075928A (en) | Network traffics Universal Simulation Model and method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120725 Termination date: 20141222 |
|
| EXPY | Termination of patent right or utility model |