CN108900413A

CN108900413A - A kind of routed path selection method, device, electronic equipment and storage medium

Info

Publication number: CN108900413A
Application number: CN201810570409.5A
Authority: CN
Inventors: 李莉; 孔德慧
Original assignee: Beijing University of Posts and Telecommunications
Current assignee: Beijing University of Posts and Telecommunications
Priority date: 2018-06-05
Filing date: 2018-06-05
Publication date: 2018-11-27
Anticipated expiration: 2038-06-05
Also published as: CN108900413B

Abstract

The embodiment of the invention provides a kind of routed path selection method, device, electronic equipment and storage mediums, wherein this method includes：Obtain two restrictive conditions, and with the first restrictive condition in two restrictive conditions for the first constraint condition, when there is the routed path for meeting the first constraint condition in network topology, judge whether the routed path for meeting the first constraint condition meets the second restrictive condition in two restrictive conditions, when the routed path for meeting the first constraint condition meets the second restrictive condition in two restrictive conditions, determine that the routed path for meeting the first constraint condition is Optimization route path.So as to realize that the routed path selected in network topology fully meets selected restrictive condition.

Description

A kind of routed path selection method, device, electronic equipment and storage medium

Technical field

The present invention relates to software defined network technical fields, more particularly to a kind of routed path selection method, device, electricity Sub- equipment and storage medium.

Background technique

With the appearance of SDN, user also gradually increases the expectation of network, and user wishes that network can be to different types of Data flow provides different service guarantees, i.e. differentiated service.There are some common data streams to QoS (Quaility of Service, service quality) it is of less demanding, routed path selection can be carried out using common routing algorithm, but had some heavy The data flow wanted has strict requirements to QoS, needs to consider multiple restrictive conditions, how in complicated network according to user The multiple restrictive conditions proposed, the reliable routing path that efficiently and rapidly selection meets multiple restrictive condition become one urgently It solves the problems, such as.

In the prior art, some researchers propose a kind of method for selecting routed path by analytic hierarchy process (AHP), Specifically, this method constructs the judgment matrix including selected restrictive condition first, in accordance with importance proportion quotiety, then counts The feature vector for calculating the judgment matrix, by the feature vector of the judgment matrix, as the corresponding weight of selected restrictive condition Then value calculates the integrated value of selected restrictive condition, and selects routed path according to the integrated value,

However, it is found by the inventors that the prior art has the following problems：

When selecting routed path by analytic hierarchy process (AHP), this method is that selected restrictive condition is integrated into integrated value, Routed path selection is carried out further according to integrated value, it is selected that this method does not ensure that the routed path of selection complies fully with Restrictive condition.

Summary of the invention

Be designed to provide a kind of routed path selection method, device, electronic equipment and the storage of the embodiment of the present invention are situated between Matter, to realize the routed path for selecting to fully meet selected restrictive condition in network topology.Specific technical solution is as follows：

In a first aspect, being applied in network topology, the party the embodiment of the invention provides a kind of routed path selection method Method includes：

Two restrictive conditions are obtained, and with the first restrictive condition in two restrictive conditions for the first constraint condition, judgement With the presence or absence of the routed path for meeting the first constraint condition in network topology, wherein the first restrictive condition is two restrictive conditions In any restrictive condition；

When there is the routed path for meeting the first constraint condition in network topology, the road for meeting the first constraint condition is judged Whether the second restrictive condition in two restrictive conditions is met by path, wherein the second restrictive condition is in two restrictive conditions, Restrictive condition in addition to the first restrictive condition；

When the routed path for meeting the first constraint condition meets the second restrictive condition in two restrictive conditions, determine full The routed path of the first constraint condition of foot is Optimization route path.

Optionally, after in judging network topology with the presence or absence of the routed path for meeting the first constraint condition, the present invention A kind of routed path selection method of embodiment further includes：

When the routed path for meeting the first constraint condition is not present in network topology, according to two restrictive conditions, use Analytic hierarchy process (AHP) selects Optimization route path in network topology.

Optionally, judging whether the routed path for meeting the first constraint condition meets the second limit in two restrictive conditions After condition processed, a kind of routed path selection method of the embodiment of the present invention further includes：

In the routed path for meeting the first constraint condition, the second restrictive condition being unsatisfactory in two restrictive conditions, with Second restrictive condition is the second constraint condition, and selection meets the routed path of the second constraint condition in network topology；

It is bright using glug according to the routed path for the second constraint condition of routed path and satisfaction for meeting the first constraint condition Day relaxed algorithm calculates Optimization route path.

Optionally, it according to the routed path for the second constraint condition of routed path and satisfaction for meeting the first constraint condition, adopts With Lagrangian Relaxation Algorithm, Optimization route path is calculated, including：

The the first shortest route path p selected when according to the r times iteration_rWith the second shortest path selected when the s times iteration By path p_s, pass through the first formula

Calculate the iteration factor λ when iteration j of Lagrangian Relaxation Algorithm_j, wherein λ_jWhen for iteration j repeatedly For the factor, c (p_r) it is the first shortest route path p_rThe first via by routing information, d (p_r) it is the first shortest route path p_r's Secondary route routing information, c (p_s) the second shortest route path p_sThe first via by routing information, d (p_s) it is the second shortest route Path p_sSecondary route routing information, the first via includes by routing information and secondary route routing information：Shortest route path Delay and shortest route path bandwidth information, j, r, s are integer more than or equal to 0,0≤r < j, 0≤s < j, When r and s are not simultaneously 0, r is different from s；Work as r=0, and when s=0, p_rFor the routed path p for meeting the first constraint condition_c, c (p_r)=c (p_c), c (p_c) it is the routed path p for meeting the first constraint condition_cThe first restrictive condition, d (p_r)=d (p_c), d (p_c) it is the routed path p for meeting the first constraint condition_cThe second restrictive condition, p_sFor the routing road for meeting the first constraint condition Diameter p_d, c (p_s)=c (p_d), c (p_d) it is the routed path p for meeting the first constraint condition_dThe first restrictive condition, d (p_s)=d (p_d), d (p_d) it is the routed path p for meeting the first constraint condition_dThe second restrictive condition；

The link information for obtaining each of the links in network topology passes through the second formula according to link information and iteration factor：

The weighted value of each of the links when calculating iteration jAnd according to the weighted value of each of the links, pass through Dijkstra's algorithm selects third shortest route path when iteration j；

Judge whether third shortest route path when iteration j meets the first restrictive condition and the second restrictive condition；

Third shortest route path when iteration j meets the first restrictive condition and the second restrictive condition, by jth time Third shortest route path when iteration is determined as Optimization route path；

Third shortest route path when iteration j only meets the first restrictive condition, third when by iteration j The the first shortest route path p selected when shortest route path is as the r times iteration_r, and when repeating according to the r times iteration First shortest route path p of selection_rWith the second shortest route path p selected when the s times iteration_s, calculated by the first formula Iteration factor λ when the iteration j of Lagrangian Relaxation Algorithm_j；

