CN101741717A - Conditional risk separation degree-based multiple domain network routing method - Google Patents

Conditional risk separation degree-based multiple domain network routing method Download PDF

Info

Publication number
CN101741717A
CN101741717A CN200810232163A CN200810232163A CN101741717A CN 101741717 A CN101741717 A CN 101741717A CN 200810232163 A CN200810232163 A CN 200810232163A CN 200810232163 A CN200810232163 A CN 200810232163A CN 101741717 A CN101741717 A CN 101741717A
Authority
CN
China
Prior art keywords
light path
inner light
domain
work
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.)
Pending
Application number
CN200810232163A
Other languages
Chinese (zh)
Inventor
赵季红
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to CN200810232163A priority Critical patent/CN101741717A/en
Publication of CN101741717A publication Critical patent/CN101741717A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention relates to the technology of optical communication and discloses a conditional risk separation degree-based multiple domain network routing method in a multi-domain optical transport network, which is characterized in that: 1) a single-domain route controller (RC) automatically discovers and searches an opposite RC through a neighbor to form a control plane; 2) the RC is in charge of implementing the single-domain topology abstraction, and performs mapping on a working/protecting internal optical path on an intra-domain virtual link to form a converged network topology; and 3) when a service request comes, (1) a source node transmits a route establishing request to the RC; (2) a source RC operates a routing algorithm on the converged network; (3) the source node adds the returned working/protecting route to a PSVP-TE PATH message, wherein the message performs a channel request along a designated route; (4) after receiving the PATH message, a target node selects a wavelength; and (5) a PSVP-TS RESV message containing the wavelength information returns along the PATH message, and finishes the resource reservation to the source node. The conditional risk separation degree-based multiple domain network routing method can not only meet the requirement on distinguishing reliability services, but also reduce the blocking rate of the service connection, and improve the availability and the resource utilization rate of the network.

Description

