CN102625369B - Load balancing optimization method for guaranteeing quality of service requirements of users of different levels in classified manner - Google Patents

Abstract

The invention discloses a load balancing optimization method for guaranteeing quality of service requirements of users of different levels in a classified manner in a mobile communication system. In view of the users of different business levels, the GBR (Guaranteed Bit Rate) requirement of GBR users of high levels can be guaranteed preferentially during load balancing switching, then, the actual available rate of non-GBR users of low levels can be increased, the users occupying more system resources can be selected preferentially respectively to undergo load balancing switching, thus, the switching number is reduced greatly, the signalling expense of a system is reduced, the access blocking rate of the GBR users is reduced and the system resource utilization rate and the total system throughput are increased.

Description

Classification guarantees the load balance optimization method that different brackets QoS of customer requires

Technical field

The present invention is the load balance optimization method that in a kind of mobile communication system, classification guarantees the requirement of different brackets QoS of customer, belongs to the networking technology area in mobile communication.

Background technology

In cell mobile communication systems, the load of each minizone is unbalanced often, some cell loads are higher, some cell loads are lower, thereby cause high capacity cell radio resource nervous and can not meet user's service quality (QoS, Quality of Service) requirement, and in low loaded cell, there is the situation of waste Radio Resource.In order to improve the utilance of Radio Resource, people have proposed load-balancing algorithm,, by the edge customer in high capacity community is switched in low loaded cell, realize the approximate equalization of minizone load.For the user of different service types, the effect that load balancing reaches is different.First the high-priority users requiring for secure bit rate (GBR), should meet it and ensure bit rate requirement, and load balancing can reduce the access blocking rate of such service-user; For the low priority user that does not ensure that bit rate (non-GBR) requires, should be after the guarantee bit rate that meets all GBR users requires, press the principle of rate fairness for all non-GBR users and distribute surplus resources, make them obtain identical reality and can obtain speed, load balancing can improve non-GBR user's reality in busy community and can obtain speed.Existing load-balancing algorithm is not considered the business of different priorities in the time carrying out load balancing, therefore can not guarantee the corresponding qos requirement of different business, thereby causes poor QoS of customer in lower resource utilization ratio and high capacity community.The present invention proposes the high-grade GBR user's of a kind of preferential assurance guarantee bit rate requirement, secondly raising inferior grade non-GBR user reality can obtain the load balance optimization method of speed.

Summary of the invention

Technical problem: the load balance optimization method that the object of the invention is to propose classification assurance different brackets QoS of customer requirement in a kind of mobile communication system, thereby in reaching load balancing, reduce GBR user and accessed blocking rate, improved resource utilization ratio and overall system throughput.

Technical scheme: the object of the invention is to propose the load balance optimization method of classification assurance different brackets QoS of customer requirement in a kind of mobile communication system, comprise the steps:

The first step, within a load balancing cycle, each community is for the user of different brackets in this community, according to its corresponding bit rate and greatest requirements rate requirement distributing system resource of ensureing;

Second step, each base station is adjacent base station exchange load information separately, and load information comprises the number of resources ρ of all secure bit rate GBR (Guaranteed Bit Rate) CU in community ^gBRand all number of resources ρ that do not ensure bit rate non-GBR (non Guaranteed Bit Rate) CU ^non-GBR;

The 3rd step, to arbitrary cell i, the number of resources ρ of all GBR CUs of Ruo Qinei _i ^gBRexceed the given load balancing handoff threshold ψ for GBR user being set according to the requirement of oneself by operator ^gBR, need to carry out the balanced switching of GBR user load., be chosen in and in this community, take the user k that number of resources is maximum according to following formula in cell i edge and can be switched to the GBR user in neighbor cell for all ^.for first-selection is switched user

k ^·＝arg?maxρ _i，k ^GBR

Wherein ρ _{i, k} ^gBRbe the number of resources that cell i is distributed to GBR user k, switch user k for first-selection ^., selecting all neighbor cells that meet following two conditions is alternative cell:

Condition one: ${\mathrm{SINR}}_{{j,k}^{\·}}\≥\mathrm{AC}\_\mathrm{threshold}$

Condition two: ${{\mathrm{\ρ}}_j}^{\mathrm{GBR}}+{{\mathrm{\ρ}}_{{j,k}^{\·}}}^{\mathrm{GBR}}\≤{\mathrm{\ψ}}^{\mathrm{GBR}}$