Third shortest route path when iteration j only meets the second restrictive condition, by third shortest route path The the second shortest route path p selected when as the s times iteration_s, and while repeating according to the r times iteration select first most Shortest routing path p_rWith the second shortest route path p selected when the s times iteration_s, Lagrange relaxation is calculated by the first formula Iteration factor λ when the iteration j of algorithm_j；

Optionally, meet in two restrictive conditions when the first routed path, other limitations in addition to the first restrictive condition When condition, determine that the first routed path is a kind of routed path selection method of the embodiment of the present invention after Optimization route path, Further include：

Obtain the digraph of network topology corresponding with Optimization route path and the source node and mesh in Optimization route path Node；

The reverse route path in Optimization route path is obtained, and by the reverse route path in Optimization route path to network The digraph of topology is modified, and obtains the correction map of the digraph of network topology；

According to source node and destination node, searched in the correction map of the digraph of network topology by dijkstra's algorithm 4th shortest route path；

Obtain identical link in Optimization route path and the 4th shortest route path, and respectively from Optimization route path and Identical link is deleted in 4th shortest route path, obtain the Optimization route path for deleting identical link and is deleted identical The shortest route path of link；

All links in the Optimization route path of identical link will be deleted and delete the shortest route road of identical link All links of diameter form two paths, and using two paths as the alternate routing path in Optimization route path.

Second aspect, the embodiment of the invention also provides a kind of routed path selection devices, are applied in network topology, should Device includes：

First path selecting module, for obtaining two restrictive conditions, and with the first limitation item in two restrictive conditions Part is the first constraint condition, is judged in network topology with the presence or absence of the routed path for meeting the first constraint condition, wherein the first limit Condition processed is any restrictive condition in two restrictive conditions；

First judgment module, for when there is the routed path for meeting the first constraint condition in network topology, judgement to be full Whether the routed path of the first constraint condition of foot meets the second restrictive condition in two restrictive conditions, wherein the second limitation item Part is the restrictive condition in addition to the first restrictive condition in two restrictive conditions；

First optimal path selection module, for meeting two restrictive conditions when the routed path for meeting the first constraint condition In the second restrictive condition when, determine meet the first constraint condition routed path be Optimization route path.

Optionally, a kind of routed path selection device of the embodiment of the present invention further includes：

Second optimal path selection module, for when there is no the routed paths for meeting the first constraint condition in network topology When, according to two restrictive conditions, Optimization route path is selected in network topology using analytic hierarchy process (AHP).

Second path selection module, for being unsatisfactory for two restrictive conditions in the routed path for meeting the first constraint condition In the second restrictive condition when, with the second restrictive condition be the second constraint condition, in network topology selection meet second constraint The routed path of condition；

Third optimal path selection module, for according to the second constraint of routed path and satisfaction for meeting the first constraint condition The routed path of condition calculates Optimization route path using Lagrangian Relaxation Algorithm.

Optionally, third optimal path selection module, including：

Iteration factor computational submodule, the first shortest route path p selected when for according to the r times iteration_rWith the s times The the second shortest route path p selected when iteration_s, pass through the first formula

Weighted value computational submodule, for obtaining the link information of each of the links in network topology, according to link information and Iteration factor passes through the second formula：

First judging submodule, for judging whether third shortest route path when iteration j meets the first limitation Condition and the second restrictive condition；

First optimal path selection submodule, the third shortest route path when iteration j meet the first limitation item Part and the second restrictive condition, third shortest route path when by iteration j are determined as Optimization route path；

Third shortest route path when iteration j only meets the first restrictive condition, third when by iteration j The the first shortest route path p selected when shortest route path is as the r times iteration_r, and trigger iteration factor computational submodule；

Third shortest route path when iteration j only meets the second restrictive condition, by third shortest route path The the second shortest route path p selected when as the s times iteration_s, and and trigger iteration factor computational submodule.

Digraph obtain module, for obtain network topology corresponding with Optimization route path digraph and best road By the source node and destination node in path；

Correction module for obtaining the reverse route path in Optimization route path, and passes through the reversed of Optimization route path Routed path is modified the digraph of network topology, obtains the correction map of the digraph of network topology；

Shortest path searching module is used for according to source node and destination node, by dijkstra's algorithm in network topology Digraph correction map in search the 4th shortest route path；

Removing module, for obtaining identical link in Optimization route path and the 4th shortest route path, and respectively from Identical link is deleted in Optimization route path and the 4th shortest route path, obtains the Optimization route road for deleting identical link Diameter and the shortest route path for deleting identical link；

Backup path selecting module, for that will delete all links in the Optimization route path of identical link and delete phase All links in the shortest route path of same link form two paths, and using two paths as Optimization route path Alternate routing path.

The third aspect, the embodiment of the invention also provides a kind of electronic equipment, the electronic equipment include processor, communication connect Mouth, memory and communication bus, wherein processor, communication interface, memory complete mutual communication by communication bus；

Memory, for storing computer program；

Processor when for executing the program stored on memory, realizes the routed path selection of any description above Method.

Fourth aspect, the embodiment of the invention also provides a kind of computer readable storage medium, the computer-readable storages Dielectric memory contains computer program, and the routed path choosing of any description above is realized when which is executed by processor Selection method.

A kind of routed path selection method, device, electronic equipment and storage medium provided in an embodiment of the present invention, in network When selecting Optimization route path in topology, available two restrictive conditions, and with the first limitation item in two restrictive conditions Part is the first constraint condition, judges to work as network topology with the presence or absence of the routed path for meeting the first constraint condition in network topology When the middle routed path that there is the first constraint condition of satisfaction, judge whether the routed path for meeting the first constraint condition meets two The second restrictive condition in restrictive condition, when the routed path for meeting the first constraint condition meets second in two restrictive conditions When restrictive condition, determine that the routed path for meeting the first constraint condition is Optimization route path.It is opened up so as to realize in network The routed path for flutterring middle selection fully meets selected restrictive condition.Certainly, implement any of the products of the present invention or method simultaneously It is not necessarily required to reach all the above advantage simultaneously.

Detailed description of the invention

In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with It obtains other drawings based on these drawings.

Fig. 1 is a kind of flow chart of the first embodiment of routed path selection method of the embodiment of the present invention；

Fig. 2 is the structural schematic diagram using a kind of network topology of routed path selection method of the embodiment of the present invention；

Fig. 3 is a kind of flow chart of second of embodiment of routed path selection method of the embodiment of the present invention；

Fig. 4 is a kind of flow chart of the third embodiment of routed path selection method of the embodiment of the present invention；

Fig. 5 is a kind of flow chart of the 4th kind of embodiment of routed path selection method of the embodiment of the present invention；

Fig. 6 a is the structural schematic diagram of the digraph of network topology shown in Fig. 2；

