CN101052232A - Call admittance control method based on dynamic threshold in radio/mobile network - Google Patents

Abstract

The method comprises: dividing the system time into several time intervals each with identical time length; at beginning of each time interval, setting a new call admittance control threshold and a switched call admittance control threshold for each type service; when a new call or switched call of a certain type service initiates a connection request, if the admission of said call will makes the amount of this type new calls or switched calls over said control thresholds, the system will reject the call; otherwise, accepting the call and allocating a required bandwidth.

Description

In the radio/mobile network based on the call admission control method of dynamic threshold

Technical field

The service quality control algolithm field that belongs to radio/mobile network in the radio/mobile network based on the call admission control method of dynamic threshold.

Background technology

The rapid growth of mobile service demand has promoted the fast development of radio/mobile network, existing radio/mobile network such as GPRS network (GPRS), wireless lan (wlan) and wideband wireless access network (BWA) etc., just develop towards broadband, intelligentized direction, purpose is to provide (QoS) personalization, the intelligentized business that ensure that have different service quality for the mobile subscriber.Yet in radio/mobile network, owing to exist the topological sum resource dynamic to change, bandwidth is rare, multiple unfavorable factor such as multipath fading and shadow fading, make that the QoS that guarantees the user under such network environment will be than more complex in cable network, especially in existing networking technology, in order to obtain higher capacity and more performance, radio/mobile network extensively adopts the structure of microcellulor/Pico cell (micro-cell/pico-cell), make the size of wireless/mobile subnetwork become littler and littler, thereby cause more frequent switching and network load variation more fast, finally make mobile subscriber's QoS guarantee face more stern challenge.Under these circumstances, adopt the Admission Control technology, just seem particularly important to improve network resource utilization, to ensure and admitted the QoS of calling.

As a kind of important QoS control technology, the effect of Admission Control is that the call connection request that arrives is made the judgement of whether admitting, be implemented in guarantee and admitted under the situation of QoS of calling, admit newly arrived calling as much as possible, improve the purpose of network resource utilization.In radio/mobile network, there is two types calling: newly call out and switch call.Wherein, new call out the calling that is meant that the mobile subscriber by current wireless/mobile subnetwork initiates, and switch call is meant that mobile subscriber by other wireless/mobile subnetwork initiates, and because user's the mobile calling that switches in current wireless/mobile subnetwork.No matter be new call out or switch call when network is initiated connection request, whether they can enjoy Internet resources, admitted by network, depend on the Admission Control technology that network adopts, therefore, new call blocking rate and switch call interruption rate become two important parameters weighing the Admission Control performance, wherein, new call blocking rate is meant in a certain amount of time, the new call number of refusal accounts for the ratio of the new call number that arrives in this period, the switch call interruption rate is meant then that in a certain amount of time the switch call quantity of refusal accounts for the ratio of the switch call quantity that arrives in this period.How to design a kind of effective call admission control method, reduce new call blocking rate and switch call interruption rate and be the key issue in the current Admission Control research.

Summary of the invention

The object of the present invention is to provide a kind of call admission control method based on dynamic threshold that can reduce new call blocking rate and switch call interruption rate.

The invention is characterized in that it contains following steps successively:

Step (1.): in system is base station or couple in router AR or wireless access point AP in the radio/mobile network, record traffic classification sum K, K ∈ N and remaining bandwidth B _r, and initialization timing device, described timer is used for the time of system is divided into the isometric period, the time segment length be 20 seconds;

Step (2.): count initialized device N _i, i=1,2 ..., K is 0, is used to write down the i that system admits in the period, i=1, and 2 ..., the new calls of K class business, wherein, new calling is meant the calling by mobile subscriber's initiation of current wireless/mobile subnetwork;

Count initialized device H _i, i=1,2 ... K is used to write down the i that system admits in the period, i=1,2,, the switch call number of K class business, wherein, switch call be meant by the mobile subscriber of other wireless/mobile subnetwork initiate, and because user's the mobile calling that switches in current wireless/mobile subnetwork;