Wherein Ac_threshold be by operator according to oneself require set user access thresholding, the first-selected user of switching k ^.signal to Interference plus Noise Ratio in the j of alternative cell.Condition one is user k ^.signal to Interference plus Noise Ratio in alternative cell is not less than by operator according to oneself requiring the user who sets to access thresholding Ac_threshold; ρ _j ^gBRthe number of resources of all GBR CUs in the j of alternative cell,

the first-selected user of switching k ^.in the j of alternative cell, reach it and ensure the required number of resources taking of bit rate requirement, condition two is user k ^.be switched to the number of resources sum of original all GBR CUs in the number of resources Yu Gai community taking in Hou Gai community, arbitrary alternative cell not higher than the balanced handoff threshold ψ of this community GBR user load ^gBR.

In all alternative cell that meet above-mentioned condition, select to have switched the minimum community j of number of resources of rear all GBR CUs according to following formula ^.for Target cell

$j^{\·}=\arg \min ({{\mathrm{\ρ}}_j}^{\mathrm{GBR}}+{{\mathrm{\ρ}}_{{j.k}^{\·}}}^{\mathrm{GBR}})$

By user k ^.switch to Target cell j by cell-of-origin i ^.;

The 4th step, within the current load balancing cycle, repeats the 3rd step, until the number of resources ρ of all GBR CUs in cell i _i ^gBRlower than the balanced handoff threshold ψ of GBR user load ^gBRor do not meet switching condition edge customer (all remaining edge GBR users can not satisfy condition simultaneously one and condition two), cell i stops that GBR user load is balanced to be switched;

The 5th step, within the balanced cycle of present load, completes the 3rd for all communities, and four liang of steps stop the balanced switching of GBR user load in the whole network;

The 6th step, for arbitrary cell i, if wherein non-GBR user's reality can obtain speed and do not reach the maximum rate of user's request, needs to carry out that non-GBR user load is balanced switches.Can be switched to the non-GBR user k in neighbor cell in cell i edge for all, be chosen in and in this community, take the non-GBR user k that number of resources is maximum according to following formula ^.for first-selection is switched user

k ^·＝arg?max?ρ _i，k ^non-GBR

Wherein ρ _{i, k} ^non-GBRbe the number of resources that cell i is distributed to non-GBR user k, switch user k for first-selection ^., selecting all neighbor cells that meet following two conditions is alternative cell:

Condition three: ${\mathrm{SINR}}_{{j,k}^{\·}}\≥\mathrm{Ac}\_\mathrm{threshold}$

Condition four: $V_{{i,k}^{\&CenterDot;}}^{\mathrm{non}-\mathrm{GBR}}<V_{{j,k}^{\&CenterDot;}}^{\mathrm{non}-\mathrm{GBR}}$

Condition three i.e. the first-selected user k that switches ^.signal to Interference plus Noise Ratio in alternative cell is not less than operator according to oneself requiring the user who sets to access thresholding Ac_threshold;

user k ^.in cell-of-origin, reality can obtain speed,

user k ^.in the j of alternative cell, reality can obtain speed, and condition four is user k ^.reality in alternative cell can obtain the reality that speed is greater than in cell-of-origin can obtain speed.

In all alternative cell that meet above-mentioned condition, select to have switched according to following formula the community j that rear total load is minimum ^.for Target cell

$j^{\&CenterDot;}=\arg \min ({{\mathrm{\&rho;}}_j}^{\mathrm{GBR}}+{{\mathrm{\&rho;}}_j}^{\mathrm{non}-\mathrm{GBR}}+{{\mathrm{\&rho;}}_{{j,k}^{\&CenterDot;}}}^{\mathrm{non}-\mathrm{GBR}})$

Wherein ρ _j ^gBRthe number of resources of existing all GBR CUs in the j of alternative cell, ρ _j ^non-GBRthe number of resources of existing all non-GBR CUs in the j of alternative cell,

non-GBR user k ^.the number of resources taking in the j of alternative cell.

By user k ^.switch to Target cell j by cell-of-origin i ^.;

The 7th step, within the current load balancing cycle, repeat the 6th step, until in cell i all non-GBR users reach their greatest requirements rate requirement or do not meet switching condition edge customer (all remaining edge non-GBR users can not satisfy condition simultaneously one and condition two), cell i stops that non-GBR user load is balanced to be switched;

The 8th step, within the balanced cycle of present load, completes the 6th for all communities, and seven liang of steps stop the balanced switching of the whole network non-GBR user load, and algorithm finishes.

The first-selected user of switching k while switching for GBR user load is balanced ^.and respective target cells j ^.selection:

k ^·＝arg?max?ρ _i，k ^GBR