Fig. 6 b is the structural schematic diagram of the correction map of the digraph of network topology shown in Fig. 6 a；

Fig. 7 is a kind of structural schematic diagram of routed path selection device of the embodiment of the present invention；

Fig. 8 is the structural schematic diagram of a kind of electronic equipment of the embodiment of the present invention.

Specific embodiment

Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other Embodiment shall fall within the protection scope of the present invention.

In order to solve the problems in the existing technology, the embodiment of the invention provides a kind of routed path selection method, Device, electronic equipment and storage medium, to realize the routing for selecting to fully meet selected restrictive condition in network topology Path.

In the following, a kind of routed path selection method of the embodiment of the present invention is introduced first, as shown in Figure 1, for this A kind of flow chart of the first embodiment of routed path selection method of inventive embodiments, in Fig. 1, this method be can wrap It includes：

S110 obtains two restrictive conditions, and with the first restrictive condition in two restrictive conditions for the first constraint condition, Judge in network topology with the presence or absence of the routed path for meeting the first constraint condition.

Wherein, the first restrictive condition is any restrictive condition in two restrictive conditions.

Specifically, can be selected first in the network topology best to use network topology to transmit file Then routed path transmits file according to the routed path of selection.

For example, Optimization route path is selected in network topology network topology that can be shown in Fig. 2, wherein Fig. 2 is application The structural schematic diagram of the network topology of a kind of routed path selection method of the embodiment of the present invention, in fig. 2 it is possible to include first Switching equipment 110, the second switching equipment 120, third switching equipment 130, the 4th switching equipment 140, the 5th switching equipment 150, 6th switching equipment 160, the 7th switching equipment 170, the 8th switching equipment 180, the 9th switching equipment 190.Can also include：The One link 201, the second link 202, third link 203, the 4th link 204, the 5th link 205, the 6th link 206, the 7th chain Road 207, the 8th link 208, the 9th link 209, the tenth link 210, the 11st link 211, the 12nd link the 212, the 13rd Link 213, the 14th link 214, the 15th link 215.

In some instances, in order to guarantee that the transmission quality of file can preset limitation when selecting routed path Then condition selects Optimization route path according to the restrictive condition in network topology.

It, can be using the embodiment of the present invention when selecting Optimization route path in network topology according to the restrictive condition A kind of routed path selection method selection Optimization route path.

Specifically, user can be in advance to a kind of routed path of routed path selection method of the application embodiment of the present invention Network topological information and two restrictive conditions are inputted in selection device.Wherein, which may include：Network topology In nodal information, the link information between every two node, which may include the identification information of the node, every two Link information between a node may include：Bandwidth letter between Delay, every two node between every two node Breath etc..Therefore, above-mentioned routed path selection device is available arrives network topology, and two corresponding with the network topology Restrictive condition.

In some instances, two above-mentioned restrictive conditions can be time delay restrictive condition and bandwidth constraints respectively.

Above-mentioned routed path selection device, can be in two restrictive conditions after getting two restrictive conditions Select any one restrictive condition for constraint condition, that is, select in two restrictive conditions the first restrictive condition for first about Then beam condition finds the routed path for meeting first constraint condition in network topology.

For example, can choose time delay restrictive condition is constraint condition, selection meets time delay limit in network topology shown in Fig. 2 The routed path of condition processed.Or selecting bandwidth constraints for constraint condition, selection meets band in network topology shown in Fig. 2 The routed path of wide restrictive condition.

It in some instances, can be in net when searching meets the routed path of first constraint condition in network topology A routed path is randomly choosed in network topology, then judges whether the randomly selected routed path meets the first constraint item The randomly selected routed path is then determined as meeting the road of first constraint condition by part when meeting the first constraint condition By path.

Otherwise, a routed path is randomly choosed again, and judges whether to meet the first constraint condition.

Specifically, above-mentioned routed path selection device is after selecting a routed path, the available routed path On every two node between link information in information corresponding with constraint condition, then to all chains on the routed path The summation of corresponding with constraint condition information, then compares with constraint condition in the link information of road, to judge whether satisfaction the One constraint condition.

It is assumed that the constraint condition that above-mentioned routed path selection device selects is time delay restrictive condition, then in selection one After routed path, the Delay between every two node on the available routed path, then on the routed path All Delays summations, judge whether to meet constraint condition.

S120 judges to meet the first constraint item when there is the routed path for meeting the first constraint condition in network topology Whether the routed path of part meets the second restrictive condition in two restrictive conditions.

Wherein, the second restrictive condition is the restrictive condition in addition to the first restrictive condition in two restrictive conditions.

When above-mentioned routed path selection device determines the routed path for existing in network topology and meeting the first constraint condition Afterwards, in order to enable the Optimization route path of selection can meet two restrictive conditions simultaneously, in this step, it can be determined that this is full Whether the routed path of the first constraint condition of foot meets the second restrictive condition.

It is assumed that the first constraint condition that above-mentioned routed path selection device selects is time delay restrictive condition, selection is expired The routed path of the first constraint condition is enough：By the first switching equipment 110, the second link 202, third switching equipment the 130, the 7th Link 207, the 5th switching equipment 150, the tenth link 210, the 7th switching equipment 170, the exchange of the 13rd link the 213, the 9th are set The routed path of standby 190 composition.In this step, it can be determined that whether the routed path meets bandwidth constraints.

S130, when the routed path for meeting the first constraint condition meets the second restrictive condition in two restrictive conditions, Determine that the routed path for meeting the first constraint condition is Optimization route path.

Specifically, when above-mentioned routed path selection device is determining the routed path satisfaction two for meeting the first constraint condition When the second restrictive condition in a restrictive condition, illustrates the routed path of first constraint condition of satisfaction while meeting the first limitation Therefore the routed path of first constraint condition of satisfaction can be determined as Optimization route path by condition and the second restrictive condition.

For example, it is assumed that above-mentioned routed path selection device is in the routed path to above-mentioned the first constraint condition of satisfaction The bandwidth information of each link is summed, and after comparing with bandwidth constraints, meets the bandwidth constraints, at this In step, can by first constraint condition of satisfaction, by the first switching equipment 110, the second link 202, third switching equipment 130, the 7th link 207, the 5th switching equipment 150, the tenth link 210, the 7th switching equipment 170, the 13rd link 213, The routed path of nine switching equipment 190 composition, is determined as Optimization route path.

A kind of routed path selection method through the embodiment of the present invention selects Optimization route path in network topology When, available two restrictive conditions, and net is judged for the first constraint condition with the first restrictive condition in two restrictive conditions With the presence or absence of the routed path for meeting the first constraint condition in network topology, meet the first constraint condition when existing in network topology When routed path, judge whether the routed path for meeting the first constraint condition meets the second limitation item in two restrictive conditions Part determines when the routed path for meeting the first constraint condition meets the second restrictive condition in two restrictive conditions and meets the The routed path of one constraint condition is Optimization route path.So as to realize that the routed path selected in network topology is complete Meet selected restrictive condition.

