CN100452717C - Resource utilization optimization method for transfer network - Google Patents

Abstract

The present invention discloses a method for transmitting network stratification, combined route selection and multi-layer resource combined optimization, which mainly solves the problems that the traditional network resource using method has a small network stratification number, does not consider the resource coordination among the networks of different layers, and the integral optimization of the network resource utilization can not be realized. The method comprises the following steps: step 1, the network is represented in stratification; step 2, the route is selected according to the combination of the parameters of the bandwidth and the grade of service requests, the using rate of link bandwidth, the link transmission rate of contiguous layers, hop number, etc; step 3, the combined dispatching algorithm MRJS of a plurality of layers of resources is dispatched according to the result of the combined route selection; step 5, the combined dispatching algorithm MRJS of a plurality of layers of resources is periodically dispatched in order to optimize resource configuration; step 5, the algorithm is performed, and the result is operated. The present invention uses the method of the transmitting network stratification, combined route selection and multi-layer resource combined optimization in order to greatly increase the using rate of network resources, guarantee the service quality of high-grade traffic, and reduce the rejecting rate of service requests.

Description

Transmit the utilization of resources optimization method of net

Technical field

The invention belongs to communication technical field, relate generally to the utilization of resources technology in the communication network, specifically a kind of to transmitting the method for optimizing resources of net.

Technical background

Fast development along with telecommunications network, computer network and broadcasting and television network, network presents the situation of mutual fusion, network configuration generation quantitative change and even qualitative change develop and transition to network N GN of future generation (Next Generation Network or NewGenerationNetwork).NGN is not the simple extension and the stack of existing telecommunications network and IP network, but the change of whole network frame is a kind of total solution.Be the investment of protection existing network, the appearance of NGN and development are gradual changes and not mutated, are the networks that realization seamlessly transits on the basis of inheriting the existing network advantage.Trend is corresponding therewith, and the transmission net of finishing the user profile transmission will be the various transmission nets that adopt existing and WeiLai Technology, for example optical-fiber network, synchronous digital hierarchy SDH network, Ethernet net and metropolitan area network etc.

Because the customer service that transmits is of a great variety, the index request of service quality QoSs (Quality of Service) such as its time delay, delay variation, bandwidth, packet loss rate has nothing in common with each other.The income that operator obtains depends on factors such as transmission rate, class of business, user type.The operator's leased circuit that has is set up the layer 3 network of oneself, and the 2nd, 3 layer networks of light path establishment oneself are rented by the operator that has, and also have operator to have the 1st, 2,3 layer networks of oneself.Although operator's residing transmission level of net difference, its target is consistent, promptly meets consumers' demand and pursues the most reasonable utilization of resource, to reach maximum revenue.

Open on March 24th, 2004 by China national Department of Intellectual Property, publication number is the patent application " a kind of method that realizes route assignment in the multi-business optimization of photo synchronous digital transmission network " of CN 1484400, discloses a kind of method that realizes route assignment in the multi-business optimization of photo synchronous digital transmission network.This method may further comprise the steps: A. will transmit net and be divided into subnet by ring, and calculate the initial route that transmits business demand in the net; B. judge between annular subnet whether overload with the interior link circuit resource of subnet,, then recomputate route respectively as overload; C. judge whether annular subnet satisfies the requirement of load balance index,, then carry out the route adjustment as not satisfying; D. judge whether the overall target of core sub satisfies the condition of convergence after subnet being divided into edge subnet and core sub,, check then whether the route calculation times reaches thresholding, as reach, then finish assigning process, otherwise recomputate route as not satisfying.This patent application improves the computational efficiency that fairly large network carries out route assignment, and obtains approximate optimal solution when reaching the optimization aim that takies the minimum and NLB of Internet resources, makes the effect of multi-business optimization more stable, good.

There is following defective in this method: 1) be only applicable to transmit the ring network in the net; 2) be only applicable to annular subnet, edge subnet and core sub two-layer configuration; 3) do not realize the whole resource optimization in the whole net and the change of network topology, to maximally utilise Internet resources; 4), can't guarantee the service quality of high-grade business better and realize that the interests of Virtual network operator maximize not to customer service graduation processing.

And for example, open on August 18th, 2004 by China national Department of Intellectual Property, publication number is the foreign patent application " the network resource optimization apparatus and method that are used to communicate by letter " of CN 1522009, disclose a kind of communications network system, had: the department of resource management that the situation of node resource in the network and link circuit resource is managed; Reconfigure indication by providing, according to by the situation of the node resource that department of resource management managed, for allowing the nodal function Configuration Control Board that suitably reconfigures that is configured as of the function of the functional node in the network and process object; Again construct indication by providing, according to by the situation of the link circuit resource that department of resource management managed, for allowing the structure of the passage in the network become at least 1 channel design control part suitably constructing again; According to by the node resource that department of resource management managed and the situation of link circuit resource, judge whether the nodal function Configuration Control Board sent and reconfigure indication or whether the channel design control part is sent and construct indication again, and the adaptation control judging part of the necessary indication of output.There is following defective in this patent application: 1) do not carry out network resource optimization according to the customer service connection request, can't reach resource optimization on the whole from network; 2) be not suitable for the Performance Evaluation for the treatment of establishing network.

In a word, Network Layeringization and the professional operator's yield variance that produces of the interphase interaction of different levels network, different user types and variety classes are not considered by selection and resource management in traditional transmission networking, can't realize the reasonable utilization of existing Internet resources, also can't design the establishing network for the treatment of that Internet resources more rationally utilize, cause the whole resource utilization of network and reliability is lower, the high defective of reject rate of customer call or service request.

Summary of the invention

The objective of the invention is to overcome above-mentioned the deficiencies in the prior art, propose a kind of method for optimizing resources that transmits net,, reduce the reject rate of user's service request to improve the resource utilization that transmits net.

The object of the present invention is achieved like this:

Transmission net among the present invention is meant the fixed network part in wired transmission net and the wireless transmission net, does not comprise the fast-changing networks of network topology such as self-organization network ad hoc.Basic ideas of the present invention are by the resource optimization that layering, joint route are selected, resource optimization realizes transmitting net to transmitting net.Its key problem in technology is: (1) carries out layer representation to network; (2) select route according to the interlayer link transmission speed and the jumping figure parametric joint of customer service connection request bandwidth and grade, link bandwidth utilization rate, adjacency; (3) according to uniting the call by result multilayer resource combined dispatching algorithm MRJS (Multilayer Resources Joint Scheduling) that selects route; (4) regularly call multilayer resource combined dispatching algorithm MRJS to optimize allocation of resources.

Concrete grammar of the present invention is as follows:

1. carry out layering to transmitting net, be about to transmit network and be divided into M 〉=2 layer, from the lower floor to the upper strata, be called the 1st, 2 successively ..., the M layer, and represent with mathematic(al) representation the network node set of each layer and the link set that is connected neighborhood of nodes, (M-1) individual adjacency interlayer network node annexation, (M-1) individual adjacency interlayer network node link rate and (M-1) the interlayer link maps of individual adjacency concern;

2. layer transmission of each after layering is online, and resource optimization divides for situation that is triggered by the customer service connection request and the situation that is triggered by timing, and the step difference of the two is as follows.

When the customer service connection request, the resource optimization step that is triggered by the customer service connection request is:

(a) layer transmission of each after layering is online, respectively according to parameters such as the sourcesink node of customer service connection request, the grade of service, duration, in conjunction with each layer of network occupation condition, select initial routing layer according to bandwidth on demand, operation joint route selection algorithm is for this customer service connection request is set up a drive access;

(b), check the count value C that calls multilayer resource combined dispatching algorithm MRJS of current routing layer and setting for the network level of operation joint route selection algorithm routing failure _MRJS:

(1) when satisfying condition, call multilayer resource combined dispatching algorithm MRJS, adjust the node resource distribution in abutting connection with lower floor of current routing layer and current routing layer respectively, and the mapping relations of this two-layer link, after realizing the reconfiguring of Internet resources, the joint route selection algorithm that reruns, the source node of setting up this customer service connection request is to the drive access between the node of place;