$j^{\&CenterDot;}=\arg \min ({{\mathrm{\&rho;}}_j}^{\mathrm{GBR}}+{{\mathrm{\&rho;}}_{{j,k}^{\&CenterDot;}}}^{\mathrm{GBR}})$

The first-selected user of switching k while switching for non-GBR user load is balanced ^.and respective target cells j ^.selection:

k ^·＝arg?max?ρ _i，k ^non-GBR

$j^{\&CenterDot;}=\arg \min ({{\mathrm{\&rho;}}_j}^{\mathrm{GBR}}+{{\mathrm{\&rho;}}_j}^{\mathrm{non}-\mathrm{GBR}}+{{\mathrm{\&rho;}}_{{j,k}^{\&CenterDot;}}}^{\mathrm{non}-\mathrm{GBR}})$

Method be: first definition following variable:

GBR user k is shared number of resources in a certain cell i

${{\mathrm{\&rho;}}_{i,k}}^{\mathrm{GBR}}=\frac{{\mathrm{\&theta;}}_k}{B*{\log }_2(1+{\mathrm{SINR}}_{i,k})}---\left[1\right]$

Wherein θ _kfor the guarantee bit rate requirement of GBR user k, B is the equivalent bandwidth of a least resource unit, SINR _{i, k}for the Signal to Interference plus Noise Ratio of user k in cell i.

For arbitrary cell i in network, define the number of resources of all GBR CUs in it:

${\mathrm{\&rho;}}_i^{\mathrm{GBR}}={\mathrm{\&Sigma;}}_{k=1}^{G_i}{\mathrm{\&rho;}}_{i,k}^{\mathrm{GBR}}---\left[2\right]$

It is the total resources number that cell i is distributed to all GBR users in it.Wherein G _igBR users all in cell i;

for cell i is to the number of resources of GBR user k distribution.

Non-GBR user k is shared number of resources in a certain cell i

${{\mathrm{\&rho;}}_{i,k}}^{\mathrm{non}-\mathrm{GBR}}=\frac{V_{i,k}^{\mathrm{non}-\mathrm{GBR}}}{B*{\log }_2(1-{\mathrm{SINR}}_{i,k})}$

[3]

Wherein B is the equivalent bandwidth of a least resource unit, SINR _{i, k}for the Signal to Interference plus Noise Ratio of user k in cell i,

for the reality of all non-GBR users in cell i can obtain speed, can obtain as follows:

To the each non-GBR user k in cell i, can record the Signal to Interference plus Noise Ratio SINR that it receives in cell i _{i, k}thereby, can try to achieve its reality in a least resource unit and can obtain speed

$T_{i,k}^{\mathrm{non}-\mathrm{GBR}}=B*{\log }_2(1+{\mathrm{SINR}}_{i,k})$

[4]

Obtain the reality of all non-GBR users in a least resource unit in cell i and can obtain speed

least common multiple lcm, can obtain speed because all non-GBR users in cell i will obtain identical reality, known arbitrary non-GBR user k divide virtual resource number

${\mathrm{\&rho;}}_{i,k}=\frac{\mathrm{lcm}}{T_{i,k}^{\mathrm{non}-\mathrm{GBR}}}$

[5]

The actual number of resources that can get of non-GBR user k is

${\mathrm{\&rho;}}_{i,k}^{\mathrm{non}-\mathrm{GBR}}=\frac{\mathrm{Virtual}\_{\mathrm{\&rho;}}_{i,k}}{{\mathrm{\&Sigma;}}_{k=1}^{N_i}\mathrm{Virtual}\_{\mathrm{\&rho;}}_{i,k}}*(S-{\mathrm{\&rho;}}_i^{\mathrm{GBR}})$

[6]

Wherein N _ibe non-GBR users all in cell i, S is community total resources.

The all non-GBR users' of cell i reality can obtain speed and can be obtained by following formula by its arbitrary user k

$V_i^{\mathrm{non}-\mathrm{GBR}}={\mathrm{\&rho;}}_{i,k}^{\mathrm{non}-\mathrm{GBR}}*T_{i,k}^{\mathrm{non}-\mathrm{GBR}}$

[7]

If the interior all non-GBR users' of cell i reality can obtain speed and exceed its greatest requirements speed, in cell i, all non-GBR users' reality can obtain speed and be set to its greatest requirements speed.

For arbitrary cell i in network, define the number of resources of its all non-GBR CUs:

${\mathrm{\&rho;}}_i^{\mathrm{non}-\mathrm{GBR}}={\mathrm{\&Sigma;}}_{k=1}^{N_i}{\mathrm{\&rho;}}_{i,k}^{\mathrm{non}-\mathrm{GBR}}---\left[8\right]$

