CN105721196A - Link importance evaluation method of directed communication network - Google Patents

Abstract

The invention relates to a link importance evaluation method of a directed communication network, and belongs to the field of communication network technology. The evaluation method comprises steps of firstly by use of the transmission probability of each of direct sub-links, calculating information amount of each link and using the information amount as the weight value of each link; by use of a link calculating method provided by the invention, searching all transmission routers of initial nodes and target nodes, and carrying out corresponding weighing on the direct sub-link in each link and summing the values so as to obtain the whole weight values of all links; and calculating the reciprocal of the whole weight values so as to obtain evaluation coefficients of the links. The bigger the evaluation coefficient of a link is, the more important the link is. On the contrary, the smaller the evaluation coefficient of a link is, the less important the link is. Thus, Reference is provided for choosing of an optimal transmission link.

Description

A kind of Link Significance evaluation methodology of oriented communication network network

Technical field

Patent of the present invention relates to the Link Significance evaluation methodology of a kind of oriented communication network network, belongs to technical field of communication network.

Background technology

In oriented communication network network, once transmission link breaks down, it is likely to result in communication paralysis, traditional research method of Link Significance analysis is all that the size that affects after link circuit deleting or link constriction, the connectedness of the network architecture caused carries out Link Significance and researchs and analyses, and seldom carries out Link Significance judgement from the number of the transmitted breath amount of link.So it is easily caused and locally link importance degree is judged rather than carry out Link Significance judgement from the concept of the overall situation, be often easily generated error in judgement in actual applications.For these problems, the Link Significance evaluation methodology of a kind of oriented communication network network is proposed, using the quantity of information of communication link as the weighted value of transmission link comprehensively in network link, being estimated Link Significance analyzing, provide reference to the selection of best transmission route in network service.

Summary of the invention

The technical problem to be solved in the present invention is to provide the Link Significance evaluation methodology of a kind of oriented communication network network, in order to solve the problems referred to above.

The technical scheme is that the Link Significance evaluation methodology of a kind of oriented communication network network, the quantity of information of each link is calculated first with the transmission probability of every sub-links, and it can be used as link weight weight values, search out start node and the whole transmission route of destination node, after sublink in each of the links carries out the weighting of correspondence respectively, summation obtains the total weighted value of each link, and total weighted value inverted is obtained the metewand of link, by the metewand of each of the links, link is carried out Assessment of Important.

Concretely comprise the following steps:

Step1: set up network node relation model:

Set up a probability transmission square formation A for a network topological diagram with m node, remember that this probability transmission square formation is A=[P (a_i,a_j)]_m×m, wherein P (a_i,a_j) represent node a_iCarry the information to a_jProbability.

Step2: determine weighting function F [P (a_i,a_j)]:

The uncertainty degree of event can describe with the probability that event occurs, quantity of information is the tolerance to the probability that message occurs, the probability that the quantity of information comprised in message occurs with message is closely related, and the probability that message occurs is more little, then the quantity of information comprised in message is more big；Otherwise, the probability that message occurs is more big, then the quantity of information comprised in message is more little.Mathematician's Shannon the article pointed out in the opinion being entitled as " mathematical theory of communication ": the thing of random ambiguity " information be used to eliminate ".By the definition of information it can be seen that in communication process, the quantity of information that addressee is acquired, quantitatively equal to probabilistic elimination before and after communication.Define a m rank square formation B=[b (a_i,a_j)]_m×m, wherein each element b (a_i,a_j) represent from node a_iTo a_jLink weight F [P (a_i,a_j)], it is assumed that node a_iWith node a_j, and node a_jWith node a_kTransmission prior probability respectively P (a_i,a_j) and P (a_j,a_k), and meet 0≤P (a_i,a_j)≤1、0≤P(a_j,a_k)≤1。

Described weighting function F [P (a_i,a_j)] meet the following conditions:

(1) if P is (a_i,a_j) < P (a_j,a_k), then: F [P (a_i,a_j)] > F [P (a_j,a_k)]；

Otherwise: if P is (a_i,a_j) > P (a_j,a_k), then: F [P (a_i,a_j)] < F [P (a_j,a_k)]；

I.e. function F [P (a_i,a_j)] it is prior probability P (a_i,a_j) monotonic decreasing function；