Step (3.): in order to implement Admission Control, system is that the new calling and the switch call of all kinds of business is provided with the Admission Control threshold value when each period begins, wherein the new Admission Control threshold value r of i class business _NiSwitch call admittance control threshold r with i class business _Hi, i=1,2 ..., K is respectively system's average yield function parameters, make system's average yield function maximize under the constraint of remaining bandwidth, described system average yield function obtains according to following steps:

Step (3.1.): i in this period of system prediction, i=1,2 ..., the average new rate of arriving calls λ of K class business _NiWith average switch call arrival rate λ _HiI=1,2, K, described average new rate of arriving calls and average switch call arrival rate refer to that respectively per second reaches the new calls of system and the mean value of switch call number, and the historical information that these two parameters are arrived according to calling by system is respectively analyzed by statistics and obtained, and the historical information that the calling here arrives refers to the new rate of arriving calls of the day part before this period and the mean value of switch call arrival rate;

Step (3.2.): system is according to the λ in this period _Ni, i=1,2 ..., K calculates the i of the system that arrives in this period, i=1, and 2 ..., the new calling number N of K class business _NiProbability $P_n\left(N_{\mathrm{ni}}\right)={({\mathrm{\λ}}_{\mathrm{ni}}\×20)}^{N_{\mathrm{ni}}}{e}^{-({\mathrm{\λ}}_{\mathrm{ni}}\×20)}/N_{\mathrm{ni}}!,i=\mathrm{1,2},\·\·\·,K$ N _ni∈N，0＜N _ni＜∞；

System is according to the λ in this period _Hi, i=1,2 ..., K calculates the probability of the switch call number of the i class business of arrival system in this period $P_h\left(N_{\mathrm{hi}}\right)={({\mathrm{\λ}}_{\mathrm{hi}}\×20)}^{N_{\mathrm{ni}}}{e}^{-({\mathrm{\λ}}_{\mathrm{hi}}\×20)}/N_{\mathrm{hi}}!,i=\mathrm{1,2},\·\·\·,K,$ N _hi∈N，0＜N _hi＜∞；

Step (3.3.): the new calling number N that in this period, arrives the i class business of system _Ni, 0≤N _Ni≤ r _Ni, i=1,2 ..., K and switch call number N _Hi, 0≤N _Hi≤ r _Hi, i=1,2 ..., during K, the income calculation of system is: p _i* (N _Ni+ N _Hi), i=1,2 ..., K, described p _iBe the reward value that system obtains when the calling of an i class business is admitted, and the priority of i class business is high more, p _iBig more, 0＜p _i＜10, i=1,2 ..., K;

Step (3.4.): the new calling number N that in this period, arrives the i class business of system _Ni, 0≤N _Ni≤ r _Ni, i=1,2 ..., K and switch call number N _Hi, N _Hi＞r _Hi, i=1,2 ..., during K, the income calculation of system is: p _i* (N _Ni+ r _Hi)-c _Hi* (N _Hi-r _Hi)-α _i* (r _Ni-N _Ni), i=1,2 ..., K, wherein, C _HiThe penalty value that system obtains when refusing the switch call of an i class business, and the priority of i class business is high more, C _HiBig more, 0＜C _Hi＜10,, i=1,2 ..., K; And α _iFor system is the too much threshold value of new call distribution of i class business, thus the penalty value when causing the wasting of resources, and the priority of i class business is high more, α _iBig more, 0＜α _i＜10, i=1,2 ..., K;

Step (3.5.): the new calling number N that in this period, arrives the i class business of system _Ni, N _Ni＞r _Ni, i=1,2 ..., K and switch call number N _Hi, 0≤N _Hi≤ r _Hi, i=1,2 ..., during K, the income calculation of system is: p _i* (r _Ni+ N _Hi)-c _Ni* (N _Ni-r _Ni)-β _i* (r _Hi-N _Hi), wherein, C _NiThe penalty value that system obtains during for new call out of refusing an i class business and the priority of i class business are high more, C _NiBig more, 0＜C _Ni＜10, C _Ni＜C _Hi, i=1,2 ..., K; And β _iFor system is that the switch call of i class distributes too much threshold value, thus the penalty value when causing the wasting of resources, and the priority of i class business is high more, β _iBig more, 0＜β _i＜10, β _i＜α _i, i=1,2 ..., K;

