CN102665285B - Optimal service scheduling method for trusted information grid system - Google Patents

Abstract

The invention provides an optimal service scheduling method for a trusted information grid system. By acquiring the pheromone traces of service in the information grid system, setting a pheromone selection rule and updating the intensity of the pheromone traces, the optimal service scheduling method realizes optimal service scheduling meeting the reliability requirement of the information grid system. The optimal service scheduling method has the remarkable advantage that the optimal service scheduling method increases the service transmission efficiency meeting the reliability requirement of the information grid system.

Description

A kind of optimum business scheduling method of authentic communication grid system

Technical field

The present invention relates to communication technical field, particularly relate to wireless network.

Background technology

Nformation grid (Global lnfo rmation Grid, GlG) is the various running concepts of configuration information matrix and the abbreviation of content.Nformation grid can help that people collect, processing and protected data, and realize information each networking unit ask flow and the access of user to these information, and information flow, reaches the object of information sharing, its structural representation as shown in Figure 1.

Consider autonomy, extendibility, survivability and the open problem of the each node of network, the feature of nformation grid mainly contain following some,

(1) topological structure of dynamic change

The motion of network node has very large randomness, add interfering with each other and the impact of factor on wireless link such as landform between the variation, wireless channel of wireless transmitting device transmitted power, network topology structure may change at any time, and the mode of this variation and speed are difficult to prediction.

(2) distributed network structure

Do not need the support of the core communications facilitys such as base station, each node is equal, and node can add at any time and exit network.Compared with centralized network structure, there is stronger robustness and survivability.

(3) multi-hop transmission mode

Grouping adopts multi-hop transmission mode, forwards through intermediate node, arrives destination node.The effectively coverage of extended network.

(4) mobile node limitation

Mobile node has small and exquisite, portable feature, but general CPU computing capability is low, internal memory is little, and this has limited the design of network and application program.Particularly many mobile nodes are by the easily power consumption source power supplies such as battery, finite energy.

(5) internet security is low

Compared with wire communication, the communication of nformation grid is attacked by the network securitys such as passive wiretapping, initiatively invasion, denial of service, forgery more easily.

(6) autonomy of network

Nformation grid network is for general networks, and maximum benefit exactly can be at any time, any place does not need the network infrastructure support of (comprising wired and wireless network), and rapid build plays a mobile communications network.

(7) nonsymmetric channel

Owing to adopting wireless channel communication, be subject to the impact of the factors such as terrain environment, emission function and receiving sensitivity, may produce uni-directional wireless channel.

(8) limited bandwidth, the wireless link of volume-variable

Because nformation grid network using Radio Transmission Technology is as the means of communication of bottom, and the network bandwidth that the physical characteristic of wireless channel itself can provide it is much lower with respect to wire message way.In addition, consider the many factors such as interference of collision, signal attenuation that competition sharing wireless channel produces, noise jamming, interchannel, mobile node finally can obtain actual bandwidth and be far smaller than theoretic maximum bandwidth value.In nformation grid, these above features must cause topology in network constantly occurring to change.

In sum: for realizing the transmitting of business, be necessary to propose a kind of business scheduling method that nformation grid system reliability requires that meets, met node and the low requirement taking of link circuit resource; Solve in the time that interstitial content is more the problem that resource occupying rate is high.

Summary of the invention

Technical problem to be solved by this invention is: solve and meet the business scheduling problem that nformation grid system reliability requires.

The present invention for solving the problems of the technologies described above adopted technical scheme is: a kind of business scheduling method that nformation grid system reliability requires that meets is provided, and the method meets the business scheduling under nformation grid system reliability requirement condition by pheromones trace, configuration information element selective rule and the lastest imformation element trace intensity of business in obtaining information grid system; It is characterized in that: invent a kind of business scheduling method that nformation grid system reliability requires that meets, comprise the following steps:

The pheromones trace of business and the heuristic information of business scheduling problem in A, obtaining information grid system;

B, business information element selective rule is set;

C, renewal business information element trace intensity.

In described steps A, as shown in Figure 2, the optimal solution of using business information element trace intensity in building process can way to acquire to select.By the configuration y of subsystem i _iinitialization business information trace can obtain the probability that respective paths is selected, business information element trace intensity is