(2) when not satisfying condition, refuse this customer service connection request;

(c) for the network level of operation joint route selection algorithm routing success, accept this customer service connection request, check whether once move joint route selection algorithm routing success:

(1) when repeatedly routing is successful, reduce initial routing layer and arrive the transmission bandwidth between junction associated in all layers of current routing layer, and reduce the transmission bandwidth of initial routing layer to the interlayer node of all of its neighbor of current routing layer, for this customer service connection request is set up drive access;

(2), reduce the transmission bandwidth between junction associated in the layer of current routing layer when routing when success.

The above-mentioned count value C that calls multilayer resource combined dispatching algorithm MRJS _MRJSSatisfy C _MRJS≤ (L _h, L _n, L _l), (L wherein _h, L _n, L _l) three parameters represent the upper limit of high-grade business, conventional grade business and inferior grade calling service multilayer resource combined dispatching algorithm MRJS respectively, these three relationship between parameters are L _h〉=L _nAnd L _l=0.

The mathematic(al) representation of each layer network node set of above-mentioned expression is: G ^l=(V ^l, A ^l), wherein l (=1,2 ..., M) the expression number of plies, V ^lRepresent this layer network node set, A ^lRepresent the adjacent link set between this layer network node.

The mathematic(al) representation that above-mentioned each layer of expression connects the link set of neighborhood of nodes is node neighbouring relations matrixes: Wherein l (=1,2 ..., M) the expression number of plies, N ^l=| V ^l| represent the nodal point number of l layer network, right $\∀i,j\∈V^l,$

The mathematic(al) representation of the interlayer network node annexation of the individual adjacency of above-mentioned expression (M-1) is an annexation matrix between the adjacent node of network l layer and (l-1) layer:

Wherein l (=2,3 ..., M) the expression number of plies, N ^L-1=| V ^L-1| the nodal point number of (l-1) layer network of expression and l layer network adjacency, right $\∀i\∈V^l$ With j ∈ V ^L-1, then

The mathematic(al) representation of the link rate of the interlayer network node of the individual adjacency of above-mentioned expression (M-1) relation is the link rate matrix between the adjacent node of network l layer and (l-1) layer:

Wherein l (=2,3 ..., M) the expression number of plies is right $\∀i\∈V^l$ With j ∈ V ^L-1, then

V (i, j) transmission rate between expression l layer node i and (l-1) layer node j.

The mathematic(al) representation of the mapping relations of the interlayer link of the individual adjacency of above-mentioned expression (M-1) is the mapping relations matrix between the link of network l layer and (l-1) layer adjacency:

Wherein l (=2,3 ..., M) the expression number of plies, E ^l=| A ^l| represent the number of links of l layer network, E ^L-1=| A ^L-1| the number of links of expression (l-1) layer network is right ${\∀f^l\∈F}^l$ And f ^L-1∈ F ^L-1, then

Above-mentioned operation joint route selection algorithm is at the link rate of the interlayer node of the interlayer node annexation of the set of the network node of known above-mentioned each layer and the link set that is connected neighborhood of nodes, (M-1) individual adjacency, (M-1) individual adjacency and (M-1) under the parameter conditions such as mapping relations of the interlayer link of individual adjacency, carries out as follows:

(1) generates the resource occupation request

Generate resource occupation request D={s, d, b according to connection request _Req, p, t}, wherein s represents the source node, and d represents place node, b _ReqRepresentative is the bandwidth on demand of unit with Mb/s, and p represents the grade of high-grade high, conventional grade normal, three kinds of business of inferior grade low, and t represents this professional duration.

(2) carrying out routing for the different brackets business handles

For different network routing level l (=1,2 ..., M) suitable bandwidth granularity b is set _l,, corresponding initial network routing layer l is included in this request according to customer service connection request bandwidth _In, make network layer variable l=l _InRemove l by bandwidth on demand _InIn the layer network, link bandwidth is this customer service connection request routing less than all links of bandwidth on demand by the multiple constraint shortest path CSPF-DS algorithm that moves based on Differentiated Services.

The above-mentioned process of calling multilayer resource combined dispatching algorithm MRJS is:

(1) all path uplink f between the current routing failure of calculating sourcesink node ^lBottleneck degree w _c(f ^l), the computing formula of this bottleneck degree is:

$w_c\left(f^l\right)={\mathrm{\α}}_1\×\frac{\underset{i}{\mathrm{\Σ}}\underset{j=1}{\overset{3}{\mathrm{\Σ}}}{b}_{\mathrm{conn}\left(i\right)}^j\·q\left(j\right)}{q\left(3\right)\·\underset{i}{\mathrm{\Σ}}\underset{j=1}{\overset{3}{\mathrm{\Σ}}}{b}_{\mathrm{conn}\left(i\right)}^j}+{\mathrm{\α}}_2\×u\left(f^l\right)+{\mathrm{\α}}_3\×\frac{(b_{\mathrm{req}}-a\left(f^l\right))}{b_{\mathrm{req}}}\×g(b_{\mathrm{req}}-a\left(f^l\right))+{\mathrm{\α}}_4\×\frac{(c^{f^{l-1}}-c^{f^l})}{c^{f^{l-1}}}$

[1]

Function in the formula [1]

α ₁+α ₂+α ₃+α ₄＝1 [3]

Wherein

f ^l: represent the link on the l layer, l=M herein ..., 3,2nd, carry out the network layer that bottleneck link is searched for by the order of successively decreasing,

α ₁, α ₂, α ₃, α ₄: expression influences the weights coefficient of 4 groups of parameters of bottleneck degree, by dynamic adjustment weights, can change 4 groups of parameters proportion in the bottleneck metric calculation,

b _{Conn (i)} ^j: the link f that represents the l layer network ^lLoaded service connects the shared bandwidth of conn (i), and its type of service is j,

Q (j): the weighted value of expression loaded service grade j, j=(1,2,3) herein, q (j) be a positive integer, and reduces with the increase of j value, corresponding successively high-grade, conventional grade of the grade of service (1,2,3) and inferior grade business, for example

U (f ^l): expression link f ^lUtilance, u (f ^l)=(c (f ^l)-a (f ^l))/c (f ^l), c (f wherein ^l) be link f ^lBandwidth capacity, a (f ^l) be link f ^lAvailable bandwidth capacity;

b _Req: the bandwidth on demand of expression current business connection request D,

Expression link f ^lIn the configured bandwidth of the mapping link of l-1 layer network,

Expression link f ^lLink bandwidth at the l layer network.

(2) in all links on the path between current routing failure sourcesink node, seek the link f of link bottleneck degree maximum _M ^l

(3) for link f _M ^lLower floor network adjacent chain road active volume more than or equal to the request capacity link, then the bandwidth with lower floor network adjacent chain road increases to link f _M ^l

(4) for link f _M ^lLower floor network adjacent chain road active volume less than the request capacity link, attempt being link f _M ^lReselect the lower floor network adjacent chain road of active volume more than or equal to the request capacity; If success, then the bandwidth with lower floor network adjacent chain road increases to link f _M ^l, otherwise, return link f _M ^lBandwidth increases failure information.

When the timer that is provided with overflows, be to call multilayer resource combined dispatching algorithm MRJS by the resource optimization that regularly triggers, concrete steps are:

1) l=3 is set, promptly locates since the 3rd layer;

2) call formula [4] at the l layer network total network links carried out the calculating of bottleneck degree:

$w_c\left(f^l\right)={\mathrm{\β}}_1\×\frac{\underset{i}{\mathrm{\Σ}}\underset{j=1}{\overset{3}{\mathrm{\Σ}}}{b}_{\mathrm{conn}\left(i\right)}^j\·q\left(i\right)}{q\left(3\right)\·\underset{i}{\mathrm{\Σ}}\underset{j=1}{\overset{3}{\mathrm{\Σ}}}{b}_{\mathrm{conn}\left(i\right)}^j}+{\mathrm{\β}}_2\×u\left(f^l\right)+{\mathrm{\β}}_3\×\frac{(c^{f^{l-1}}-c^{f^l})}{c^{f^{l-1}}}---\left[4\right]$

Wherein