In a kind of optional embodiment of the embodiment of the present invention, a kind of base of routed path selection method shown in Fig. 1 On plinth, the embodiment of the invention also provides a kind of possible implementations, as shown in figure 3, being a kind of road of the embodiment of the present invention By the flow chart of second of embodiment of routing resource, in Fig. 3, in S110, judge in network topology with the presence or absence of full After the routed path of the first constraint condition of foot, a kind of routed path selection method of the embodiment of the present invention can also include：

S140, when in network topology there is no when the routed path for meeting the first constraint condition, according to two restrictive conditions, Optimization route path is selected in network topology using analytic hierarchy process (AHP).

In some instances, for above-mentioned routed path selection device in determining above-mentioned network topology, there is no meet When the routed path of the first constraint condition, it can be said that it is bright, it is necessarily not present in the network topology while meeting this two limitations The routed path of condition.In this regard, the embodiment of the invention also provides a kind of possible implementation, to select closest to above-mentioned limit The Optimization route path of condition processed.

Specifically, above-mentioned routed path selection device can locally preserve importance proportion quotiety as shown in Table 1 Table, then the importance proportion quotiety table according to shown in two restrictive conditions and table 1, development of judgment matrix, and then can count The feature vector of the judgment matrix is calculated, and using this feature vector as the weighted value of two restrictive conditions, finally, can basis The integrated value of the weighted value for two restrictive conditions being calculated selects routed path.It is selected with realizing closest to above-mentioned limitation The Optimization route path of condition.

1 importance proportion quotiety table of table

Different degree project	Different degree index	Different degree project	Different degree index
				It is of equal importance	1	It is obvious more important	7
It is relatively important	3	It is absolutely essential	9
				It is more important	5	Median	2,4,6,8

In a kind of optional embodiment of the embodiment of the present invention, a kind of base of routed path selection method shown in Fig. 1 On plinth, the embodiment of the invention also provides a kind of possible implementations, as shown in figure 4, being a kind of road of the embodiment of the present invention By the flow chart of the third embodiment of routing resource, in Fig. 4, in S120, the road for meeting the first constraint condition is judged After whether meeting the second restrictive condition in two restrictive conditions by path, a kind of routed path of the embodiment of the present invention is selected Method can also include：

S150, in the routed path for meeting the first constraint condition, the second restrictive condition being unsatisfactory in two restrictive conditions When, with the second restrictive condition for the second constraint condition, selection meets the routed path of the second constraint condition in network topology.

In some instances, above-mentioned routed path selection device is determining the routed path for meeting the first constraint condition Afterwards, in order to find while meeting the Optimization route path of the first restrictive condition and the second restrictive condition, it can be determined that the satisfaction Whether the routed path of one constraint condition meets the second restrictive condition.When the routed path of first constraint condition of satisfaction is unsatisfactory for When the second restrictive condition, a kind of routed path selection method of the embodiment of the present invention additionally provides a kind of possible implementation.

Specifically, above-mentioned routed path selection device is unsatisfactory in the routed path for judging first constraint condition of satisfaction , can be with the second restrictive condition for the second constraint condition when the second restrictive condition, selection meets the second constraint in network topology The routed path of condition.

For example, the first constraint condition that above-mentioned routed path selection device selects is time delay restrictive condition, selection is expired The routed path of the first constraint condition is enough：By the first switching equipment 110, the second link 202, third switching equipment the 130, the 7th Link 207, the 5th switching equipment 150, the tenth link 210, the 7th switching equipment 170, the exchange of the 13rd link the 213, the 9th are set The routed path of standby 190 composition.In this step, it can be determined that whether the routed path meets bandwidth constraints.When this is full The routed path of the first constraint condition of foot is when being unsatisfactory for the second restrictive condition, then with the in network topology that can be shown in Fig. 2 Two restrictive conditions are the second constraint condition, and selection meets the routed path of the second constraint condition.

S160 is used according to the routed path for the second constraint condition of routed path and satisfaction for meeting the first constraint condition Lagrangian Relaxation Algorithm calculates Optimization route path.

Specifically, above-mentioned routed path selection device choose meet the second constraint condition routed path after, can To use Lagrangian Relaxation Algorithm, the routed path of the first constraint condition and the second constraint condition is calculated while meeting, also It is the routed path for calculating while meeting the first restrictive condition and the second restrictive condition.

For example, it is assumed that the routed path for the second constraint condition of satisfaction that above-mentioned routed path selection device selects for：By First switching equipment 110, third link 203, the 4th switching equipment 140, the 9th link 209, the 6th switching equipment the 160, the tenth The routed path that two links 212, the 8th switching equipment 180, the 15th link 215, the 9th switching equipment 190 form, in this step In rapid, above-mentioned routed path selection device can be according to by the first switching equipment 110, the second link 202, third switching equipment 130, the 7th link 207, the 5th switching equipment 150, the tenth link 210, the 7th switching equipment 170, the 13rd link 213, Nine switching equipment 190 composition routed path, and by the first switching equipment 110, third link 203, the 4th switching equipment 140, 9th link 209, the 6th switching equipment 160, the 12nd link 212, the 8th switching equipment 180, the 15th link the 215, the 9th The routed path that switching equipment 190 forms calculates Optimization route path using Lagrangian Relaxation Algorithm.

By using Lagrangian Relaxation Algorithm, in network topology that can be shown in Fig. 2, selects while meeting above-mentioned Two restrictive conditions routed path so that selection Optimization route path can meet this two limitation items simultaneously Part.

In some instances, in the routing according to the second constraint condition of routed path and satisfaction for meeting the first constraint condition Path can be calculated using Lagrangian Relaxation Algorithm when calculating Optimization route path by following steps：

Step A, the first shortest route path p selected when according to the r times iteration_rWith selected when the s times iteration second Shortest route path p_s, pass through the first formula

Calculate the iteration factor λ when iteration j of Lagrangian Relaxation Algorithm_j。

Wherein, λ_jIteration factor when for iteration j, c (p_r) it is the first shortest route path p_rThe first routed path Information, d (p_r) it is the first shortest route path p_rSecondary route routing information, c (p_s) the second shortest route path p_sFirst Routed path information, d (p_s) it is the second shortest route path p_sSecondary route routing information.J, r, s are more than or equal to 0 Integer, 0≤r < j, 0≤s < j, when r and s is not simultaneously 0, r is different from s.

