CN101605279A - A kind of shortest path of double layers implementation method based on cluster computing unit - Google Patents
A kind of shortest path of double layers implementation method based on cluster computing unit Download PDFInfo
- Publication number
- CN101605279A CN101605279A CNA2009100887599A CN200910088759A CN101605279A CN 101605279 A CN101605279 A CN 101605279A CN A2009100887599 A CNA2009100887599 A CN A2009100887599A CN 200910088759 A CN200910088759 A CN 200910088759A CN 101605279 A CN101605279 A CN 101605279A
- Authority
- CN
- China
- Prior art keywords
- computing unit
- cluster computing
- shortest path
- routing
- gce
- 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.)
- Pending
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a kind of shortest path of double layers implementation method based on cluster computing unit.The present invention is according to the Routing Protocol of extended groupv computing unit layer, in the packets of information that floods of cluster computing unit layer, increase the node identification information that each cluster computing unit layer is responsible for, to strengthen the cluster computing unit permeability of face topological layer by layer, calculate the shortest path that arrives the purpose cluster computing unit by the source cluster computing unit, then the routing request is directly passed to the purpose cluster computing unit along shortest path, avoid flooding of routing request, reduce the network load overload problem that information from flooding causes greatly; Adopt the shortest path of double layers method can save the routing resource to a great extent simultaneously, reduce the convergence time of extensive routing, reduce the routing complexity.According to the method for the invention, can solve the too much problem of the information that floods that a large amount of routing requests cause, and the time of multiple domain routing convergence difficulty and computing resource waste problem.
Description
Technical field
The present invention relates to ASON (ASON, Automatically Switched OpticalNetworks) technical field, be specifically related to a kind of shortest path of double layers implementation method based on cluster computing unit.
Background technology
Based on ASON hierarchical routing and path-calculating element (PCE, Path Computation Element) in the dual-route computing unit system, the ASON routing module provides functions such as Topology Discovery, route calculating as individual computing unit (UCE, UnitComputation Element); Cluster computing unit (GCE, Group Computation Element) according to the PCE technology is provided with provides the group who is exclusively used in complicated limited routing procedure calculation services.
In the multi-layer multi-domain optical network dual-route computing unit system, traffic engineering database (TED, Traffic Engineering Database) has different network visual fields; Routing unit selector (RES, Routing Element Selector) is responsible for above-mentioned routing unit function is selected.The group calculates agency (GCA, Group Computation Agent) corresponding to the path computing client in the PCE structure.
Two kinds of route computing units can both be realized the routing function in the optical-fiber network; but in the routing process under the multi-layer multi-domain multi-constraint condition that can expand on a large scale; it is complicated that traditional control plane routing function seems; and can not realize the traffic engineering of multi-layer multi-domain effectively; protection recovers, functions such as control and multi-constraint condition routing between resource optimization and territory.
Fig. 2 is the distributed routing structure schematic diagram based on GCE.As shown in Figure 2, route controlled function and routing function from traditional control plane loose coupling, have been formed the distributed routing structure based on GCE.
In the distributed routing structure based on GCE, GCE and management plane are finished reporting of performance parameter information and assigning of webmaster strategy by network management interface (NMI, Network Management Interface) communication; GCE and control plane are by GCE agreement (GCEP, GCE Protocol) or based on ospf protocol (OSPF-TE) protocol communication of etc.ing of traffic engineering, and one side is finished the reception of routing request and replied, and finishes resource information management in the territory on the other hand; Finish routing request/reply by agreements such as GCEP or OSPF-TE between GCE and the GCE and in abutting connection with the discovery of resource.
GCE has adopted the thought of concentrating among a small circle, distributing on a large scale, can realize the routing function under the various scenes effectively.Particularly can be solved preferably under the cooperation at a plurality of GCE in the routing problem under the multi-layer multi-domain multi-constraint condition.
When the routing request comes, both the routing request can be passed to UCE by the connection controller in the Control Node and finish routing, also can pass to GCE and carry out routing.Under the environment of multi-layer multi-domain, especially, can give one or more GCE and finish in the routing of extensive multi-constraint condition.Cooperate with each other by UCE and GCE, finish calculating quick, accurate, end-to-end path jointly.
In the distributed routing structure based on GCE, when the destination node of routing request was not in the responsible scope of local GCE institute, local GCE needed to send the routing solicited message to peripheral GCE and floods, and arrives destination node place GCE up to request.And then calculate shortest path tree to source node by destination node place GCE.Finally the combined calculation by a plurality of GCE obtains the shortest path that destination node arrives source node.
Yet, in large-scale optical network, the number of GCE or the number in territory are very many, the routing request will flood in the GCE aspect, can produce on the one hand a large amount of routing requests information that floods, between a plurality of GCE, transmit and calculate owing to the routing request on the other hand, thereby strengthen the convergence time that route is calculated, cause the decline of quality of service.
Fig. 3 back for based on GCE to recalling the routing algorithm schematic diagram, as shown in Figure 3, back in back-track algorithm based on GCE, there is a node A to arrive GCE1 to the routing request of node V, GCE1 discovery destination node is sent the routing request to the GCE2 of its adjacency not in its scope of being responsible for, GCE2 finds that destination node V is not also in its responsible scope of institute, so continue to send the routing request, up to finding that destination node is in the scope that GCE3 was responsible for to the GCE3 of its adjacency.Then, initiate routing by destination node place GCE, with the form of broadcasting by along the GCE on road to source node direction calculating shortest path, finally forming one is the shortest path tree of root with the destination node, therefrom can find the shortest path from the destination node to the source node.
For above-mentioned back to recalling routing algorithm based on GCE, the routing request that need flood to the GCE of its adjacency of the source node of initiation arrives destination node place GCE up to solicited message.In this process, can produce a large amount of path request information that floods, increase the load of network; While, in recalling the process of calculating the road, routing existed in the mode of broadcasting in the back, and forming at last with the destination node is the tree type shortest path of root, and there is bigger calculating redundancy in this process, and the convergence time of routing is longer.
Especially, back in recalling routing algorithm based on GCE, when the kind in the quantity of GCE or territory very for a long time, because the routing request will flood in the GCE aspect, can produce a large amount of routing requests information that floods, because destination node place GCE initiates along the source node direction is that broadcast type is calculated the road, so just cause too much GCE participation routing process simultaneously, so that taken a large amount of GCE computational resources, the convergence time of routing also can not get guaranteeing.Therefore, the quasi-solution of the present invention too much problem of the information that floods that a large amount of routing requests cause of determining, and the time of multiple domain routing convergence difficulty and computing resource waste problem.
Summary of the invention
The invention provides a kind of shortest path of double layers implementation method based on cluster computing unit.At above-mentioned based on behind the GCE to the deficiency of recalling routing algorithm, the present invention proposes inter-domain routing prioritization scheme based on GCE Routing Protocol expansion, in order to avoid flooding of routing request, reduce the network load overload problem that information from flooding causes greatly; Adopt the shortest path of double layers method can save the routing resource to a great extent simultaneously, reduce the convergence time of extensive routing, reduce the routing complexity.
Based on the inter-domain routing prioritization scheme of GCE Routing Protocol expansion, and based on the Routing Protocol expansion scheme, the present invention proposes the shortest path of double layers method based on the GCE expansion, promptly the network node layer of being responsible at GCE layer and GCE respectively calculates shortest path respectively.
For solving the problems of the technologies described above, it is as follows to the invention provides scheme:
Described inter-domain routing prioritization scheme based on the expansion of GCE Routing Protocol, traffic engineering database and the ospf protocol of expansion GCE increase the node ID information that each GCE was responsible in the bag that floods of this etale topology of GCE information.
Flood by GCE, comprised in the traffic engineering database of each GCE the topology information of GCE and the whole network node ID with and pairing GCE.
Utilize shortest path first to find the shortest path of source node place GCE, the routing request is directly conveyed to destination node place GCE along this shortest path to destination node place GCE.
Preferably, described method has been saved the process that source GCE routing request floods;
Preferably, described method can reduce the packets of information number that floods under a plurality of GCE situations;
Preferably, described method can reduce the time delay of routing request transmission, can reduce the generation of resource contention to a certain extent;
Preferably, described method is in the latticed network topology, and the load expense can reduce to original 1/12.
Based on above-mentioned Routing Protocol expansion scheme, the present invention proposes shortest path of double layers method based on the GCE expansion.
Described double-deck shortest path method based on the GCE expansion, promptly the network node layer of being responsible at GCE layer and GCE respectively calculates shortest path respectively.
Described method is characterized in that, calculates in the process on road at destination node place GCE, removes to calculate shortest path along K bar GCE shortest path, and finally forming with the destination node is the shortest path tree of simplifying of root, therefrom selects destination node to arrive the shortest path of source node.
From the above as can be seen, a kind of shortest path of double layers implementation method provided by the invention based on cluster computing unit, Routing Protocol by expansion GCE layer, in the packets of information that floods of GCE, increase the node ID information that each GCE was responsible for, strengthen the permeability of GCE aspect topology, reduce a lot of packets of information and reduce the time delay that the routing request is transmitted, save the routing resource, reduce the convergence time of extensive routing.
Description of drawings
Fig. 1 is based on the dual-route computing unit system schematic diagram that is applicable to multi-layer multi-domain optical network;
Fig. 2 is the distributed routing structure schematic diagram based on GCE;
Fig. 3 back for based on GCE to recalling the routing algorithm schematic diagram;
Fig. 4 is the GCE layer of the present invention expense contrast schematic diagram that floods;
Fig. 5 is the shortest path of double layers scheme schematic diagram that the present invention is based on the GCE expansion;
Fig. 6 is that the shortest path of double layers method expense that the present invention is based on GCE is analyzed schematic diagram.
Embodiment
The present invention is directed to the network load overload problem that information from flooding causes, a kind of shortest path of double layers implementation method based on cluster computing unit is provided, and the present invention adopts the shortest path of double layers method, and then saves the routing resource, reduce the convergence time of extensive routing, reduce the routing complexity.
Fig. 3 back for based on GCE to recalling the routing algorithm schematic diagram.As shown in Figure 3, described back based on GCE to recalling under the structural framing of routing algorithm at GCE, there is a node A to arrive GCE1 to the routing request of node V, GCE1 finds that destination node is not in its scope of being responsible for, so send the routing request to the GCE2 of its adjacency, GCE2 finds that destination node V is not also in its responsible scope of institute, so continuation is sent the routing request to the GCE3 of its adjacency, up to finding that destination node is in the scope that GCE3 was responsible for.Then, initiate routing by destination node place GCE, with the form of broadcasting by along the GCE on road to source node direction calculating shortest path, finally forming one is the shortest path tree of root with the destination node, therefrom can find the shortest path from the destination node to the source node.
For above-mentioned back to recalling routing algorithm based on GCE, the routing request that need flood to the GCE of its adjacency of the source node of initiation arrives destination node place GCE up to solicited message.In this process, can produce a large amount of path request information that floods, increase the load of network; While, in recalling the process of calculating the road, routing existed in the mode of broadcasting in the back, and forming at last with the destination node is the tree type shortest path of root, and there is bigger calculating redundancy in this process, and the routing convergence time is longer.
Described back in recalling routing algorithm based on GCE, because destination node place GCE is that broadcast type is calculated the road along the initiation of source node direction, so just cause too much GCE to participate in routing process, so that taken a large amount of GCE computational resources, the convergence time of routing can not get guaranteeing.
For solving the problems of the technologies described above, it is as follows to the invention provides scheme:
Based on the inter-domain routing prioritization scheme of GCE Routing Protocol expansion, traffic engineering database and the ospf protocol of expansion GCE increase the node ID information that each GCE was responsible in the bag that floods of this etale topology of GCE information.Flood by GCE, comprised in the traffic engineering database of each GCE the topology information of GCE and the whole network node ID with and pairing GCE.
Utilize shortest path first to find the shortest path of source node place GCE, the routing request is directly conveyed to destination node place GCE along this shortest path to destination node place GCE.
Fig. 4 is for the GCE layer expense contrast schematic diagram that floods, and in the latticed network topology, the load expense can reduce to original 1/12.
Based on above-mentioned Routing Protocol expansion scheme, the present invention proposes a kind of shortest path of double layers implementation method based on group unit.
Described shortest path of double layers method based on the GCE expansion, promptly the network node layer of being responsible at GCE layer and GCE respectively calculates shortest path respectively.
In the present embodiment, described method is characterized in that, before source node place GCE sends path request, utilize the preceding K bar shortest path of K bar shortest path (KSP) algorithm computation according to GCE topology information and the whole network ID from source GCE to purpose GCE, send the routing request to purpose GCE along article one shortest path then, and K bar GCE shortest path information is reached purpose GCE.
Send the routing request to purpose GCE, and K bar GCE shortest path information is reached purpose GCE.
Fig. 5 is the shortest path of double layers scheme schematic diagram based on the GCE expansion.Wherein, in the shortest path of double layers scheme based on the GCE expansion shown in Figure 5, calculate in the process on road at destination node place GCE, remove to calculate shortest path along K bar GCE shortest path, finally forming with the destination node is the shortest path tree of simplifying of root, therefrom selects destination node to arrive the shortest path of source node.
Preferably, in the present embodiment, described method can be saved the routing resource to a great extent, reduces the convergence time of extensive routing.
Below introduce in the present embodiment based on the double-deck shortest path method expense of GCE and analyze schematic diagram, and then the superior function of explanation shortest path of double layers method.
Fig. 6 is that the shortest path of double layers method expense that the present invention is based on GCE is analyzed schematic diagram.In the present embodiment, the number of establishing GCE in the network is N, and the link between the GCE is L.
Described L works as l
Ij=0 o'clock, expression GCE
iAnd GCE
jBetween do not have tie link; Work as l
Ij=1 o'clock, expression GCE
iAnd GCE
jBetween tie link is arranged.
Suppose GCE
sTo GCE
dJumping figure be t, N
tExpression is apart from GCE
sThe node jumping figure is smaller or equal to the number of all GCE nodes of t.
Based on top hypothesis, the number that the packets of information that path request floods reduces can be calculated by following formula:
N
X＝N
t-t
Be that the path request packets of information is with the percentage that reduces:
In the following formula, t represent source GCE to purpose GCE the GCE number of process, N
tExpression is apart from purpose GCE jumping figure all GCE numbers smaller or equal to t.
Because purpose GCE is to be that initial point carries out broadcast type and calculates the road with it, until calculating source node, participate in the calculating that there is no need so have a lot of GCE, waste a large amount of computational resources, cause bigger routing answer delay.
Preferably, in the present embodiment, in GCE topological structure arbitrarily, present embodiment adopts double-deck shortest path algorithm, and the computational resource of GCE will be similar to and be reduced to original t/N
t
Preferably, in the present embodiment, the inter-domain routing prioritization scheme that proposes according to the present invention based on the expansion of GCE Routing Protocol, directly adopt shortest path first to find the shortest path to purpose GCE by source GCE, remove source GCE to the flood process of path request of purpose GCE, reduced the flood number of packets of information of path request greatly.
From the above as can be seen, a kind of shortest path of double layers implementation method provided by the invention based on cluster computing unit, by the Routing Protocol of expansion GCE layer, in the packets of information that floods of GCE, increase the node ID information that each GCE was responsible for, strengthen the permeability of GCE aspect topology.Thereby reduce a lot of packets of information, reduce the time delay of routing request transmission, save the routing resource, and reduce the convergence time of extensive routing.
The above only is embodiments of the present invention; should be pointed out that for those skilled in the art, under the prerequisite that does not break away from the principle of the invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (8)
1. the shortest path of double layers implementation method based on cluster computing unit is characterized in that, proposes the inter-domain routing prioritization scheme based on the expansion of cluster computing unit Routing Protocol; And, the shortest path of double layers method based on the cluster computing unit expansion is proposed based on the Routing Protocol expansion scheme, promptly the network node layer of being responsible at cluster computing unit layer and cluster computing unit respectively calculates shortest path respectively.
2. according to claim 1 based on the inter-domain routing prioritization scheme of cluster computing unit Routing Protocol expansion, it is characterized in that, the traffic engineering database of extended groupv computing unit and OSPF, in the bag that floods of this etale topology of cluster computing unit information, increase the node identification information that each cluster computing unit is responsible for, utilize shortest path first to find the shortest path of source node place cluster computing unit, the routing request is directly conveyed to destination node place cluster computing unit along this shortest path to destination node place cluster computing unit.
3. as method as described in the claim 2, it is characterized in that, flood by cluster computing unit, in the traffic engineering database of each cluster computing unit, comprised the topology information of cluster computing unit and the whole network node identification with and pairing cluster computing unit, under the situation of a plurality of cluster computing units, reduce a plurality of packets of information.
4. as method as described in the claim 2, it is characterized in that, reduce the time delay of routing request transmission, can reduce the generation of resource contention to a certain extent.
5. according to claim 1 based on the double-deck shortest path method of cluster computing unit layer expansion, it is characterized in that, respectively the network node layer calculating shortest path of being responsible at cluster computing unit layer and cluster computing unit.
6. as method as described in the claim 5, it is characterized in that, before source node place cluster computing unit sends path request, utilize the K bar shortest path of K bar shortest path first calculating according to cluster computing unit topology information and full network marking from the source cluster computing unit to the purpose cluster computing unit, send the routing request to the purpose cluster computing unit along article one shortest path then, and K bar cluster computing unit shortest path information is reached the purpose cluster computing unit.
7. as method as described in the claim 5, it is characterized in that, in the process on destination node place cluster computing unit calculation road, remove to calculate the bottom shortest path along K bar cluster computing unit floor shortest path, finally forming with the destination node is the shortest path tree of simplifying of root, therefrom selects destination node to arrive the shortest path of source node.
8. as method as described in the claim 5, it is characterized in that, can save the routing resource to a great extent, reduce the convergence time of extensive routing based on the shortest path of double layers algorithm of group unit.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2009100887599A CN101605279A (en) | 2009-07-10 | 2009-07-10 | A kind of shortest path of double layers implementation method based on cluster computing unit |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2009100887599A CN101605279A (en) | 2009-07-10 | 2009-07-10 | A kind of shortest path of double layers implementation method based on cluster computing unit |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101605279A true CN101605279A (en) | 2009-12-16 |
Family
ID=41470795
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2009100887599A Pending CN101605279A (en) | 2009-07-10 | 2009-07-10 | A kind of shortest path of double layers implementation method based on cluster computing unit |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101605279A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015131703A1 (en) * | 2014-03-06 | 2015-09-11 | Huawei Technologies Co., Ltd. | Method and apparatus for path selecting |
| CN111369052A (en) * | 2020-03-03 | 2020-07-03 | 中铁工程设计咨询集团有限公司 | Simplified road network KSP optimization algorithm |
-
2009
- 2009-07-10 CN CNA2009100887599A patent/CN101605279A/en active Pending
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015131703A1 (en) * | 2014-03-06 | 2015-09-11 | Huawei Technologies Co., Ltd. | Method and apparatus for path selecting |
| CN106068632A (en) * | 2014-03-06 | 2016-11-02 | 华为技术有限公司 | A kind of routing resource and device |
| CN111369052A (en) * | 2020-03-03 | 2020-07-03 | 中铁工程设计咨询集团有限公司 | Simplified road network KSP optimization algorithm |
| CN111369052B (en) * | 2020-03-03 | 2021-02-12 | 中铁工程设计咨询集团有限公司 | Simplified road network KSP optimization algorithm |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102238443B (en) | Method for establishing cross-domain path meeting wavelength-continuity constraints | |
| CN102469009B (en) | Processing method for stateful path computation element, and stateful path computation element | |
| CN101483539B (en) | Method, path computing unit and system for obtaining path | |
| RU2541940C2 (en) | Method of applying service instance to mpls network (versions) and mpls network | |
| CN101808030B (en) | Logical network construction method based on virtual routers | |
| CN100452750C (en) | Token transfer and manage method for Ad Hoc network | |
| CN101729385B (en) | Path calculation and establishing method, device and system | |
| US20100260177A1 (en) | Path selection method and network system, path computation element | |
| CN101960801A (en) | Technique for determining a point-to-multipoint tree linking a root node to a plurality of leaf nodes | |
| CN103379032A (en) | Acquisition method and device for cross-domain end-to-end route and secondary route computation element | |
| CN101083548A (en) | Multi-domain routing computation method and system | |
| CN105827529B (en) | A kind of path establishment method and controller | |
| CN102340434A (en) | Multihoming access-based loop avoidance method and edge devices | |
| CN103209088A (en) | Ring network label switch path creation method and associated devices and communication system | |
| CN101965031B (en) | Maximum probability-based cognitive radio multi-path multicast routing method | |
| CN102611607A (en) | Processing method and path computation element of inter-domain link information | |
| CN101682552A (en) | Failure notification in a network having serially connected nodes | |
| CN101753462B (en) | Method and device for realizing multi-next-hop routes | |
| CN102065006B (en) | Method for recovering inter-domain failure of cross-domain label switched path | |
| CN102281193A (en) | Method and fiber channel (FC) equipment for realizing message forwarding in fiber channel network | |
| CN102292942B (en) | Method, system and router for route processing | |
| CN103188147A (en) | Path establishment method and system | |
| CN101155119A (en) | Method and device for confirming boundary node of autonomous system and its path computing method | |
| CN101984597B (en) | Computing method and system for multi-domain two-way label switched path | |
| CN100579025C (en) | Route information maintaining method of automatic exchange optical 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 | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20091216 |