Being absent from its direct sublink weight during information transmission between (2) two nodes is infinity, namely at P (a_i,a_jDuring)=0, have: F [P (a_i,a_j)] → ∞；

(3) two inter-node transmission have and only have a direct sublink of feasible transmission, and when namely transmitting information with probability 1, this link weight is 0, i.e. P (a_i,a_jDuring)=1, therefore have: F [P (a_i,a_j)] → 0；

(4) in network node topological diagram, two adjacent direct sublink sum F [P (a_i,a_j)]+F[P(a_j,a_k)] relevant with the joint probability of the independent variable of adjacent direct sublink, it may be assumed that

F[P(a_i,a_j；A_j,a_k)]=F [P (a_i,a_j)]+F[P(a_j,a_k)]；

According to above it can be gathered that, meet the weighting function F [P (a of the mapping relations of above-mentioned condition_i,a_j)] should be:

$F\&lsqb;P(a_i,a_j)\&rsqb;=log\frac{1}{p(a_i,a_j)}=-logP(a_i,a_j).$

Described weighting function F [P (a_i,a_j)] reality is the quantity of information expression formula of communication link.

Step3: according to weighting function, transmits probability square formation and is converted to the weight matrix B=[b (a of network topological diagram_i,a_j)]_m×m。

Step4: build network associate matrix:

One network topological diagram with m node is set up an incidence matrix, and it is expressed as: C=[e (a_i,a_j)]_m×mIts representation node a_iTo node a_jDirect sublink, for the foundation of square formation, it then follows below rule:

(1) incidence matrix element definition is:

(2) if node a_iTo node a_jBetween have a plurality of direct sublink, such as there is direct sublink e_s、e_k, then two direct sublinks are carried out logical "or" computing, namely element definition is:

(3) by a_jAs m-th node, namely the m row of incidence matrix reflect destination node a_jConnection state.

Step5: the node of incidence matrix eliminates conversion:

Set up new element in incidence matrix and generate model:To eliminate start node a_sWith destination node a_lBetween node a_c, eliminate node a_cRepresenting that the c row deleting former incidence matrix and c row are associated matrix reduction, wherein " " represents logic "and" operation,Represent logical "or" computing, e (a_s,a_l) represent elimination node a_cThe element of the new incidence matrix of rear generation, finally gives a second-order matrix of only surplus start node and destination node through iteration depression of order, is made zero by all the other elements except matrix element corresponding with destination node except start node for second-order matrix.This square Matrix now only remains next non-zero element, this non-zero element is carried out logical operations abbreviation, namely this element represents all connection states of start node and destination node, all logical "or"s being split, all logical "and" expression formulas formed after fractionation are the whole possible transmission link between start node and destination node.

Step6: Link Significance evaluation analysis:

Article one, complete communications network link is defined as the start node sequential combination to all direct sublink passed through when communicating between destination node, for complete communications network link, direct sublink quantity of information is more big, represent that the weighted value of direct sublink is more big, the corresponding total weighted value of this complete link is also more big, the probability that the information of meaning passes through this link transmission is more little, and the relatively whole network architecture importance of link is relatively low；Otherwise, the quantity of information of direct sub-sublink is more little, represents that the weighted value of direct sub-sublink is more little, and the weight of corresponding complete communication link is also more little, the probability that the information of meaning passes through this link transmission is more big, and now the relatively whole network architecture importance of link is higher.Therefore being defined as by Link Significance relevant to the metewand of every full link, metewand is total weighted value of every full link, and total weighted value is more big, and corresponding metewand is more little, represents that the importance of this full link is relatively low；Otherwise, total weighted value is more little, and corresponding metewand is more big, represents that the importance of this full link is of a relatively high.According to Link Significance definition, the whole transmission links to start node produced by Step4, Step5 with destination node, the weight matrix B=[b (a according to network topological diagram_i,a_j)]_m×mWeight element value corresponding in weight matrix is substituted in the direct sublink of each transmission link, and the weighted value of the direct sublink of each logic "and" operation in each transmission link is carried out arithmetic be added and draw total weighted value of each transmission link, by total weighted value inverted is obtained metewand, then path Assessment of Important will be carried out according to the metewand of each link, metewand is more big, and transmission link is more high to the importance of network；Otherwise, metewand is more little, and transmission link is more low to the importance of network.What can consider link accordingly when carrying out network information transfer selects use.