Step (3.6.): the new calling number N that in this period, arrives the i class business of system _Ni, N _Ni＞r _Ni, i=1,2 ..., K and switch call number N _Hi, N _Hi＞r _Hi, i=1,2 ..., during K, the income calculation of system is: p _i* (r _Ni+ r _Hi)-c _Ni* (N _Ni-r _Ni)-c _Hi* (N _Hi-r _Hi), i=1,2 ..., K;

Step (3.7.): the P that system obtains according to step (3.2.) _n(N _Ni) and P _h(N _Hi), i=1,2 ..., K and step (3.3.) ~ step (3.6.) calculates works as N _NiAnd N _Hi, i=1,2 ..., the income of the system when K is in different range obtains the average yield function of system

Wherein, G _i(r _Ni, r _Hi) for the calling owing to i class business arrives the average yield of bringing to system, it is threshold value r _NiAnd r _HiFunction, i=1,2 ..., K, it is calculated as:

$G_i(r_{\mathrm{ni}},r_{\mathrm{hi}})=r_{\mathrm{ni}}(p_i+c_{\mathrm{ni}})+r_{\mathrm{hi}}(p_i+c_{\mathrm{hi}})-20\×({\mathrm{\λ}}_{\mathrm{ni}}{c}_{\mathrm{ni}}+{\mathrm{\λ}}_{\mathrm{hi}}{c}_{\mathrm{hi}})+\underset{N_{\mathrm{ni}}=0}{\overset{r_{\mathrm{ni}}}{\mathrm{\Σ}}}\underset{N_{\mathrm{hi}}=0}{\overset{r_{\mathrm{hi}}}{\mathrm{\Σ}}}({\mathrm{\α}}_i(r_{\mathrm{ni}}-N_{\mathrm{ni}})+{\mathrm{\β}}_i(r_{\mathrm{hi}}-N_{\mathrm{hi}}))P_n\left(N_{\mathrm{ni}}\right)P_h\left(N_{\mathrm{hi}}\right)+$

$\underset{N_{\mathrm{ni}}=0}{\overset{r_{\mathrm{ni}}}{\mathrm{\Σ}}}(p_i+{\mathrm{\α}}_i+c_{\mathrm{ni}})(N_{\mathrm{ni}}-r_{\mathrm{ni}})P_n\left(N_{\mathrm{ni}}\right)+\underset{N_{\mathrm{hi}}=0}{\overset{r_{\mathrm{hi}}}{\mathrm{\Σ}}}(p_i+{\mathrm{\β}}_i+c_{\mathrm{hi}})(N_{\mathrm{hi}}-r_{\mathrm{hi}})P_h\left(N_{\mathrm{hi}}\right);$

Step (3.8.): system calculates and to make the maximized r of average yield function under the constraint of remaining bandwidth _NiAnd r _Hi, i=1,2 ..., K;

Step (4.): the system start-up timer, and enter waiting event arrival state, described incident comprises new calling arrival event, switch call arrival event, calls out leave event and timer expiry incident;

Step (5.): when being in waiting event arrival state in system, if i, i=1,2 ..., the new calling of K class business arrives, and then system judges to admit this calling whether can make the i that admits in this period, i=1,2 ..., the new number of calls N of K class business _i, i=1,2 ..., K surpasses threshold value r _Ni, i=1,2 ..., K, if then this calling is refused by system, otherwise system admits this calling, and carries out following operation:

Step (5.1.): be the required bandwidth of this call distribution;

Step (5.2.): counter N _i, i=1,2 ..., K adds 1;

Step (5.3.): remaining bandwidth B _rBe updated to the current residual bandwidth and deduct bandwidth into this call distribution;

Step (5.4.): system reenters waiting event and arrives state;

Step (6.): when being in waiting event arrival state in system, if i, i=1,2 ..., the switch call of K class business arrives, and then the i that admits this calling whether can make this period admittance judges in system, i=1,2 ..., the switch call number H of K class business _i, i=1,2 ..., K surpasses threshold value r _Hi, i=1,2 ..., K, if then this calling is refused by system, otherwise system admits this calling, and carries out following operation:

Step (6.1.): be the required bandwidth of this call distribution;