It is the total resources number that cell i is given all non-GBR users in it.

Suppose the GBR user k in cell i ^.be switched to Target cell j because of load balancing, for the balanced validity of switching of proof load, should meet the following conditions:

Condition one: ${\mathrm{SINR}}_{{j,k}^{\&CenterDot;}}\&GreaterEqual;\mathrm{AC}\_\mathrm{threshold}$

Condition two: ${{\mathrm{\&rho;}}_j}^{\mathrm{GBR}}+{{\mathrm{\&rho;}}_{{j,k}^{\&CenterDot;}}}^{\mathrm{GBR}}\&le;{\mathrm{\&psi;}}^{\mathrm{GBR}}$

Condition one is user k ^.the Signal to Interference plus Noise Ratio of the alternative cell receiving is not less than by operator according to oneself requiring the user who sets to access thresholding Ac_threshold.Condition two is user k ^.be switched to number of resources sum that the number of resources taking in Hou Gai community, arbitrary alternative cell adds original all GBR CUs in this community not higher than the balanced handoff threshold ψ of GBR user load of this community ^gBR.

Only, in the time that above-mentioned condition all meets, this user just can carry out the switching of load balancing.

Suppose the non-GBR user k in cell i ^.be switched to Target cell j because of load balancing, for the balanced validity of switching of proof load, should meet the following conditions:

Condition three: ${\mathrm{SINR}}_{{j,k}^{\&CenterDot;}}\&GreaterEqual;\mathrm{Ac}\_\mathrm{threshold}$

Condition four: $V_{{i,k}^{\&CenterDot;}}^{\mathrm{non}-\mathrm{GBR}}<V_{{j,k}^{\&CenterDot;}}^{\mathrm{non}-\mathrm{GBR}}$

Condition three is user k ^.be not less than by operator according to oneself requiring the user who sets to access thresholding Ac_threshold to the Signal to Interference plus Noise Ratio of alternative cell.Condition four is user k ^.reality in alternative cell can obtain the reality that speed is greater than in cell-of-origin can obtain speed, and user k ^.the reality obtaining in alternative cell can obtain speed and should be calculated by the surplus resources of alternative cell, and in alternative cell, existing non-GBR user self reality can obtain speed and do not decline.

Wherein user can obtain speed in the reality of cell-of-origin

can be obtained by [1]～[7].

User k ^.reality in the j of Target cell can obtain speed

can try to achieve in the following manner:

$V_{j{,k}^{\&CenterDot;}}^{\mathrm{non}-\mathrm{GBR}}=B*{\log }_2(1+{\mathrm{SINR}}_{j{,k}^{\&CenterDot;}})*(S-{{\mathrm{\&rho;}}_j}^{\mathrm{GBR}}-{{\mathrm{\&rho;}}_j}^{\mathrm{non}-\mathrm{GBR}})$

[9]

If the interior all non-GBR users' of community j reality can obtain speed and exceed its greatest requirements speed, in the j of Ze Jiang community, all non-GBR users' reality can obtain speed and be set to its greatest requirements speed.Note switching user k ^.reality in the j of Target cell can obtain speed and only depend on the surplus resources number in the j of Target cell, does not decline thereby j interior existing non-GBR user self reality in Target cell can obtain speed.

Only, in the time that above-mentioned condition all meets, this user just can carry out the switching of load balancing.

Beneficial effect: owing to considering the user of different business grade, in the time carrying out load balancing switching, can preferentially guarantee high-grade GBR user's guarantee bit rate requirement, secondly improve inferior grade non-GBR user reality and can obtain speed, and preferentially select respectively the user that occupying system resources number is maximum to carry out the switching of load balancing, therefore, greatly reduce switching times, thereby reduce the signaling consumption of system, and reduced GBR user and accessed blocking rate, improve resource utilization ratio and overall system throughput.

Embodiment

The present invention proposes the load balance optimization method of classification assurance different brackets QoS of customer requirement in a kind of mobile communication system.

Take LTE system as example provides a kind of embodiment:

First the following variable of definition:

GBR user k is shared number of resources in a certain cell i

${{\mathrm{\&rho;}}_{i,k}}^{\mathrm{GBR}}=\frac{{\mathrm{\&theta;}}_k}{B*{\log }_2(1-{\mathrm{SINR}}_{i,k})}---\left[1\right]$