Work as r=0, and when s=0, then illustrates that above-mentioned routed path selection device is not iterated also, p_rTo meet first The routed path p of constraint condition_c, c (p_r)=c (p_c), c (p_c) it is the routed path p for meeting the first constraint condition_cFirst limitation Condition, d (p_r)=d (p_c), d (p_c) it is the routed path p for meeting the first constraint condition_cThe second restrictive condition, p_sTo meet the The routed path p of one constraint condition_d, c (p_s)=c (p_d), c (p_d) it is the routed path p for meeting the first constraint condition_dFirst limit Condition processed, d (p_s)=d (p_d), d (p_d) it is the routed path p for meeting the first constraint condition_dThe second restrictive condition.

Step B obtains the link information of each of the links in network topology, and according to link information and iteration factor, passes through Second formula：

c_λ,i=c_i+λ_j·d_i

The weighted value c of each of the links when calculating iteration j_λ,i, and according to the weighted value of each of the links, pass through Dijkstra's algorithm selects third shortest route path when iteration j.

Step C, judges whether third shortest route path when iteration j meets the first restrictive condition and the second limitation Condition.

Step D, the third shortest route path when iteration j meet the first restrictive condition and the second restrictive condition, Third shortest route path when by iteration j is determined as Optimization route path.

Step E, the third shortest route path when iteration j only meets the first restrictive condition, when by iteration j Third shortest route path as the r times iteration when the first shortest route path p for selecting_r, and repeat according to the r times The the first shortest route path p selected when iteration_rWith the second shortest route path p selected when the s times iteration_s, pass through the first public affairs Formula calculates the iteration factor λ when iteration j of Lagrangian Relaxation Algorithm_j。

Step F, the third shortest route path when iteration j only meets the second restrictive condition, by third shortest path The the second shortest route path p selected when by path as the s times iteration_s, and while repeating according to the r times iteration, selects First shortest route path p_rWith the second shortest route path p selected when the s times iteration_s, it is bright that glug is calculated by the first formula Iteration factor λ when the iteration j of day relaxed algorithm_j。

Illustrate in the embodiment of the present invention in order to clearer, according to the routed path for meeting the first constraint condition and meets the The routed path of two constraint conditions calculates the process in Optimization route path using Lagrangian Relaxation Algorithm, below with for the first time It is illustrated for iteration and second of iteration.

Work as r=0, and when s=0, then explanation does not change also when calculating Optimization route path using Lagrangian Arithmetic Generation, then p_rFor the routed path p for meeting the first constraint condition_c, p_sFor the routed path p for meeting the first constraint condition_d, therefore, on The first formula stated can be equivalent to following formula：

Wherein, c (p_r)=c (p_c), c (p_c) it is the routed path p for meeting the first constraint condition_cThe first restrictive condition, d (p_r)=d (p_c), d (p_c) it is the routed path p for meeting the first constraint condition_cThe second restrictive condition, c (p_s)=c (p_d), c (p_d) it is the routed path p for meeting the first constraint condition_dThe first restrictive condition, d (p_s)=d (p_d), d (p_d) it is to meet first about The routed path p of beam condition_dThe second restrictive condition；

By the formula, above-mentioned routed path selection device can calculate primary iteration factor lambda₀, then can obtain At least two link informations in each of the links are taken, and pass through following formula：

The weighted value of each of the links when calculating the 0th iteration

Wherein, c_iFor the first link information of i-th link, d_iSecond link information of i-th link.

Above-mentioned routed path selection device is in the weighted value c that each of the links are calculated_λ,iIt afterwards, can be according to the 0th time repeatedly For when each of the links weighted valueIn network topology, shortest route path is selected by dijkstra's algorithm.

For example, the first link 201 in the available network topology shown in Fig. 2 of above-mentioned routed path selection device, Second link 202, third link 203, the 4th link 204, the 5th link 205, the 6th link 206, the 7th link the 207, the 8th Link 208, the 9th link 209, the tenth link 210, the 11st link 211, the 12nd link 212, the 13rd link 213, 14 links 214, the 15th link 215, the bandwidth information and Delay of totally ten five links, then pass through above-mentioned formula pair The Delay and bandwidth information of each of the links are weighted processing, and then can be shown in Fig. 2 by dijkstra's algorithm Shortest route path when the 0th iteration is selected in network topology.

When shortest route path of the above-mentioned routed path selection device when determining the 0th iteration meets the first limitation When condition and the second restrictive condition, then illustrate that shortest route path when the 0th iteration is that Optimization route path therefore can Shortest route path when with by the 0th iteration is determined as Optimization route path.

In some instances, the shortest route road when above-mentioned routed path selection device when determining the 0th iteration When diameter only meets the first restrictive condition, the embodiment of the invention also provides a kind of possible implementations, to pass through the side of iteration Formula searches while meeting the routed path of the first restrictive condition and the second restrictive condition in network topology.

For example, it is assumed that above-mentioned routed path selection device judges that shortest route path when the 0th iteration only meets One restrictive condition, then shortest route path when can be by the 0th iteration, as the routed path for meeting the first restrictive condition, And the shortest route path p selected when executing according to the 0th iteration₀With meet the second restrictive condition routed path, by with Lower formula：

Calculate iteration factor λ when the 1st iteration of Lagrangian Relaxation Algorithm₁.Wherein, c (p₀) it is shortest route path p₀The first via by routing information, d (p₀) it is shortest route path p₀Secondary route routing information.Wherein, the first via is by road Diameter information and secondary route routing information can be shortest route path p₀Multiple routed path information in any two routing Routing information, for example, the first via can be shortest route path p respectively by routing information and secondary route routing information₀'s Delay and bandwidth information.

Then further according to the link information of each of the links in the iteration factor and network topology, pass through the second formula：

The weighted value of each of the links when calculating the 1st iterationAnd according to the weighted value of each of the linksPass through Dijkstra's algorithm selects shortest route path p when the 1st iteration₁；

Assuming that shortest route path p of the above-mentioned routed path selection device when obtaining the 1st iteration₁, and determining should Shortest route path p when the 1st iteration₁Shortest route when only meeting the second restrictive condition, then when can be by the 1st iteration Path p₁, as the routed path for meeting the second restrictive condition, and execute the shortest route path that selects when according to the 1st iteration p₁With shortest route path p when the 0th iteration₀, pass through following formula：

Calculate iteration factor λ when the 2nd iteration of Lagrangian Relaxation Algorithm₂.Wherein, c (p₁) it is shortest route path p₁The first via by routing information, d (p₁) it is shortest route path p₁Secondary route routing information, then further according to the iteration The link information of each of the links in the factor and network topology, passes through the second formula：

The weighted value of each of the links when calculating the 2nd iterationAnd according to the weighted value of each of the linksPass through Dijkstra's algorithm selects shortest route path p when the 2nd iteration₂。

Assuming that shortest route path p of the above-mentioned routed path selection device when judging the 2nd iteration₂Meet first Shortest route path p when restrictive condition and the second restrictive condition, then when can be by the 2nd iteration₂It is determined as Optimization route Path.