Step (6.2.): counter H _i, i=1,2 ..., K adds 1;

Step (6.3.): remaining bandwidth B _rBe updated to the current residual bandwidth and deduct bandwidth into this call distribution;

Step (6.4): system reenters waiting event and arrives state;

Step (7.): when being in waiting event arrival state in system, leave if having to call out, then system is with remaining bandwidth B _rBe updated to the bandwidth that the current residual bandwidth adds that this calling discharges, reenter waiting event then and arrive state;

Step (8.): when being in waiting event arrival state, if timer expiry then restarts to carry out from above-mentioned step (2.) in system.

According to above-mentioned execution mode, we provide under the situation of two class business in system, with average new call blocking rate in 2000 emulation periods and average switch call interruption rate is the parameter of weighing systematic function, contrasted this method and other two call admission control methods---the performance of the call admission control method (ROCAC) that static many threshold values call admission control method (SMCAC) and income are optimized, described average new call blocking rate (or average switch call interruption rate) is meant new call blocking rate (switch call interruption rate) sum in 2000 periods divided by 2000, the time segment length timer length be 20 seconds.Fig. 2 and Fig. 3 show the remaining bandwidth B at initial time when system respectively _rThe new rate of arriving calls of=11 mbit/, first kind business and switch call arrival rate, and the switch call arrival rate of the second class business is when being 0.01 calling/second, when using this method, SMCAC and ROCAC, the average new call blocking rate of all kinds of business and average switch call interruption rate are with the variation of the average new rate of arriving calls of the second class business, think that in emulation the priority of first kind business will be higher than the priority of the second class business, and following reward value and penalty value: p is set ₁=8, p ₂=6, C _N1=4, C _N2=3, C _H1=8, C _H2=6, α ₁=6, α ₂=4, β ₁=3, β ₂=2.In every kind of method, the performance of system average new call blocking rate and average switch call interruption rate professional by the first kind and the second class business determine that jointly average new call blocking rate and average switch call interruption rate are low more, and the performance of system is good more.

Can find out from two figure, the average increase of rate of arriving calls newly along with the second class business, the average new call blocking rate of the second class business of SMCAC sharply increases, though other performance index of SMCAC are lower, the highest average new call blocking rate near 23% the second class business sharply descends the overall performance of system; In addition, the average increase of rate of arriving calls newly along with the second class business, increasing has by a relatively large margin all appearred in the average new call blocking rate of all kinds of business of ROCAC, the highest near 6%, be far longer than the average handoff rate of all kinds of business, though system uses the overall performance of ROCAC better than the overall performance that uses SMCAC, ROCAC sacrifices the way of average new call blocking rate excessively in order to ensure average switch call interruption rate, be that system and user are undesirable; At last, can further find out from two figure, the average increase of rate of arriving calls newly along with the second class business, the average new call blocking rate and the average handoff rate of this method are all lower, even in the average new rate of arriving calls of the second class business more than or equal to 0.025 o'clock, the average switch call interruption rate of two class business begins to occur bigger rising, but its maximum still is limited within 0.53% and 0.35%, and these performance index values are system and user's acceptable.

In sum, the performance of this method is than existing two kinds of call admission control methods---the performance of SMCAC and ROCAC is more excellent, because it is both unlike SMCAC, owing to can not dynamically adjust bandwidth, thereby when the average call arrival rate changed, the overall performance of system became very poor; Also unlike ROCAC, though can dynamically adjust bandwidth, its mode of dynamically adjusting is to sacrifice average new call blocking rate excessively in order to reduce average switch call arrival rate; This method can not only dynamically be adjusted bandwidth, and has realized balance between average new call blocking rate and average these two performance parameters of handoff rate, has reached the purpose that reduces average new call blocking rate and average switch call interruption rate.

Description of drawings

Fig. 1. process chart of the present invention;

Fig. 2. average new call blocking rate curve chart;

The first kind business of this method

The second class business of this method

The first kind business of ROCAC

The second class business of ROCAC

The first kind business of SMCAC

The second class business of SMCAC

Fig. 3. average switch call interruption rate curve chart;

The first kind business of this method

The second class business of this method