The invention has the beneficial effects as follows:

1, the importance judgement that patent of the present invention is oriented communication link provides a kind of new evaluation methodology, and the selection not being only communication best transmission link provides reference, and the network experience and internet environment promoting Internet user is also most important.

2, patent of the present invention by by quantity of information with weighting form comprehensively in the Assessment of Important of link, drastically increasing the accuracy that Link Significance is evaluated.

Accompanying drawing explanation

Fig. 1 is the flow chart of patent of the present invention；

Fig. 2 is the example directed networks topological diagram of patent of the present invention.

Detailed description of the invention

Embodiment 1: the Link Significance evaluation methodology of a kind of oriented communication network network, the quantity of information of each direct sublink is calculated first with the transmission probability of every direct sublink, and it can be used as link weight weight values, search out start node and the whole transmission route of destination node, after direct sublink in each of the links carries out the weighting of correspondence respectively, summation obtains the total weighted value of each link, and total weighted value inverted is obtained the metewand of link, by the metewand of each of the links, link is carried out Assessment of Important.

Concretely comprise the following steps:

Step1: set up network node relation model:

One network topological diagram with m node is set up a probability transmission square formation A, remembers that this probability transmission square formation is A=[P (a_i,a_j)]_m×m, wherein P (a_i,a_j) represent node a_iCarry the information to a_jProbability.

Step2: determine weighting function F [P (a_i,a_j)]:

The uncertainty degree of event can describe with the probability that event occurs, quantity of information is the tolerance to the probability that message occurs, the probability that the quantity of information comprised in message occurs with message is closely related, and the probability that message occurs is more little, then the quantity of information comprised in message is more big；Otherwise, the probability that message occurs is more big, then the quantity of information comprised in message is more little.Mathematician's Shannon the article pointed out in the opinion being entitled as " mathematical theory of communication ": the thing of random ambiguity " information be used to eliminate ".By the definition of information it can be seen that in communication process, the quantity of information that addressee is acquired, quantitatively equal to probabilistic elimination before and after communication.Define a m rank square formation B=[b (a_i,a_j)]_m×m, wherein each element b (a_i,a_j) represent from node a_iTo a_jLink weight F [P (a_i,a_j)], it is assumed that node a_iWith node a_j, and node a_jWith node a_kTransmission prior probability respectively P (a_i,a_j) and P (a_j,a_k), and meet 0≤P (a_i,a_j)≤1、0≤P(a_j,a_k)≤1。

Described weighting function F [P (a_i,a_j)] meet the following conditions:

(1) if P is (a_i,a_j) < P (a_j,a_k), then: F [P (a_i,a_j)] > F [P (a_j,a_k)]；

Otherwise: if P is (a_i,a_j) > P (a_j,a_k), then: F [P (a_i,a_j)] < F [P (a_j,a_k)]；

I.e. function F [P (a_i,a_j)] it is prior probability P (a_i,a_j) monotonic decreasing function；

Being absent from its direct sublink weight during information transmission between (2) two nodes is infinity, namely at P (a_i,a_jDuring)=0, have: F [P (a_i,a_j)] → ∞；

(3) two inter-node transmission have and only have a direct sublink of feasible transmission, and when namely transmitting information with probability 1, this link weight is 0, i.e. P (a_i,a_jDuring)=1, therefore have: F [P (a_i,a_j)] → 0；

(4) in network node topological diagram, adjacent both links sum F [P (a_i,a_j)]+F[P(a_j,a_k)] relevant with the joint probability of the independent variable of adjacent link, it may be assumed that

F[P(a_i,a_j；A_j,a_k)]=F [P (a_i,a_j)]+F[P(a_j,a_k)]；

According to above it can be gathered that, meet the weighting function F [P (a of the mapping relations of above-mentioned condition_i,a_j)] should be:

$F\&lsqb;P(a_i,a_j)\&rsqb;=log\frac{1}{p(a_i,a_j)}=-logP(a_i,a_j).$

Step3: according to weighting function, transmits probability square formation and is converted to the weight matrix B=[b (a of network topological diagram_i,a_j)]_m×m。

Step4: build network associate matrix:

One network topological diagram with m node is set up an incidence matrix, and it is expressed as: C=[e (a_i,a_j)]_m×mIts representation node a_iTo node a_jDirect sublink, for the foundation of square formation, it then follows below rule:

(1) incidence matrix element definition is:

(2) if node a_iTo node a_jBetween have a plurality of direct sublink, such as there is direct sublink e_s、e_k, then two sub-links are carried out logical "or" computing, namely element definition is:

(3) by a_jAs m-th node, namely the m row of incidence matrix reflect destination node a_jConnection state.

Step5: the node of incidence matrix eliminates conversion:

Set up new element in incidence matrix and generate model:To eliminate start node a_sWith destination node a_lBetween node a_c, eliminate node a_cRepresenting that the c row deleting former incidence matrix and c row are associated matrix reduction, wherein " " represents logic "and" operation,Represent logical "or" computing, e (a_s,a_l) represent elimination node a_cThe element of the new incidence matrix of rear generation, finally gives a second-order matrix of only surplus start node and destination node through iteration depression of order, is made zero by all the other elements except matrix element corresponding with destination node except start node for second-order matrix.This square Matrix now only remains next non-zero element, this non-zero element is carried out logical operations abbreviation, namely this element represents all connection states of start node and destination node, all logical "or"s being split, all logical "and" expression formulas formed after fractionation are the whole possible transmission link between start node and destination node.

Step6: Link Significance evaluation analysis:

Article one, complete communications network link is defined as the start node sequential combination to all sublinks passed through when communicating between destination node, for complete communications network link, direct sublink quantity of information is more big, represent that the weighted value of direct sublink is more big, the corresponding total weighted value of this complete link is also more big, the probability that the information of meaning passes through this link transmission is more little, and the relatively whole network architecture importance of link is relatively low；Otherwise, the quantity of information of direct sublink is more little, represents that the weighted value of direct sublink is more little, and the weight of corresponding complete communication link is also more little, the probability that the information of meaning passes through this link transmission is more big, and now the relatively whole network architecture importance of link is higher.Therefore being defined as by Link Significance relevant to the metewand of every full link, metewand is total weighted value of every full link, and total weighted value is more big, and corresponding metewand is more little, represents that the importance of this full link is relatively low；Otherwise, total weighted value is more little, and corresponding metewand is more big, represents that the importance of this full link is of a relatively high.According to Link Significance definition, the whole transmission links to start node produced by Step4, Step5 with destination node, the weight matrix B=[b (a according to network topological diagram_i,a_j)]_m×mWeight element value corresponding in weight matrix is substituted in the direct sublink of each transmission link, and the weighted value of the direct sublink of each logic "and" operation in each transmission link is carried out arithmetic be added and draw total weighted value of each transmission link, by total weighted value inverted is obtained metewand, then path Assessment of Important will be carried out according to the metewand of each link, metewand is more big, and transmission link is more high to the importance of network；Otherwise, metewand is more little, and transmission link is more low to the importance of network.What can consider link accordingly when carrying out network information transfer selects use.

Embodiment 2: the Link Significance evaluation methodology of a kind of oriented communication network network, the quantity of information of each link is calculated first with the transmission probability of every direct sublink, and it can be used as link weight weight values, search out start node and the whole transmission route of destination node, after direct sublink in each of the links carries out the weighting of correspondence respectively, summation obtains the total weighted value of each link, and total weighted value inverted is obtained the metewand of link, by the metewand of each of the links, link is carried out Assessment of Important.

Concrete steps as:

Step1: by the directed networks topological diagram of accompanying drawing 2, the evaluation calculation process of transmission link importance is analyzed and verifies, it is assumed here that find node a₁To node a₅Whole transmission links, and by calculate transmission link importance is analyzed, e in Fig. 2₁、e₂、e₃、e₄、e₅、e₆、e₇、e₈、e₉、e₁₀、e₁₁It is defined as the direct sublink of communication network information transmission.Directed networks topological diagram 2 is set up probability transmission matrix A:

Step2: calculate weight matrix B according to probability transmission matrix computation rule:

Step3: Fig. 2 builds incidence matrix C, needs in this example to eliminate node a₂, node a₃, and node a₄, to reach the purpose of incidence matrix C depression of order:

(1) a is taken_k=a₂, eliminate node a₂, incidence matrix C is reduced to 4 rank, obtains representing node a₁, node a₃, node a₄, node a₅The new incidence matrix C1 of connection state:

$C1=\left[\begin{array}{cccc}{e}_2\&CenterDot;e_1& e_2\&CenterDot;e_4\&CirclePlus;e_3& e_2\&CenterDot;e_7& 0\\ e_5\&CenterDot;e_1& e_5\&CenterDot;e_4& e_5\&CenterDot;e_7\&CirclePlus;e_8& 0\\ e_6\&CenterDot;e_1& e_6\&CenterDot;e_4& e_6\&CenterDot;e_7& e_{10}\\ 0& e_9& e_{11}& 0\end{array}\right]$

(2) a is taken_k=a₃, eliminate node a₃, incidence matrix C1 is reduced to 3 rank, obtains representing node a₁, node a₄, node a₅The new incidence matrix C2 of connection state:

$C2=\left[\begin{array}{ccc}{e}_2\&CenterDot;e_4\&CenterDot;e_5\&CenterDot;e_1\&CirclePlus;e_3\&CenterDot;e_5\&CenterDot;e_1& e_2\&CenterDot;e_4\&CenterDot;e_5\&CenterDot;e_7\&CirclePlus;e_2\&CenterDot;e_4\&CenterDot;e_8\&CirclePlus;e_3\&CenterDot;e_5\&CenterDot;e_7\&CirclePlus;e_3\&CenterDot;e_8& 0\\ e_6\&CenterDot;e_4\&CenterDot;e_5\&CenterDot;e_1& e_6\&CenterDot;e_4\&CenterDot;e_5\&CenterDot;e_7\&CirclePlus;e_6\&CenterDot;e_4\&CenterDot;e_8& e_{10}\\ e_9\&CenterDot;e_5\&CenterDot;e_1& e_9\&CenterDot;e_5\&CenterDot;e_7\&CirclePlus;e_9\&CenterDot;e_8\&CirclePlus;e_{11}& 0\end{array}\right]---\left(3\right)$ Take a_k=a₄, eliminate node a₄, incidence matrix C2 is reduced to 2 rank, all the other elements except matrix element corresponding with destination node except start node for second-order matrix is made zero, and a remaining nonzero element is carried out logic simplifying, obtain representing node a₁, node a₅The new incidence matrix C3 of connection state:

$C3=\left[\begin{array}{cc}0& e_2\&CenterDot;e_4\&CenterDot;e_5\&CenterDot;e_7\&CenterDot;e_{10}\&CirclePlus;e_2\&CenterDot;e_4\&CenterDot;e_8\&CenterDot;e_{10}\&CirclePlus;e_3\&CenterDot;e_5\&CenterDot;e_7\&CenterDot;e_{10}\&CirclePlus;e_3\&CenterDot;e_8\&CenterDot;e_{10}\\ 0& 0\end{array}\right]$

Egress a can be obtained from incidence matrix C3₁To node a₅The whole transmission links being formed by connecting by direct sublink, 4 " logical AND " expression formulas namely connected with " logic or " in incidence matrix C3:

L1=e₂·e₄·e₅·e₇·e₁₀

L2=e₂·e₄·e₈·e₁₀

L3=e₃·e₅·e₇·e₁₀

L4=e₃·e₈·e₁₀

Can be obtained and the transmission link of above-mentioned identical result by tabulating method and diagram method, weight element value corresponding in weight matrix is substituted in the direct sublink of each transmission link, and the weighted value of the direct sublink of each logic "and" operation in each transmission link is carried out arithmetic is added the total weighted value drawing each transmission link:

M (L1)=B_(1,2)+B_(2,3)+B_(3,2)+B_(2,4)+B_(4,5)=0.699+0.222+0.523+0.658+0.398=2.5

M (L2)=B_(1,2)+B_(2,3)+B_(3,4)+B_(4,5)=0.699+0.222+0.222+0.398=1.541

M (L3)=B_(1,3)+B_(3,2)+B_(2,4)+B_(4,5)=1+0.523+0.658+0.398=2.579

M (L4)=B_(1,3)+B_(3,4)+B_(4,5)=1+0.222+0.398=1.62

Inverse is gone to obtain the metewand of corresponding full link total weighted value:

$S\&lsqb;M\left(L1\right)\&rsqb;=\frac{1}{M\left(L1\right)}=\frac{1}{2.5}=0.4$

$S\&lsqb;M\left(L2\right)\&rsqb;=\frac{1}{M\left(L2\right)}=\frac{1}{1.541}=0.649$

$S\&lsqb;M\left(L3\right)\&rsqb;=\frac{1}{M\left(L3\right)}=\frac{1}{2.579}=0.388$

$S\&lsqb;M\left(L4\right)\&rsqb;=\frac{1}{M\left(L4\right)}=\frac{1}{1.62}=0.617$

Step4: Link Significance analysis: definition the direct sublink of each of the links weighted value and be the total weighted value M (L) of each of the links, L represents link, for link L1: node a₁With node a₅By passing sequentially through direct sublink e₂, direct sublink e₄, direct sublink e₅, direct sublink e₇, direct sublink e₁₀The information of carrying out transmission, total weighted value M (L1)=2.5 of its correspondence, the metewand S [M (L1)]=0.4 of its correspondence；In link L2, node a₁With node a₅By passing sequentially through direct sublink e₂, direct sublink e₄, direct sublink e₈, direct sublink e₁₀The information of carrying out transmission, total weighted value M (L2)=1.541 of its correspondence, corresponding metewand is S [M (L2)]=0.649；In link L3, node a₁With node a₅By passing sequentially through direct sublink e₃, direct sublink e₅, direct sublink e₇, direct sublink e₁₀The information of carrying out transmission, total weighted value M (L3)=2.579 of its correspondence, corresponding metewand S [M (L3)]=0.388；In link L4, node a₁With node a₅By passing sequentially through direct sublink e₃, direct sublink e₈, direct sublink e₁₀The information of carrying out transmission, total weighted value M (L4)=1.62 of its correspondence, corresponding metewand S [M (L4)]=0.617；Contrast the weighted value of these four links, total weighted value of link is L3, L1, L4, L2 from high to low successively, contained unknown message amount link from high to low is L3, L1, L4, L2 successively, corresponding metewand order from high to low is followed successively by: L2 → L4 → L1 → L3, then each link for the importance of network by from the order of high to low is: L2 → L4 → L1 → L3, when carrying out network information transfer, best information transmission link can be selected according to this importance.

Embodiment 3: the Link Significance evaluation methodology of a kind of oriented communication network network, the quantity of information of each link is calculated first with the transmission probability of every sub-links, and it can be used as link weight weight values, search out start node and the whole transmission route of destination node, after sublink in each of the links carries out the weighting of correspondence respectively, summation obtains the total weighted value of each link, and total weighted value inverted is obtained the metewand of link, by the metewand of each of the links, link is carried out Assessment of Important.

Concretely comprise the following steps:

Step1: set up network node relation model:

For a network topological diagram with m node, set up a probability transmission square formation A, be designated as A=[P (a_i,a_j)]_m×m, wherein P (a_i,a_j) represent node a_iCarry the information to a_jProbability；

Step2: determine weighting function F [P (a_i,a_j)]:

Define a m rank square formation B=[b (a_i,a_j)]_m×m, wherein each element b (a_i,a_j) represent from node a_iTo a_jLink weight F [P (a_i,a_j)], it is assumed that node a_iTo node a_jTransmission prior probability be P (a_i,a_j)(0≤P(a_i,a_j)≤1), node a_jTo node a_kTransmission prior probability be P (a_j,a_k)(0≤P(a_j,a_k)≤1)；

Described weighting function F [P (a_i,a_j)] meet the following conditions:

(1) if P is (a_i,a_j) < P (a_j,a_k), then: F [P (a_i,a_j)] > F [P (a_j,a_k)]；

If P is (a_i,a_j) > P (a_j,a_k), then: F [P (a_i,a_j)] < F [P (a_j,a_k)]；

I.e. function F [P (a_i,a_j)] it is prior probability P (a_i,a_j) monotonic decreasing function；

Being absent from its direct sublink weight during information transmission between (2) two nodes is infinity, namely at P (a_i,a_jDuring)=0, then F [P (a_i,a_j)] → ∞；