β ₁, β ₂, β ₃: expression influences the weights coefficient of 3 groups of parameters of bottleneck degree, by dynamic adjustment weights, can change 3 groups of parameters proportion in the bottleneck metric calculation, requires β ₁+ β ₂+ β ₃=1,

b _{Conn (i)} ^j: the link f that represents the l layer network ^lLoaded service connects the shared bandwidth of conn (i), and its type of service is j, and i represents the professional numbering that connects,

Q (j): the weighted value of expression bearer service type j, j=1 herein, 2,3, q (j) be a positive integer, and reduces with the increase of j value, corresponding successively high-grade, conventional grade of type of service (1,2,3) and inferior grade business,

f ^l: represent the link on the l, l=M herein ..., 3,2,

U (f ^l): expression link f ^lUtilance, u (f ^l)=(c (f ^l)-a (f ^l))/c (f ^l), c (f wherein ^l) be link f ^lBandwidth capacity, a (f ^l) be link f ^lActive volume,

Expression link f ^lIn the configured bandwidth of the mapping link of l-1 layer network,

Expression link f ^lLink bandwidth at the l layer network;

3) press the bottleneck metric from big to small to all the link ordering of l layer, obtain set A _Sorted ^l

4) in set A _Sorted ^lIn, seek link utilization greater than T _Bol ^lLink, obtain gathering F _M ^l

5) for $f_M^l\∈F_M^l$ Link is judged and f _M ^lWhether lower floor's network path available bandwidth of adjacency is more than or equal to Q _Bw ^l, when condition is set up, use in abutting connection with the available bandwidth of lower layer path directly to be f _M ^lIncrease bandwidth, otherwise, attempt being f _M ^lReselect available bandwidth greater than Q _Bw ^lLower floor in abutting connection with the path, if the failure, be given f _M ^lIncrease the bandwidth failure information;

6) when being less than or equal to bottleneck link, bottleneck link optimization counting i optimizes number upper limit CNT _BolThe time, next link is increased bandwidth;

7) the network number of plies subtracts 1, when the number of plies more than or equal to 2 the time, carry out the global resource optimization of l layer again.

The present invention is owing to adopt the layering, the joint route that transmit net to select and multilayer resource combined optimization technological means, thereby can satisfy the business demand of different user, realized that the internetwork resource of different levels coordinates mutually, reach the reasonable utilization of Internet resources, reduced the reject rate of customer call or service request significantly.

The present invention both can be used for having built up network Route Selection and the resource optimization that transmits net, also can be used for distributing rationally of the Performance Evaluation of transmission net yet to be built and Network Transmission, exchange resource.

Description of drawings

Fig. 1 is overall flow figure of the present invention

Fig. 2 is a network hierarchy structural representation of the present invention

Fig. 3 is a joint route selection algorithm flow chart of the present invention

Fig. 4 (a) is the multilayer resource combined dispatching algorithm MRJS flow chart of the present invention when routing is failed

Fig. 4 (b) is the multilayer resource combined dispatching algorithm MRJS flow chart of the present invention when connecting dismounting

Fig. 4 (c) is the multilayer resource combined dispatching algorithm MRJS flow chart of the present invention when timer overflows

Fig. 5 is the used network topological diagram of Computer Simulation of the present invention

Fig. 6 is the high-grade professional routing performance chart that joint route of the present invention selects emulation to obtain

After Fig. 7 is multilayer resource combined dispatching of the present invention emulation, the three kinds of total call denial rate of business change curves of acquisition

After Fig. 8 is multilayer resource combined dispatching of the present invention emulation, the high-grade service call reject rate change curve of acquisition

Embodiment

Below in conjunction with accompanying drawing the present invention is further described in detail.Be convenient narration, the present invention is example narration implementation method with M=3, but its principle also is fit to the situation of M＞3 or M=2.For ease of difference with link and two interlayer site links of adjacency up and down between neighborhood of nodes in one deck, the present invention will with in one deck between neighborhood of nodes link be called adjacent link between node, with two up and down between layer node of adjacency link be called between node in abutting connection with link.

With reference to Fig. 1, specific implementation method of the present invention is as follows:

The 1st step, at first, also can divide, or, will transmit network and be divided into 3 layers by the network settings of fabricating according to the network configuration that operator uses according to transmitting the different real network system of net, from the lower floor to the upper strata, be called the 1st, 2,3 layer successively;

Secondly represent the network node set and the interlayer network node annexation of the link set that is connected neighborhood of nodes, a M-1 adjacency and the mapping relations between network node link rate and link of each layer respectively with following mathematic(al) representation, promptly

The network node set of each layer is: G ^l=(V ^l, A ^l), V wherein ^lRepresent this layer network node set, A ^lRepresent the adjacent link set between this layer network node, l=1,2,3.For example l=1 represents the physics optical-fiber network, l=2 indication circuit layer, and l=3 represents the network layer of packet-based IP network;

The link set of the network neighborhood of nodes of each layer is:

L=1 wherein, 2,3, N ^l=| V ^l| represent the nodal point number of l layer network, right $\∀i,j\∈V^l$ Have

The interlayer network node annexation of 2 adjacency is: L=2 wherein, 3, N ^L-1=| V ^L-1| the nodal point number of (l-1) layer network of expression and l layer network adjacency, N ^l=| V ^l| represent the nodal point number of l layer network, right $\∀i\∈V^l$ With j ∈ V ^L-1,

The interlayer link rate of 2 adjacency

L=2 wherein, 3, N ^L-1=| V ^L-1| the nodal point number of (l-1) layer network of expression and l layer network adjacency, N ^lThe nodal point number of representing the l layer network, right $\∀i\∈V^l$ With j ∈ V ^L-1, then

V (i, j) transmission rate between the node j of the node i of expression l layer and (l-1) layer;

The mapping relations of the interlayer link of 2 adjacency are:

L=2 wherein, 3, E ^L-1=| A ^L-1| the number of links of expression (l-1) layer network, E ^l=| A ^l| represent the number of links of l layer network, right ${\∀f^l\∈F}^l$ And f ^L-1∈ F ^L-1, establish link f ^lAnd f ^L-1Numbering be respectively i and j, then

Then with optical transmission device, optical cross-connection equipment (OXCs) as network node, connect some network node with optical fiber, constitute the 1st layer of optical-fiber network like this, 1A as shown in Figure 2 and 1B node connect and compose 1A～1B link.This layer network node set is V ¹=1A, and 1B, 1C, 1D, 1E, 1F}, the adjacent link set between this layer network node is A ¹={ 1A～1B, 1A～1F, 1B～1C, 1B～1E, 1C～1D, 1D～1E, 1E～1F}.In like manner, circuit transmission equipment, digital cross connect equipment (DXCs) as network node, are connected some network node with transmission circuit, constitute the 2nd layer of circuit network like this, connect and compose 2A～2B link as 2A among Fig. 2 and 2B node.This layer network node set is V ²=2A, and 2B, 2C, 2D, 2E}, the adjacent link set between this layer network node is A ²={ 2A～2B, 2A～2E, 2B～2C, 2B～2D, 2C～2D, 2D～2E}.The network equipments such as router, switch as network node, are connected some network node with transmission equipment, constitute the 3rd layer of packet network like this, for example 3A1 among the figure and 3B1 node are connected and composed 3A1～3B1 link.This layer network node set is V ³=3A1, and 3B1,3C1,3D1,3A2,3B2,3C2}, the adjacent link set between this layer network node is A ³={ 3A1～3B1,3A1～3C1,3A1～3D1,3B1～3C1,3C1～3D1,3A2～3B2,3A2～3C2,3B2～3C2}.According to the network node annexation, we can be divided into this layer network two sub-network N 31 and N32, and the node set of network N 31 is V ^3,1=3A1, and 3B1,3C1,3D1}, the adjacent link set between node is A ^3,1={ 3A1～3B1,3A1～3C1,3A1～3D1,3B1～3C1,3C1～3D1}; The node set of network N 32 is V ^3,2=3A2, and 3B2,3C2}, the adjacent link set is A between node ^3,2={ 3A2～3B2,3A2～3C2,3B2～3C2}.