Wherein θ _kfor the guarantee bit rate requirement of GBR user k, B is the equivalent bandwidth of a least resource unit, SINR _{i, k}for the Signal to Interference plus Noise Ratio of user k in cell i.

For arbitrary cell i in network, define the number of resources of all GBR CUs in it:

${\mathrm{\&rho;}}_i^{\mathrm{GBR}}={\mathrm{\&Sigma;}}_{k=1}^{G_i}{\mathrm{\&rho;}}_{i,k}^{\mathrm{GBR}}---\left[2\right]$

It is the total resources number that cell i is distributed to all GBR users in it.Wherein G _igBR users all in cell i;

for cell i is to the number of resources of GBR user k distribution.

Non-GBR user k is shared number of resources in a certain cell i

${{\mathrm{\&rho;}}_{i,k}}^{\mathrm{non}-\mathrm{GBR}}=\frac{V_{i,k}^{\mathrm{non}-\mathrm{GBR}}}{B*{\log }_2(1-{\mathrm{SINR}}_{i,k})}$

[3]

Wherein B is the equivalent bandwidth of a least resource unit, SINR _{i, k}for the Signal to Interference plus Noise Ratio of user k in cell i,

for the reality of all non-GBR users in cell i can obtain speed, can obtain as follows:

To the each non-GBR user k in cell i, can record the Signal to Interference plus Noise Ratio SINR that it receives in cell i _{i, k}thereby, can try to achieve its reality in a least resource unit and can obtain speed

$T_{i,k}^{\mathrm{non}-\mathrm{GBR}}=B*{\mathrm{lon}}_2(1+{\mathrm{SINR}}_{i,k})$

[4]

Obtain the reality of all non-GBR users in a least resource unit in cell i and can obtain speed

least common multiple lcm, can obtain speed because all non-GBR users in cell i will obtain identical reality, known arbitrary non-GBR user k divide virtual resource number

${\mathrm{Virtual}\_\mathrm{\&rho;}}_{i,k}=\frac{\mathrm{lcm}}{T_{i,k}^{\mathrm{non}-\mathrm{GBR}}}$

[5]

The actual number of resources that can get of non-GBR user k is

${\mathrm{\&rho;}}_{i,k}^{\mathrm{non}-\mathrm{GBR}}=\frac{\mathrm{Virtual}\_{\mathrm{\&rho;}}_{i,k}}{{\mathrm{\&Sigma;}}_{k=1}^{N_i}\mathrm{Virtual}\_{\mathrm{\&rho;}}_{i,k}}*(S-{\mathrm{\&rho;}}_i^{\mathrm{GBR}})$

[6]

Wherein N _ibe non-GBR users all in cell i, S is community total resources.

The all non-GBR users' of cell i reality can obtain speed and can be obtained by following formula by its arbitrary user k

$V_i^{\mathrm{non}-\mathrm{GBR}}={\mathrm{\&rho;}}_{i,k}^{\mathrm{non}-\mathrm{GBR}}*T_{i,k}^{\mathrm{non}-\mathrm{GBR}}$

[7]

If the interior all non-GBR users' of cell i reality can obtain speed and exceed its greatest requirements speed, in cell i, all non-GBR users' reality can obtain speed and be set to its greatest requirements speed.

For arbitrary cell i in network, define the number of resources of its all non-GBR CUs:

${\mathrm{\&rho;}}_i^{\mathrm{non}-\mathrm{GBR}}={\mathrm{\&Sigma;}}_{k=1}^{N_i}{\mathrm{\&rho;}}_{i,k}^{\mathrm{non}-\mathrm{GBR}}---\left[8\right]$

It is the total resources number that cell i is given all non-GBR users in it.

Suppose the GBR user k in cell i ^.be switched to Target cell j because of load balancing, for the balanced validity of switching of proof load, should meet the following conditions:

Condition one: ${\mathrm{SINR}}_{{j,k}^{\&CenterDot;}}\&GreaterEqual;\mathrm{Ac}\_\mathrm{threshold}$

Condition two: ${{\mathrm{\&rho;}}_j}^{\mathrm{GBR}}+{{\mathrm{\&rho;}}_{{j,k}^{\&CenterDot;}}}^{\mathrm{GBR}}\&le;{\mathrm{\&psi;}}^{\mathrm{GBR}}$

Condition one is user k ^.the Signal to Interference plus Noise Ratio of the alternative cell receiving is not less than by operator according to oneself requiring the user who sets to access thresholding Ac_threshold.Condition two is user k ^.be switched to number of resources sum that the number of resources taking in Hou Gai community, arbitrary alternative cell adds original all GBR CUs in this community not higher than the balanced handoff threshold ψ of GBR user load of this community ^gBR.