The first kind business of ROCAC

The second class business of ROCAC

The first kind business of SMCAC

The second class business of SMCAC

Fig. 4. application exemplary plot of the present invention.

Embodiment

The maximum characteristics of radio/mobile network are user's mobility, the direct result that user's mobility brings network is the dynamic change of topological sum resource, in having the radio/mobile network of dynamic characteristic, reduce new call blocking rate and the switch call interruption rate has great importance: concerning network, can improve resource utilization; Concerning the user, can promote professional QoS.According to user's mobility of dynamic change, design a kind of call admission control method that can reduce new call blocking rate and switch call interruption rate, be main contribution of the present invention.

The basic thought of this method is: system time is divided into the isometric period (time segment length be 20 seconds), system is new Admission Control threshold value of all kinds of business settings and switch call admittance control threshold at the beginning of each period, and they represent the new calls or the switch call number of system's maximum admissible all kinds of business in a period respectively.The new calls of all kinds of business that system statistics has been admitted in each period and switch call number, when the new calling (or switch call) of certain class business when system sends connection request, system checks to admit this callings whether can cause the new Admission Control threshold value (or switch call admittance control threshold) of the new calls (or switch call number) of such business of having admitted in this period above such business, if, then refuse this calling, otherwise admit this calling, and be the required bandwidth of this call distribution.In order to carry out rational allocated bandwidth, the Admission Control threshold value that system comes calculating optimum according to the average new rate of arriving calls of remaining bandwidth and all kinds of business, average switch call arrival rate, thus realization reduces the purpose of new call blocking rate and switch call interruption rate.For this reason, system is in calling of admittance or when a calling is left, the remaining bandwidth of meeting update system also can carry out statistical analysis to calling out the historical information that arrives simultaneously, thereby predicts the average new rate of arriving calls and average switch call arrival rate of all kinds of business.

Overview flow chart of the present invention is seen Fig. 1.

Application exemplary plot of the present invention is seen Fig. 4.Call admission control method based on dynamic threshold of the present invention can be applicable in the access point shown in the figure (AP), couple in router (AR) and the base station.

The present invention is divided into the isometric period with system time, by rational Admission Control threshold value just is set at day part, to the new calling of all kinds of business that arrive system or the judgement whether switch call admits, realized when ensureing the existing QoS that calls out, reduce the purpose of new call blocking rate and switch call interruption rate, finally improved the performance of system.

Claims (1)