The neighborhood of nodes annexation of the 1st layer network can further be expressed as with matrix form among Fig. 2:

Wherein 1A～1F is a network node, is matrix element in the braces.In like manner, can obtain the neighborhood of nodes annexation matrix of layer 2 network and layer 3 network.

Dotted line among Fig. 2 is represented the transmittability or the annexation of interlayer network node of two adjacency of network, for example connects 2D node and the 1st layer of 1B node of the 2nd layer, constitutes 2D～1B link; Connect the 3rd layer 3B1 node, 3A2 node and the 2nd layer 2D node, constitute 3B1～2D link and 3A2～2D link respectively.

The 2nd layer of adjacent node annexation matrix with the 1st layer is among Fig. 2:

Wherein 1A～1F, 2A～2E are network node, are matrix element in the braces.In like manner can get the 3rd layer of N31, N32 and the 2nd interlayer adjacent node between incidence matrices.

According to the 2nd layer and the 1st interlayer adjacent node between the annexation matrix, be that the position of " 1 " is provided with in abutting connection with link rate at matrix element, obtain that the link rate matrix is between the adjacent node of layer 2 network and the 1st layer network:

In like manner can get link rate matrix between the adjacent node of the 3rd layer of N31, N32 and the 2nd interlayer.

For the link in the 2nd layer, according to annexation matrix between the 2nd layer on network and the 1st layer of adjacent node, mapping relations between the link of the 2nd layer and the 1st layer adjacency of configuration network.The configuration of this link generally provides transmittability by its single link in abutting connection with lower floor, provide transmittability as the link 2C～2D among Fig. 2 by link 1A～1B, can not provide the situation of transmittability for link in abutting connection with the single link of lower floor, dispose its a plurality of links of this chain route transmittability is provided in abutting connection with lower floor, for example the link 2D～2E among Fig. 2 provides transmittability by link 1B～1C and 1C～1D, layer 2 network that obtains thus and the 1st layer network in abutting connection with link mapping relations matrix:

In like manner can obtain the 3rd layer on network and the 2nd layer in abutting connection with link mapping relations matrix.

In Fig. 2, some networks that the consolidated network that is in certain one deck can be its high one deck provide transfer resource, for example, are in the 2nd layer consolidated network and have both can be layer 3 network N31 transfer resource is provided, and also can be layer 3 network N32 transfer resource is provided.

In the 2nd step, layer transmission of each after layering is online, and resource optimization divides for situation that is triggered by the customer service connection request and the situation that is triggered by timing, and the step difference of the two is as follows.

When the customer service connection request, the resource optimization step that is triggered by the customer service connection request is:

The 2.1st step, according to the customer service request, operation joint route selection algorithm.With reference to joint route selection algorithm flow chart shown in Figure 3, the relevant parameter and the universal constraining condition of this joint route selection algorithm at first is set, this comprises constant and variable two parts about parameter.

Described constant partly is:

1) each layer network model and adjacency matrix: G ^l=(V ^l, A ^l),

L=1 wherein, 2,3;

2) the 1st layer network link transmission bandwidth:

I is the link number of this layer network, i=1, and 2 ..., | A ¹|;

3) annexation matrix between the adjacent node of network l layer and l-1 layer:

L=2 wherein, 3;

4) link rate matrix between the adjacent node of network l layer and (l-1) layer:

L=2 wherein, 3;

5) customer service connection request set: R _p, subscript p represents the grade of service, (R _High, R _Normal, R _Low) represent high-grade, conventional grade and inferior grade customer service connection request to gather respectively.Can set R as required _pProfessional connection performance, distribute as production process, arrival rate average, the professional duration that connects.For example, can establish R _pBusiness connect be produced as Poisson process, the arrival rate average is λ, the duration average is 1/ a μ chronomere.

Described variable partly is:

1) l layer network loaded service matrix: ${\mathrm{\Λ}}^l={\left[{\mathrm{\Λ}}^l(s,d)\right]}_{N^l\×N^l},$ L=1 wherein, 2,3, N ^l=| V ^l|, s, d ∈ V ^l, each element in the matrix

b ^l(s, d p) represent this business in the shared bandwidth of l layer, and s, d represent the sourcesink point that this business connects at the l layer respectively, p=high, and normal, low represent the grade of service of this connection, b ^l(initial value p) is 0 for s, d;

2) the mapping relations matrix between the link of network l layer and l-1 layer adjacency:

L=2 wherein, 3;

3) business of l layer network connect by way of the adjacent link matrix:

L=1 wherein, 2,3, R ^lBe the current business linking number of l layer network, E ^lBe the adjacent chain way of l layer network, right ${{\∀}_{\mathrm{\Λ}}}^l\∈{\mathrm{\Λ}}^l$ Have

4) bandwidth capacity of adjacent link i in the l layer network: L=2 wherein, 3, f ^l∈ F ^l

5) available bandwidth of adjacent link i in the l layer network:

L=1 wherein, 2,3, f ^l∈ F ^lDescribed universal constraining condition is:

1) the arbitrary adjacent link f of l layer network ^lThis layer network of carrying and all professional connections in abutting connection with upper layer network, shared bandwidth is less than or equal to the bandwidth capacity of this link

2) the l layer node can only be connected with a node of l-1 layer or not connect, and promptly at l=2, satisfies in 3 o'clock: $\underset{i}{\mathrm{\Σ}}{x}_{l-1}^l(i,j)=1$ With $\underset{j}{\mathrm{\Σ}}{x}_{l-1}^l(i,j)=1;$

3) the l layer adjacent link can only be carried by a path of l-1 layer, and does not allow 2 or 2 above paths carryings by the l-1 layer.

It should be noted that the C among Fig. 3 _MRJSWhether routing for the first time is successful to be used for resource adjustment time counting number and difference, parameter (L _h, L _n, L _l) high-grade, the conventional grade of expression setting respectively and the resource adjustment number of times upper limit of inferior grade business.

Under known above-mentioned parameter condition, operation joint route selection algorithm carries out as follows:

(1) generates the resource occupation request

Generate resource occupation request D={s, d, b according to connection request _Req, p, t}, wherein s represents the source node, and d represents place node, b _ReqRepresentative is the bandwidth on demand of unit with Mb/s, and p represents high-grade high, conventional grade normal, three kinds of grades of service of inferior grade low, and t represents this professional duration.The value of grade of service p is divided into Three Estate by traffic performance: high-grade business all has strict demand to bandwidth, time delay, delay variation, Loss Rate, and such business is transmitted the EF business corresponding to the acceleration among the Differentiated Services DiffServ; Conventional grade business has certain requirement to time delay, bandwidth, but the real-time requirement is not tight, allows certain Loss Rate, and such business is transmitted the AF business corresponding to guaranteeing among the Differentiated Services DiffServ; The inferior grade business does not have service quality QoS requirements, promptly traditional Internet business, and such business can be corresponding to the best effort BE business among the Differentiated Services DiffServ.

(2) carrying out routing for the different brackets business handles

Be different network routing level l=1,2,3 are provided with suitable bandwidth granularity b _l,, corresponding initial network routing layer l is included in this request according to customer service connection request bandwidth _In, make network layer variable l=l _InPress bandwidth on demand at l _InLayer network carries out the link beta pruning, promptly removes l _InLink bandwidth is less than all links of bandwidth on demand in the layer network.Operation is this connection request routing based on the multiple constraint shortest path CSPF-DS algorithm of Differentiated Services.

(3) based on the multiple constraint shortest path CSPF-DS algorithm process of Differentiated Services

Adopt the dijkstra's algorithm of SPF based on the multiple constraint shortest path CSPF-DS algorithm of Differentiated Services, for business is chosen between the sourcesink node path by way of link metric summation minimum.Link metric is taken all factors into consideration bandwidth availability ratio and two factors of jumping figure, promptly when bandwidth availability ratio is identical, selects the minimum path of jumping figure.

