CN101325560A - Method and apparatus for generating link - Google Patents

Abstract

The invention discloses a link generating method and device thereof. The method includes the following steps: A. converging a plurality of parallel links existing between the neighbor nodes into a logic link according to the link property information of neighbor nodes, generating the property information of the logic link, and forming a resource allocation table of the logic link; B. enquiring the resource allocation table of the logic link, and selecting an optimum transmission route; C. determining one link from the plurality of parallel links existing between the neighbor nodes as the optimum transmission link, according to the optimum transmission route and link enquiring condition. Herein the link property information is specifically to the characteristic of the link itself, such as expense, signal types, and the like. The invention adopts the link property information for converging a plurality of parallel links between a pair of neighbor nodes in prior network into one link, to perform routing calculation and select an optimum transmission path.

Description

A kind of link generation method and device thereof

Technical field

The present invention relates to the routing iinformation inundation and the route computing technique field of ASON, be specifically related to a kind of link generation method and device thereof.

Background technology

Optical-fiber network, OTN (Optical Transmission Network for example, optical transport network), WDM (Wavelength-division Multiplexing, wavelength division multiplexing), SDH (SynchronousDigital Hierarchy, synchronous digital hierarchy) or SONET (Synchronous Optical Network, Synchronous Optical Network) transmits net, be used widely at field of telecommunications.

ASON (Automatic Switched Optical Network is called for short ASON) is meant the optical-fiber network of new generation of finishing automatic function of exchange under routing and signaling control, the research focus of field of optical networks in recent years.The introducing of ASON technology then can strengthen the quick allocative abilities of Network, improves professional survivability, effectively resists network multiple spot fault, and the different grades of service can be provided neatly, satisfies the needs of the differentiated service that develops rapidly at present.ITU-T G.8080 series suggestion has proposed the notion of ASON and has realized framework.In the ASON network, can there be a large amount of links between two nodes in transmission plane.In the route computational process of reality, can not do the work of converging usually to parallel link, the parallel link here refers in particular between a pair of adjacent node has multilink to connect by point-to-point mode each other.Owing to generally used the CSPF algorithm (shortest-path first algorithm) that is obtained by the expansion of SPF (Sender PolicyFramework, sender policy framework) algorithm, therefore, many parallel links will cause a lot of influences to efficient and the result who calculates.

As seen there is certain problem in the prior art, needs to improve further.

Summary of the invention

The object of the present invention is to provide a kind of link generation method and device thereof, the method that it adopts many parallel link aggregations is a link reduces the computational complexity in the CSPF algorithm, and good multilink attribute load balancing can be provided.

To achieve these goals, the present invention adopts following technical scheme:

The invention provides a kind of link generation method, said method comprising the steps of:

A, according to the link attribute information of adjacent node, many parallel links that exist between adjacent node are pooled a logical links, generate the attribute information of this logical links, form this logical link resource allocation table;

B, the described logical link resource allocation table of inquiry are selected the best transmission route;

C, according to described best transmission route and link querying condition, between adjacent node, determine one many parallel links as the best transmission link.The link attribute information here refers in particular to the characteristic of link itself, cost for example, signal type etc.

Described method, wherein, described step B adopts fuzzy query conditions, the setting of interval query conditioned disjunction to loosen condition, inquires about described logical link resource allocation table.

Described method, wherein, in the described steps A, comprise according to the link wavelength attribute many parallel links are pooled a logical links, and generate the process of this logical links attribute information, this process may further comprise the steps: the wavelength attribute of many parallel links of adjacent node is done an intersection, and indicate this intersection attribute with a preset value.

Described method, wherein, in the described steps A, comprise according to the link total bandwidth many parallel links are pooled a logical links, and generate the process of this logical links attribute information, this process may further comprise the steps: with the total bandwidth sum of many parallel links between adjacent node, as the total bandwidth of logical links between this adjacent node.