1. In the radio/mobile network based on the call admission control method of dynamic threshold, it is characterized in that this method contains following steps successively:

   Step (1.): in system is base station or couple in router AR or wireless access point AP in the radio/mobile network, record traffic classification sum K, K ∈ N and remaining bandwidth B _r, and initialization timing device, described timer is used for the time of system is divided into the isometric period, the time segment length be 20 seconds;

   Step (2.): count initialized device N _i, i=1,2 ..., K is 0, is used to write down the i that system admits in the period, i=1, and 2 ..., the new calls of K class business, wherein, new calling is meant the calling by mobile subscriber's initiation of current wireless/mobile subnetwork;

   Count initialized device H _i, i=1,2 ... K is used to write down the i that system admits in the period, i=1,2,, the switch call number of K class business, wherein, switch call be meant by the mobile subscriber of other wireless/mobile subnetwork initiate, and because user's the mobile calling that switches in current wireless/mobile subnetwork;

   Step (3.): in order to implement Admission Control, system is that the new calling and the switch call of all kinds of business is provided with the Admission Control threshold value when each period begins, wherein the new Admission Control threshold value r of i class business _NiSwitch call admittance control threshold r with i class business _Hi, i=1,2 ..., K is respectively system's average yield function parameters, make system's average yield function maximize under the constraint of remaining bandwidth, described system average yield function obtains according to following steps:

   Step (3.1.): i in this period of system prediction, i=1,2 ..., the average new rate of arriving calls λ of K class business _NiWith average switch call arrival rate λ _HiI=1,2, K, described average new rate of arriving calls and average switch call arrival rate refer to that respectively per second reaches the new calls of system and the mean value of switch call number, and the historical information that these two parameters are arrived according to calling by system is respectively analyzed by statistics and obtained, and the historical information that the calling here arrives refers to the new rate of arriving calls of the day part before this period and the mean value of switch call arrival rate;

   Step (3.2.): system is according to the λ in this period _Ni, i=1,2 ..., K calculates the i of the system that arrives in this period, i=1, and 2 ..., the new calling number N of K class business _NiProbability $P_n\left(N_{\mathrm{ni}}\right)={({\mathrm{\λ}}_{\mathrm{ni}}\×20)}^{N_{\mathrm{ni}}}{e}^{-({\mathrm{\λ}}_{\mathrm{ni}}\×20)}/N_{\mathrm{ni}}!$ ，i＝1，2，…，KN _ni∈N，0＜N _ni＜∞；

   System is according to the λ in this period _Hi, i=1,2 ..., K calculates the probability of the switch call number of the i class business of arrival system in this period $P_h\left(N_{\mathrm{hi}}\right)={({\mathrm{\λ}}_{\mathrm{hi}}\×20)}^{N_{\mathrm{ni}}}{e}^{-({\mathrm{\λ}}_{\mathrm{hi}}\×20)}/N_{\mathrm{hi}}!$ ，i＝1，2，…，K，N _hi∈N，0＜N _hi＜∞；

   Step (3.3.): the new calling number N that in this period, arrives the i class business of system _Ni, 0≤N _Ni≤ r _Ni, i=1,2 ..., K and switch call number N _Hi, 0≤N _Hi≤ r _Hi, i=1,2 ..., during K, the income calculation of system is: p _i* (N _Ni+ N _Hi), i=1,2 ..., K, described p _iBe the reward value that system obtains when the calling of an i class business is admitted, and the priority of i class business is high more, p _iBig more, 0＜p _i＜10, i=1,2 ..., K;

   Step (3.4.): the new calling number N that in this period, arrives the i class business of system _Ni, 0≤N _Ni≤ r _Ni, i=1,2 ..., K and switch call number N _Hi, N _Hi＞r _Hi, i=1,2 ..., during K, the income calculation of system is: p _i* (N _Ni+ r _Hi)-c _Hi* (N _Hi-r _Hi)-α _i* (r _Ni-N _Ni), i=1,2 ..., K, wherein, c _HiThe penalty value that system obtains when refusing the switch call of an i class business, and the priority of i class business is high more, c _HiBig more, 0＜c _Hi＜10,, i=1,2 ..., K; And α _iFor system is the too much threshold value of new call distribution of i class business, thus the penalty value when causing the wasting of resources, and the priority of i class business is high more, α _iBig more, 0＜α _i＜10, i=1,2 ..., K;

   Step (3.5.): the new calling number N that in this period, arrives the i class business of system _Ni, N _Ni＞r _Ni, i=1,2 ..., K and switch call number N _Hi, 0≤N _Hi≤ r _Hi, i=1,2 ..., during K, the income calculation of system is: p _i* (r _Ni+ N _Hi)-c _Ni* (N _Ni-r _Ni)-β _i* (r _Hi-N _Hi), wherein, c _NiThe penalty value that system obtains during for new call out of refusing an i class business and the priority of i class business are high more, c _NiBig more, 0＜c _Ni＜10, c _Ni＜c _Hi, i=1,2 ..., K; And β _iFor system is that the switch call of i class distributes too much threshold value, thus the penalty value when causing the wasting of resources, and the priority of i class business is high more, β _iBig more, 0＜β _i＜10, β _i＜α _i, i=1,2 ..., K;

   Step (3.6.): the new calling number N that in this period, arrives the i class business of system _Ni, N _Ni＞r _Ni, i=1,2 ..., K and switch call number N _Hi, N _Hi＞r _Hi, i=1,2 ..., during K, the income calculation of system is: p _i* (r _Ni+ r _Hi)-c _Ni* (N _Ni-r _Ni)-c _Hi* (N _Hi-r _Hi), i=1,2 ..., K;

   Step (3.7.): the P that system obtains according to step (3.2.) _n(N _Ni) and P _h(N _Hi), i=1,2 ..., K and step (3.3.)～step (3.6.) calculates works as N _NiAnd N _Hi, i=1,2 ..., the income of the system when K is in different range obtains the average yield function of system

   

   Wherein, G _i(r _Ni, r _Hi) for the calling owing to i class business arrives the average yield of bringing to system, it is threshold value r _NiAnd r _HiFunction, i=1,2 ..., K, it is calculated as:

   $G_i(r_{\mathrm{ni}},r_{\mathrm{hi}})=r_{\mathrm{ni}}(p_i+c_{\mathrm{ni}})+r_{\mathrm{hi}}(p_i+c_{\mathrm{hi}})-20\×({\mathrm{\λ}}_{\mathrm{ni}}{c}_{\mathrm{ni}}+{\mathrm{\λ}}_{\mathrm{hi}}{c}_{\mathrm{hi}})+\underset{N_{\mathrm{ni}}=0}{\overset{r_{\mathrm{ni}}}{\mathrm{\Σ}}}\underset{N_{\mathrm{hi}}=0}{\overset{r_{\mathrm{hi}}}{\mathrm{\Σ}}}({\mathrm{\α}}_i(r_{\mathrm{ni}}-N_{\mathrm{ni}})+{\mathrm{\β}}_i(r_{\mathrm{hi}}-N_{\mathrm{hi}}))P_n\left(N_{\mathrm{ni}}\right)P_h\left(N_{\mathrm{hi}}\right)+$

   $\underset{N_{\mathrm{ni}}=0}{\overset{r_{\mathrm{ni}}}{\mathrm{\Σ}}}(p_i+{\mathrm{\α}}_i+c_{\mathrm{ni}})(N_{\mathrm{ni}}-r_{\mathrm{ni}})P_n\left(N_{\mathrm{ni}}\right)+\underset{N_{\mathrm{hi}}=0}{\overset{r_{\mathrm{hi}}}{\mathrm{\Σ}}}(p_i+{\mathrm{\β}}_i+c_{\mathrm{hi}})(N_{\mathrm{hi}}-r_{\mathrm{hi}})P_h\left(N_{\mathrm{hi}}\right);$

   Step (3.8.): system calculates and to make the maximized r of average yield function under the constraint of remaining bandwidth _NiAnd r _Hi, i=1,2 ..., K;

   Step (4.): the system start-up timer, and enter waiting event arrival state, described incident comprises new calling arrival event, switch call arrival event, calls out leave event and timer expiry incident;

   Step (5.): when being in waiting event arrival state in system, if i, i=1,2 ..., the new calling of K class business arrives, and then system judges to admit this calling whether can make the i that admits in this period, i=1,2 ..., the new number of calls N of K class business _i, i=1,2 ..., K surpasses threshold value r _Ni, i=1,2 ..., K, if then this calling is refused by system, otherwise system admits this calling, and carries out following operation:

   Step (5.1.): be the required bandwidth of this call distribution;

   Step (5.2.): counter N _i, i=1,2 ..., K adds 1;

   Step (5.3.): remaining bandwidth B _rBe updated to the current residual bandwidth and deduct bandwidth into this call distribution;

   Step (5.4.): system reenters waiting event and arrives state;

   Step (6.): when being in waiting event arrival state in system, if i, i=1,2 ..., the switch call of K class business arrives, and then the i that admits this calling whether can make this period admittance judges in system, i=1,2 ..., the switch call number H of K class business _i, i=1,2 ..., K surpasses threshold value r _Hi, i=1,2 ..., K, if then this calling is refused by system, otherwise system admits this calling, and carries out following operation:

   Step (6.1.): be the required bandwidth of this call distribution;

   Step (6.2.): counter H _i, i=1,2 ..., K adds 1;

   Step (6.3.): remaining bandwidth B _rBe updated to the current residual bandwidth and deduct bandwidth into this call distribution;

   Step (6.4): system reenters waiting event and arrives state;

   Step (7.): when being in waiting event arrival state in system, leave if having to call out, then system is with remaining bandwidth B _rBe updated to the bandwidth that the current residual bandwidth adds that this calling discharges, reenter waiting event then and arrive state;

   Step (8.): when being in waiting event arrival state, if timer expiry then restarts to carry out from above-mentioned step (2.) in system.

Images