With the routed path in the prior art that can only calculate one restrictive condition of satisfaction using Lagrangian Relaxation Algorithm Mode compare, a kind of routed path selection method through the embodiment of the present invention, may be implemented using Lagrange relaxation calculate Method calculates while meeting the routed path of two restrictive conditions.

In a kind of optional embodiment of the embodiment of the present invention, a kind of base of routed path selection method shown in Fig. 1 On plinth, the embodiment of the invention also provides a kind of possible implementations, as shown in figure 5, being a kind of road of the embodiment of the present invention By the flow chart of the 4th kind of embodiment of routing resource, in Fig. 5, in S130, when the first routed path meets two limits In condition processed, when other restrictive conditions in addition to the first restrictive condition, after determining that the first routed path is Optimization route path, A kind of routed path selection method of the embodiment of the present invention can also include：

S170 obtains the digraph of network topology corresponding with Optimization route path and the source node in Optimization route path And destination node.

In some instances, above-mentioned routed path selection device is after determining Optimization route path, in order to best at this When routed path breaks down, it can provide services to the user in time, a kind of routing resource of the embodiment of the present invention may be used also To select backup path in the network topology, after breaking down to avoid optimal path routing, network topology cannot be to user Service is provided.

Specifically, the above-mentioned available network topology corresponding with Optimization route path of routed path selection device has To figure and the source node and destination node in Optimization route path.

For example, it is assumed that the Optimization route path that above-mentioned routed path selection device obtains, for by the first switching equipment 110, the second link 202, third switching equipment 130, the 8th link 208, the 6th switching equipment 160, the 12nd link 212, The routed path for the routed path composition that eight switching equipment 180, the 15th link 215, the 9th switching equipment 190 form, the net The digraph of network topology is as shown in Figure 6 a, then the source node in the Optimization route path is the first switching equipment 110, and destination node is 9th switching equipment 190.

S180 obtains the reverse route path in Optimization route path, and passes through the reverse route path in Optimization route path The digraph of network topology is modified, the correction map of the digraph of network topology is obtained.

Specifically, above-mentioned routed path selection device, is obtaining having for network topology corresponding with Optimization route path To after figure and the source node and destination node in Optimization route path, can be obtained best in the digraph of the network topology The reverse route path of routed path, and carried out by digraph of the reverse route path in Optimization route path to network topology Amendment, obtains the correction map of the digraph of network topology.

For example, as shown in Figure 6 b, being the structural schematic diagram of the correction map of the digraph of network topology shown in Fig. 6 a, scheming It may include by the first switching equipment 110, the reverse link 202' of the second link 202, third switching equipment the 130, the 8th in 6b The reverse link 208' of link 208, the 6th switching equipment 160, the reverse link 212' of the 12nd link 212, the 8th exchange are set The reverse route path of standby 180,215 reverse link 215' of the 15th link, the 9th switching equipment 190 composition.

S190, according to source node and destination node, by dijkstra's algorithm the digraph of network topology correction map The 4th shortest route path of middle lookup；

Above-mentioned routed path selection device, can be with after obtaining the correction map of digraph of network topology shown in Fig. 2 According to source node and destination node, in the correction map of the digraph of the network topology, the 4th is searched by dijkstra's algorithm Shortest route path.

For example, it is assumed that the correction map of the digraph of above-mentioned network topology is correction map shown in Fig. 6 b, then it can basis Source node " the first switching equipment 110 " and destination node " the 9th switching equipment 190 ", by dijkstra's algorithm, in Fig. 6 b institute Shortest route path is searched in the correction map shown.

S200 obtains identical link in Optimization route path and shortest route path, and respectively from Optimization route path With delete identical link in shortest route path, obtain deleting the Optimization route path of identical link and delete identical chain The shortest route path on road.

Specifically, above-mentioned routed path selection device finds the 4th in the correction map from the digraph of network topology Behind shortest route path, identical link in available Optimization route path and shortest route path, and respectively from best road By deleting identical link in path and shortest route path, obtaining the Optimization route path for deleting identical link and deleting phase The shortest route path of same link.

For example, it is assumed that the 4th shortest route path that selects of above-mentioned routed path selection device for：It is set by the first exchange Standby 110, third link 203, the 4th switching equipment 140, the 9th link 209, the 6th switching equipment 160, the 8th link 208 it is anti- It is set to link 208', third switching equipment 130, the 7th link 207, the 5th switching equipment 150, the exchange of the tenth link the 210, the 7th Standby 170, the 13rd link 213, the 9th switching equipment 190.

Optimization route path is：By the first switching equipment 110, the second link 202, third switching equipment 130, the 8th link 208, the 6th switching equipment 160, the 12nd link 212, the 8th switching equipment 180, the 15th link 215, the 9th switching equipment The routed path of the routed path composition of 190 compositions.

Since the reverse link 208' of the 8th link 208 and the 8th link 208 is only contrary, it is believed that this two Link is identical, therefore, respectively by the reverse link 208' of the 8th link 208 and the 8th link 208 from the path at respective place Middle deletion.Obtain deleting the path of the 8th link 208：First switching equipment 110, the second link 202, third switching equipment 130, 6th switching equipment 160, the 12nd link 212, the 8th switching equipment 180, the 15th link 215, the 9th switching equipment 190, Delete the path of the reverse link 208' of the 8th link 208：First switching equipment 110, third link 203, the 4th switching equipment 140, the 9th link 209, the 6th switching equipment 160, third switching equipment 130, the 7th link 207, the 5th switching equipment 150, Tenth link 210, the 7th switching equipment 170, the 13rd link 213, the 9th switching equipment 190.

S210 will delete all links in the Optimization route path of identical link and delete the shortest path of identical link By all links in path, two paths are formed, and using two paths as the alternate routing path in Optimization route path.

Above-mentioned routed path selection device is in the Optimization route path for obtaining deleting identical link and deletes identical Behind the shortest route path of link, according to the Optimization route path of the identical link of the deletion and identical link can be deleted Shortest route path selects alternate routing path of two paths as Optimization route path, to realize in Optimization route path When failure, service is provided using alternate routing path.

For example, above-mentioned routed path selection device, the path of obtained the 8th link 208 of deletion：First switching equipment 110, the second link 202, third switching equipment 130, the 6th switching equipment 160, the 12nd link 212, the 8th switching equipment 180, the 15th link 215, the 9th switching equipment 190.The path of the reverse link 208' of obtained the 8th link 208 of deletion： First switching equipment 110, third link 203, the 4th switching equipment 140, the 9th link 209, the 6th switching equipment 160, third Switching equipment 130, the 7th link 207, the 5th switching equipment 150, the tenth link 210, the 7th switching equipment 170, the 13rd chain Road 213, the 9th switching equipment 190.

It then can be in the reverse link of the 8th link 208 of all links and deletion in the path by deleting the 8th link 208 In all links in the path of 208', two paths are selected, as alternate routing path.