${\mathrm{\τ}}_i^0\left(y_i\right)=\left\{\begin{array}{ccc}{R}_{\mathrm{ij}}\left(k\right)& \mathrm{if}& y_i=j\left(k\right),\\ 1-(1-R_{{\mathrm{ij}}_1}\left(k_1\right))*(1-R_{{\mathrm{ij}}_2}\left(k_2\right))& \mathrm{if}& y_i=(j_1\left(k_1\right),j_2\left(k_2\right)),\\ 1-(1-R_{{\mathrm{ij}}_1}\left(k_1\right))*(1-R_{{\mathrm{ij}}_2}\left(k_2\right))*(1-R_{\mathrm{ij}3}\left(k_3\right))& \mathrm{if}& y_i=(j_1\left(k_1\right),j_2\left(k_2\right),j_3\left(k_3\right)),\end{array}\right.$ , wherein $R_{\mathrm{ij}}\left(x_{\mathrm{ij}}\right)=\underset{d=1}{\overset{D}{\mathrm{\Σ}}}{T}_d^{\′}\·\{1-\mathrm{Pr}\left(x_{\mathrm{ij}}\right)\},$

$\mathrm{Bin}(x_{\mathrm{ij}},p,r_{\mathrm{ij}})=\underset{t=0}{\overset{p}{\mathrm{\Σ}}}\left(\begin{array}{c}{x}_{\mathrm{ij}}\\ t\end{array}\right)\left(r_{\mathrm{ij}}\right){(1-r_{\mathrm{ij}})}^{x_{\mathrm{ij}}-t}.$ For the y of i subsystem _iheuristic function be

${\mathrm{\η}}_i\left(y_i\right)=\left\{\begin{array}{ccc}\frac{r_{\mathrm{ij}}+g_{\mathrm{ij}}}{{\mathrm{kc}}_{\mathrm{ij}}}& \mathrm{if}& y_i=j\left(k\right),\\ \frac{r_{{\mathrm{ij}}_1}+g_{{\mathrm{ij}}_1}+r_{{\mathrm{ij}}_2}+g_{{\mathrm{ij}}_2}}{k_1{c}_{{\mathrm{ij}}_1}+k_2{c}_{{\mathrm{ij}}_2}}& \mathrm{if}& y_i=(j_1\left(k_1\right),j_2\left(k_2\right))\\ \frac{r_{{\mathrm{ij}}_1}+g_{{\mathrm{ij}}_1}+r_{{\mathrm{ij}}_2}+g_{{\mathrm{ij}}_2}+r_{{\mathrm{ij}}_3}+g_{{\mathrm{ij}}_3}}{k_1{c}_{{\mathrm{ij}}_1}+k_2{c}_{{\mathrm{ij}}_2}+k_3{c}_{{\mathrm{ij}}_3}}& \mathrm{if}& y_i=(j_1\left(k_1\right),j_2\left(k_2\right),j_3\left(k_3\right))\end{array}\right..$

In described step B, the Business Stream in subsystem i is by using pseudorandom ratio rules option and installment y _i, wherein Y distributes by probability of use carry out the random selection of business information element.

In described step C, local updating business information element density.Each Business Stream is by local message element update rule upgrade business information element density, build optimal solution temporarily to reduce pheromones quantity.

In described step C, in the time that all Business Streams all obtain optimal solution, business information element trace is made an addition to configuration y _iin, and use global information element update rule

y _ithe lowest possible config update business information element of ∈ density, wherein for the feasible susceptibility ratio of current optimum.

Beneficial effect of the present invention is: a kind of business scheduling method that nformation grid system reliability requires that meets is provided, has met node and the low requirement taking of link circuit resource; Solve in the time that interstitial content is more the problem that resource occupying rate is high.

Brief description of the drawings

Fig. 1 is nformation grid system configuration schematic diagram

Fig. 2 meets the business scheduling flow schematic diagram that nformation grid system reliability requires

Embodiment

According to drawings and embodiments the present invention is described in further detail below:

Basic ideas of the present invention are as follows: by the pheromones trace of business in obtaining information grid system and the heuristic information of business scheduling problem, configuration information element selective rule, lastest imformation element trace intensity, realizes and meets the business scheduling that nformation grid system reliability requires.

1. the optimal solution of using business information element trace intensity in building process can way to acquire to select.As shown in Figure 2, by the configuration y of subsystem i _iinitialization business information trace can obtain the probability that respective paths is selected, business information element trace intensity is

${\mathrm{\τ}}_i^0\left(y_i\right)=\left\{\begin{array}{ccc}{R}_{\mathrm{ij}}\left(k\right)& \mathrm{if}& y_i=j\left(k\right),\\ 1-(1-R_{{\mathrm{ij}}_1}\left(k_1\right))*(1-R_{{\mathrm{ij}}_2}\left(k_2\right))& \mathrm{if}& y_i=(j_1\left(k_1\right),j_2\left(k_2\right)),\\ 1-(1-R_{{\mathrm{ij}}_1}\left(k_1\right))*(1-R_{{\mathrm{ij}}_2}\left(k_2\right))*(1-R_{\mathrm{ij}3}\left(k_3\right))& \mathrm{if}& y_i=(j_1\left(k_1\right),j_2\left(k_2\right),j_3\left(k_3\right)),\end{array}\right.$ , wherein $R_{\mathrm{ij}}\left(x_{\mathrm{ij}}\right)=\underset{d=1}{\overset{D}{\mathrm{\Σ}}}{T}_d^{\′}\·\{1-\mathrm{Pr}\left(x_{\mathrm{ij}}\right)\},$

$\mathrm{Bin}(x_{\mathrm{ij}},p,r_{\mathrm{ij}})=\underset{t=0}{\overset{p}{\mathrm{\Σ}}}\left(\begin{array}{c}{x}_{\mathrm{ij}}\\ t\end{array}\right)\left(r_{\mathrm{ij}}\right){(1-r_{\mathrm{ij}})}^{x_{\mathrm{ij}}-t}.$ For the y of i subsystem _iheuristic function

For ${\mathrm{\η}}_i\left(y_i\right)=\left\{\begin{array}{ccc}\frac{r_{\mathrm{ij}}+g_{\mathrm{ij}}}{{\mathrm{kc}}_{\mathrm{ij}}}& \mathrm{if}& y_i=j\left(k\right),\\ \frac{r_{{\mathrm{ij}}_1}+g_{{\mathrm{ij}}_1}+r_{{\mathrm{ij}}_2}+g_{{\mathrm{ij}}_2}}{k_1{c}_{{\mathrm{ij}}_1}+k_2{c}_{{\mathrm{ij}}_2}}& \mathrm{if}& y_i=(j_1\left(k_1\right),j_2\left(k_2\right))\\ \frac{r_{{\mathrm{ij}}_1}+g_{{\mathrm{ij}}_1}+r_{{\mathrm{ij}}_2}+g_{{\mathrm{ij}}_2}+r_{{\mathrm{ij}}_3}+g_{{\mathrm{ij}}_3}}{k_1{c}_{{\mathrm{ij}}_1}+k_2{c}_{{\mathrm{ij}}_2}+k_3{c}_{{\mathrm{ij}}_3}}& \mathrm{if}& y_i=(j_1\left(k_1\right),j_2\left(k_2\right),j_3\left(k_3\right))\end{array}\right..$

2. the Business Stream in subsystem i is by using pseudorandom ratio rules option and installment y _i, wherein Y distributes by probability of use carry out the random selection of business information element.

3. business information element density local updating.Local updating business information element density.Each Business Stream is by local message element update rule upgrade business information element density, build optimal solution temporarily to reduce pheromones quantity.

4. in the time that all Business Streams all obtain optimal solution, business information element trace is made an addition to configuration y _iin, and use global information element update rule

y _ithe lowest possible config update business information element of ∈ density, wherein for the feasible susceptibility ratio of current optimum.

The invention provides a kind of business scheduling method that nformation grid system reliability requires that meets, met node and the low requirement taking of link circuit resource, solved in the time that interstitial content is more the problem that resource occupying rate is high.

Claims (2)

1. the optimum business scheduling method of an authentic communication grid system, pheromones trace, configuration information element selective rule and lastest imformation element trace intensity by business in obtaining information grid system meet the business scheduling under nformation grid system reliability requirement condition, comprise the steps:

A. the pheromones trace of business and the heuristic information of business scheduling problem in obtaining information grid system;

B., business information element selective rule is set, and the Business Stream being specially in subsystem i passes through to use pseudorandom ratio rules option and installment y _i, wherein Y distributes by probability of use carry out the random selection of business information element;

C. upgrade business information element trace intensity, be specially local updating business information element density, each Business Stream is by local message element update rule upgrade business information element density, build optimal solution temporarily to reduce pheromones quantity.

2. according to the method for claim 1, it is characterized in that for described step C: in the time that all Business Streams all obtain optimal solution, business information element trace is made an addition to configuration y _iin, and use global information element update rule y _ithe lowest possible config update business information element of ∈ density, wherein for the feasible susceptibility ratio of current optimum.