At first according to the current bandwidth utilance of link, (s, d) all links of the link set between are divided into 4 subclass with the sourcesink point.Suppose f ^l(l=1,2,3) expression link, c (f ^l) be its bandwidth capacity, a (f ^l) be total available bandwidth, u (f then ^l)=1-a (f ^l)/c (f ^l) the expression bandwidth availability ratio.Use A _Sd ^lExpression sourcesink point (s, the d) link set between, according to the current bandwidth utilance of link, will ${\∀f}^l{\∈A}_{\mathrm{sd}}^l$ All links be divided into following 4 subclass:

$f^l\&Element;\left\{\begin{array}{cc}{L}_A,& u\left(f^l\right)\&GreaterEqual;U_{\mathrm{high}}\\ L_B,& U_{\mathrm{nor}}\&le;u\left(f^l\right)<U_{\mathrm{high}}\\ L_C,& U_{\mathrm{low}}\&le;u\left(f^l\right)<U_{\mathrm{nor}}\\ L_D,& u\left(f^l\right)<U_{\mathrm{low}}\end{array}\right.---\left[5\right]$

(L wherein _A, L _B, L _C, L _D) represent 4 kinds of link subset, (U respectively _High, U _Nor, U _Low) represent the bandwidth availability ratio thresholding of high-grade, conventional grade, three kinds of business of inferior grade respectively.

Secondly according to link utilization u (f ^l), realize that the flow process of link set division is as follows:

To all $f^l\&Element;A_{\mathrm{sd}}^l,$ Computation bandwidth utilance u (f ^l)=1-a (f ^l)/c (f ^l)

if?u(f ^l≥U _high

L _A＝L _A+{f ^l}

else?if?U _nor≤u(f ^l)＜U _high

L _B＝L _B+{f ^l}

else?if?U _low≤u(f ^l)＜U _nor

L _C＝L _C+{f ^l}

else

L _D＝L _D+{f ^l}。

Then according to link f ^lSubclass under (l=1,2,3) calculates this link $f^l\&Element;A_{\mathrm{sd}}^l$ Link metric, computational methods are as follows:

if?p＝high

$w\left(f^l\right)=\left\{\begin{array}{cc}\mathrm{\&Delta;}& f^l\&Element;{\mathrm{<figure-callout\; id="1"\; label="L\; A"\; filenames="C20051004194200251.png,C20051004194200261.png"\; state="\{\{state\}\}">L</figure-callout>}}_A\\ 1& \mathrm{else}\end{array}\right.$

else?if?p＝normal

$w\left(f^l\right)=\left\{\begin{array}{cc}2\mathrm{\&Delta;}& f^l\&Element;L_A\\ \mathrm{\&Delta;}& f^l\&Element;{\mathrm{<figure-callout\; id="1"\; label="L\; B"\; filenames="C20051004194200251.png,C20051004194200261.png"\; state="\{\{state\}\}">L</figure-callout>}}_B\\ 1& \mathrm{else}\end{array}\right.$

else

$w\left(f^l\right)=\left\{\begin{array}{cc}3\mathrm{\&Delta;}& f^l\&Element;L_A\\ 2\mathrm{\&Delta;}& f^l\&Element;L_B\\ \mathrm{\&Delta;}& f^l\&Element;L_C\\ 1& f^l\&Element;L_D\end{array}\right.;$

Wherein, Δ be one greater than 1 constant.According to link metric w (f ^l), on current l layer network topology, move dijkstra's algorithm.

According to the routing success or not, carry out the aspect processing of routing failure or the aspect of routing success respectively and handle.

In the 2.2nd step,, judge 2 kinds of situations for the aspect of operation joint route selection algorithm routing failure:

1) works as C _MRJS≤ (L _h, L _n, L _l) and level l 〉=2 o'clock, i.e. multilayer resource combined dispatching algorithm MRJS call number C _MRJSThe upper limit that is less than or equal to this grade traffic set, and level l 〉=2 o'clock call that multilayer resource combined dispatching algorithm MRJS adjusts current routing l layer and it is in abutting connection with the mapping relations between the link of l-1 layer

Link available bandwidth between node in the l layer

Link available bandwidth between the node in the l-1 layer

L layer and (l-1) layer in abutting connection with link rate between junction associated, and network layer l subtracted 1 and call number C _MRJSAfter increasing 1, carry out Route Selection again.

2) work as C _MRJS≤ (L _h, L _n, L _l) and level l 〉=when 2 conditions are false, when promptly multilayer resource combined dispatching algorithm MRJS call number has reached for the upper limit of this grade traffic set or l=1, refuse this connection request.

In the 2.3rd step,, accept this connection and set up request for the aspect of operation joint route selection algorithm routing success.The routing success according to whether first, judge 2 kinds of situations:

1) when the success of routing first, reduces initial routing layer l _InAll layers in transmission bandwidth between junction associated Upgrade l _InThe resource state information of layer, i.e. l=l _InLayer network is the loaded service matrix ${\mathrm{\&Lambda;}}^l={\left[{\mathrm{\&Lambda;}}^l(s,d)\right]}_{N^l\&times;N^l},$ The business of l layer network connect by way of adjacent link

2) when not being the success of routing first, reduce initial routing layer l _InTo current routing layer l _pAll layers in transmission bandwidth between junction associated, and reduce initial routing layer l _InTo current routing layer l _pThe interlayer node transmission bandwidth of all of its neighbor, for the customer service connection request is set up drive access; Need to upgrade l _InLayer is to current routing l _pTransmission bandwidth in all layers of layer between junction associated ${a\left(i\right)}^{f^l}(l=l_{\mathrm{in}}~l_p),$ The different layers network is in abutting connection with the mapping relations matrix between link $Y_{l-1}^l{\left[y_{f^{l-1}}^{f^l}(i,j)\right]}_{E^{l-1}\&times;E^l}(l=l_{\mathrm{in}}~(l_p+1)),$ Link rate matrix between different layers network adjacent node $H_{l-1}^l{\left[h_{l-1}^l(i,j)\right]}_{N^{l-1}\&times;N^l}(l=l_{\mathrm{in}}~(l_p+1)),$ Also need upgrade l _InLayer is to l _pThe matrix of loaded service of layer relevant layers ${\mathrm{\&Lambda;}}^l={\left[{\mathrm{\&Lambda;}}^l(s,d)\right]}_{N^l\&times;N^l},$ L _pThe business of layer network connect by way of adjacent link

As shown in Figure 4, remove in routing failure, connection, when timer overflows 3 kinds of incidents generations, carry out multilayer resource combined dispatching algorithm MRJS respectively to 4 (c), above-mentioned 3 kinds of incidents are carried out respective handling by Fig. 4 (a).In the aforementioned joint route selection algorithm indication call multilayer resource combined dispatching algorithm MRJS, undertaken by the flow process of Fig. 4 (a) exactly.Symbol implication among Fig. 4 is as follows:

A _Sorted ^l: expression is to l=3, and all adjacent link of 2 layer networks are by its bottleneck degree order from big to small, the orderly adjacent link set after the ordering;

F _M ^l: represent l=3, the current bottleneck degree of 2 layer networks is higher, and bandwidth availability ratio is above the adjacent link set of bottleneck degree threshold value, for link $f_M^l\&Element;F_M^l,$ Have $w_c\left(f_M^l\right)=\underset{f^l\&Element;A_{\mathrm{sorted}}^l}{\mathrm{Max}}\left[w_c\left(f^l\right)\right]$ And $u\left(f_M^l\right)>T_{\mathrm{bol}};$

Q _Bw ^l: represent l=3, the link bandwidth of 2 layer networks is adjusted granularity;

δ _Req ^l: represent certain customer service connection request at l=3, the absolute value of the link corresponding bandwidth on demand of 2 layer networks and the difference of link available bandwidth;

T _Bol ^l: represent l=3, the link utilization u (f of 2 layer networks _M ^l) bottleneck degree threshold value;

CNT _Bol: the expression bottleneck link is optimized the number upper limit, and its numerical value is calculated as follows:

In the formula | F _M ^l| expression set F _M ^lElement number, CNT _Bol ⁰Be the predetermined value that bottleneck link is optimized the number upper limit, can establish earlier

Actual optimization effect and efficient according to multilayer resource combined dispatching algorithm MRJS are adjusted this parameter, to obtain the compromise of efficient and optimization aim.

Shown in Fig. 4 (a), this moment, the step of multilayer resource combined dispatching algorithm MRJS was: 1) call formula [1] and calculate current routing failure (s, d) the bottleneck degree of all links between, 2) seek and the sourcesink node of definite routing failure to the link f of link bottleneck degree maximum _M ^l, 3) judge and f _M ^lWhether lower floor's network path available bandwidth of adjacency is more than or equal to δ _Req ^l, when condition satisfies, use in abutting connection with the available bandwidth of lower layer path directly to be f _M ^lIncrease bandwidth, otherwise, attempt being f _M ^lReselect available bandwidth greater than δ _Req ^lLower floor in abutting connection with the path, if the failure, be given f _M ^lIncrease the bandwidth failure information.