Described method, wherein, in the described steps A, comprise according to the link maximum available bandwidth many parallel links are pooled a logical links, and generate the process of this logical links attribute information, this process may further comprise the steps: the maximum between the selection adjacent node in the maximum available bandwidth of many parallel links, and with the maximum available bandwidth of this maximum as logical links between this adjacent node.

Described method; wherein; in the described steps A; comprise according to the link protection types value many parallel links are pooled a logical links; and generate the process of this logical links attribute information; this process may further comprise the steps: the protection types value to many parallel links between adjacent node computes weighted, with the protection types value of ranking operation result as logical links between this adjacent node.The link protection type is here refered in particular to a kind of attribute of link itself, has shown the processing mode of link when taking place to lose efficacy, and common type has, 1+1,1: 1 etc.

Described method, wherein, described ranking operation carries out according to following formula:

$\mathrm{Protect}-\mathrm{type}(X-Y)=\underset{i=1}{\overset{n}{\mathrm{\Σ}}}\mathrm{protect}-\mathrm{type}(X_i-Y_i)\×\frac{\mathrm{bandwidth}(X_i-Y_i)}{\underset{i=1}{\overset{n}{\mathrm{\Σ}}}\mathrm{bandwidth}(X_i-Y_i)}$

Wherein, X, Y represent two adjacent nodes, and n represents the number of parallel link between X node and Y node, bandwidth (X _i-Y _i) the maximum available bandwidth of the parallel link of i bar between expression X node and Y node, protect-type (X _i-Y _i) the protection types value of the parallel link of i bar between expression X node and Y node, Protect-type (X-Y) represents the protection types value of logical links between X node and Y node.

Described method wherein, in the described steps A, comprises according to the link cost property value many parallel links are pooled a logical links, and generates the process of this logical links attribute information that this process may further comprise the steps:

The cost attribute value of many parallel links between A11, statistics adjacent node;

A12, calculate the cost attribute value of logical links between this adjacent node according to the following equation,

$\mathrm{Matrix}(X-Y)=\frac{\mathrm{Matrix}}{\underset{i=1}{\overset{n}{\mathrm{\Σ}}}\mathrm{bandwidth}(X_i-Y_i)/\underset{i=1}{\overset{n}{\mathrm{\Σ}}}\mathrm{sum}-\mathrm{bandwidth}(X_i-Y_i)}$

Wherein, X, Y represent two adjacent nodes, and n represents the number of parallel link between X node and Y node, bandwidth (X _i-Y _i) the maximum available bandwidth of the parallel link of i bar between expression X node and Y node, sum-bandwidth (X _i-Y _i) main broadband of the parallel link of i bar between expression X node and Y node, Matrix (X-Y) represents the cost attribute value of logical links between X node and Y node, Matrix represents the cost attribute value of parallel link between X node and Y node.

The present invention also provides a kind of link generating apparatus, it is characterized in that, described device comprises:

The link attribute convergence module is used for the link attribute information according to adjacent node, and many parallel links that exist between adjacent node are pooled a logical links, generates the attribute information of this logical links, forms this logical link resource allocation table; The shortest-path first algorithm module is used to inquire about described logical link resource allocation table, selects the best transmission route; And resource distribution module, be used for carrying out resource management according to described best transmission route, continuous link attribute information is converted to centrifugal pump, and, between adjacent node, determines one as the best transmission link many parallel links according to described best transmission route and link querying condition.

Described device, wherein, described device also comprises: routing module is used to revise the inundation packets of information, and adds in the inundation packets of information in order to support the link attribute information of link aggregation.

Described device, wherein, described link attribute convergence module comprises at least with one in the lower unit:

Be used for many parallel links being pooled a logical links, and generate the unit of this logical links attribute information according to the link total bandwidth,

Be used for many parallel links being pooled a logical links, and generate the unit of this logical links attribute information according to the link maximum available bandwidth,

Be used for many parallel links being pooled a logical links, and generate the unit of this logical links attribute information according to the link protection types value,

Be used for many parallel links being pooled a logical links, and generate the unit of this logical links attribute information according to the link cost property value,

Be used for many parallel links being pooled a logical links, and generate the unit of this logical links attribute information according to the link wavelength attribute.