For example, two paths that above-mentioned routed path selection device selects can be figure such as is respectively：By the first exchange Equipment 110, the second link 202, third switching equipment 130, the 7th link 207, the 5th switching equipment 150, the tenth link 210, 7th switching equipment 170, the 13rd link 213, the 9th switching equipment 190 composition path, and by the first switching equipment 110, Third link 203, the 4th switching equipment 140, the 9th link 209, the 6th switching equipment 160, the 12nd link the 212, the 8th are handed over The path of exchange device 180, the 15th link 215, the 9th switching equipment 190 composition.

Corresponding to above-mentioned embodiment of the method, the embodiment of the invention also provides a kind of routed path selection device, such as Fig. 7 It is shown, it is a kind of structural schematic diagram of routed path selection device of the embodiment of the present invention, in Fig. 7, the apparatus may include：

First path selecting module 710, for obtaining two restrictive conditions, and with the first limitation in two restrictive conditions Condition is the first constraint condition, is judged in network topology with the presence or absence of the routed path for meeting the first constraint condition, wherein first Restrictive condition is any restrictive condition in two restrictive conditions；

First judgment module 720, for judging when there is the routed path for meeting the first constraint condition in network topology Whether the routed path for meeting the first constraint condition meets the second restrictive condition in two restrictive conditions, wherein the second limitation Condition is the restrictive condition in addition to the first restrictive condition in two restrictive conditions；

First optimal path selection module 730, for meeting two limitations when the routed path for meeting the first constraint condition When the second restrictive condition in condition, determine that the routed path for meeting the first constraint condition is Optimization route path.

A kind of routed path selection device provided in an embodiment of the present invention selects Optimization route path in network topology When, available two restrictive conditions, and net is judged for the first constraint condition with the first restrictive condition in two restrictive conditions With the presence or absence of the routed path for meeting the first constraint condition in network topology, meet the first constraint condition when existing in network topology When routed path, judge whether the routed path for meeting the first constraint condition meets the second limitation item in two restrictive conditions Part determines when the routed path for meeting the first constraint condition meets the second restrictive condition in two restrictive conditions and meets the The routed path of one constraint condition is Optimization route path.So as to realize that the routed path selected in network topology is complete Meet selected restrictive condition.

Specifically, a kind of routed path selection device of the embodiment of the present invention, can also include：

Specifically, third optimal path selection module, may include：

The embodiment of the invention also provides a kind of electronic equipment, as shown in figure 8, include processor 810, communication interface 820, Memory 830 and communication bus 840, wherein processor 810, communication interface 820, memory 830 are complete by communication bus 840 At mutual communication,

Memory 830, for storing computer program；

Processor 810 when for executing the program stored on memory 830, realizes following steps：

A kind of electronic equipment provided in an embodiment of the present invention can obtain when selecting Optimization route path in network topology Two restrictive conditions are taken, and are judged in network topology with the first restrictive condition in two restrictive conditions for the first constraint condition With the presence or absence of the routed path for meeting the first constraint condition, when the routed path that there is the first constraint condition of satisfaction in network topology When, judge whether the routed path for meeting the first constraint condition meets the second restrictive condition in two restrictive conditions, works as satisfaction When the routed path of first constraint condition meets the second restrictive condition in two restrictive conditions, determines and meet the first constraint condition Routed path be Optimization route path.So as to realize that it is selected that the routed path selected in network topology is fully met Restrictive condition.

The communication bus that above-mentioned electronic equipment is mentioned can be Peripheral Component Interconnect standard (Peripheral Component Interconnect, PCI) bus or expanding the industrial standard structure (Extended Industry Standard Architecture, EISA) bus etc..The communication bus can be divided into address bus, data/address bus, control bus etc..For just It is only indicated with a thick line in expression, figure, it is not intended that an only bus or a type of bus.

Communication interface is for the communication between above-mentioned electronic equipment and other equipment.

Memory may include random access memory (Random Access Memory, RAM), also may include non-easy The property lost memory (Non-Volatile Memory, NVM), for example, at least a magnetic disk storage.Optionally, memory may be used also To be storage device that at least one is located remotely from aforementioned processor.

Above-mentioned processor can be general processor, including central processing unit (Central Processing Unit, CPU), network processing unit (Network Processor, NP) etc.；It can also be digital signal processor (Digital Signal Processing, DSP), it is specific integrated circuit (Application Specific Integrated Circuit, ASIC), existing It is field programmable gate array (Field-Programmable Gate Array, FPGA) or other programmable logic device, discrete Door or transistor logic, discrete hardware components.

The embodiment of the invention also provides a kind of computer readable storage medium, stored in the computer readable storage medium There is computer program, the routed path selection method of any description above is realized when which is executed by processor.

A kind of computer readable storage medium provided in an embodiment of the present invention selects Optimization route path in network topology When, available two restrictive conditions, and net is judged for the first constraint condition with the first restrictive condition in two restrictive conditions With the presence or absence of the routed path for meeting the first constraint condition in network topology, meet the first constraint condition when existing in network topology When routed path, judge whether the routed path for meeting the first constraint condition meets the second limitation item in two restrictive conditions Part determines when the routed path for meeting the first constraint condition meets the second restrictive condition in two restrictive conditions and meets the The routed path of one constraint condition is Optimization route path.So as to realize that the routed path selected in network topology is complete Meet selected restrictive condition.

It should be noted that, in this document, relational terms such as first and second and the like are used merely to a reality Body or operation are distinguished with another entity or operation, are deposited without necessarily requiring or implying between these entities or operation In any actual relationship or order or sequence.Moreover, the terms "include", "comprise" or its any other variant are intended to Non-exclusive inclusion, so that the process, method, article or equipment including a series of elements is not only wanted including those Element, but also including other elements that are not explicitly listed, or further include for this process, method, article or equipment Intrinsic element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that There is also other identical elements in process, method, article or equipment including the element.

Each embodiment in this specification is all made of relevant mode and describes, same and similar portion between each embodiment Dividing may refer to each other, and each embodiment focuses on the differences from other embodiments.Especially for system reality For applying example, since it is substantially similar to the method embodiment, so being described relatively simple, related place is referring to embodiment of the method Part explanation.

The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the scope of the present invention.It is all Any modification, equivalent replacement, improvement and so within the spirit and principles in the present invention, are all contained in protection scope of the present invention It is interior.

Claims

1. a kind of routed path selection method, which is characterized in that it is applied in network topology, the method includes：

Two restrictive conditions are obtained, and with the first restrictive condition in described two restrictive conditions for the first constraint condition, judgement With the presence or absence of meeting the routed path of first constraint condition in the network topology, wherein first restrictive condition is Any restrictive condition in described two restrictive conditions；

When there is the routed path for meeting first constraint condition in the network topology, judge described to meet described first Whether the routed path of constraint condition meets the second restrictive condition in described two restrictive conditions, wherein second limitation Condition is the restrictive condition in addition to first restrictive condition in described two restrictive conditions；

