CN101155139B - Method and system for searching path - Google Patents
Method and system for searching path Download PDFInfo
- Publication number
- CN101155139B CN101155139B CN2006101596686A CN200610159668A CN101155139B CN 101155139 B CN101155139 B CN 101155139B CN 2006101596686 A CN2006101596686 A CN 2006101596686A CN 200610159668 A CN200610159668 A CN 200610159668A CN 101155139 B CN101155139 B CN 101155139B
- Authority
- CN
- China
- Prior art keywords
- path
- cost
- connecting line
- node
- network
- 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 invention discloses a method of searching path. The said method comprises: receiving the service connection request; establishing an auxiliary chart for reflecting all the usable link resource in network and established path pair of minimum cost; searching a path for satisfying the reliability constraint in the auxiliary chart. The invention also discloses a system of searching path, the saidsystem is composed of an establishing element of auxiliary chart and arithmetic element. The said establishing element of auxiliary chart is used to establish an auxiliary chart for reflecting all the usable link resource in network and established path pair of minimum cost. The said arithmetic element is used to search a path for satisfying the reliability constraint in the auxiliary chart afterreceiving the service connection request. The invention can better and more fully use the network resource.
Description
Technical field
The present invention relates to technical field of data transmission, relate in particular to a kind of searching route method and system.
Background technology
Develop rapidly along with the Internet (INTERNET) technology, it is more and more higher that the transmission bandwidth of network also becomes, for example, adopt dense wave division multipurpose (Dense Wavelength Division Multiplexing, DWDM) in the optical-fiber network of technology, an optical fiber can provide the bandwidth of several Tbit, every optical fiber is all transmitting lot of data, in this case, in case some network components that is transmitting data lost efficacy, all might cause lot of data to lose.Owing to the unexpected heavy losses that cause, a kind of method that satisfies certain reliability requirement route based on the single-link failure model for each connection request foundation has generally been adopted in the reliability fail safe that improves data transmission in network in recent years for fear of these.
Under the single-link failure model, system can transmit failure probability of link of data can for each, the failure probability sum of all links is 1 in the network, the method of setting failure probability has a variety of, can be provided with according to the result of statistics, also can be provided with according to sampled result, actual hardware situation or additive method, failure probability can reflect an elementary probability that is in the link generation failure conditions in the network.Every the path that can set up route all is made up of link in network, and the failure probability of a paths is exactly the failure probability sum of all links on this paths.Simultaneously; under the hypothesis of single-link failure model, the same time only has a paths and lost efficacy, if a certain section an of paths is by the protection segment protect of a link disjoint; promptly have one section diverse link can connect the two ends of this section, this moment, the failure probability of this section was exactly 0.
In this model, each connection request all has the failure probability accepted of a maximum, above-mentioned " setting up the method that certain reliability requires route that satisfies for each connection request based on the single-link failure model " is exactly: when receiving connection request, the failure probability accepted that must be less than or equal to this connection request maximum for the path of each connection request foundation, has certain reliability with regard to the path that has guaranteed route use this time like this, this method of setting up route also can be called as reliability constraint routing method.
At present under situation, have two kinds commonly used to set up the method that satisfies certain reliability requirement route for each connection request based on the single-link failure model:
1, LDPP (two path of link disjoint) method is set up the path of two link disjoint for each connection request.
With example this method is described once now, system receives that it is 0.1 connection request that a maximum can be accepted failure probability, network condition as shown in Figure 1 at this moment, the source node of this connection request is node S, destination node is node D, system adopts the LDPP method, has set up the path of two link disjoint: path 11 and path 12, come this connection of route.Wherein path 11 is: through the path of node S-node 1-node 2-node 3-node D, path 12 is: through the path of node S-node 4-node 5-node 6-node D.
Set up route if only select path 11; 3 sections link failure probability sums on the road 11 are: 0.05+0.05+0.1+0.05=0.25; the maximum that is higher than this connection request can be accepted failure probability 0.1; but owing to selected the path of two link disjoint; the path is protected in road 11 and path 12 each other; so the failure probability of this two paths all is 0; the maximum that has satisfied this connection request can be accepted the requirement of failure probability, and this time the route of setting up also is a route that satisfies certain reliability requirement.
By above example as can be known, because two paths that the LDPP method is set up are link disjoint, therefore, under the situation of single-link failure model, the failure probability of this two paths is always 0, so can satisfy the maximum failure probability of any connection request, guarantee that the path that each route is used all has certain reliability.
But; this method need expend more Internet resources usually; still with Fig. 1 example; suppose the cost of each link among the figure; be that the resource that each link takies is 1; be exactly total adopt so that the LDPP method selects that road 1 and path 2 consume for use cost 8; if we directly select path 1 for use; and with the subpath of protecting through the path 13 of node 2-node 7-node D through the path 11 of node 2-node 3-node D; the failure probability of protected subpath is reduced to 0; can accept failure probability for this maximum is that 0.1 connection request is set up route; the path failure probability of this moment is: 0.5+0.5+0=0.1; can satisfy the maximum of this connection request equally and can accept the failure probability requirement, and the cost that consumes only is 6, saved 2 link costs than the cost 8 of using the consumption of LDPP method.
Since adopt very consumption of network resources of LDPP method, very possible because resource is not enough under the Internet resources condition of limited, satisfy the route that certain reliability requires and can't successfully set up.
2, PP (part protection) method, this method concrete steps be as shown in Figure 2:
Step 201, when receiving connection request, find a minimal cost path from the source point to the point of destination.
Step 202, judge that whether the failure probability of this minimal cost path allows failure probability greater than the maximum of this connection request, if, then enter step 204, otherwise execution in step 203.
The maximum that step 203, this minimal cost path can satisfy this connection request allows the failure probability requirement, directly chooses this minimal cost path and sets up route, and flow process finishes.
The maximum that step 204, this minimal cost path can not satisfy this connection request allows the failure probability requirement, will find out that all can cause the path failure probability to exceed the link that maximum can be accepted failure probability on this minimal cost path this moment, promptly satisfies the link of following condition:
Deduct the failure probability of this link with the failure probability of this minimal cost path, the maximum that the failure probability of acquisition is less than or equal to this connection request allows failure probability.
Step 205, the protection highway section of calculating a link disjoint for each qualified link of finding out.
Route is set up in step 206, protection highway section and the minimum cost highway section of choosing a cost minimum from the protection highway section that these calculate together, and flow process finishes.
Now be the concrete operations of example explanation PP method with Fig. 3:
The connection request of node S to node D route set up in the request of receiving, system is that connection request finds a minimal cost path: path 31, road 31 is the path through node S-node 1-node 2-node D.
Because the failure probability in path 31 allows failure probability greater than the maximum of this connection request, footpath all on 31 that then will find new outlets can cause the path failure probability to exceed the link that maximum can be accepted failure probability, finally obtain qualified link: the link between link between the node 1-node 2 and the node 2-node D.
Be respectively the protection highway section of a link disjoint of two links calculating of finding out: the protection highway section 32 of link between the protection highway section 31 of link, the node 2-node D between the node 1-node 2; because two links finding out all satisfy condition: " deduct the failure probability of this link with the failure probability of this minimal cost path, the failure probability of acquisition is less than or equal to the maximum permission failure probability of this connection request.So " these two sections links any one section protected, make its failure probability be 0 after, the maximum that the failure probability of entire path 31 all can be less than or equal to this connection request allows failure probability, the maximum that satisfies this connection request allows the failure probability requirement.
The cost of relatively protecting highway section 31 and protection highway section 32 to consume then; select the protection highway section 31 of cost minimum and the route that this connection request is set up in path 31 together; the route of setting up this moment is exactly one and satisfies the route that certain reliability requires, and has guaranteed the reasonable use of Internet resources to a certain extent.
But because in the PP method; owing to can only look for a protection highway section; under the situation that a lot of resources allow, also may can not find the protection highway section that satisfies condition; with Fig. 4 is example; remove any one section link; link failure probability sum remaining on this path all equals 0.2; as long as the maximum that the connection request from s to d that receives requires allows failure probability less than 0.2; the PP method just can't successfully be set up route; can learn and in fact go up us by figure; choose by and together through the protection highway section of node 2-node 4-node D and this path through the protection highway section of node S-node 1-node 3; be that can to set up a failure probability be 0.1 path, as long as the maximum that this connection request requires allows failure probability more than or equal to 0.1 route that fully can successful foundation satisfy the reliability requirement.
In two kinds of above-mentioned methods; the LDPP method is too wasted Internet resources; and very possible because Internet resources are not that abundance causes setting up route especially, the PP method also may can not find the protection highway section that satisfies condition owing to can only look for a protection highway section under the situation that a lot of resources allow.
Summary of the invention
The technical problem to be solved in the present invention provides a kind of searching route method and system.
For solving the problems of the technologies described above, the invention provides a kind of searching route method, described method comprises:
Receive service connection request;
Foundation comprises that all can use the surplus resources network of resource in the network; Described surplus resources network is the combination that meets the link of service connection request requirement in the current network;
Set up the rest layers of surplus resources network according to described surplus resources network, comprise: for all nodes in the described surplus resources network are set up the child node of rest layers, it is right to the child node in rest layers by link-attached node to use connecting line to connect, wherein, the failure probability of all connecting lines is the failure probability of all connecting line respective links, and the cost of all connecting lines is the cost of all connecting line respective links; Described minimal cost path is to one group for cost minimum in the link combinations in path that can form two link disjoint;
And according to described surplus resources network set up the surplus resources network reflection all can set up the right shortest path of minimal cost path to layer, comprise: for all nodes in the described surplus resources network are set up the child node of shortest path to layer, use connecting line to connect all and can set up the right node of minimal cost path right to the child node in the layer at shortest path, wherein, all connecting line failure probabilities are 0, the cost of all connecting lines for all connecting line corresponding node between the cost of minimal cost path set up to expending;
Connect described rest layers and described shortest path to layer, obtain auxiliary view, comprise and use connecting line to connect described rest layers and the described shortest path corresponding child node to layer, all connecting line failure probabilities are 0;
In described auxiliary view, search out the path of satisfying the reliability constraint.
The present invention also provides a kind of system of seeking routed path, and this system comprises that auxiliary view sets up unit and arithmetic element:
Described auxiliary view is set up the unit, is used for setting up comprising network all can using the surplus resources network of resource; Described surplus resources network is the combination that meets the link of service connection request requirement in the current network; Set up the rest layers of surplus resources network according to described surplus resources network, be included as all nodes in the described surplus resources network and set up the child node of rest layers, it is right to the child node in rest layers by link-attached node to use connecting line to connect, wherein, the failure probability of all connecting lines is the failure probability of all connecting line respective links, and the cost of all connecting lines is the cost of all connecting line respective links; Described minimal cost path is to one group for cost minimum in the link combinations in path that can form two link disjoint; And according to described surplus resources network set up the surplus resources network reflection all can set up the right shortest path of minimal cost path to layer, be included as in the described surplus resources network all nodes and set up the child node of shortest path layer, use connecting line to connect all and can set up the right node of minimal cost path right to the child node in the layer at shortest path, wherein, all connecting line failure probabilities are 0, the cost of all connecting lines for all connecting line corresponding node between the cost of minimal cost path set up to expending; Connect described rest layers and described shortest path to layer, obtain auxiliary view, comprise and use connecting line to connect described rest layers and the described shortest path corresponding child node to layer, all connecting line failure probabilities are 0;
Described arithmetic element is used for after receiving service connection request, sets up at described auxiliary view and searches out the path of satisfying the reliability constraint in the auxiliary view of setting up the unit.
As from the foregoing; the present invention has constructed an auxiliary view of seeking the path for each connection request according to current network condition; this comprise shortest path to the auxiliary view of layer and rest layers can reflect in the current available network resource all minimal cost paths that can set up to and available link; and in auxiliary view, be provided with their failure probability; and then in this auxiliary view, utilize known algorithm to seek a path of satisfying the reliability constraint; the maximum that promptly meets the connection request requirement allows the path of failure probability; this paths can comprise a plurality of links and protection highway section; can make full use of conventional network resources; under the situation that resource allows, can both searching out of success satisfy the path that reliability retrains substantially; set up route for connection request, reduced owing to can't find the occurrence probability of the path refusal connection request situation that satisfies the reliability constraint.And because what select when setting up shortest path to layer is all the path centerings that can set up the protection section, the minimal cost path of cost minimum is right, has also controlled the Internet resources that consume to a certain extent.
Further, the invention provides the scheme that the cost parameter is set in auxiliary view, move suitable algorithm like this, as SEA approximate data, approximate data etc., just can find the path of satisfying the reliability constraint of minimum cost, the Internet resources that the path is consumed are controlled at minimum scope.
Description of drawings
Fig. 1, prior art LDPP method schematic diagram;
Fig. 2, prior art PP method flow chart;
Fig. 3, prior art PP method schematic diagram;
Fig. 4, prior art PP law limitation analysis chart;
Fig. 5, the present invention seek the route method flow chart;
Fig. 6, embodiment of the invention conventional network resources schematic diagram;
Fig. 7, embodiment of the invention surplus resources network diagram;
The schematic diagram of Fig. 8, embodiment of the invention auxiliary view;
Fig. 9, system diagram of the present invention.
Embodiment
The invention provides a kind of searching route method and system, set up an auxiliary view model, when receiving service connection request, utilize this auxiliary view model to seek the path.
Searching route method provided by the invention, can construct an auxiliary view according to current network condition for each service connection request that dynamically arrives, the structure of this auxiliary view can be before service connection request arrives, also can be after service connection request arrives, in this auxiliary view, seek out a path of satisfying the reliability constraint then, the maximum that promptly meets the service connection request requirement allows the path of failure probability, if adopt suitable algorithm can obtain the path of a cost minimum simultaneously.
Now this paper will be that example describes searching route method provided by the invention in detail to construct auxiliary view after service connection request arrives, idiographic flow as shown in Figure 5:
A service connection request is received by step 501, system.
Step 502, actual requirement according to current network condition and service connection request obtains surplus resources network (RN), the actual requirement of service connection request might be a bandwidth, also might be the constraints of cost or other network uplink, the surplus resources network is meant in the current network herein, meet the combination of the link of service connection request requirement, actual requirement with service connection request is that bandwidth is an example, the surplus resources network just is meant: will remove the network that obtains after the link of those idler long numbers less than the demand bandwidth in the current primitive network, soon can not provide the link that requires bandwidth to pick out the remaining network in back.
Step 503, according to surplus resources net structure auxiliary view, this auxiliary view comprises two layers: shortest path is to layer (shortest-path-pair layer, SPPL) and rest layers (residual layer, RL), wherein that layer is comprised in the current network all minimal cost paths that can set up is right for shortest path, minimal cost path is to one group of cost minimum in the link combinations that is meant the path that can form two link disjoint, with Fig. 4 is example, node S, 1, it is right that link between 3 just can be set up 3 minimal cost paths, this is because 3 sections links between these 3 nodes can find the protection path of oneself, thereby forms the path of 3 pairs of two link disjoint; And the surplus resources network that rest layers obtains with regard to corresponding step 502.
This paper will describe the concrete grammar according to surplus resources net structure auxiliary view in detail now:
At first,, be divided into the child node of two corresponding shortest paths of difference, suppose that the node in the surplus resources network is V layer and rest layers with each node in the surplus resources network
i, two corresponding shortest paths of difference that then are divided into just are V to the child node of layer and rest layers
ISPPLAnd V
IRL, all corresponding shortest paths are V to the set of straton node
SPPL, the set of all corresponding rest layers child nodes is V
RL
And then generate corresponding shortest path to layer and rest layers according to these child nodes.
Wherein, the structure and the attribute of rest layers and surplus resources network are basic identical, and its generation method is: find out in the surplus resources network directly the node that linked to each other by a link to (V
i, V
j), at set V
RLIn find out this node to the node of correspondence to (V
IRL, V
JRL), then at node V
IRLAnd V
JRLBetween increase a connecting line, the failure probability of this connecting line is exactly connected node V
iAnd V
jThe failure probability of link, the cost of this connecting line is exactly connected node V
iAnd V
jThe cost of link.Find out set V
RLIn all such nodes, and add to go up connecting line, just generated complete rest layers.
Shortest path to the generation method of layer is: find out and can set up the right node of minimal cost path in the surplus resources network to (V
i, V
j), at set V
SPPLIn find out this node to the node of correspondence to (V
ISPPL, V
JSPPL), then at node V
ISPPLAnd V
JSPPLBetween increase a connecting line because node is to (V
i, V
j) exist the minimal cost path of two link disjoint right, so the failure probability of this connecting line is 0, the cost of this connecting line be that the node of correspondence is to (V
i, V
j) the right total cost of minimal cost path that can set up.
Connect shortest path then to layer and rest layers, at each to the child node told by same node to (V
ISPPL, V
IRL) between add connecting line, the failure probability of this connecting line is 0, the cost of this connecting line also is 0, has so just constituted complete auxiliary view.
Step 504, in auxiliary view, seek the path satisfy the reliability constraint.The algorithm that generally is used for seeking the path of satisfying the reliability constraint has SEA approximate data, approximate data, EBE algorithm etc., these algorithms of operation can find the minimal cost path that satisfies the reliability constraint in auxiliary view, promptly meet the minimal cost path that maximum that the request of service connection request requires allows failure probability, wherein the EBE algorithm can only use during for integer at link cost.
If, only need find a path of satisfying the reliability constraint, do not require that final result is the words of minimal cost path, can also use enlightening Coase thorough (Dijkstra) shortest path first, find the path of satisfying the reliability constraint, nature does not just need to be the attribute of connecting line setting about cost, as long as it is just much of that the failure probability attribute of connecting line is set when the structure auxiliary view under kind of situation.
Step 505, judging whether to have found the path of satisfying reliability constraint in auxiliary view, is execution in step 506 then, otherwise execution in step 507.
Step 506, owing to found the path of satisfying reliability constraint, so accept this service connection request, and for this service connection request Resources allocation and upgrade network condition.Be that service connection request is set up route promptly, and upgrade network condition that to wait for the arrival of service connection request next time, this moment, flow process finished by the path that searches out.
This example is to be that example describes with the situation of constructing auxiliary view after service connection request arrives, if before service connection request arrives, construct auxiliary view, just can construct new auxiliary view at once this moment after upgrading network condition, wait for that new service connection request arrives, this moment auxiliary view building method and step 502, described method is basic identical in 503, do not need to remove nonconforming link when just constructing the surplus resources network, new service connection request arrives the back and judges whether this auxiliary view meets the condition of this service connection request, just meet and directly use, do not meet and set up new qualified auxiliary view again.
Also have a kind of situation to be exactly, all service connection request are all only required the maximum failure probability that allows, do not limit other Internet resources conditions, then after service connection request arrives, do not need auxiliary view is judged, directly use the auxiliary view that structure is good in advance to get final product.
Step 507, owing to find the path of not satisfying reliability constraint, illustrate that conventional network resources can not satisfy the requirement of this service connection request, so can not set up route for this service connection request, this moment, this service connection request was refused by system, flow process finishes, and waits for the arrival of service connection request next time.
Now describe the utilization of searching route method provided by the invention in detail with real example, the initial network resource as shown in Figure 6, comprise node A, B, C, D, E, F and link AB, AC, CB, BE, CD, DE, DF, EF, the cost of link AB is 1, failure probability is 0.1, the cost of link AC is 1, failure probability is 0.1, and the cost of link CB is 4, and failure probability is 0.2, the cost of link BE is 1, failure probability is 0.1, and the cost of link CD is 1, and failure probability is 0.1, the cost of link DE is 1, failure probability is 0.2, and the cost of link DF is 1, and failure probability is 0.1, the cost of link EF is 1, and failure probability is 0.1.
The service connection request of receiving, its request are set up the route of node A to node F, and bandwidth on demand is 2 wavelength, and it is 0.1 that the maximum of requirement allows failure probability.
After receiving this service connection request, at first to set up the surplus resources network according to flow process, link BE has only an idle wavelength in the initial network resource, other links all have two or plural idle wavelength, so pick out link BE remaining be exactly the surplus resources network, the surplus resources network comprises node A as shown in Figure 7, B, C, D, E, F and link AB, AC, CB, CD, DE, DF, EF, the cost of link AB is 1, failure probability is 0.1, and the cost of link AC is 1, and failure probability is 0.1, the cost of link CB is 4, failure probability is 0.2, and the cost of link CD is 1, and failure probability is 0.1, the cost of link DE is 1, failure probability is 0.2, and the cost of link DF is 1, and failure probability is 0.1, the cost of link EF is 1, and failure probability is 0.1.
According to surplus resources net structure auxiliary view shown in Figure 7, obtain auxiliary view as shown in Figure 8 at last then, structure auxiliary view detailed process is as follows:
At first, node A, B, C, D, E, F are split as node A ', B ', C ', D ', E ', the F ' that belongs to rest layers respectively and belong to minimal path to the node A of layer ", B ", C ", D ", E ", F ".
Then, according to the method for above-mentioned structure rest layers at rest layers node A ', B ', C ', D ', E ', add connecting line between the F ', obtain connecting line A ' B ', A ' C ', C ' B ', C ' D ', D ' E ', D ' F ', E ' F ', link attribute in the surplus resources network of these connecting lines and correspondence is in full accord, the cost of connecting line A ' B ' is 1, failure probability is 0.1, the cost of connecting line A ' C ' is 1, failure probability is 0.1, and the cost of connecting line C ' B ' is 4, and failure probability is 0.2, the cost of connecting line C ' D ' is 1, failure probability is 0.1, and the cost of connecting line D ' E ' is 1, and failure probability is 0.2, the cost of connecting line D ' F ' is 1, failure probability is 0.1, and the cost of connecting line E ' F ' is 1, and failure probability is 0.1.
Also will be according to above-mentioned structure shortest path to the method for layer at the node A of minimal path to layer "; B " C "; D " E "; F " add connecting line, obtain connecting line A " B " at last, A " C ", C " B ", D " E ", D " F ", E " F ", because the node of connecting line A " B " correspondence in the surplus resources network is to (A, B) the right total cost of setting up between of minimal cost path is link AB, AC, the cost sum 6 of CB, so the cost of connecting line A " B " is 6, failure probability is 0, the cost of same connecting line A " C " is 6, failure probability is 0, the cost of connecting line C " B " is 6, failure probability is 0, and the cost of connecting line D " E " is 3, and failure probability is 0, the cost of connecting line D " F " is 3, failure probability is 0, and the cost of connecting line E " F " is 3, and failure probability is 0.
At last, connect shortest path to layer and rest layers, each to the child node told by same node between add connecting line, obtain connecting line A ' A ", B ' B ", C ' C ", D ' D ", E ' E ", F ' F ", the failure probability of all connecting lines is 0, cost also is 0, has so just constituted complete auxiliary view as shown in Figure 8.
After having constructed auxiliary view, adopt the SEA approximate data in auxiliary view as shown in Figure 8, to find and satisfy the path that reliability retrains route, the final path that obtains is exactly path shown in dotted lines in Figure 8, this path cost is 10, failure probability is 0.1, satisfies the maximum permission failure probability 0.1 that this service connection request requires.Initial network is shone upon back in this path, and the protection highway section of being made up of node A, B, C adds uplink CD and adds the path that the protection highway section be made up of node D, E, F is formed.
Because what adopt is the SEA approximate data, when existing many to satisfy maximum that this service connection request requires and allow the path of failure probability, what can also guarantee to find is wherein minimal cost path.
After searching out this path, be the service connection request Resources allocation,, and upgrade network condition by the route of this path foundation from node A to node F.
The system in searching provided by the invention path as shown in Figure 9, comprise that auxiliary view sets up unit 901, arithmetic element 902, with control unit 903, can construct an auxiliary view according to current network condition for each service connection request that dynamically arrives equally, the structure of this auxiliary view can be before service connection request arrives, also can be after service connection request arrives, and then in this auxiliary view, seek out one and satisfy the path that reliability retrains, the maximum that promptly meets the service connection request requirement allows the path of failure probability, if adopt suitable algorithm can obtain the path of a cost minimum simultaneously, its each Elementary Function is as follows:
Auxiliary view is set up unit 901: be used to set up auxiliary view, the concrete method for building up of auxiliary view is not described in detail in this referring to above seeking step 502 and the described content of step 503 in the route method.
Arithmetic element 902: be used for after receiving service connection request, set up in the auxiliary view of setting up unit 901 at auxiliary view and seek the path of satisfying the reliability constraint.Finding method is not described in detail in this referring to above seeking the described content of step 504 in the route method.
Control unit 903: be used for behind the path of satisfying the reliability constraint that arithmetic element 902 searches out, the path that searches out by arithmetic element 902 for described service connection request is that service connection request is set up route, and the renewal network condition, to wait for the arrival of service connection request next time.If arithmetic element 902 does not search out the path of satisfying the reliability constraint, then refuse this service connection request.
More than a kind of searching route method provided by the present invention and system are described in detail, used specific case herein principle of the present invention and execution mode are set forth, the explanation of above embodiment just is used for helping to understand method of the present invention and core concept thereof; Simultaneously, for one of ordinary skill in the art, according to thought of the present invention, the part that all can change in specific embodiments and applications, in sum, this description should not be construed as limitation of the present invention.
Claims (4)
1. seek route method for one kind, it is characterized in that described method comprises:
Receive service connection request;
Foundation comprises that all can use the surplus resources network of resource in the network; Described surplus resources network is the combination that meets the link of service connection request requirement in the current network;
Set up the rest layers of surplus resources network according to described surplus resources network, comprise: for all nodes in the described surplus resources network are set up the child node of rest layers, it is right to the child node in rest layers by link-attached node to use connecting line to connect, wherein, the failure probability of all connecting lines is the failure probability of all connecting line respective links, and the cost of all connecting lines is the cost of all connecting line respective links; Described minimal cost path is to one group for cost minimum in the link combinations in path that can form two link disjoint;
And according to described surplus resources network set up the surplus resources network reflection all can set up the right shortest path of minimal cost path to layer, comprise: for all nodes in the described surplus resources network are set up the child node of shortest path to layer, use connecting line to connect all and can set up the right node of minimal cost path right to the child node in the layer at shortest path, wherein, all connecting line failure probabilities are 0, the cost of all connecting lines for all connecting line corresponding node between the cost of minimal cost path set up to expending;
Connect described rest layers and described shortest path to layer, obtain auxiliary view, comprise and use connecting line to connect described rest layers and the described shortest path corresponding child node to layer, all connecting line failure probabilities are 0;
In described auxiliary view, search out the path of satisfying the reliability constraint.
2. searching route method as claimed in claim 1 is characterized in that, the described path of satisfying the reliability constraint that searches out in described auxiliary view comprises:
After receiving service connection request, in described auxiliary view, search out the path of satisfying the reliability constraint of minimum cost.
3. a system of seeking the path is characterized in that, this system comprises that auxiliary view sets up unit and arithmetic element:
Described auxiliary view is set up the unit, is used for setting up comprising network all can using the surplus resources network of resource; Described surplus resources network is the combination that meets the link of service connection request requirement in the current network; Set up the rest layers of surplus resources network according to described surplus resources network, comprise: for all nodes in the described surplus resources network are set up the child node of rest layers, it is right to the child node in rest layers by link-attached node to use connecting line to connect, wherein, the failure probability of all connecting lines is the failure probability of all connecting line respective links, and the cost of all connecting lines is the cost of all connecting line respective links; Described minimal cost path is to one group for cost minimum in the link combinations in path that can form two link disjoint; And according to described surplus resources network set up the surplus resources network reflection all can set up the right shortest path of minimal cost path to layer, be included as in the described surplus resources network all nodes and set up the child node of shortest path layer, use connecting line to connect all and can set up the right node of minimal cost path right to the child node in the layer at shortest path, wherein, all connecting line failure probabilities are 0, the cost of all connecting lines for all connecting line corresponding node between the cost of minimal cost path set up to expending; Connect described rest layers and described shortest path to layer, obtain auxiliary view, comprise and use connecting line to connect described rest layers and the described shortest path corresponding child node to layer, all connecting line failure probabilities are 0;
Described arithmetic element is used for after receiving service connection request, sets up at described auxiliary view and searches out the path of satisfying the reliability constraint in the auxiliary view of setting up the unit.
4. the system in searching as claimed in claim 3 path is characterized in that:
Described arithmetic element is used for after receiving service connection request, searches out the path of satisfying the reliability constraint of minimum cost in described auxiliary view.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006101596686A CN101155139B (en) | 2006-09-30 | 2006-09-30 | Method and system for searching path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006101596686A CN101155139B (en) | 2006-09-30 | 2006-09-30 | Method and system for searching path |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101155139A CN101155139A (en) | 2008-04-02 |
| CN101155139B true CN101155139B (en) | 2011-07-06 |
Family
ID=39256583
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2006101596686A Expired - Fee Related CN101155139B (en) | 2006-09-30 | 2006-09-30 | Method and system for searching path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101155139B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE10345546A1 (en) * | 2003-09-30 | 2005-05-12 | Siemens Ag | Method for determining connection path for setting-up connection in transparent optical transmission system, e.g. of wavelength division multiplexing technology (WDM), with numerous optical transmission paths via network nodal points |
| KR20050076235A (en) * | 2004-01-20 | 2005-07-26 | 주식회사 케이티 | Network-resource allocation method using the novel heuristic mechanism for highly utilizable survivability in wdm |
| JP2006067067A (en) * | 2004-08-25 | 2006-03-09 | Kddi Corp | Optical network design method |
| CN1791000A (en) * | 2004-12-17 | 2006-06-21 | 电子科技大学 | Integrated service leading method for WDM optical network |
-
2006
- 2006-09-30 CN CN2006101596686A patent/CN101155139B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE10345546A1 (en) * | 2003-09-30 | 2005-05-12 | Siemens Ag | Method for determining connection path for setting-up connection in transparent optical transmission system, e.g. of wavelength division multiplexing technology (WDM), with numerous optical transmission paths via network nodal points |
| KR20050076235A (en) * | 2004-01-20 | 2005-07-26 | 주식회사 케이티 | Network-resource allocation method using the novel heuristic mechanism for highly utilizable survivability in wdm |
| JP2006067067A (en) * | 2004-08-25 | 2006-03-09 | Kddi Corp | Optical network design method |
| CN1791000A (en) * | 2004-12-17 | 2006-06-21 | 电子科技大学 | Integrated service leading method for WDM optical network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101155139A (en) | 2008-04-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Dutta et al. | A survey of virtual topology design algorithms for wavelength routed optical networks | |
| US6882627B2 (en) | Methods and apparatus for selecting multiple paths taking into account shared risk | |
| Lee | Spanning tree method for link state aggregation in large communication networks | |
| KR101548695B1 (en) | Apparatus and method for topology design of hybrid optical networks on chip | |
| US20040004938A1 (en) | Routing bandwidth guaranteed paths with local restoration in label switched networks | |
| CN101155137A (en) | Method for confirming routing path and its confirming unit | |
| CN104518961B (en) | It is grouped the leading method and device of optical transport network | |
| US20190020500A1 (en) | Network design method for ethernet ring protection switching | |
| CN102769563A (en) | Router calculation method and device | |
| CN108833142A (en) | A kind of network plan method of multi-core optical fiber planning business | |
| Datta et al. | Diverse routing for shared risk resource groups (SRRG) failures in WDM optical networks | |
| CN101179485B (en) | Route selecting method of new adding multicast member | |
| CN108429681B (en) | Source network element is to the multilayer shortest route method for searching and system between egress network element | |
| Guo et al. | Joint routing-selection algorithm for a shared path with differentiated reliability in survivable wavelength-division-multiplexing mesh networks | |
| CN103346964B (en) | Based on the method and system that the satellite-ground link of multilayer satellite network switches | |
| US9906435B2 (en) | Method and apparatus for determining intermediate routing node and system | |
| CN103200468B (en) | The route Wavelength allocation method of power optical fiber communication network and device | |
| CN101848153B (en) | Route establishing method and system for distinguishing reliability by power ICT (Information and Communication Technology) network | |
| CN101155139B (en) | Method and system for searching path | |
| Wessing et al. | Novel scheme for packet forwarding without header modifications in optical networks | |
| CN1707978B (en) | Method and apparatus for obtaining constrained path of loose routing in intelligent optical network | |
| Lu et al. | Asymmetric CDC ROADM architecture for efficient support of bi-directional asymmetric traffic demands | |
| Fang et al. | Performance analysis of WDM optical networks with wavelength usage constraint | |
| Zhang et al. | Backup fibre deployment algorithm based on daily traffic demand in fibre‐wireless (FiWi) access networks | |
| CN101841466B (en) | Optical network routing method based on diffusion of information |
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: 20110706 Termination date: 20150930 |
|
| EXPY | Termination of patent right or utility model |