Beneficial effect: it is a link with the parallel link aggregation of many between a pair of adjacent node in the present network that the present invention utilizes link attribute information, calculates in order to carry out route, selects optimal transmission paths.Method of the present invention and device thereof have been simplified route calculating in the prior art, and have reduced the computational complexity that causes because of many parallel links, have improved the efficient that route is calculated.

Description of drawings

Fig. 1 is the network topological diagram before the link aggregation;

Fig. 2 is the network topological diagram behind the link aggregation;

Fig. 3 is the flow chart of the inventive method;

Fig. 4 is a system configuration schematic diagram of the present invention.

Embodiment

Describe technical scheme of the present invention in detail below in conjunction with accompanying drawing.

As shown in Figure 3, link generation method proposed by the invention is carried out according to following steps:

At first, according to the link attribute information of adjacent node, many parallel links that exist between adjacent node are pooled a logical links, generate the attribute information of this logical links, form this logical link resource allocation table; Here said logical link resource allocation table is used to write down the attribute information of logical links and this logical links between adjacent node;

Secondly, inquire about described logical link resource allocation table, selection best transmission route;

At last, according to described best transmission route and link querying condition, between adjacent node, determine one many parallel links as the best transmission link.

Usually inundation information is not suitable for carrying out the link aggregation operation, so need the classification expansion of this information promptly be made amendment to transmission information, adds in order to support the link attribute information of link aggregation.The attribute information here comprises that the essential information of link and link use information.

1, the link essential information comprises wavelength information etc.For example in the wavelength-division field, need the expansion link the wavelength information that can transmit, as, can be by the field of definition one 64 (8 bytes), wherein each has all represented a concrete wavelength (perhaps can there be a plurality of wavelength in an interval in it), if equipment can carry out the wavelength Conversion of link, can set particular value sign complete or collected works so, be used for increasing wavelength information in inundation information.

2, link uses information, for example in SDH (Synchronous Digital Hierarchy, SDH (Synchronous Digital Hierarchy)) field, can expand the maximum cascade that link is supported at present.Owing to need the information of inundation not only identical in different fields, this sentences SDH is example, enumerates the information that needs inundation, as shown in table 1 below:

Table 1

Attribute information	The Chinese implication
		Link type	Linktype
Link ID	Link indicates
		Local interface IP address	The IP address of local interface
Remote interface IP address	The IP address of remote interface
		Traffic engineering metric	The traffic engineering standard
Maximum bandwidth	Maximum bandwidth
		Maximum reservable bandwidth	Maximum deposit bandwidth
Unreserved bandwidth	Available bandwidth
		Administrative group	The management group
Link Protection Type	The link protection type
		Shared Risk Link Group(SRLG)	Risk shared link group
Interface Switching Capability Descriptor	The interface exchange capacity is described

Above information is from RFC3630, RFC4203, and RFC is the abbreviation of Request For Comment, is the official standard all about Internet by the IETF management.

The process that above-mentioned link attribute converges, promptly the link attribute information according to adjacent node pools a logical links with many parallel links that exist between adjacent node, and generate the process of the attribute information of this logical links, wherein, can classify according to link attribute information, and then carry out attribute respectively and converge, such as following four kinds of situations:

(1) can directly carry out the attribute information of mathematical computations, for example bandwidth below illustrates.

During link total bandwidth after converging such as calculating, it carries out link attribute according to the link total bandwidth and converges process, and this process may further comprise the steps: with the total bandwidth sum of many parallel links between adjacent node, as the total bandwidth of logical links between this adjacent node.

During link cost property value after converging such as calculating, it carries out link attribute according to the link cost property value and converges process, and this process may further comprise the steps:

At first, the cost attribute value of many parallel links between the statistics adjacent node;

Secondly, according to the following equation (1) calculate the cost attribute value of logical links between this adjacent node,