Shown in Fig. 4 (b), when receiving from outside signaling or management entity when discharging connection request, the order that multilayer resource combined dispatching algorithm MRJS successively decreases according to the network layer numbering discharges this successively and is connected shared bandwidth on its routing level and the lower level.

When the timer that is provided with overflows, by the resource optimization that regularly triggers is to call multilayer resource combined dispatching algorithm MRJS, concrete steps are shown in Fig. 4 (c), when the periodicity fixed time interval that presets then, multilayer resource combined dispatching algorithm MRJS is at l=3,2 layers are carried out the processing procedure that global resource is optimized respectively, and concrete steps are:

1) l=3 is set, promptly locates since the 3rd layer;

2) call formula [4] at the l layer network total network links is carried out the calculating of bottleneck degree;

3) press the bottleneck metric from big to small to all the link ordering of l layer, obtain set A _Sorted ^l

4) in set A _Sorted ^lIn, seek link utilization greater than T _Bol ^lLink, obtain gathering F _M ^l

5) for $f_M^l\&Element;F_M^l$ Link is judged and f _M ^lWhether lower floor's network path available bandwidth of adjacency is more than or equal to Q _Bw ^l, when condition is set up, use in abutting connection with the available bandwidth of lower layer path directly to be f _M ^lIncrease bandwidth, otherwise, attempt being f _M ^lReselect available bandwidth greater than Q _Bw ^lLower floor in abutting connection with the path, if the failure, be given f _M ^lIncrease the bandwidth failure information;

6) when being less than or equal to bottleneck link, bottleneck link optimization counting i optimizes number upper limit CNT _BolThe time, next link is increased bandwidth;

7) the network number of plies subtracts 1, when the number of plies more than or equal to 2 the time, carry out the global resource optimization of l layer again.

Bottleneck link is optimized number should be moderate, and link is optimized number, and then calculated load is higher too much, and link is optimized number and then may do not reached the expection optimization aim very little, and for example link optimization number is made as 2 or 3.For bottleneck link, can be directly from the available bandwidth pool of adjacency lower layer path, be that this link increases bandwidth, or to this link correspondence carry out routing again in abutting connection with lower floor's network path, with indirect increase bandwidth resources.

According to formula [1] and formula [4] weights coefficient (α is set respectively ₁, α ₂, α ₃, α ₄) and (β ₁, β ₂, β ₃), according to the optimization effect of multilayer resource combined dispatching algorithm MRJS, reset weights coefficient (α again ₁, α ₂, α ₃, α ₄) and (β ₁, β ₂, β ₃), repeat this process, up to obtaining satisfactory result.Completed simulation result shows, bigger α ₂And β ₂Numerical value can reduce the call denial rate effectively.

A kind of method that transmits net layering, joint route selection and multilayer resource combined dispatching that the present invention proposes, both can be used for having built up the network Route Selection and the resource optimization that transmit net, also can be used for distributing rationally of the Performance Evaluation of transmission net yet to be built and Network Transmission, exchange resource.The method and the device of this transmission net layer-stepping associating Route Selection and resource optimization both can use separately as an equipment, also the function of this method and device can be integrated in signaling or the asset management device.

In addition, a kind of method that transmits net layering, joint route selection and multilayer resource combined dispatching that the present invention proposes is applicable to that also certain one deck has the situation of a plurality of networks.For example, in Fig. 2, be in the 2nd layer consolidated network and both can be layer 3 network N31 transfer resource is provided, also can be layer 3 network N32 transfer resource is provided.At this moment, need set up 2 layer-stepping routes and explorer RRMs at the 3rd layer.Aspect transmission net layer-stepping associating Route Selection and method for optimizing resources, need to increase the relevant variable of layer 3 network N32, be the adjacent node annexation matrix, adjacent node link rate matrix of same layer network node and adjacent link, this layer node and the 2nd layer and in abutting connection with the link mapping matrix, the method that the present invention proposes is still effective.

A kind of method that transmits net layering, joint route selection and multilayer resource combined dispatching that the present invention proposes, its advantage is that Network Layeringization has been considered in network route and resource management, the interphase interaction of different levels network, the difference of different user business income, both met consumers' demand, accomplished the most reasonable utilization of resource again, realized the network profit maximization, greatly improve the global reliability of network, reduce the reject rate of customer call or service request.

Be a kind of validity that transmits net layering, joint route selection and multilayer resource combined scheduling method that check the present invention proposes, we adopt the Computer Simulation checking, as Fig. 5, Fig. 6, Fig. 7 and Fig. 8.

With reference to Fig. 5, the condition that Computer Simulation of the present invention sets is as follows:

1) the maximum configured bandwidth of network layer 3 link is 622Mbit/s, and the maximum configured bandwidth of the 2nd layer or circuit layer link is 2.5Gbit/s, and the maximum configured bandwidth of the 1st layer or mpsi layer link is 10Gbit/s;

2) the layer 3 network node R among Fig. 5 _i(i=1,2 ..., 19) and layer 2 network node A _j(j=1,2 ..., 19) same node numbering be connected layer 2 network node A _j(j=1,2 ..., 21) and the 1st layer network node O _k(k=1,2 ..., 21) same node numbering be connected node A ₂₂With node O ₂₄Be connected;

3) the sourcesink node to (s d) produces with equiprobability in the 3rd layer of node set of regulation at random, active, place node to traffic intensity all identical;

4) arrival of service connection request is Poisson process, and it is the Poisson distribution of λ that arrival rate is obeyed average, and it is the exponential distribution of 1/ μ that the professional duration that connects is obeyed average, adopt in the emulation 1/ μ=2 minute and λ=2.5-25 individual/minute;

5) grade of service produces at random in the grade of service ratio of predesignating, and is promptly high-grade: conventional grade: inferior grade=0.3: 0.3: 0.4;

6) the maximum normalization configured rate of the 3rd of hypothetical network the layer of adjacent link is 1, and the span of the bandwidth on demand of each grade business is as follows: V _High=[0.5,1], V _Normal=[0.1,0.5], V _Low=[0.05,0.1];

7) according to the grade of service of request, customer service connection request bandwidth produces at random by evenly distributing in the corresponding bandwidth scope;

8) system does not have waiting list, in case connection request is rejected, then abandons immediately;

9) each emulation produces 100000 the 3rd layer service connection requests, and result data is the assembly average of simulation run 1000 times.

With reference to Fig. 6, be the relatively improvement of joint route selection algorithm performance, provided the performance of the joint route selection algorithm and the traditional constraints shortest-path first algorithm CSPF (Constrains-based Shortest Path First) of high-grade business among the figure, this moment, the joint route selection algorithm did not adopt multilayer resource combined dispatching algorithm MRJS.In view of the jumping figure/jumping figure variance in the selected path of business is the important performance indexes of service delay and delay variation, according to the right span of the selected specific node of Fig. 5, the length in selected path is done class hypothesis in following minute: jumping figure 3≤hops≤4 of shortest path, jumping figure 5≤hops≤6 of second shortest path, jumping figure hops 〉=7 of longest path.