A kind of domain network based on the conditional risk separating degree is by method
Technical field
The invention belongs to the optical communication technique field, relate in particular in the multiple domain optical transport network a kind of domain network based on the conditional risk separating degree by method.
Background technology
At optical transfer network in high power capacity, synthesization, intelligent network evolution process, based on management, safety or route, the diversified consideration of technology, different network configurations is divided into different territories, between each operator, the network of same operator inside also is divided into different territories.Thereby optical transfer network trends towards the multiple domain optical transfer network.Step in communication industry under the background in " the professional king of being " epoch comprehensively, user oriented, service-oriented are based in the evolution of optical transfer network all the time, to satisfy the novel business that continues to bring out exactly: such as, Data mirroring (data image), Grid Computing (grid computing), Storage area networks (storage area network network), Video conferencing (video conference), OVPN (photosphere Virtual Private Network) etc., the universals of all these new business are: high bandwidth requirements, dynamic, a plurality of optical-fiber networks of leap territory.Yet in the multiple domain optical transfer network, by independently service provider's control, this just makes the interactive operation between the territory or between operator become the bottleneck of network evolution to each single domain respectively.Therefore, the seamless teleservice that how to satisfy cross-domain multiple domain optical transfer network effectively is that Internet service provider presses for one of most important challenge of solution.Wherein, multiple domain optical transfer network route is as the key index of weighing the network performance quality, and is the closest with real network application relation, is the current problem that presses for solution.
At present, the research at the routing mechanism of multiple domain optical transfer network just just begins.In order to promote research, many mechanisms in the whole world and NGO have been subsidized a large amount of projects.International Standards Organization also only just begins attentiveness is forwarded on this problem.ITU-T G 8080 agreements are carried out standardization to the ASON architectural framework; The main control protocol of being responsible for of the GMPLS of IETF (Generalized Multi-Protocol LabelSwitching, the exchange of general multiple protocols label) series; OIF is devoted to interconnecting of optical-fiber network, is responsible to define the optical network interface standard.TE working group has related to the network routing issue, other as CCAMP (Common Control and Measurement Plane, public control and measure the horizontal operation group) and other a few thing group also in this problem of concern.At present, the process of standard relatively lags behind, and research mostly is in draft and formulates the stage, remains further additional and perfect.
Under multi-domain environment, network is the interconnected of many separate single domain networks, the topology information in each territory and allocated bandwidth details are limited in the single domain scope, have only abstracted information as seen to external domain, the global information that allows certain node grasp network is unpractical, so-called extensibility constraint that Here it is.Based on extensibility and management strategy constraint, what routing database was safeguarded is incomplete topology information, coarse network state information.Given this, existing single domain routing solution all no longer is applicable to multiple domain.
At present in the research of multiple domain optical transfer network routing issue, obtained extensive favor based on the route matrix of hierarchical network, the scheme that adopts abstracted information to substitute global information has satisfied the demand of multiple domain route to a certain extent.
There are 2 deficiencies in such solution: (1) they just from the angle of route, with the bandwidth is that cost has been done desk study to multiple domain protection route, yet comprise the content of route and two aspects of Wavelength Assignment in the optical transfer network, simple consideration route is lost comprehensive; (2) they suppose that all physical link is that fault is independently each other; promptly need only consider working light path and the physical separation of protecting light path; yet in real network is used; the fault relevance that the physical link ubiquity is certain; " physical separation " increased the probability that work/the protection light path lost efficacy simultaneously undoubtedly, is difficult to guarantee professional reliable transmission.Simultaneously; the notion of physical separation has been expanded in the SRLG constraint that IETF proposes, and can reduce the risk that work/the protection physical link lost efficacy simultaneously, but SRLG is the pattern that a kind of complete risk is separated; do not consider the needs of distinguishing reliable service, network availability is low, resource utilization is low.In the practical application, different business has different reliability requirements, and simultaneously different user also has difference to the ability to bear of expense, therefore, is necessary to the research of traffic differentiation reliability.
Summary of the invention
The objective of the invention is to, the multiple domain optical transfer network method for routing based on the conditional risk separating degree is provided, not only satisfy the demand of distinguishing reliable service, and can reduce the professional blocking rate that connects, improve the availability and the resource utilization of network.
The objective of the invention is to be achieved through the following technical solutions: a kind of domain network based on the conditional risk separating degree be is characterized in that by method:
1) single domain path control deivce (RC) is found automatically by neighbours, searches for its reciprocity RC, forms the interoperability control plane;
2) RC is responsible for realizing the topological abstract of single domain, and virtual link in the territory is mapped as work in order to flow between carrying virtual link boundary node/protect inner light path, announces routing iinformation in the high-level control plane, forms the converging network topology;
3) when service request arrives: 1. source node sends the road construction request to RC; 2. source RC moves routing algorithm on converging network, will return a request response that comprises end-to-end work/protection route to source node through calculating; 3. source node is in the work returned/protection route adding RSVP-TE PATH message, this message along specified circuit by carrying out channel request; 4. destination node is used the selected wavelength of Wavelength assignment algorithm after receiving PATH message; 5. comprise wavelength information and will return along the former road of PATH message, be accomplished to the resource reservation of source point in interior RSVP-TS RESV message.
Described step 2) in the territory virtual link mapping be search in order to the work of flow between carrying virtual link boundary node/protect inner light path, work/protection light path that requirement obtains has reliability difference.
In the described step 1), before the inner light path of work/protection of search single domain, need the inner light path group of candidate in earlier definite this territory, method is: to virtual link e in the arbitrarily-shaped domain, use the SPF algorithm to obtain the shortest the most steady inner light path candidate set P e SEL(the inner light path sum of candidate n e SEL), two scale calibrations of use be (P, C), the failure probability of P (L) expression physical link L wherein,
Figure G2008102321637D0000041
The cost of expression physical link L, C L RESThe remaining bandwidth capacity of expression physical link L.
Described all single domains are all given tacit consent to the abstract technology of full mesh topology that adopts.
Described for belonging to inner light path candidate set P e SELEach q, calculate following parameters:
∀ q ∈ P e SEL
Remaining bandwidth r q = min L ∈ q C L RES
Failure probability
Figure G2008102321637D0000044
The condition probability of malfunction
Figure G2008102321637D0000045
Wherein: srlg iExpression link L iSRLG; The SRLG set of the inner light path q of S (q) expression, i.e. S (q)={ srlg i, L i∈ q}; CS (q 1, q 2) the inner light path q of expression 1And q 2The set of total SRLG, i.e. CS (q 1, q 2)=S (q 1) ∩ S (q 2).
Inner light path (the P of described work/protect e W/ P e B) searching algorithm as follows:
Start: all not selected inner light path of virtual link in all territories,
Figure G2008102321637D0000051
Or
Figure G2008102321637D0000052
Continue:
Step1: to virtual link e in the territory, at P e SELThe inner light path of middle search work, and add among the S set e; (condition: for e, because being selected into of this inside light path, newly-increased and the conditional risk separating degree sum backup virtual link
Figure G2008102321637D0000053
Maximum), wherein,
Figure G2008102321637D0000054
Put and represented inner light path at 1 o'clock
Figure G2008102321637D0000055
Belong to set
Figure G2008102321637D0000056
Otherwise put 0;
Figure G2008102321637D0000057
The expression q and
Figure G2008102321637D0000058
The conditional risk separating degree, promptly
Figure G2008102321637D0000059
Step2: in Se, search for q (condition: this q and the conditional risk separating degree sum of selecting the inner light path of work
Figure G2008102321637D00000510
Maximum), wherein, Put and represented inner light path at 1 o'clock
Figure G2008102321637D00000512
Figure G2008102321637D00000513
In, otherwise put 0;
P e W = P e W ∪ { q } , P e SEL = P e SEL \ { q } ;
Step3: search for a backup q (condition: for e, because being selected into of this inside light path, newly-increased and the conditional risk separating degree sum maximum work virtual link) similarly;
P e B = P e B ∪ { q } , P e SEL = P e SEL \ { q } ;
Step4: set (P e W+ P e B) in any one q, the physical link sequence is carried out the AND operation of wavelength available vector successively in its territory, obtains the wavelength available Vector Groups of light path q;
Step5: pair set (P e W+ P e B) in all q, the number of times that the summation wavelength available occurs, and limit to the end inside light path wavelength available vector based on thresholding Q;
Step6: virtual link is finished mapping in the next field;
Step7: next circulation ... when satisfying end condition, finish;
End: do not search the work that satisfies condition/protect inner light path, perhaps
Figure G2008102321637D0000061
Figure G2008102321637D0000062
So far, single domain RC has finished in the territory virtual link mapping, and has obtained having accordingly the inner light path of the work of reliability difference/protect.
Described conditional risk separating degree (CRDD) is defined as follows: from mathematics angle qualitative description the irrelevant degree of fault of two light paths.
Beneficial effect of the present invention: based on the multiple domain optical transfer network method for routing of conditional risk separating degree, can not only satisfy the demand of distinguishing reliable service in the multiple domain optical transfer network, and can reduce the professional blocking rate that connects, improve the availability and the resource utilization of network.
Description of drawings
The present invention will be further described below in conjunction with the embodiment accompanying drawing.
Fig. 1 is the topological abstract and the virtual link mapping schematic diagram of single domain among the present invention;
Fig. 2 be among the present invention employed emulation with reference to topological schematic diagram;
Fig. 3 is the blocking rate comparative analysis analogous diagram of institute's extracting method among the present invention;
Fig. 4 is the reliability comparative analysis analogous diagram of real work path among the present invention.
Embodiment
For simplifying the analysis, suppose that all single domains are all given tacit consent to adopt the abstract technology of full mesh topology, with D jBe example, as shown in Figure 1, from 1[a] to 1[b], work as D jThe territory in after RCj finishes topological abstract, obtain D jAbstract topology N j BORDERExpression D jBoundary node set, C j VIRTUALRepresent virtual link e (characteristic information in this territory is passed through in reaction) set in the territory of all fillet nodes.
(1) preparation of virtual link mapping in the territory
Before the inner light path of work/protection of search single domain, need the inner light path group of candidate in earlier definite this territory, method is: to virtual link e in the arbitrarily-shaped domain, use the SPF algorithm to obtain the shortest the most steady inner light path candidate set P e SEL(the inner light path sum of candidate n e SEL), two scale calibrations of use be (P, C), the failure probability of P (L) expression physical link L wherein,
Figure G2008102321637D0000071
The cost of expression physical link L, C L RESThe remaining bandwidth capacity of expression physical link L.
Still with D jBe example, as shown in Figure 2, from 1[b] to 1[c], any virtual link between the boundary node has all been determined possible inside light path group.
For belonging to inner light path candidate set P e SELEach q, calculate following parameters:
Remaining bandwidth r q = min L ∈ q C L RES
Failure probability
Figure G2008102321637D0000074
The condition probability of malfunction
Wherein: srlg iExpression link L iSRLG; The SRLG set of the inner light path q of S (q) expression, i.e. S (q)={ srlg i, L i∈ q}; CS (q 1, q 2) the inner light path q of expression 1And q 2The set of total SRLG, i.e. CS (q 1, q 2)=S (q 1) ∩ S (q 2).
(2) algorithm of virtual link mapping is realized in the territory
In conjunction with CRDD and above-mentioned preparation, inner light path (P works/protects e W/ P e B) searching algorithm be described below:
Start: all not selected inner light path of virtual link in all territories,
Figure G2008102321637D0000076
Or
Figure G2008102321637D0000077
Continue:
Step1: to virtual link e in the territory, at P e SELThe inner light path of middle search work, and add among the S set e.(condition: for e, because being selected into of this inside light path, newly-increased and the conditional risk separating degree sum backup virtual link Maximum), wherein,
Figure G2008102321637D0000082
Put and represented inner light path at 1 o'clock Belong to set
Figure G2008102321637D0000084
Otherwise put 0; The expression q and
Figure G2008102321637D0000086
The conditional risk separating degree, promptly
Figure G2008102321637D0000087
Step2: in Se, search for q (condition: this q and the conditional risk separating degree sum of selecting the inner light path of work
Figure G2008102321637D0000088
Maximum), wherein,
Figure G2008102321637D0000089
Put and represented inner light path at 1 o'clock
Figure G2008102321637D00000811
In, otherwise put 0.
P e W = P e W ∪ { q } , P e SEL = P e SEL \ { q } ;
Step3: search for a backup q (condition: for e, because being selected into of this inside light path, newly-increased and the conditional risk separating degree sum maximum work virtual link) similarly.
P e B = P e B ∪ { q } , P e SEL = P e SEL \ { q } ;
Step4: set (P e W+ P e B) in any one q, the physical link sequence is carried out the AND operation of wavelength available vector successively in its territory, obtains the wavelength available Vector Groups of light path q;
Step5: pair set (P e W+ P e B) in all q, the number of times that the summation wavelength available occurs, and limit to the end inside light path wavelength available vector based on thresholding Q;
Step6: virtual link is finished mapping in the next field;
Step7: next circulation ... when satisfying end condition, finish;
End: do not search the work that satisfies condition/protect inner light path, perhaps
Figure G2008102321637D00000816
Figure G2008102321637D00000817
So far, single domain RC has finished in the territory virtual link mapping, and has obtained having accordingly the inner light path of the work of reliability difference/protect.
Wherein, in the 2nd step, the algorithm of end-to-end work/protection route is achieved as follows among the Step3:
After all single domains had been finished topological abstract and virtual link mapping, RC broadcasted aggregation information by inter-domain routing protocol in control plane, form converging network.Since the converging network direct correlation physical link between inner light path and territory, therefore calculating based on the cost of converging network is accurately, and does not lose extensibility.
(1) preparation of end-to-end work/protection route
For work of crossing over multiple-domain network or protection light path p, calculate failure probability P (p inefficacy), condition probability of malfunction P (p 1Inefficacy/p 2Lost efficacy):
Figure G2008102321637D0000091
Wherein PS (p) represents the S of light path p jSet, PS (p)={ S j, j=1,2 ..., j is the link number of carrying light path; ES (p 1, p 2) expression light path p 1And p 2The set of total SRLG, ES (p 1, p 2))={ CS j, j=1,2 ....
According to the reliability requirement of specific transactions, algorithm need be searched for such work and protection light path (p WWith p B) right: the probability that they lost efficacy simultaneously is no more than (1-R), i.e. P (p WInefficacy ∩ p BLost efficacy)≤(1-R), obtain by Bayesian formula:
P (p WInefficacy ∩ p BLost efficacy)=P (p WLost efficacy) * P (p BInefficacy/p WLost efficacy)
The condition probability of malfunction formula of contact p
Figure G2008102321637D0000093
Figure G2008102321637D0000094
Therefore, in case satisfied following formula, also just be equivalent to satisfied should business reliability requirement.
Consider the reliability requirement of different business differentiation, can be to the SRLG processing of classifying, with optimized Algorithm, that is: for the srlg in the SRLG set iIf, P (srlg i)≤(1-R)/P (q WLost efficacy), promptly as work and related srlg of backup path while iThe time, still can satisfy the service reliability requirement, claim this srlg iFor not needing to consider the SRLG set of risk, otherwise for needing to consider the SRLG set of risk.Thus, the SRLG set is divided into two classes: needs are considered the srlg of risk iS set Disjoint=S Disjoint∪ { srlg iAnd do not need to consider the srlg of risk iSet (S-S Disjoint), when calculating backup path, for the srlg that does not need to consider risk i, its conditional risk separating degree puts 1, promptly to any srlg i∈ { S-S Disjoint, P (srlg i)=0.
(2) algorithm of end-to-end work/protection route is realized
The main thought of end-to-end work/protection routing algorithm is: to the link that those links with the service aisle process have identical SRLG sign, be not direct deletion it; Algorithm will back up the main foundation of the CRDD of inner light path as routing, and the optimum protection passage of correlation degree is distinguished in search on this basis.Routing algorithm is as follows:
Step1: working light path as far as possible through the low inside light path of failure probability, if the reliability of the working light path that obtains has satisfied service reliability R, just needn't calculate the protection light path: otherwise the casual labourer of use SPF algorithm computation makes light path, jumps to Step2;
Step2: the S that generates working light path jSet PS calculates PS based on R Disioint, and, to any S j∈ { PS-PS Disjoint, P (S j)=0;
Step3: the inside light path of deletion working light path process, domain-to-domain link and node use dijkstra-Improved algorithm computation protection light path.
Herein, and two yardsticks that the dijkstra-Improve algorithm uses (P, C), P (cs)=1-CRDD (cs) wherein, CRDD (cs) represents the conditional risk separating degree of inner light path q; The cost of inner light path q is expressed as C=1/r q, r qThe remaining bandwidth capacity of representing inner light path q.
So far, source RC will return a request response that comprises end-to-end work/protection explicit route to source node by operation end-to-end work/protection routing algorithm on converging network, and source node is initiated resource reservation request subsequently.
In order to illustrate, carried out emulation at multiple domain optical transfer network shown in Figure 2 based on the performance of the multiple domain optical transfer network method for routing of conditional risk separating degree.
Multiple domain optical transfer network physical topology shown in Figure 2 has comprised 28 nodes and 46 physical links, and every physical link is made up of the opposite one-way optical fiber of a pair of direction, and every optical fiber is supported 8 wavelength, and the single domain boundary node possesses wavelength conversion capability.
Suppose that in simulation process the reliable probability of network link is randomly dispersed between the 0.8-1.0, the condition probability of malfunction of link is 0.1,0.2,0.5 at random.Connection request be expressed as R (s, d, B, R), s and d are respectively source, the destination nodes of service request, b is a bandwidth occupancy, R is the service request reliability and is randomly dispersed between the 0.85-1.0.The source of all service request, destination node are to generating at random, and the Poisson distribution that connection request is obeyed parameter lambda according to Mean Speed independently arrives each node of network, the professional duration that connects is obeyed the negative exponent distribution that average is 1/u, and then the network total load is λ/u (Erlang).Algorithm is set up light path according to reliability R, if do not have success then connect to block, does not have queuing phenomena.
When emulation,, produce 10 respectively for different network load conditions 6Inferior service connection request uses statistical method to analyze.
(1) blocking rate that adopts the SMDR method has at first been studied in emulation.In order to show the advantage of SMDR method more intuitively, under the equal conditions, we have introduced two kinds of prior arts: consider the multiple domain level routing algorithm of physical separation, this technical mark is MHR; Do not distinguish the multiple domain risk separation algorithm of reliable service, this technical mark is the SD method.Fig. 3 has shown blocking rate comparative analysis analogous diagram.As shown in Figure 3, under the identical situation of offered load, the blocking rate of SMDR method is always between SD and MHR, this be because: compare the SD algorithm, the SMDR method is not directly those links with the service aisle process to be had the link circuit deleting of identical SRLG sign, and is based on the CRDD routing when the search route, this has increased the service efficiency of available resources greatly, thereby has improved the road construction probability of success; On the other hand, because the MHR algorithm has only only been considered the physical separation of work/protection passage,, obtained the blocking rate lower slightly than SMDR so when search protection passage, obtained wider optional network specific digit resource relatively.Simultaneously, can also find from Fig. 3 that under the lighter situation of offered load, the blocking rate of SMDR method is very little, the road construction ability that demonstrates it is at all no less than the MHR algorithm of considering physical separation.
(2) emulation is also studied the ability of SMDR method differentiation reliability simultaneously.The reliability that Fig. 4 has added up the service aisle of actual success foundation distributes, connection reliability random value between 0.924-0.962 of service request, as seen from Figure 4, the reliability of real work passage is all concentrated and is distributed between 0.991 to 0.998, stability of network and availability have been guaranteed, and for the high business of reliability requirement, its actual reliability is also higher relatively, has guaranteed to distinguish the performance index of reliability.Simultaneously, along with the increase of offered load, the actual reliability that connects presents faint downward trend, and this illustrates mainly that when offered load increases Internet resources are comparatively obvious to the influence of algorithm.

Claims (7)

  1. One kind based on the domain network of conditional risk separating degree by method, it is characterized in that: 1) single domain path control deivce (RC) is found automatically by neighbours, searches for its reciprocity RC, forms the interoperability control plane;
    2) RC is responsible for realizing the topological abstract of single domain, and virtual link in the territory is mapped as work in order to flow between carrying virtual link boundary node/protect inner light path, announces routing iinformation in the high-level control plane, forms the converging network topology;
    3) when service request arrives: 1. source node sends the road construction request to RC; 2. source RC moves routing algorithm on converging network, will return a request response that comprises end-to-end work/protection route to source node through calculating; 3. source node is in the work returned/protection route adding RSVP-TE PATH message, this message along specified circuit by carrying out channel request; 4. destination node is used the selected wavelength of Wavelength assignment algorithm after receiving PATH message; 5. comprise wavelength information and will return along the former road of PATH message, be accomplished to the resource reservation of source point in interior RSVP-TS RESV message.
  2. 2. a kind of domain network based on the conditional risk separating degree according to claim 1 is by method; it is characterized in that: described step 2) in the territory virtual link mapping be search in order to the work of flow between carrying virtual link boundary node/protect inner light path, work/protection light path that requirement obtains has reliability difference.
  3. 3. a kind of domain network based on the conditional risk separating degree according to claim 1 is by method; it is characterized in that: in the described step 1); before the inner light path of work/protection of search single domain; need the inner light path group of candidate in earlier definite this territory; method is: to virtual link e in the arbitrarily-shaped domain, use the SPF algorithm to obtain the shortest the most steady inner light path candidate set P e SEL(the inner light path sum of candidate n e SEL), two scale calibrations of use be (P, C), the failure probability of P (L) expression physical link L wherein, The cost of expression physical link L, C L RESThe remaining bandwidth capacity of expression physical link L.
  4. 4. a kind of domain network based on the conditional risk separating degree according to claim 1 be is characterized in that by method: described all single domains are all given tacit consent to the abstract technology of full mesh topology that adopts.
  5. 5. the multiple domain optical transfer network method for routing based on the conditional risk separating degree according to claim 1 is characterized in that: described for belonging to inner light path candidate set P e SELEach q, calculate following parameters: ∀ q ∈ P e SEL
    Remaining bandwidth r q = min L ∈ q C L RES
    Failure probability
    Figure F2008102321637C0000024
    The condition probability of malfunction
    Figure F2008102321637C0000025
    Wherein: srlg iExpression link L iSRLG; The SRLG set of the inner light path q of S (q) expression, i.e. S (q)={ srlg i, L i∈ q}; CS (q 1, q 2) the inner light path q of expression 1And q 2The set of total SRLG, i.e. CS (q 1, q 2)=S (q 1) ∩ S (q 2).
  6. 6. the multiple domain optical transfer network method for routing based on the conditional risk separating degree according to claim 1 is characterized in that: the inner light path (P of described work/protect e W/ P e B) searching algorithm as follows:
    Start: all not selected inner light path of virtual link in all territories,
    Figure F2008102321637C0000026
    Or
    Figure F2008102321637C0000027
    Continue:
    Step1: to virtual link e in the territory, at P e SELThe inner light path of middle search work, and add a set to
    Among the Se.(condition: for e, because being selected into of this inside light path, newly-increased and the conditional risk separating degree sum backup virtual link
    Figure F2008102321637C0000028
    Maximum), wherein,
    Figure F2008102321637C0000029
    Put and represented inner light path at 1 o'clock
    Figure F2008102321637C00000210
    Belong to set
    Figure F2008102321637C00000211
    Otherwise put 0;
    Figure F2008102321637C00000212
    The expression q and
    Figure F2008102321637C00000213
    Condition
    The risk separating degree, promptly
    Figure F2008102321637C0000031
    Step2: in Se, search for q (condition: this q and the conditional risk separating degree sum of selecting the inner light path of work
    Figure F2008102321637C0000032
    Maximum), wherein,
    Figure F2008102321637C0000033
    Put and represented inner light path at 1 o'clock
    Figure F2008102321637C0000034
    In, otherwise put 0.
    P e W = p e W ∪ { q } 、 p e SEL = P e SEL \ { q } ;
    Step3: search for a backup q (condition: for e, because being selected into of this inside light path, newly-increased and the conditional risk separating degree sum maximum work virtual link) similarly;
    P e B = P e B ∪ { q } 、 P e SEL = P e SEL \ { q } ;
    Step4: set (P e W+ P e B) in any one q, the physical link sequence is carried out the AND operation of wavelength available vector successively in its territory, obtains the wavelength available Vector Groups of light path q;
    Step5: pair set (P e W+ P e B) in all q, the number of times that the summation wavelength available occurs, and limit to the end inside light path wavelength available vector based on thresholding Q;
    Step6: virtual link is finished mapping in the next field;
    Step7: next circulation ... when satisfying end condition, finish;
    End: do not search the work that satisfies condition/protect inner light path, perhaps
    Figure F2008102321637C00000311
    So far, single domain RC has finished in the territory virtual link mapping, and has obtained having accordingly the inner light path of the work of reliability difference/protect.
  7. 7. the multiple domain optical transfer network method for routing based on the conditional risk separating degree according to claim 6, it is characterized in that: described conditional risk separating degree (CRDD) is defined as follows: from mathematics angle qualitative description the irrelevant degree of fault of two light paths.