Only, in the time that above-mentioned condition all meets, this user just can carry out the switching of load balancing.

Suppose the non-GBR user k in cell i ^.be switched to Target cell j because of load balancing, for the balanced validity of switching of proof load, should meet the following conditions:

Condition three: ${\mathrm{SINR}}_{{j,k}^{\&CenterDot;}}\&GreaterEqual;\mathrm{Ac}\_\mathrm{threshold}$

Condition four: $V_{{i,k}^{\&CenterDot;}}^{\mathrm{non}-\mathrm{GBR}}<V_{{j,k}^{\&CenterDot;}}^{\mathrm{non}-\mathrm{GBR}}$

Condition three is user k ^.be not less than by operator according to oneself requiring the user who sets to access thresholding Ac_threshold to the Signal to Interference plus Noise Ratio of alternative cell.Condition four is user k ^.reality in alternative cell can obtain the reality that speed is greater than in cell-of-origin can obtain speed, and user k ^.the reality obtaining in alternative cell can obtain speed and should be calculated by the surplus resources of alternative cell, and in alternative cell, existing non-GBR user self reality can obtain speed and do not decline.

Wherein user can obtain speed in the reality of cell-of-origin can be obtained by [1]～[7].

User k ^.reality in the j of Target cell can obtain speed

can try to achieve in the following manner:

$V_{j{,k}^{\&CenterDot;}}^{\mathrm{non}-\mathrm{GBR}}=B*{\log }_2(1+{\mathrm{SINR}}_{j{,k}^{\&CenterDot;}})*(S-{{\mathrm{\&rho;}}_j}^{\mathrm{GBR}}-{{\mathrm{\&rho;}}_j}^{\mathrm{non}-\mathrm{GBR}})$

[9]

If the interior all non-GBR users' of community j reality can obtain speed and exceed its greatest requirements speed, in the j of Ze Jiang community, all non-GBR users' reality can obtain speed and be set to its greatest requirements speed.Note switching user k ^.reality in the j of Target cell can obtain speed and only depend on the surplus resources number in the j of Target cell, does not decline thereby j interior existing non-GBR user self reality in Target cell can obtain speed.

Only, in the time that above-mentioned condition all meets, this user just can carry out the switching of load balancing.

The first step, within a load balancing cycle, each community is for all GBR users in this community, according to maximizing the mode distributing system resource that minimum (max-min) is fair, all such users' of strict guarantee guarantee bit rate requirement; For the non-GBR user of all greatest requirements rate requirement, distribute remaining system resource in the mode of rate fairness;

Second step, each eNB (E-UTRAN NodeB) is by X2 interface, exchanges the number of resources of all GBR CUs by formula [2] definition of community separately and the number of resources information by all non-GBR CUs of formula [4] definition;

The 3rd step, to arbitrary cell i, calculates the number of resources ρ of all GBR CUs in it according to formula [2] _i ^gBR.The number of resources ρ of all GBR CUs of Ruo Qinei _i ^gBRexceed the handoff threshold ψ of the given load balancing for GBR user of being set according to the requirement of oneself by operator ^gBR, need to carry out that GBR user load is balanced switches, after proceed to the 4th step.The number of resources ρ of all GBR CUs of Ruo Qinei _i ^gBRbe less than thresholding ψ ^gBR, directly proceed to the 5th step;

The 4th step, within the current load balancing cycle, repeats the 3rd step, until the number of resources of the interior all GBR CUs of cell i is lower than the balanced handoff threshold ψ of GBR user load ^gBRor do not meet the edge customer of switching condition, cell i stops that GBR user load is balanced to be switched;

The 5th step, within the balanced cycle of present load, completes the 3rd for all communities, and four liang of steps stop the balanced switching of GBR user load in the whole network;

The 6th step, calculates its reality to all non-GBR users in arbitrary cell i according to formula [1]～[7] and can obtain speed

.If its reality can obtain speed

do not reach the maximum rate of user's request, need to carry out that non-GBR user load is balanced switches, after proceed to the 7th step.If its reality can obtain speed reach the maximum rate of user's request, directly proceed to the 8th step;

The 7th step, within the current load balancing cycle, repeats the 6th step, until all non-GBR edge customer that reaches their greatest requirements speed per family or do not meet switching condition in cell i, cell i stops the balanced switching of non-GBR user load;

The 8th step, within the balanced cycle of present load, completes the 6th for all communities, and seven liang of steps stop the balanced switching of non-GBR user load in the whole network, and algorithm finishes.