CASE1 represents the joint route selection algorithm among Fig. 6, and CASE2 represents traditional constraints SPF CSPF algorithm, and thick dashed line is represented the jumping figure variance, the admission service number that the fine line representative is high-grade.Can find out increase along with traffic intensity from figure, the joint route selection algorithm selects the high-grade number of shortest path to be higher than traditional Constraint Shortest Path First CSPF algorithm owing to possess the traffic differentiation ability.In addition, employing possesses the joint route selection algorithm of traffic differentiation ability, the path jumping figure that can guarantee high-grade business fluctuates near its jumping figure average all the time, promptly always tend to the shortest path of selecting jumping figure minimum, and when adopting traditional constraints SPF CSPF algorithm, the path jumping figure variance of high-grade business changes greatly.Fig. 6 illustrates that the joint route selection algorithm can guarantee that high-grade service selection is than short path, short, the sudden big inferior grade of holding time is professional to be selected than long path as far as possible, thereby avoid the impact of inferior grade business to high-grade business, the business that is embodied as different brackets provides different service quality.

With reference to Fig. 7, during for comparison joint route selection algorithm routing failure, whether allow to call multilayer resource combined dispatching algorithm MRJS, whether allow regularly to call the performance under the multilayer resource combined dispatching algorithm MRJS condition, the call denial rate that provides the whole 3 kinds of business under the different mode among the figure is with incoming traffic Strength Changes figure.4 kinds of pattern MODE 1～MODE 4 are defined as follows among Fig. 7, wherein S _MRJSWhen=on/off represents joint route selection algorithm routing failure, whether allow to call multilayer resource combined dispatching algorithm MRJS, T _MRJS=on/off represents whether allow regularly to call multilayer resource combined dispatching algorithm MRJS to carry out global resource optimization:

1) MODE 1:S _MRJS=on and T _MRJS=on during i.e. joint route selection algorithm routing failure, allows to call multilayer resource combined dispatching algorithm MRJS, and allows the regular global resource optimization among the multilayer resource combined dispatching algorithm MRJS;

2) MODE 2:S _MRJS=on and T _MRJS=off during i.e. joint route selection algorithm routing failure, allows to call multilayer resource combined dispatching algorithm MRJS, and does not allow the regular global resource optimization among the multilayer resource combined dispatching algorithm MRJS;

3) MODE 3:S _MRJS=off and T _MRJS=on during i.e. joint route selection algorithm routing failure, does not allow to call multilayer resource combined dispatching algorithm MRJS, allows the regular global resource optimization among the multilayer resource combined dispatching algorithm MRJS;

4) MODE 4:S _MRJS=off and T _MRJS=off during i.e. joint route selection algorithm routing failure, does not allow to call multilayer resource combined dispatching algorithm MRJS, and does not allow the regular global resource optimization among the multilayer resource combined dispatching algorithm MRJS.

As can be seen from Figure 7, do not adopt the call denial rate of the MODE 4 of multilayer resource combined dispatching algorithm MRJS, at least be about 6～60 times of other 3 kinds of patterns, this explanation adopts multilayer resource combined dispatching algorithm MRJS can significantly reduce the call denial rate of network, improves network resource utilization and performance.

With reference to Fig. 8,, provide the call denial rate of the high-grade business under above-mentioned MODE 1～MODE 3 patterns among the figure, with incoming traffic Strength Changes figure for comparing the call denial rate of the high-grade business under MODE 1～MODE 3 patterns.Can find out that from figure MODE 1 is because S _MRJS=on and T _MRJS=on, the ascendant trend minimum that its call denial rate increases with traffic intensity; MODE 2 modes are S only _MRJS=on, its performance is inferior to MODE 1, but both gaps are less; MODE 3 modes are T only _MRJS=on, its blocking rate ascendant trend is much larger than in MODE 1 and MODE 2, and this is because MODE 1 and MODE 2 modes when all adopting the routing failure, are called multilayer resource combined dispatching algorithm MRJS, it is to resource distribution between the equal trigger layer of professional routing turkey with higher level, and at T _MRJSMultilayer resource combined dispatching algorithm MRJS under the=on condition just periodically is optimized processing to the whole network resource at set intervals, has reduced the blocking rate of subsequent user service connection request, and not at current professional routing turkey.From Fig. 8 as seen, S _MRJSThe call denial rate of multilayer resource combined dispatching algorithm MRJS during=on is less than T _MRJSThe call denial rate of multilayer resource combined dispatching algorithm MRJS during=on.

It should be noted that the data of Fig. 7 and Fig. 8 all are at α ₁: α ₂: α ₃: α ₄=1: 10: 1: 8 and β ₁: β ₂: β ₃=1: condition under obtain at 2: 1.5.

Claims (6)

1. method for optimizing resources that transmits net, carry out as follows:

(1) carries out layering to transmitting net, be about to transmit network and be divided into M 〉=2 layer, from the lower floor to the upper strata, be called the 1st, 2 successively ..., the M layer, and represent network node set and the interlayer node annexation of the link set that is connected neighborhood of nodes, a M-1 adjacency and the mapping relations between network node link rate and link of each layer respectively with mathematic(al) representation;

(2) layer transmission of each after layering is online, and resource optimization divides for situation that is triggered by the customer service connection request and the situation that is triggered by timing, and the step difference of the two is as follows;

When the customer service connection request, the resource optimization step that is triggered by the customer service connection request is:

(a) layer transmission of each after layering is online, respectively according to sourcesink node, the grade of service, the duration parameter of customer service connection request, in conjunction with each layer of network occupation condition, select initial routing layer according to bandwidth on demand, operation joint route selection algorithm sends a request of setting up drive access;

(b), check that current routing layer l is whether more than or equal to 2 with call the count value C of multilayer resource combined dispatching algorithm MRJS for the network level of operation joint route selection algorithm routing failure _MRJSThe upper limit parameter that whether is less than or equal to setting, when satisfying this condition, at first call multilayer resource combined dispatching algorithm MRJS, adjust the node resource distribution of the adjoining course of current routing layer and current routing layer respectively, and the mapping relations of this two-layer link, realize reconfiguring of Internet resources, move the joint route selection algorithm then, the source node of setting up this customer service connection request when not satisfying this condition, is refused this customer service connection request to the drive access between the node of place;

(c) for the network level that moves joint route selection algorithm routing success, accept this customer service connection request, check and whether once move joint route selection algorithm routing success, when routing success, reduce the transmission bandwidth between junction associated in the layer of current routing layer, when repeatedly routing is successful, reduce initial routing layer and arrive the transmission bandwidth between junction associated in all layers of current routing layer, and reduce the transmission bandwidth of initial routing layer to the interlayer node of all of its neighbor of current routing layer, for the customer service connection request is set up drive access;

When the timer that is provided with overflows, be to call multilayer resource combined dispatching algorithm MRJS by the resource optimization that regularly triggers, concrete steps are:

(a) l=M is set, promptly since M layer place, M 〉=2 herein;

(b) call following formula at the l layer network total network links carried out the calculating of bottleneck degree:

$w_c\left(f^l\right)={\mathrm{\&beta;}}_1\&times;\frac{\underset{i}{\mathrm{\&Sigma;}}\underset{j=1}{\overset{3}{\mathrm{\&Sigma;}}}{b}_{\mathrm{conn}\left(i\right)}^j\&CenterDot;q\left(j\right)}{q\left(3\right)\&CenterDot;\underset{i}{\mathrm{\&Sigma;}}\underset{j=1}{\overset{3}{\mathrm{\&Sigma;}}}{b}_{\mathrm{conn}\left(i\right)}^3}+{\mathrm{\&beta;}}_2\&times;u\left(f^l\right){+\mathrm{\&beta;}}_3\&times;\frac{(c^{f^{l-1}}-c^{f^l})}{c^{f^{l-1}}}$

β in the formula ₁, β ₂, β ₃: expression influences the weights coefficient of 3 groups of parameters of bottleneck degree, by dynamic adjustment weights, can change 3 groups of parameters proportion in the bottleneck metric calculation, requires β ₁+ β ₂+ β ₃=1,

b _Conn(i) j: the link f that represents the l layer network ^lLoaded service connects the shared bandwidth of conn (i), and its grade of service is j, and i represents the professional numbering that connects,

Q (j): the weighted value of expression bearer service grade j, j=(1,2,3) herein, q (j) be a positive integer, and reduces with the increase of j value, corresponding successively high-grade, conventional grade of the grade of service (1,2,3) and inferior grade business,