$\mathrm{Matrix}(X-Y)=\frac{\mathrm{Matrix}}{\underset{i=1}{\overset{n}{\mathrm{\Σ}}}\mathrm{bandwidth}(X_i-Y_i)/\underset{i=1}{\overset{n}{\mathrm{\Σ}}}\mathrm{sum}-\mathrm{bandwidth}(X_i-Y_i)}---\left(1\right)$

Wherein, X, Y represent two adjacent nodes, and n represents the number of parallel link between X node and Y node, bandwidth (X _i-Y _i) the maximum available bandwidth of the parallel link of i bar between expression X node and Y node, sum-bandwidth (X _i-Y _i) main broadband of the parallel link of i bar between expression X node and Y node, Matrix (X-Y) represents the cost attribute value of logical links between X node and Y node, Matrix represents the cost attribute value of parallel link between X node and Y node.

(2) can be weighted the attribute information of calculating, for example link protection type below illustrates.。

During the protection attribute of the link after converging such as calculating; it carries out link attribute according to the link protection types value and converges process; this process may further comprise the steps: the protection types value to many parallel links between adjacent node computes weighted, with the protection types value of ranking operation result as logical links between this adjacent node.The ratio of supposing to use the link broadband then can compute weighted according to following formula (2) as weights:

$\mathrm{Protect}-\mathrm{type}(X-Y)=\underset{i=1}{\overset{n}{\mathrm{\Σ}}}\mathrm{protect}-\mathrm{type}(X_i-Y_i)\×\frac{\mathrm{bandwidth}(X_i-Y_i)}{\underset{i=1}{\overset{n}{\mathrm{\Σ}}}\mathrm{bandwidth}(X_i-Y_i)}---\left(2\right)$

Wherein, X, Y represent two adjacent nodes, and n represents the number of parallel link between X node and Y node, bandwidth (X _i-Y _i) the maximum available bandwidth of expression i bar parallel link, protect-type (X _i-Y _i) the protection types value of the parallel link of i bar between expression X node and Y node, Protect-type (X-Y) represents the protection types value of logical links between X node and Y node.Link circuit resource distribution condition as shown in table 2 below:

Table 2

The link protection type	The link protection types value	Link bandwidth
			1+1	10	100M
1∶1	8	200M
			M∶N	5	400M
Do not have	1	300M

The ratio of using link bandwidth in the last table is as weights, and the protection types value of the link after then converging according to above-mentioned formula (2) is

Value＝10×(100/1000)+8×(200/1000)+5×(400/1000)+1×(300/1000)＝4.9。

(3) can gather the attribute of calculating, for example the maximum cascade bandwidth of wavelength, link that can support of link illustrates below.

During link maximum available bandwidth after converging such as calculating, it carries out link attribute according to the link maximum available bandwidth and converges process, this process may further comprise the steps: the maximum between the selection adjacent node in the maximum available bandwidth of many parallel links, and with the maximum available bandwidth of this maximum as logical links between this adjacent node.Suppose to have 4 links, its maximum cascade bandwidth is respectively 4 VC4,6 VC4,2 VC4,8 VC4, but the maximum cascade bandwidth of logical links is 8 VC4 after then converging.

Link wavelength after converging such as calculating, the wavelength attribute that is about to all links is done an intersection, if equipment has the ability that wavelength is changed, can set a preset value so and identify this intersection attribute, the corresponding wavelength property value of each preset value.

(4) can't converge the attribute of calculating, for example Linktype.

Need to prove that herein (4) kind situation also can converge in fact under certain conditions.For example, if equipment can be transformed the signal between dissimilar, so dissimilar links also can converge, otherwise can't converge.

In the process shown in Figure 3, after finishing link attribute and converging, generate one and recorded the logic chain that converges and the logical link resource allocation table of attribute information thereof, according to this table, can use more flexibly method directly to inquire about the best transmission route with reference to CSPF algorithm (shortest-path first algorithm), for example

(1) can use fuzzy query conditions; for example in inquiry link protection type; can stipulate the fuzzy value of link protection type; the protection value of route that can specifies query is 5.5; so after route is calculated; all link values are lower than 5.5 link and can be used, and this just makes the load in the network can realize balanced in whole network.