Claims (2)

1. classify and guarantee a load balance optimization method for different brackets QoS of customer requirement, it is characterized in that the method comprises the steps:

The first step, within a load balancing cycle, each community is for the user of different brackets in this community, according to its corresponding bit rate and greatest requirements rate requirement distributing system resource of ensureing;

Second step, each base station is adjacent base station exchange load information separately, and load information comprises the number of resources ρ of all secure bit rate GBR CUs in community ^gBRand all number of resources ρ that do not ensure bit rate non-GBR CU ^non-GBR;

The 3rd step, to arbitrary cell i, the number of resources ρ of all GBR CUs of Ruo Qinei _i ^gBRexceed the given load balancing handoff threshold ψ for GBR user being set according to the requirement of oneself by operator ^gBR, need to carry out the balanced switching of GBR user load; , be chosen in and in this community, take the user k that number of resources is maximum according to following formula in cell i edge and can be switched to the GBR user in neighbor cell for all ^.for first-selection is switched user

k ^·＝arg?maxρ _i,k ^GBR

Wherein ρ _i,k ^gBRbe the number of resources that cell i is distributed to GBR user k, switch user k for first-selection ^., selecting all neighbor cells that meet following two conditions is alternative cell:

Condition one:

Condition two:

Wherein Ac_threshold be by operator according to oneself require set user access thresholding,

the first-selected user of switching k ^.signal to Interference plus Noise Ratio in the j of alternative cell; Condition one is user k ^.signal to Interference plus Noise Ratio in alternative cell is not less than by operator according to oneself requiring the user who sets to access thresholding Ac_threshold; ρ _j ^gBRthe number of resources of all GBR CUs in the j of alternative cell, the first-selected user of switching k ^.in the j of alternative cell, reach it and ensure the required number of resources taking of bit rate requirement; Condition two is user k ^.be switched to the number of resources sum of original all GBR CUs in the number of resources Yu Gai community taking in Hou Gai community, arbitrary alternative cell not higher than the balanced handoff threshold ψ of this community GBR user load ^gBR;

In all alternative cell that meet above-mentioned condition, select to have switched the minimum community j of number of resources of rear all GBR CUs according to following formula ^.for Target cell

By user k ^.switch to Target cell j by cell-of-origin i ^.;

The 4th step, within the current load balancing cycle, repeats the 3rd step, until the number of resources ρ of all GBR CUs in cell i _i ^gBRlower than the balanced handoff threshold ψ of GBR user load ^gBRor do not meet the edge customer of switching condition; All remaining edge GBR users can not satisfy condition one and condition two simultaneously, and cell i stops that GBR user load is balanced to be switched;

The 5th step, within the balanced cycle of present load, completes the 3rd for all communities, and four liang of steps stop the balanced switching of GBR user load in the whole network;

The 6th step, for arbitrary cell i, if wherein non-GBR user's reality can obtain speed and do not reach the maximum rate of user's request, needs to carry out that non-GBR user load is balanced switches; Can be switched to the non-GBR user k in neighbor cell in cell i edge for all, be chosen in and in this community, take the non-GBR user k that number of resources is maximum according to following formula ^.for first-selection is switched user

k ^·＝arg?maxρ _i,k ^non-GBR

Wherein ρ _i,k ^non-GBRbe the number of resources that cell i is distributed to non-GBR user k, switch user k for first-selection ^., selecting all neighbor cells that meet following two conditions is alternative cell:

Condition three:

Condition four:

Condition three i.e. the first-selected user k that switches ^.signal to Interference plus Noise Ratio in alternative cell is not less than operator according to oneself requiring the user who sets to access thresholding Ac_threshold;

user k ^.in cell-of-origin, reality can obtain speed, user k ^.in the j of alternative cell, reality can obtain speed, and condition four is user k ^.reality in alternative cell can obtain the reality that speed is greater than in cell-of-origin can obtain speed;

In all alternative cell that meet above-mentioned condition, select to have switched according to following formula the community j that rear total load is minimum ^.for Target cell

Wherein ρ _j ^gBRthe number of resources of existing all GBR CUs in the j of alternative cell, ρ _j ^non-GBRthe number of resources of existing all non-GBR CUs in the j of alternative cell,

non-GBR user k ^.the number of resources taking in the j of alternative cell;

By user k ^.switch to Target cell j by cell-of-origin i ^.;

The 7th step, within the current load balancing cycle, repeat the 6th step, until all non-GBR users reach their greatest requirements rate requirement or do not meet the edge customer of switching condition in cell i, all remaining edge non-GBR users can not satisfy condition three and condition four simultaneously, and cell i stops that non-GBR user load is balanced to be switched;