f ^l: represent the link on the l, l=M herein ..., 3,2,

U (f ^l): expression link f ^lUtilance, u (f ^l)=(c (f ^l)-a (f ^l))/c (f ^l), c (f wherein ^l) be link f ^lBandwidth capacity, a (f ^l) be link f ^lActive volume,

Expression link f ^lIn the configured bandwidth of the mapping link of l-1 layer network,

Expression link f ^lAt the link bandwidth of l layer network,

(c) press the bottleneck metric from big to small to all the link ordering of l layer, obtain set A _Sorted ^l

(d) in set A _Sorted ^lIn, seek link utilization greater than link utilization threshold values T _Bol ^lLink, obtain gathering F _M ^l

(e) for link $f_m^l\&Element;F_M^l,$ Judge and f _M ^lWhether lower floor's network path available bandwidth of adjacency adjusts granularity Q more than or equal to link bandwidth _Bw ^l, when this condition satisfies, use in abutting connection with the available bandwidth of lower layer path directly to be f _M ^lIncrease bandwidth, otherwise, attempt being f _M ^lReselect available bandwidth greater than Q _Bw ^lLower floor in abutting connection with the path, if the failure, be given f _M ^lIncrease the bandwidth failure information;

(f) judge whether bottleneck link optimization counting i is less than or equal to bottleneck link and optimizes number upper limit CNT _Bol, when condition is set up, next link is increased bandwidth;

(g) network number of plies l is subtracted 1, when the number of plies more than or equal to 2 the time, from step (b), carry out the global resource optimization of l layer again.

2. the method for optimizing resources of transmission net according to claim 1 is characterized in that calling the count value C of multilayer resource combined dispatching algorithm MRJS _MRJSUpper limit parameter be set at: high-grade professional I _h, the professional I of conventional grade _nWith the professional L of inferior grade _l, the relation between this upper limit parameter is L _h〉=L _nAnd L _l=0.

3. the method for optimizing resources of transmission net according to claim 1 is characterized in that the mathematic(al) representation of representing each layer network node set and the link set that is connected neighborhood of nodes is respectively: G ^l=(V ^l, A ^l) and $F^l{\left[f^l(i,j)\right]}_{N^l\&times;N^l},$

L=1 in the formula, 2 ..., M

V ^lRepresent this layer network node set

A ^lRepresent the adjacent link set between this layer network node

N ^l=| V ^l| represent the nodal point number of l layer network

Right $\&ForAll;i,j\&Element;V^l,$

4. the method for optimizing resources of transmission net according to claim 1 is characterized in that representing that the interlayer node annexation of M-1 adjacency and the mathematic(al) representation of the mapping relations between network node link rate and link are respectively:

$X_{l-1}^l{\left[x_{l-1}^l(i,j)\right]}_{N^{l-1}\&times;N^l}$ 、 $H_{l-1}^l{\left[h_{l-1}^l(i,j)\right]}_{N^{l-1}\&times;N^l}$ 、 $Y_{l-1}^l{\left[y^{f^{l-1}}(i,j)\right]}_{E^{l-1}\&times;E^l},$

L=2 in the formula, 3 ..., M,

N ^L-1=| V ^L-1| the nodal point number of the l-1 layer network of expression and l layer network adjacency, right $\&ForAll;i\&Element;V^l$ With j ∈ V ^L-1,

Then

Right $\&ForAll;i\&Element;V^l$ With j ∈ V ^L-1, then

I represents the node of l layer, and j represents the node of l-1 layer;

V (i, j) transmission rate between expression l layer node i and l-1 layer node j;

f ^lA link of expression network l layer, f ^L-1A link of expression network l-1 layer, E ^l=| A ^l| represent the number of links of l layer network, E ^L-1=| A ^L-1| represent the number of links of l-1 layer network, right $\&ForAll;f^l\&Element;F^l$ And f ^L-1∈ F ^L-1, then

5. the method for optimizing resources of transmission net according to claim 1, it is characterized in that moving the joint route selection algorithm and be under the condition of the interlayer node annexation of the network node set of known each layer and the link set that is connected neighborhood of nodes, a M-1 adjacency and the mapping relations parameter between network node link rate and link, carry out as follows:

(1) generates the resource occupation request

Generate resource occupation request D={s, d, b according to the customer service connection request _Req, p, t}, wherein s represents the source node, and d represents place node, b _ReqRepresentative is the bandwidth on demand of unit with Mb/s, the grade of high-grade, conventional grade that p represents, three kinds of business of inferior grade, and t represents this professional duration;

(2) carrying out routing for the different brackets business handles

At first be different network routing level l=1,2 ..., M is provided with bandwidth granularity b _l,, corresponding initial network routing layer l is included in this request again according to customer service connection request bandwidth _In, make network layer variable l=l _In, to remove in the l layer network by bandwidth on demand then, link bandwidth by the multiple constraint shortest path CSPF-DS algorithm of operation based on Differentiated Services, is this customer service connection request selection path less than all links of bandwidth on demand.

6. the method for optimizing resources of transmission net according to claim 1, when it is characterized in that moving joint route selection algorithm routing failure, the process of calling multilayer resource combined dispatching algorithm MRJS is:

(1) all path uplink f between the current routing failure of calculating sourcesink node ^lBottleneck degree w _c(f ^l), the computing formula of this bottleneck degree is:

$w_c\left(f^l\right)={\mathrm{\&alpha;}}_1\&times;\frac{\underset{i}{\mathrm{\&Sigma;}}\underset{j=1}{\overset{3}{\mathrm{\&Sigma;}}}{b}_{\mathrm{conn}\left(i\right)}^j\&CenterDot;q\left(j\right)}{q\left(3\right)\&CenterDot;\underset{i}{\mathrm{\&Sigma;}}\underset{j=1}{\overset{3}{\mathrm{\&Sigma;}}}{b}_{\mathrm{conn}\left(i\right)}^j}+{\mathrm{\&alpha;}}_2\&times;u\left(f^l\right)+{\mathrm{\&alpha;}}_3\&times;\frac{(b_{\mathrm{req}}-a\left(f^l\right))}{b_{\mathrm{req}}}\&times;g(b_{\mathrm{req}}-a\left(f^l\right))+{\mathrm{\&alpha;}}_4\&times;\frac{(c^{f^{l-1}}-c^{f^l})}{c^{f^{l-1}}}$

Function in the formula

f ^l: represent the link on the l layer, l=M herein ..., 3,2,

α ₁, α ₂, α ₃, α ₄: expression influences the weights coefficient of 4 groups of parameters of bottleneck degree, by dynamic adjustment weights, can change 4 groups of parameters proportion in the bottleneck metric calculation, requires α ₁+ α ₂+ α ₃+ α ₄=l,

b _{Conn (i)} ^j: the link f that represents the l layer network ^lLoaded service connects the shared bandwidth of conn (i), and its grade of service is j,

Q (j): the weighted value of expression bearer service grade j, j=(1,2,3) herein, q (j) be a positive integer, and reduces with the increase of j value, corresponding successively high-grade, conventional grade of the grade of service (1,2,3) and inferior grade business,

U (f ^l): expression link f ^lUtilance, u (f ^l)=(c (f ^l)-a (f ^l))/c (f ^l), c (f wherein ^l) be link f ^lBandwidth capacity, a (f ^l) be link f ^lActive volume,

b _Req: the bandwidth on demand of expression current business request D,

Expression link f ^lIn the configured bandwidth of the mapping link of l-1 layer network,

Expression link f ^lLink bandwidth at the l layer network;

(2) in all links on the path between current routing failure sourcesink node, seek the link f of link bottleneck degree maximum _M ^l

(3) for link f _M ^lThe active volume on lower floor network adjacent chain road more than or equal to the link of request capacity, the bandwidth on lower floor network adjacent chain road is increased to link f _M ^l

(4) for link f _M ^lLower floor network adjacent chain road active volume less than the request capacity link, attempt being link f _M ^lReselect the lower floor network adjacent chain road of active volume, if success increases the bandwidth on lower floor network adjacent chain road to link f more than or equal to the request capacity _M ^l, otherwise, return link f _M ^lBandwidth increases failure information.

Images