(3) two inter-node transmission have and only have a direct sublink of feasible transmission, and when namely transmitting information with probability 1, this link weight is 0, i.e. P (a_i,a_jDuring)=1, therefore have: F [P (a_i,a_j)] → 0；

(4) in network node topological diagram, two adjacent direct sublink sum F [P (a_i,a_j)]+F[P(a_j,a_k)] relevant with the joint probability of the independent variable of adjacent link, it may be assumed that

F[P(a_i,a_j；A_j,a_k)]=F [P (a_i,a_j)]+F[P(a_j,a_k)]；

According to above it can be gathered that, meet the weighting function F [P (a of the mapping relations of above-mentioned condition_i,a_j)] should be:

$F\&lsqb;P(a_i,a_j)\&rsqb;=log\frac{1}{p(a_i,a_j)}=-logP(a_i,a_j);$

Described weighting function F [P (a_i,a_j)] reality is the quantity of information expression formula of communication link；

Step3: according to weighting function, transmits probability square formation and is converted to the weight matrix B=[b (a of network topological diagram_i,a_j)]_m×m；

Step4: build network associate matrix:

An incidence matrix C=[e (a is set up for a network topological diagram with m node_i,a_j)]_m×m, its representation node a_iTo node a_jDirect sublink, following rule is followed in the foundation of described incidence matrix:

(1) incidence matrix element definition is:

(2) if node a_iTo node a_jBetween have a plurality of direct sublink, such as there is direct sublink e_s、e_k, then two sub-links are carried out logical "or" computing, namely element definition is:

(3) by a_jAs m-th node, namely the m row of incidence matrix reflect destination node a_jConnection state；

Step5: the node of incidence matrix eliminates conversion:

Set up new element in incidence matrix and generate model:To eliminate start node a_sWith destination node a_lBetween node a_c, eliminate node a_cRepresenting that the c row deleting former incidence matrix and c row are associated matrix reduction, wherein " " represents logic "and" operation,Represent logical "or" computing, e (a_s,a_l) represent elimination node a_cThe element of the new incidence matrix of rear generation, finally gives a second-order matrix of only surplus start node and destination node through iteration depression of order, is made zero by all the other elements except matrix element corresponding with destination node except start node for second-order matrix；This square Matrix now only remains next non-zero element, this non-zero element is carried out logical operations abbreviation, namely this element represents all connection states of start node and destination node, all logical "or"s being split, all logical "and" expression formulas formed after fractionation are the whole possible transmission link between start node and destination node；

Step6: Link Significance evaluation analysis

Whole transmission links to start node produced by Step4, Step5 with destination node, the weight matrix B=[b (a according to network topological diagram_i,a_j)]_m×mWeight element value corresponding in weight matrix is substituted in the direct sublink of each transmission link, and the weighted value of the direct sublink of each logic "and" operation in each transmission link is carried out arithmetic be added and draw total weighted value of each transmission link, by total weighted value inverted is obtained metewand, then path Assessment of Important will be carried out according to the metewand of each link, metewand is more big, and transmission link is more high to the importance of network；Otherwise, metewand is more little, and transmission link is more low to the importance of network.What can consider link accordingly when carrying out network information transfer selects use.

Above in conjunction with accompanying drawing, the specific embodiment of the present invention is explained in detail, but the present invention is not limited to above-mentioned embodiment, in the ken that those of ordinary skill in the art possess, it is also possible to make various change under the premise without departing from present inventive concept.

Claims (2)

1. the Link Significance evaluation methodology of an oriented communication network network, it is characterized in that: calculate the quantity of information of each link first with the transmission probability of every sub-links, and it can be used as link weight weight values, search out start node and the whole transmission route of destination node, after sublink in each of the links carries out the weighting of correspondence respectively, summation obtains the total weighted value of each link, and total weighted value inverted is obtained the metewand of link, by the metewand of each of the links, link is carried out Assessment of Important.

2. the Link Significance evaluation methodology of oriented communication network network according to claim 1, it is characterised in that concretely comprise the following steps:

Step1: set up network node relation model:

For a network topological diagram with m node, set up a probability transmission square formation A, be designated as A=[P (a_i,a_j)]_m×m, wherein P (a_i,a_j) represent node a_iCarry the information to a_jProbability；

Step2: determine weighting function F [P (a_i,a_j)]:

Define a m rank square formation B=[b (a_i,a_j)]_m×m, wherein each element b (a_i,a_j) represent from node a_iTo a_jLink weight F [P (a_i,a_j)], it is assumed that node a_iTo node a_jTransmission prior probability be P (a_i,a_j)(0≤P(a_i,a_j)≤1), node a_jTo node a_kTransmission prior probability be P (a_j,a_k)(0≤P(a_j,a_k)≤1)；

Described weighting function F [P (a_i,a_j)] meet the following conditions:

(1) if P is (a_i,a_j) < P (a_j,a_k), then: F [P (a_i,a_j)] > F [P (a_j,a_k)]；

If P is (a_i,a_j) > P (a_j,a_k), then: F [P (a_i,a_j)] < F [P (a_j,a_k)]；

I.e. function F [P (a_i,a_j)] it is prior probability P (a_i,a_j) monotonic decreasing function；

Being absent from its direct sublink weight during information transmission between (2) two nodes is infinity, namely at P (a_i,a_jDuring)=0, then F [P (a_i,a_j)] → ∞；

(3) two inter-node transmission have and only have a direct sublink of feasible transmission, and when namely transmitting information with probability 1, this link weight is 0, i.e. P (a_i,a_jDuring)=1, therefore have: F [P (a_i,a_j)] → 0；

(4) in network node topological diagram, two adjacent direct sublink sum F [P (a_i,a_j)]+F[P(a_j,a_k)] relevant with the joint probability of the independent variable of adjacent link, it may be assumed that

F[P(a_i,a_j；A_j,a_k)]=F [P (a_i,a_j)]+F[P(a_j,a_k)]；

According to above it can be gathered that, meet the weighting function F [P (a of the mapping relations of above-mentioned condition_i,a_j)] should be:

$F\&lsqb;P(a_i,a_j)\&rsqb;=log\frac{1}{p(a_i,a_j)}=-\log P(a_i,a_j);$

Described weighting function F [P (a_i,a_j)] reality is the quantity of information expression formula of communication link；

Step3: according to weighting function, transmits probability square formation and is converted to the weight matrix B=[b (a of network topological diagram_i,a_j)]_m×m；

Step4: build network associate matrix:

An incidence matrix C=[e (a is set up for a network topological diagram with m node_i,a_j)]_m×m, its representation node a_iTo node a_jDirect sublink, following rule is followed in the foundation of described incidence matrix:

(1) incidence matrix element definition is:

(2) if node a_iTo node a_jBetween have a plurality of direct sublink, such as there is direct sublink e_s、e_k, then two sub-links are carried out logical "or" computing, namely element definition is:

(3) by a_jAs m-th node, namely the m row of incidence matrix reflect destination node a_jConnection state；

Step5: the node of incidence matrix eliminates conversion:

Set up new element in incidence matrix and generate model:To eliminate start node a_sWith destination node a_lBetween node a_c, eliminate node a_cRepresenting that the c row deleting former incidence matrix and c row are associated matrix reduction, wherein " " represents logic "and" operation,Represent logical "or" computing, e (a_s,a_l) represent elimination node a_cThe element of the new incidence matrix of rear generation, finally gives a second-order matrix of only surplus start node and destination node through iteration depression of order, is made zero by all the other elements except matrix element corresponding with destination node except start node for second-order matrix；This square Matrix now only remains next non-zero element, this non-zero element is carried out logical operations abbreviation, namely this element represents all connection states of start node and destination node, all logical "or"s being split, all logical "and" expression formulas formed after fractionation are the whole possible transmission link between start node and destination node；

Step6: Link Significance evaluation analysis

Whole transmission links to start node produced by Step4, Step5 with destination node, the weight matrix B=[b (a according to network topological diagram_i,a_j)]_m×mWeight element value corresponding in weight matrix is substituted in the direct sublink of each transmission link, and the weighted value of the direct sublink of each logic "and" operation in each transmission link is carried out arithmetic be added and draw total weighted value of each transmission link, by total weighted value inverted is obtained metewand, then path Assessment of Important will be carried out according to the metewand of each link, metewand is more big, and transmission link is more high to the importance of network；Otherwise, metewand is more little, and transmission link is more low to the importance of network.What can consider link accordingly when carrying out network information transfer selects use.