The 8th step, within the balanced cycle of present load, completes the 6th for all communities, and seven liang of steps stop the balanced switching of the whole network non-GBR user load, finish.

2. classification according to claim 1 guarantees the load balance optimization method that different brackets QoS of customer requires, and it is characterized in that described first-selection switching user k ^.and respective target cells j ^., the first-selected user k that switches in the time of the balanced switching of GBR user load ^.and respective target cells j ^.selection:

k ^·＝arg?maxρ _i,k ^GBR

The first-selected user of switching k while switching for non-GBR user load is balanced ^.and respective target cells j ^.selection:

k ^·＝arg?maxρ _i,k ^non-GBR

Method be: first definition following variable:

GBR user k is shared number of resources in a certain cell i

Wherein θ _kfor the guarantee bit rate requirement of GBR user k, B is the equivalent bandwidth of a least resource unit, SINR _i,kfor the Signal to Interference plus Noise Ratio of user k in cell i;

For arbitrary cell i in network, define the number of resources of all GBR CUs in it:

It is the total resources number that cell i is distributed to all GBR users in it; Wherein G _igBR users all in cell i;

for cell i is to the number of resources of GBR user k distribution;

Non-GBR user k is shared number of resources in a certain cell i

Wherein B is the equivalent bandwidth of a least resource unit, SINR _i,kfor the Signal to Interference plus Noise Ratio of user k in cell i,

for the reality of all non-GBR users in cell i can obtain speed, can obtain as follows:

To the each non-GBR user k in cell i, can record the Signal to Interference plus Noise Ratio SINR that it receives in cell i _i,kthereby, can try to achieve its reality in a least resource unit and can obtain speed

Obtain the reality of all non-GBR users in a least resource unit in cell i and can obtain speed

least common multiple lcm, can obtain speed because all non-GBR users in cell i will obtain identical reality, known arbitrary non-GBR user k divide virtual resource number

The actual number of resources that can get of non-GBR user k is

Wherein N _ibe non-GBR users all in cell i, S is community total resources;

The all non-GBR users' of cell i reality can obtain speed and can be obtained by following formula by its arbitrary user k

If the interior all non-GBR users' of cell i reality can obtain speed and exceed its greatest requirements speed, in cell i, all non-GBR users' reality can obtain speed and be set to its greatest requirements speed;

For arbitrary cell i in network, define the number of resources of its all non-GBR CUs:

it is the total resources number that cell i is given all non-GBR users in it;

Suppose the GBR user k in cell i ^.be switched to Target cell j because of load balancing, for the balanced validity of switching of proof load, should meet the following conditions:

Condition one:

Condition two:

Condition one is user k ^.the Signal to Interference plus Noise Ratio of the alternative cell receiving is not less than by operator according to oneself requiring the user who sets to access thresholding Ac_threshold; Condition two is user k ^.be switched to number of resources sum that the number of resources taking in Hou Gai community, arbitrary alternative cell adds original all GBR CUs in this community not higher than the balanced handoff threshold ψ of GBR user load of this community ^gBR;

Only, in the time that above-mentioned condition all meets, this user just can carry out the switching of load balancing;

Suppose the non-GBR user k in cell i ^.be switched to Target cell j because of load balancing, for the balanced validity of switching of proof load, should meet the following conditions:

Condition three:

Condition four:

Condition three is user k ^.to the Signal to Interference plus Noise Ratio of alternative cell be not less than by operator according to oneself require set user access thresholding Ac_threshold, condition four is user k ^.reality in alternative cell can obtain the reality that speed is greater than in cell-of-origin can obtain speed, and user k ^.the reality obtaining in alternative cell can obtain speed and should be calculated by the surplus resources of alternative cell, and in alternative cell, existing non-GBR user self reality can obtain speed and do not decline,

Wherein user can obtain speed in the reality of cell-of-origin can be obtained by [1]～[7],

User k ^.reality in the j of Target cell can obtain speed can try to achieve in the following manner:

If the interior all non-GBR users' of community j reality can obtain speed and exceed its greatest requirements speed, in the j of Ze Jiang community, all non-GBR users' reality can obtain speed and be set to its greatest requirements speed; Note switching user k ^.reality in the j of Target cell can obtain speed and only depend on the surplus resources number in the j of Target cell, does not decline thereby j interior existing non-GBR user self reality in Target cell can obtain speed;

Only, in the time that above-mentioned condition all meets, this user just can carry out the switching of load balancing.