When the routed path for meeting first constraint condition meets the second restrictive condition in described two restrictive conditions When, determine that the routed path for meeting first constraint condition is Optimization route path.

2. the method according to claim 1, wherein with the presence or absence of satisfaction in the judgement network topology After the routed path of first constraint condition, the method also includes：

When the routed path for meeting first constraint condition is not present in the network topology, according to described two limitation items Part selects Optimization route path using analytic hierarchy process (AHP) in the network topology.

3. the method according to claim 1, wherein meeting first constraint condition the judgement is described After whether routed path meets the second restrictive condition in described two restrictive conditions, the method also includes：

In the routed path for meeting first constraint condition, second be unsatisfactory in described two restrictive conditions limits item When part, with second restrictive condition for the second constraint condition, selection meets the second constraint item in the network topology The routed path of part；

According to the routed path and the routed path for meeting second constraint condition for meeting the first constraint condition, adopt With Lagrangian Relaxation Algorithm, Optimization route path is calculated.

4. according to the method described in claim 3, it is characterized in that, described according to the routing road for meeting the first constraint condition Diameter and the routed path for meeting second constraint condition calculate Optimization route path using Lagrangian Relaxation Algorithm, Including：

The the first shortest route path p selected when according to the r times iteration_rWith the second shortest route path selected when the s times iteration p_s, pass through the first formula

Calculate the iteration factor λ when iteration j of the Lagrangian Relaxation Algorithm_j, wherein the λ_jWhen for iteration j Iteration factor, the c (p_r) it is the first shortest route path p_rThe first via by routing information, the d (p_r) it is first most short Routed path p_rSecondary route routing information, the c (p_s) the second shortest route path p_sThe first via by routing information, institute State d (p_s) it is the second shortest route path p_sSecondary route routing information, the first via is by routing information and second tunnel Include by routing information：The Delay in shortest route path and the bandwidth information in shortest route path, described j, r, s be greater than Or the integer equal to 0,0≤r < j, 0≤s < j, when the r and s is not simultaneously 0, the r is different from the s；Work as r =0, and when s=0, the p_rFor the routed path p for meeting the first constraint condition_c, the c (p_r)=c (p_c), the c (p_c) it is the routed path p for meeting the first constraint condition_cThe first restrictive condition, the d (p_r)=d (p_c), the d (p_c) For the routed path p for meeting the first constraint condition_cThe second restrictive condition, the p_sFor the first constraint condition of the satisfaction Routed path p_d, the c (p_s)=c (p_d), the c (p_d) it is the routed path p for meeting the first constraint condition_dFirst Restrictive condition, the d (p_s)=d (p_d), the d (p_d) it is the routed path p for meeting the first constraint condition_dSecond limit Condition processed；

The link information for obtaining each of the links in the network topology passes through according to the link information and the iteration factor Second formula：

Judge whether the third shortest route path when iteration j meets the first restrictive condition and the second limitation item Part；

Third shortest route path when the iteration j meets the first restrictive condition and second restrictive condition, will Third shortest route path when the iteration j is determined as the Optimization route path；

Third shortest route path when the iteration j only meets first restrictive condition, by the iteration j When third shortest route path as the r times iteration when the first shortest route path p for selecting_r, and repeat institute The the first shortest route path p selected when stating according to the r times iteration_rWith the second shortest route path selected when the s times iteration p_s, the iteration factor λ when iteration j of the Lagrangian Relaxation Algorithm is calculated by the first formula_j；

Third shortest route path when the iteration j only meets second restrictive condition, and the third is most short The the second shortest route path p selected when routed path is as the s times iteration_s, and repeat it is described according to the r times repeatedly For when the first shortest route path p for selecting_rWith the second shortest route path p selected when the s times iteration_s, pass through the first formula Calculate the iteration factor λ when iteration j of the Lagrangian Relaxation Algorithm_j。

5. method according to any one of claims 1 to 4, which is characterized in that described when first routed path is full In the described two restrictive conditions of foot, when other restrictive conditions in addition to first restrictive condition, determine the first via by road Diameter be Optimization route path after, the method also includes：

Obtain the digraph of the network topology corresponding with the Optimization route path and the source in the Optimization route path Node and destination node；

The reverse route path in the Optimization route path is obtained, and passes through the reverse route path pair in the Optimization route path The digraph of the network topology is modified, and obtains the correction map of the digraph of the network topology；

According to the source node and the destination node, by dijkstra's algorithm the digraph of the network topology amendment The 4th shortest route path is searched in figure；

Identical link in the Optimization route path and the 4th shortest route path is obtained, and respectively from the best road By deleting the identical link in path and the 4th shortest route path, obtain deleting the best of the identical link Routed path and the shortest route path for deleting the identical link；

By all links in the Optimization route path for deleting the identical link and the deletion identical link Shortest route path all links, two paths are formed, and using two paths as the Optimization route path Alternate routing path.

6. a kind of routed path selection device, which is characterized in that be applied in network topology, described device includes：

First path selecting module, for obtaining two restrictive conditions, and with the first limitation item in described two restrictive conditions Part is the first constraint condition, judges to whether there is the routed path for meeting first constraint condition in the network topology, In, first restrictive condition is any restrictive condition in described two restrictive conditions；

First judgment module, for sentencing when there is the routed path for meeting first constraint condition in the network topology Whether the routed path for meeting first constraint condition that breaks meets the second restrictive condition in described two restrictive conditions, Wherein, second restrictive condition is the restrictive condition in addition to first restrictive condition in described two restrictive conditions；

First optimal path selection module, the routed path for that described ought meet first constraint condition meet described two When the second restrictive condition in restrictive condition, determine that the routed path for meeting first constraint condition is Optimization route road Diameter.

7. device according to claim 6, which is characterized in that described device further includes：

Second optimal path selection module, for when there is no the routings for meeting first constraint condition in the network topology When path, according to described two restrictive conditions, Optimization route path is selected in the network topology using analytic hierarchy process (AHP).

8. device according to claim 6, which is characterized in that described device further includes：

Second path selection module, for being unsatisfactory for described two in the routed path for meeting first constraint condition When the second restrictive condition in restrictive condition, with second restrictive condition for the second constraint condition, in the network topology Selection meets the routed path of second constraint condition；

Third optimal path selection module, for according to the routed path for meeting the first constraint condition and the satisfaction The routed path of second constraint condition calculates Optimization route path using Lagrangian Relaxation Algorithm.

9. a kind of electronic equipment, which is characterized in that including processor, communication interface, memory and communication bus, wherein processing Device, communication interface, memory complete mutual communication by communication bus；

Memory, for storing computer program；

Processor when for executing the program stored on memory, realizes any method and step of claim 1-5.

10. a kind of computer readable storage medium, which is characterized in that be stored with computer in the computer readable storage medium Program realizes claim 1-5 any method and step when the computer program is executed by processor.