(2) can use the interval query condition: for example, use protection type is the link between 4～5.

(3) can use the condition of loosening: for example, inquiry protection type is 6.5, loosens value and be 1 link, will preferentially choose the link value so and be 6.5 link, when can't meet the demands, can expand the hunting zone to 5.5～7.5.

After link aggregation, some querying condition based on multilink needs conversion, for instance, if calculate the 1+1 route, and require the link disjoint route, so Xiang Guan inquiry need be converted to routing inquiry twice, after inquiry for the first time, revise network topology, carry out the inquiry second time then.

Below describe the present invention in detail with regard to specific embodiment and how to carry out route and calculate and generate link.As shown in Figure 1, the network topology structure before it has provided and has converged wherein has A, B, four nodes of C, D.Wherein the network link resource situation is as shown in table 3 below.

Table 3

Link name	Sum-bandwidth	Bandwidth	Protection-type	Matrix
					A1-B1	500M	200M	16	30
A2-B2	500M	200M	4	30
					A3-B3	500M	200M	2	30
A4-B4	500M	100M	0	30
					A1-C1	500M	200M	16	20
A2-C2	500M	100M	4	20
					A3-C3	500M	300M	2	20
A4-C4	500M	100M	0	20
					A1-D1	500M	100M	16	10

A2-D2	500M	200M	4	10
					A3-D3	500M	200M	2	10
A4-D4	500M	500M	0	10
					B1-D1	500M	500M	16	40
B2-D2	500M	300M	4	40
					B3-D3	500M	0	2	40
B4-D4	500M	0	0	40
					C1-D1	500M	300M	16	30
C2-D2	500M	200M	4	30
					C3-D3	500M	100M	2	30
C4-D4	500M	500M	0	30

In the last table, link attribute information has: Matrix (link cost attribute), sum-bandwidth (link total bandwidth), bandwidth (link maximum available bandwidth), protection-type (link protection types value), Link name (link name).In the table, link identifies a link between A, the B node in the mode of A1-B1, in the present embodiment,, the parallel chain way order between adjacent node is 4, and link is two-way link, and bi-directional data is identical.Based on the resource distribution in the last table, the objective of the invention is to search the optimal path of node A to node D from above-mentioned link, and querying condition is: the link maximum available bandwidth is 100M, and the protection types value is higher than 4.5.

For achieving the above object, the present invention is before carrying out the CSPF routing algorithm, and advanced line link converges, and its result is as shown in table 4 below:

Table 4

Link name	Sum-bandwidth	Bandwidth	Protection-type	Matrix
					A-B	2000M	200M	6.3	85.7
A-C	2000M	300M	6	57.1
					A-D	2000M	500M	2.8	20
B-D	2000M	500M	11.5	100

C-D

2000M

500M

5.27

54.5

In the above-mentioned table, logical links A-B has compiled four the parallel links of A1-B1, A2-B2, A3-B3, A4-B4 in the table 3; Logical links A-C has compiled four the parallel links of A1-C1, A2-C2, A3-C3, A4-C4 in the table 3; Logical links A-D has compiled four the parallel links of A1-D1, A2-D2, A3-D3, A4-D4 in the table 3; Logical links B-D has compiled four the parallel links of B1-D1, B2-D2, B3-D3, B4-D4 in the table 3; Logical links C-D has compiled four the parallel links of C1-D1, C2-D2, C3-D3, C4-D4 in the table 3.Wherein, the link attribute computational methods of logical links A-B, A-C, A-D, B-D, C-D are as follows:

The link total bandwidth sum-bandwidth (X-Y) of logical links is between X node and Y node:

$\mathrm{Sum}-\mathrm{bandwidth}(X-Y)=\underset{i=1}{\overset{4}{\mathrm{\Σ}}}\mathrm{Sum}-\mathrm{bandwidth}(\mathrm{Xi}-\mathrm{Yi})$

The link maximum available bandwidth bandwidth (X-Y) of logical links is between X node and Y node:

Bandwidth(X-Y)＝MAX[Bandwidth(Xi-Yi]，0＜i＜4。

According to above-mentioned formula (2), the protection types value Protect-type (X-Y) of logical links is between X node and Y node:

$\mathrm{Protect}-\mathrm{type}(X-Y)=\underset{i=1}{\overset{4}{\mathrm{\Σ}}}\mathrm{protect}-\mathrm{type}(X_i-Y_i)\×\frac{\mathrm{bandwidth}(X_i-Y_i)}{\underset{i=1}{\overset{4}{\mathrm{\Σ}}}\mathrm{bandwidth}(X_i-Y_i)}$

According to above-mentioned formula (1), the cost attribute Matrix (X-Y) of logical links is between X node and Y node:

$\mathrm{Matrix}(X-Y)=\frac{\mathrm{Matrix}}{\underset{i=1}{\overset{4}{\mathrm{\Σ}}}\mathrm{bandwidth}(X_i-Y_i)/\underset{i=1}{\overset{4}{\mathrm{\Σ}}}\mathrm{sum}-\mathrm{bandwidth}(X_i-Y_i)}$

In above-mentioned several formula, X, Y represent two adjacent nodes, bandwidth (X _i-Y _i) the maximum available bandwidth of the parallel link of i bar between expression X node and Y node, protect-type (X _i-Y _i) the protection types value of the parallel link of i bar between expression X node and Y node, sum-bandwidth (X _i-Y _i) main broadband of the parallel link of i bar between expression X node and Y node, Matrix represents the cost attribute value of parallel link between X node and Y node.

After carrying out link aggregation, the querying condition of junction link protection types value and the size of Matrix value are carried out the CSPF routing algorithm according to above-mentioned table 4.Be higher than 4.5 condition according to the link protection types value, get rid of the route of A-D,, determine that finally the best transmission route is A-C-D according to the not too big condition of Matrix value.

Then, according to above-mentioned definite best transmission route A-C-D and querying condition, from many parallel links of A-C and C-D, determine the best transmission link of node A to node D.For example; be higher than 4.5 the above-mentioned table 3 of condition query according to the link protection types value; can know that node A is A1-C1 to the best transmission link of node C, node C is C1-D1 to the best transmission link of node D, so node A is A1-C1-D1 to the best transmission link of node D.

After link aggregation, some querying condition based on multilink needs conversion, for instance, if calculate the 1+1 route, and require the link disjoint route, so Xiang Guan inquiry need be converted to routing inquiry twice, after inquiry for the first time, revise network topology, carry out the inquiry second time then.

Based on said method, the present invention also provides a kind of link generating apparatus, and described device comprises: routing module is used for adding the link attribute information that converges in order to the support link attribute in packets of information; Resource distribution module is used for when distributing route, and the successive value of link attribute information is converted to centrifugal pump; The link attribute convergence module is used for the link attribute information according to adjacent node, and many parallel links that exist between adjacent node are pooled a logical links, generates the attribute information of this logical links, forms this logical link resource allocation table; The shortest-path first algorithm module, be used to inquire about described logical link resource allocation table, select the best transmission route, and, between adjacent node, determine one as the best transmission link many parallel links according to described best transmission route and link querying condition.

Above-mentioned link attribute convergence module carry out link attribute can be when converging referring to above-mentioned correlation technique, accordingly, described link attribute convergence module comprises at least with one in the lower unit:

Be used for many parallel links being pooled a logical links, and generate the unit of this logical links attribute information according to the link total bandwidth;

Be used for many parallel links being pooled a logical links, and generate the unit of this logical links attribute information according to the link maximum available bandwidth;

Be used for many parallel links being pooled a logical links, and generate the unit of this logical links attribute information according to the link protection types value;

Be used for many parallel links being pooled a logical links, and generate the unit of this logical links attribute information according to the link cost property value;

Be used for many parallel links being pooled a logical links, and generate the unit of this logical links attribute information according to the link wavelength attribute.

Above-mentioned resource distribution module can be determined concrete link attribute value in conjunction with querying condition according to the principle of resource allocation.For example, one of condition of certain inquiry is that inquiry minimal protection attribute is 4.5 link, and the value of the protection attribute of physical link is respectively 1,2,4,8, and the link of choosing so at last just should be the link greater than 4.5 (being that the link protection types value is 8).If querying condition is the scope of link protection types value is 3.5～7.5, so just should choose the link protection types value and be 4 link.

Using after link attribute converges, such a case can occur: promptly the value of converging of link can not be represented the resource distribution situation of link fully, the resource allocation conditions of for example following 4 parallel links, shown in following table 5 and table 6:

Table 5

The link protection type	The link protection types value	Link bandwidth
			1+1	4	100M
1∶1	3	100M
			M∶N	2	100M
Do not have	1	100M

Table 6

The link protection type	The link protection types value	Link bandwidth
			1+1	4	0
1∶1	3	200M
			M∶N	2	200M
Do not have	1	0

Link protection types value shown in the above-mentioned table 5, be weighted calculating according to above-mentioned formula (2) after, it is worth Value=2.5.

Link protection types value shown in the above-mentioned table 6, be weighted calculating according to above-mentioned formula (2) after, it is worth Value=2.5.

Above-mentioned table 5 is identical with the link protection types value of the link shown in the table 6 after converging, but the implication of two kinds of link representatives but is distinct.Therefore, may be in Resources allocation, discovery can't satisfy condition (mainly being some interval query condition), and this situation needs two kinds of methods and solves, and is example with the protection type:

The first, the link protection types value should be provided with very big leap, and is for example as shown in table 7 below,

Table 7

The link protection type	The link protection types value	Link bandwidth
			1+1	16	100M
1∶1	4	100M
			M∶N	2	100M
Do not have	0	100M

Be convenient to reflect comparatively really the resource situation of link like this.

The second, the link protection types value should be got discrete values, and avoids using serial number.

In sum, the method for the invention compared with prior art, has reached and can simplify the calculating of CSPF route, strengthens the route computing function.Adopt the while of the present invention, can be when route be calculated automatic application load balancing strategy, the load balancing is here refered in particular to for the traffic carrying capacity that makes network and is evenly distributed to the technology of whole network with the robustness that strengthens service security and network as far as possible.In addition, the present invention does not need route inundation information is revised in a large number, and the information of all increases does not influence the use of existing Routing Protocol, and the Network Load Balance among the present invention can take into account a plurality of attributes of link.

Illustrating of above-mentioned each concrete steps is comparatively concrete, can not therefore think the restriction to scope of patent protection of the present invention, and scope of patent protection of the present invention should be as the criterion with claims.

Claims (10)

1, a kind of link generation method is characterized in that, said method comprising the steps of:

A, according to the link attribute information of adjacent node, many parallel links that exist between adjacent node are pooled a logical links, generate the attribute information of this logical links, form this logical link resource allocation table;

B, the described logical link resource allocation table of inquiry are selected the best transmission route;

C, according to described best transmission route and link querying condition, between adjacent node, determine one many parallel links as the best transmission link.

2, method according to claim 1 is characterized in that, described step B adopts fuzzy query conditions, the setting of interval query conditioned disjunction to loosen condition, inquires about described logical link resource allocation table.

3, method according to claim 1 and 2 is characterized in that, in the described steps A, comprises according to the link wavelength attribute many parallel links are pooled a logical links, and generate the process of this logical links attribute information that this process may further comprise the steps:

The wavelength attribute of many parallel links of adjacent node is done an intersection, and indicate this intersection attribute with a preset value.

4, method according to claim 1 and 2 is characterized in that, in the described steps A, comprises according to the link total bandwidth many parallel links are pooled a logical links, and generate the process of this logical links attribute information that this process may further comprise the steps:

With the total bandwidth sum of many parallel links between adjacent node, as the total bandwidth of logical links between this adjacent node.

5, method according to claim 1 and 2, it is characterized in that, in the described steps A, comprise according to the link maximum available bandwidth many parallel links are pooled a logical links, and generate the process of this logical links attribute information, this process may further comprise the steps:

Maximum between the selection adjacent node in the maximum available bandwidth of many parallel links is with the maximum available bandwidth of this maximum as logical links between this adjacent node.

6, method according to claim 1 and 2 is characterized in that, in the described steps A, comprises according to the link protection types value many parallel links are pooled a logical links, and generate the process of this logical links attribute information that this process may further comprise the steps:

Protection types value to many parallel links between adjacent node computes weighted, with the protection types value of ranking operation result as logical links between this adjacent node.

7, method according to claim 6 is characterized in that, described ranking operation carries out according to following formula:

$\mathrm{Protect}-\mathrm{type}(X-Y)=\underset{i=1}{\overset{n}{\mathrm{\Σ}}}\mathrm{protect}-\mathrm{type}(X_i-Y_i)\×\frac{\mathrm{bandwidth}(X_i-Y_i)}{\underset{i=1}{\overset{n}{\mathrm{\Σ}}}\mathrm{bandwidth}(X_i-Y_i)}$

Wherein, X, Y represent two adjacent nodes, and n represents the number of parallel link between X node and Y node, bandwidth (X _i-Y _i) the maximum available bandwidth of the parallel link of i bar between expression X node and Y node, protect-type (X _i-Y _i) the protection types value of the parallel link of i bar between expression X node and Y node, Protect-type (X-Y) represents the protection types value of logical links between X node and Y node.

8, method according to claim 1 and 2 is characterized in that, in the described steps A, comprises according to the link cost property value many parallel links are pooled a logical links, and generate the process of this logical links attribute information that this process may further comprise the steps:

The cost attribute value of many parallel links between A11, statistics adjacent node;

A12, calculate the cost attribute value of logical links between this adjacent node according to the following equation,

$\mathrm{Matrix}(X-Y)=\frac{\mathrm{Matrix}}{\underset{i=1}{\overset{n}{\mathrm{\Σ}}}\mathrm{bandwidth}(X_i-Y_i)/\underset{i=1}{\overset{n}{\mathrm{\Σ}}}\mathrm{sum}-\mathrm{bandwidth}(X_i-Y_i)}$

Wherein, X, Y represent two adjacent nodes, and n represents the number of parallel link between X node and Y node, bandwidth (X _i-Y _i) the maximum available bandwidth of the parallel link of i bar between expression X node and Y node, sum-bandwidth (X _i-Y _i) main broadband of the parallel link of i bar between expression X node and Y node, Matrix (X-Y) represents the cost attribute value of logical links between X node and Y node, Matrix represents the cost attribute value of parallel link between X node and Y node.

9, a kind of link generating apparatus is characterized in that, described device comprises:

Routing module is used for adding the link attribute information that converges in order to the support link attribute in packets of information;

Resource distribution module is used for when distributing route, and the successive value of link attribute information is converted to centrifugal pump;

The link attribute convergence module is used for the link attribute information according to adjacent node, and many parallel links that exist between adjacent node are pooled a logical links, generates the attribute information of this logical links, forms this logical link resource allocation table; And

The shortest-path first algorithm module, be used to inquire about described logical link resource allocation table, select the best transmission route, and, between adjacent node, determine one as the best transmission link many parallel links according to described best transmission route and link querying condition.

10, device according to claim 9 is characterized in that, described link attribute convergence module comprises at least with one in the lower unit:

Be used for many parallel links being pooled a logical links, and generate the unit of this logical links attribute information according to the link total bandwidth;

Be used for many parallel links being pooled a logical links, and generate the unit of this logical links attribute information according to the link maximum available bandwidth;

Be used for many parallel links being pooled a logical links, and generate the unit of this logical links attribute information according to the link protection types value;

Be used for many parallel links being pooled a logical links, and generate the unit of this logical links attribute information according to the link cost property value;

Be used for many parallel links being pooled a logical links, and generate the unit of this logical links attribute information according to the link wavelength attribute.

Images