CN200810232163A 2008-11-07 2008-11-07 Conditional risk separation degree-based multiple domain network routing method Pending CN101741717A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN200810232163A CN101741717A (en) 2008-11-07 2008-11-07 Conditional risk separation degree-based multiple domain network routing method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN200810232163A CN101741717A (en) 2008-11-07 2008-11-07 Conditional risk separation degree-based multiple domain network routing method

Publications (1)

Publication Number Publication Date
CN101741717A true CN101741717A (en) 2010-06-16

Family

ID=42464630

Family Applications (1)

Application Number Title Priority Date Filing Date
CN200810232163A Pending CN101741717A (en) 2008-11-07 2008-11-07 Conditional risk separation degree-based multiple domain network routing method

Country Status (1)

Country Link
CN (1) CN101741717A (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101873271A (en) * 2010-06-29 2010-10-27 西安交通大学 Business-driven cross-layer survivability method in multilayer network
CN102075429A (en) * 2011-01-21 2011-05-25 北京邮电大学 Virtual network mapping method based on principle of proximity
CN102546232A (en) * 2011-11-03 2012-07-04 北京邮电大学 Multi-topology mapping method of virtual network
CN106161230A (en) * 2016-06-29 2016-11-23 杭州华三通信技术有限公司 A kind of backup link determines method and device
CN109818858A (en) * 2017-11-20 2019-05-28 中国电信股份有限公司 For realizing the methods, devices and systems of topological relation automatic Mosaic between domain
CN109889930A (en) * 2019-03-26 2019-06-14 重庆邮电大学 A kind of virtual optical network mapping method and device for combining energy consumption and load balancing
CN114630215A (en) * 2021-12-14 2022-06-14 云南电网有限责任公司玉溪供电局 Risk assessment method for protecting subnet of optical transmission network

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101873271A (en) * 2010-06-29 2010-10-27 西安交通大学 Business-driven cross-layer survivability method in multilayer network
CN101873271B (en) * 2010-06-29 2012-07-18 西安交通大学 Business-driven cross-layer survivability method in multilayer network
CN102075429A (en) * 2011-01-21 2011-05-25 北京邮电大学 Virtual network mapping method based on principle of proximity
CN102546232A (en) * 2011-11-03 2012-07-04 北京邮电大学 Multi-topology mapping method of virtual network
CN102546232B (en) * 2011-11-03 2014-12-17 北京邮电大学 Multi-topology mapping method of virtual network
CN106161230A (en) * 2016-06-29 2016-11-23 杭州华三通信技术有限公司 A kind of backup link determines method and device
CN106161230B (en) * 2016-06-29 2020-10-30 新华三技术有限公司 Backup link determining method and device
CN109818858A (en) * 2017-11-20 2019-05-28 中国电信股份有限公司 For realizing the methods, devices and systems of topological relation automatic Mosaic between domain
CN109889930A (en) * 2019-03-26 2019-06-14 重庆邮电大学 A kind of virtual optical network mapping method and device for combining energy consumption and load balancing
CN109889930B (en) * 2019-03-26 2021-08-13 重庆邮电大学 Virtual optical network mapping method and device combining energy consumption and load balancing
CN114630215A (en) * 2021-12-14 2022-06-14 云南电网有限责任公司玉溪供电局 Risk assessment method for protecting subnet of optical transmission network

Similar Documents

Publication Publication Date Title
CN101515886A (en) Multi-domain optical network survivability method based on identification of reliable service
CN100459534C (en) Layer network node and network constituted throuth said nodes, the node and layer network thereof
CN1992676B (en) Method and device for forwarding state sharing between multiple traffic paths in a communication network
CN101267450B (en) Multicast routing method for distributed network application layer based on network coding
CN101741717A (en) Conditional risk separation degree-based multiple domain network routing method
CN105933174B (en) A kind of precomputation restoration methods based on apart from adaptive routing and frequency spectrum distribution
CN101562568B (en) Method and device for generating alternate routes of coverage network
CN102197625B (en) Provider link state bridging (PLSB) computation method
CN103379032A (en) Acquisition method and device for cross-domain end-to-end route and secondary route computation element
CN103001875A (en) Quantum cryptography network dynamic routing method
Jaumard et al. Efficient spectrum utilization in large scale RWA problems
CN101605280A (en) Dual-route computing unit system based on multi-layer multi-domain optical network
Koster et al. Graphs and algorithms in communication networks: studies in broadband, optical, wireless and ad hoc networks
CN103384251A (en) Multi-class safety service combinable safety network construction method and device
CN102075428B (en) Integrated routing setting method and device
Gu et al. Pricing Incentive Mechanism based on Multi-stages Traffic Classification Methodology for QoS-enabled Networks
Huang et al. A scalable path protection mechanism for guaranteed network reliability under multiple failures
CN101155433B (en) Service protection method and routing device
Tang et al. A novel multi-link fault-tolerant algorithm for survivability in multi-domain optical networks
Lastine et al. A fault-tolerant multipoint cycle routing algorithm (mcra)
Aibin et al. Monte Carlo tree search for cross-stratum optimization of survivable inter-data center elastic optical network
Zhang et al. A practical traffic control scheme with load balancing based on PCE architecture
CN102325039A (en) ASON (Automatically Switched Optical Network) optimization design method orienting to electric power control business
Wang Allocation of light splitters in all-optical WDM networks with sparse light splitting capabilities
CN105611435A (en) Calculating method of cross-photosphere electric straton wavelength route based on WSON (Wavelength Division Multiplexing) 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: 20100616